Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854027700073.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is CloudDeployment-PT-6b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854027700073
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.3M
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 4.8M May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME CloudDeployment-PT-6b-CTLCardinality-2023-12
FORMULA_NAME CloudDeployment-PT-6b-CTLCardinality-2023-13
FORMULA_NAME CloudDeployment-PT-6b-CTLCardinality-2023-14
FORMULA_NAME CloudDeployment-PT-6b-CTLCardinality-2023-15
FORMULA_NAME CloudDeployment-PT-6b-CTLCardinality-2025-00
FORMULA_NAME CloudDeployment-PT-6b-CTLCardinality-2025-01
FORMULA_NAME CloudDeployment-PT-6b-CTLCardinality-2025-02
FORMULA_NAME CloudDeployment-PT-6b-CTLCardinality-2025-03
FORMULA_NAME CloudDeployment-PT-6b-CTLCardinality-2025-04
FORMULA_NAME CloudDeployment-PT-6b-CTLCardinality-2025-05
FORMULA_NAME CloudDeployment-PT-6b-CTLCardinality-2025-06
FORMULA_NAME CloudDeployment-PT-6b-CTLCardinality-2025-07
FORMULA_NAME CloudDeployment-PT-6b-CTLCardinality-2025-08
FORMULA_NAME CloudDeployment-PT-6b-CTLCardinality-2025-09
FORMULA_NAME CloudDeployment-PT-6b-CTLCardinality-2025-10
FORMULA_NAME CloudDeployment-PT-6b-CTLCardinality-2025-11

=== Now, execution of the tool begins

BK_START 1748561135788

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-6b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-05-29 23:25:37] [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]
[2025-05-29 23:25:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 23:25:37] [INFO ] Load time of PNML (sax parser for PT used): 444 ms
[2025-05-29 23:25:37] [INFO ] Transformed 1888 places.
[2025-05-29 23:25:37] [INFO ] Transformed 6804 transitions.
[2025-05-29 23:25:37] [INFO ] Found NUPN structural information;
[2025-05-29 23:25:37] [INFO ] Parsed PT model containing 1888 places and 6804 transitions and 91831 arcs in 618 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Initial state reduction rules removed 1 formulas.
FORMULA CloudDeployment-PT-6b-CTLCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-6b-CTLCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 115 out of 1888 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1888/1888 places, 6804/6804 transitions.
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 1881 transition count 6804
Discarding 490 places :
Symmetric choice reduction at 1 with 490 rule applications. Total rules 497 place count 1391 transition count 2242
Iterating global reduction 1 with 490 rules applied. Total rules applied 987 place count 1391 transition count 2242
Discarding 173 places :
Symmetric choice reduction at 1 with 173 rule applications. Total rules 1160 place count 1218 transition count 2069
Iterating global reduction 1 with 173 rules applied. Total rules applied 1333 place count 1218 transition count 2069
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 1353 place count 1218 transition count 2049
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1370 place count 1201 transition count 2032
Iterating global reduction 2 with 17 rules applied. Total rules applied 1387 place count 1201 transition count 2032
Applied a total of 1387 rules in 675 ms. Remains 1201 /1888 variables (removed 687) and now considering 2032/6804 (removed 4772) transitions.
// Phase 1: matrix 2032 rows 1201 cols
[2025-05-29 23:25:38] [INFO ] Computed 18 invariants in 51 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:25:39] [INFO ] Implicit Places using invariants in 535 ms returned []
[2025-05-29 23:25:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:25:41] [INFO ] Implicit Places using invariants and state equation in 2215 ms returned []
Implicit Place search using SMT with State Equation took 2786 ms to find 0 implicit places.
Running 2031 sub problems to find dead transitions.
[2025-05-29 23:25:46] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1200 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2031 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1200/3233 variables, and 18 constraints, problems are : Problem set: 0 solved, 2031 unsolved in 31150 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/1201 constraints, PredecessorRefiner: 2031/1598 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2031 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1200 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2031 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1200/3233 variables, and 18 constraints, problems are : Problem set: 0 solved, 2031 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/1201 constraints, PredecessorRefiner: 433/1598 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62985ms problems are : Problem set: 0 solved, 2031 unsolved
Search for dead transitions found 0 dead transitions in 68393ms
Starting structural reductions in LTL mode, iteration 1 : 1201/1888 places, 2032/6804 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71895 ms. Remains : 1201/1888 places, 2032/6804 transitions.
Support contains 115 out of 1201 places after structural reductions.
[2025-05-29 23:26:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-05-29 23:26:50] [INFO ] Flatten gal took : 208 ms
FORMULA CloudDeployment-PT-6b-CTLCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 23:26:50] [INFO ] Flatten gal took : 140 ms
[2025-05-29 23:26:50] [INFO ] Input system was already deterministic with 2032 transitions.
Support contains 103 out of 1201 places (down from 115) after GAL structural reductions.
RANDOM walk for 40000 steps (199 resets) in 2119 ms. (18 steps per ms) remains 22/47 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 22/22 properties
[2025-05-29 23:26:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 231/286 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 42/328 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 1079/1407 variables, 328/346 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1407 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 666/2073 variables, 283/629 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2073 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 571/2644 variables, 264/893 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2644 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 418/3062 variables, 210/1103 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3062 variables, 0/1103 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 141/3203 variables, 96/1199 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3203 variables, 0/1199 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 24/3227 variables, 16/1215 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3227 variables, 0/1215 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 6/3233 variables, 4/1219 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3233/3233 variables, and 1219 constraints, problems are : Problem set: 0 solved, 22 unsolved in 5011 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 1201/1201 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 231/286 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 42/328 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 1079/1407 variables, 328/346 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1407 variables, 3/349 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1407 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 666/2073 variables, 283/632 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2073 variables, 19/651 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0)
(t1 1)
(t2 1)
(t3 1)
(t4 0)
(t5 1)
(t6 1)
(t7 1)
(t8 1)
(t9 1)
(t10 1)
(t11 1)
(t12 1)
(t13 1)
(t14 1)
(t15 1)
(t16 1)
(t17 0)
(t18 0)
(t19 0)
(t20 0)
(t21 0)
(t22 0)
(t23 0)
(t24 0)
(t25 0)
(t26 0)
(t27 0)
(t28 0)
(t29 0)
(t30 1)
(t31 0)
(t32 0)
(t33 0)
(t34 0)
(t35 1)
(t36 1)
(t37 1)
(t38 0)
(t43 0)
(t44 0)
(t46 0)
(t47 0)
(t48 0)
(t49 0)
(t53 0)
(t56 0)
(t57 0)
(t62 0)
(t65 0)
(t66 0)
(t71 0)
(t76 0)
(t77 0)
(t78 0)
(t90 0)
(t91 0)
(t96 0)
(t97 0)
(t98 0)
(t106 0)
(t114 0)
(t115 0)
(t119 0)
(t120 0)
(t121 0)
(t123 2)
(t124 2)
(t125 0)
(t126 0)
(t129 0)
(t130 0)
(t132 2)
(t133 0)
(t134 1)
(t135 0)
(t140 0)
(t141 0)
(t142 0)
(t145 1)
(t146 1)
(t147 1)
(t148 0)
(t149 0)
(t150 0)
(t151 0)
(t152 1)
(t153 2)
(t154 0)
(t155 0)
(t157 0)
(t160 0)
(t161 0)
(t162 0)
(t168 0)
(t169 0)
(t170 0)
(t171 0)
(t174 0)
(t177 0)
(t178 0)
(t179 0)
(t180 0)
(t182 0)
(t183 0)
(t184 0)
(t185 0)
(t186 0)
(t190 0)
(t191 0)
(t192 0)
(t196 0)
(t205 0)
(t207 1)
(t208 3)
(t209 2)
(t210 2)
(t211 2)
(t212 2)
(t213 2)
(t214 0)
(t215 0)
(t216 1)
(t217 1)
(t218 0)
(t219 0)
(t220 1)
(t221 1)
(t222 0)
(t223 2)
(t224 0)
(t225 0)
(t226 0)
(t227 1)
(t228 1)
(t229 1)
(t230 0)
(t231 0)
(t232 0)
(t233 0)
(t234 0)
(t235 0)
(t236 1)
(t237 0)
(t238 1)
(t239 1)
(t240 1)
(t241 1)
(t245 7)
(t246 0)
(t248 0)
(t249 0)
(t250 0)
(t251 0)
(t254 0)
(t257 0)
(t258 0)
(t263 0)
(t266 0)
(t267 0)
(t271 0)
(t276 0)
(t277 0)
(t278 0)
(t290 0)
(t292 0)
(t297 1)
(t298 1)
(t299 1)
(t308 0)
(t316 0)
(t317 0)
(t321 0)
(t322 0)
(t323 0)
(t330 0)
(t331 0)
(t332 0)
(t333 0)
(t334 0)
(t339 0)
(t340 0)
(t341 0)
(t349 0)
(t350 0)
(t351 0)
(t355 0)
(t358 2)
(t359 0)
(t360 0)
(t361 0)
(t362 0)
(t367 0)
(t368 0)
(t369 0)
(t370 0)
(t371 0)
(t376 0)
(t377 0)
(t381 1)
(t382 0)
(t383 0)
(t384 0)
(t385 0)
(t390 0)
(t391 0)
(t392 0)
(t395 0)
(t404 7)
(t406 1)
(t407 10)
(t408 3)
(t409 0)
(t410 0)
(t411 0)
(t412 0)
(t413 0)
(t414 0)
(t415 0)
(t416 0)
(t417 0)
(t418 0)
(t419 0)
(t420 0)
(t421 0)
(t422 0)
(t423 1)
(t424 0)
(t425 0)
(t426 7)
(t427 12)
(t428 5)
(t429 0)
(t430 0)
(t431 0)
(t432 0)
(t433 0)
(t434 0)
(t435 4)
(t436 7)
(t437 1)
(t438 1)
(t439 1)
(t440 0)
(t444 0)
(t445 0)
(t446 2)
(t447 2)
(t448 0)
(t449 0)
(t450 0)
(t451 0)
(t454 0)
(t457 0)
(t458 0)
(t463 0)
(t466 0)
(t467 0)
(t471 0)
(t476 0)
(t477 0)
(t478 0)
(t479 0)
(t480 0)
(t481 0)
(t490 0)
(t491 0)
(t496 0)
(t497 0)
(t498 0)
(t506 0)
(t514 0)
(t515 0)
(t519 0)
(t520 0)
(t521 0)
(t522 0)
(t529 1)
(t530 0)
(t531 0)
(t532 0)
(t533 0)
(t538 0)
(t539 0)
(t540 0)
(t548 0)
(t551 1)
(t552 0)
(t554 0)
(t557 0)
(t558 0)
(t563 1)
(t564 1)
(t565 0)
(t566 0)
(t567 0)
(t574 0)
(t579 0)
(t580 0)
(t581 0)
(t587 0)
(t588 0)
(t589 0)
(t591 0)
(t592 0)
(t595 0)
(t596 0)
(t597 1)
(t598 1)
(t601 0)
(t603 1)
(t604 1)
(t605 1)
(t606 0)
(t607 1)
(t608 1)
(t609 1)
(t610 1)
(t611 1)
(t612 1)
(t613 0)
(t614 0)
(t615 0)
(t616 0)
(t617 0)
(t618 0)
(t619 0)
(t620 0)
(t621 0)
(t622 0)
(t623 0)
(t624 0)
(t625 0)
(t626 2)
(t627 3)
(t628 1)
(t629 0)
(t630 0)
(t631 0)
(t632 1)
(t633 1)
(t634 0)
(t635 0)
(t636 1)
(t637 1)
(t638 1)
(t639 1)
(t640 2)
(t641 2)
(t642 1)
(t643 0)
(t644 0)
(t646 0)
(t647 0)
(t648 0)
(t649 0)
(t650 3)
(t651 0)
(t652 0)
(t655 0)
(t656 0)
(t661 0)
(t664 0)
(t665 0)
(t669 0)
(t670 0)
(t671 0)
(t674 1)
(t675 0)
(t676 1)
(t677 0)
(t685 2)
(t686 2)
(t687 0)
(t690 0)
(t691 0)
(t695 0)
(t696 0)
(t697 0)
(t698 0)
(t699 0)
(t703 0)
(t704 0)
(t705 0)
(t706 0)
(t708 0)
(t709 0)
(t714 0)
(t715 0)
(t719 0)
(t720 0)
(t721 0)
(t731 0)
(t732 0)
(t737 0)
(t738 0)
(t739 0)
(t747 0)
(t753 0)
(t755 0)
(t756 0)
(t757 0)
(t758 1)
(t759 0)
(t760 0)
(t763 0)
(t764 0)
(t765 2)
(t766 2)
(t767 1)
(t768 0)
(t769 0)
(t773 0)
(t778 0)
(t779 0)
(t780 0)
(t787 0)
(t788 0)
(t789 0)
(t792 0)
(t793 0)
(t794 0)
(t797 0)
(t798 0)
(t801 0)
(t802 3)
(t803 1)
(t804 2)
(t805 2)
(t806 1)
(t807 1)
(t808 1)
(t809 1)
(t810 0)
(t811 0)
(t812 1)
(t813 1)
(t814 0)
(t815 0)
(t816 0)
(t817 0)
(t818 0)
(t819 0)
(t820 0)
(t821 1)
(t822 0)
(t823 2)
(t824 2)
(t825 0)
(t826 0)
(t827 0)
(t828 0)
(t829 0)
(t830 0)
(t831 0)
(t832 0)
(t833 1)
(t834 0)
(t835 0)
(t836 0)
(t837 1)
(t838 1)
(t839 1)
(t840 1)
(t844 0)
(t845 0)
(t847 0)
(t848 0)
(t849 0)
(t850 0)
(t853 0)
(t856 0)
(t857 0)
(t859 1)
(t860 1)
(t861 0)
(t862 0)
(t865 0)
(t866 0)
(t868 0)
(t870 0)
(t875 0)
(t876 0)
(t877 0)
(t878 2)
(t879 0)
(t880 0)
(t888 0)
(t889 0)
(t894 0)
(t895 0)
(t896 0)
(t904 0)
(t912 0)
(t913 0)
(t917 0)
(t919 0)
(t930 0)
(t931 0)
(t936 0)
(t937 0)
(t938 0)
(t946 0)
(t952 0)
(t955 0)
(t956 0)
(t962 0)
(t963 0)
(t964 0)
(t965 0)
(t972 0)
(t977 0)
(t978 0)
(t979 0)
(t985 0)
(t986 0)
(t987 0)
(t989 0)
(t990 0)
(t993 0)
(t994 0)
(t995 0)
(t996 2)
(t997 1)
(t998 0)
(t999 0)
(t1001 1)
(t1002 1)
(t1003 1)
(t1004 1)
(t1005 1)
(t1006 1)
(t1007 1)
(t1008 0)
(t1009 0)
(t1010 0)
(t1011 0)
(t1012 0)
(t1013 0)
(t1014 1)
(t1015 1)
(t1016 0)
(t1017 0)
(t1018 0)
(t1019 0)
(t1020 0)
(t1021 1)
(t1022 1)
(t1023 0)
(t1024 0)
(t1025 1)
(t1026 1)
(t1027 0)
(t1028 0)
(t1029 0)
(t1030 1)
(t1031 1)
(t1032 0)
(t1036 0)
(t1037 0)
(t1040 0)
(t1041 0)
(t1042 0)
(t1043 0)
(t1050 0)
(t1051 0)
(t1056 0)
(t1059 0)
(t1060 0)
(t1064 0)
(t1069 0)
(t1070 0)
(t1071 0)
(t1078 0)
(t1079 0)
(t1080 0)
(t1083 0)
(t1084 0)
(t1089 0)
(t1090 0)
(t1091 0)
(t1100 0)
(t1103 3)
(t1104 3)
(t1105 0)
(t1106 0)
(t1108 0)
(t1109 0)
(t1113 0)
(t1114 0)
(t1115 0)
(t1124 0)
(t1126 3)
(t1127 0)
(t1128 0)
(t1133 0)
(t1134 0)
(t1135 0)
(t1139 2)
(t1140 2)
(t1141 0)
(t1144 0)
(t1145 0)
(t1147 3)
(t1148 0)
(t1149 0)
(t1151 0)
(t1152 3)
(t1153 3)
(t1154 0)
(t1155 0)
(t1159 2)
(t1160 2)
(t1161 1)
(t1162 0)
(t1163 0)
(t1164 0)
(t1165 1)
(t1166 1)
(t1167 0)
(t1171 0)
(t1176 0)
(t1177 0)
(t1178 0)
(t1179 0)
(t1180 0)
(t1185 0)
(t1186 0)
(t1187 0)
(t1190 0)
(t1199 0)
(t1201 1)
(t1202 1)
(t1203 1)
(t1204 1)
(t1205 1)
(t1206 1)
(t1207 0)
(t1208 0)
(t1209 0)
(t1210 0)
(t1211 0)
(t1212 0)
(t1213 0)
(t1214 0)
(t1215 0)
(t1216 0)
(t1217 0)
(t1218 0)
(t1219 0)
(t1220 0)
(t1221 0)
(t1222 0)
(t1223 0)
(t1224 1)
(t1225 1)
(t1226 1)
(t1227 0)
(t1228 0)
(t1229 0)
(t1230 0)
(t1231 0)
(t1232 0)
(t1233 0)
(t1234 0)
(t1235 0)
(t1236 0)
(t1237 0)
(t1238 0)
(t1239 0)
(t1240 0)
(t1241 0)
(t1242 0)
(t1243 0)
(t1244 0)
(t1245 0)
(t1246 0)
(t1247 0)
(t1248 0)
(t1249 0)
(t1250 0)
(t1251 0)
(t1252 0)
(t1253 0)
(t1254 0)
(t1255 0)
(t1256 0)
(t1257 0)
(t1258 0)
(t1259 0)
(t1260 0)
(t1261 0)
(t1262 0)
(t1263 0)
(t1264 0)
(t1265 0)
(t1266 0)
(t1267 0)
(t1268 0)
(t1269 0)
(t1270 0)
(t1271 0)
(t1272 0)
(t1273 0)
(t1274 0)
(t1275 0)
(t1276 0)
(t1277 0)
(t1278 0)
(t1279 0)
(t1280 0)
(t1281 0)
(t1282 0)
(t1283 0)
(t1284 0)
(t1285 0)
(t1286 0)
(t1287 0)
(t1288 0)
(t1289 0)
(t1290 0)
(t1291 0)
(t1292 0)
(t1293 0)
(t1294 0)
(t1295 0)
(t1296 0)
(t1297 0)
(t1298 0)
(t1299 0)
(t1300 0)
(t1301 0)
(t1302 0)
(t1303 0)
(t1304 0)
(t1305 0)
(t1306 0)
(t1307 0)
(t1308 0)
(t1309 0)
(t1310 0)
(t1311 0)
(t1312 0)
(t1313 0)
(t1314 0)
(t1315 0)
(t1316 0)
(t1317 0)
(t1318 0)
(t1319 0)
(t1320 0)
(t1321 0)
(t1322 0)
(t1323 0)
(t1324 0)
(t1325 0)
(t1326 0)
(t1327 0)
(t1328 0)
(t1329 0)
(t1330 0)
(t1331 0)
(t1332 0)
(t1333 0)
(t1334 0)
(t1335 0)
(t1336 0)
(t1337 0)
(t1338 0)
(t1339 0)
(t1340 0)
(t1341 0)
(t1342 0)
(t1343 0)
(t1344 0)
(t1345 0)
(t1346 0)
(t1347 0)
(t1348 0)
(t1349 0)
(t1350 0)
(t1351 0)
(t1352 0)
(t1353 0)
(t1354 0)
(t1355 0)
(t1356 0)
(t1357 0)
(t1358 0)
(t1359 0)
(t1360 0)
(t1361 0)
(t1362 0)
(t1363 0)
(t1364 0)
(t1365 0)
(t1366 0)
(t1367 0)
(t1368 0)
(t1369 0)
(t1370 0)
(t1371 0)
(t1372 0)
(t1373 0)
(t1374 0)
(t1375 0)
(t1376 0)
(t1377 0)
(t1378 0)
(t1379 0)
(t1380 0)
(t1381 0)
(t1382 0)
(t1383 0)
(t1384 0)
(t1385 0)
(t1386 0)
(t1387 0)
(t1388 0)
(t1389 0)
(t1390 0)
(t1391 0)
(t1392 0)
(t1393 0)
(t1394 0)
(t1395 0)
(t1396 0)
(t1397 0)
(t1398 0)
(t1399 0)
(t1400 0)
(t1401 0)
(t1402 0)
(t1403 0)
(t1404 0)
(t1405 0)
(t1406 0)
(t1407 0)
(t1408 0)
(t1409 0)
(t1410 0)
(t1411 0)
(t1412 0)
(t1413 0)
(t1414 0)
(t1415 0)
(t1416 0)
(t1417 0)
(t1418 0)
(t1419 0)
(t1420 0)
(t1421 0)
(t1422 0)
(t1423 0)
(t1424 0)
(t1425 0)
(t1426 0)
(t1427 0)
(t1428 0)
(t1429 0)
(t1430 0)
(t1431 0)
(t1432 0)
(t1433 0)
(t1434 0)
(t1435 0)
(t1436 0)
(t1437 0)
(t1438 0)
(t1439 0)
(t1440 0)
(t1441 0)
(t1442 0)
(t1443 0)
(t1444 0)
(t1445 0)
(t1446 0)
(t1447 0)
(t1448 0)
(t1449 0)
(t1450 0)
(t1451 0)
(t1452 0)
(t1453 0)
(t1454 0)
(t1455 0)
(t1456 0)
(t1457 0)
(t1458 0)
(t1459 0)
(t1460 0)
(t1461 0)
(t1462 0)
(t1463 0)
(t1464 0)
(t1465 0)
(t1466 0)
(t1467 0)
(t1468 0)
(t1469 0)
(t1470 0)
(t1471 0)
(t1472 0)
(t1473 0)
(t1474 0)
(t1475 0)
(t1476 0)
(t1477 0)
(t1478 0)
(t1479 0)
(t1480 0)
(t1481 0)
(t1482 0)
(t1483 0)
(t1484 0)
(t1485 0)
(t1486 0)
(t1487 0)
(t1488 0)
(t1489 0)
(t1490 0)
(t1491 0)
(t1492 0)
(t1493 0)
(t1494 0)
(t1495 0)
(t1496 0)
(t1497 0)
(t1498 0)
(t1499 0)
(t1500 0)
(t1501 0)
(t1502 0)
(t1503 0)
(t1504 0)
(t1505 0)
(t1506 0)
(t1507 0)
(t1508 0)
(t1509 0)
(t1510 0)
(t1511 0)
(t1512 0)
(t1513 0)
(t1514 0)
(t1515 0)
(t1516 0)
(t1517 0)
(t1518 0)
(t1519 0)
(t1520 0)
(t1521 0)
(t1522 0)
(t1523 0)
(t1524 0)
(t1525 0)
(t1526 0)
(t1527 0)
(t1528 0)
(t1529 0)
(t1530 0)
(t1531 0)
(t1532 0)
(t1533 0)
(t1534 0)
(t1535 0)
(t1536 0)
(t1537 0)
(t1538 0)
(t1539 0)
(t1540 0)
(t1541 0)
(t1542 0)
(t1543 0)
(t1544 0)
(t1545 0)
(t1546 0)
(t1547 0)
(t1548 0)
(t1549 0)
(t1550 0)
(t1551 0)
(t1552 0)
(t1553 0)
(t1554 0)
(t1555 0)
(t1556 0)
(t1557 0)
(t1558 0)
(t1559 0)
(t1560 0)
(t1561 0)
(t1562 0)
(t1563 0)
(t1564 0)
(t1565 0)
(t1566 0)
(t1567 0)
(t1568 0)
(t1569 0)
(t1570 0)
(t1571 0)
(t1572 0)
(t1573 0)
(t1574 0)
(t1575 0)
(t1576 0)
(t1577 0)
(t1578 0)
(t1579 0)
(t1580 0)
(t1581 0)
(t1582 0)
(t1583 0)
(t1584 0)
(t1585 0)
(t1586 0)
(t1587 0)
(t1588 0)
(t1589 0)
(t1590 0)
(t1591 0)
(t1592 0)
(t1593 0)
(t1594 0)
(t1595 0)
(t1596 0)
(t1597 0)
(t1598 0)
(t1599 0)
(t1600 0)
(t1601 0)
(t1602 0)
(t1603 0)
(t1604 0)
(t1605 0)
(t1606 0)
(t1607 0)
(t1608 0)
(t1609 0)
(t1610 0)
(t1611 0)
(t1612 0)
(t1613 1)
(t1614 0)
(t1615 0)
(t1616 0)
(t1617 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2073/3233 variables, and 651 constraints, problems are : Problem set: 0 solved, 22 unsolved in 5016 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 611/1201 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10057ms problems are : Problem set: 0 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 55 out of 1201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1201/1201 places, 2032/2032 transitions.
Graph (trivial) has 1149 edges and 1201 vertex of which 357 / 1201 are part of one of the 44 SCC in 4 ms
Free SCC test removed 313 places
Drop transitions (Empty/Sink Transition effects.) removed 395 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 398 transitions.
Graph (complete) has 3373 edges and 888 vertex of which 887 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 314 transitions
Trivial Post-agglo rules discarded 314 transitions
Performed 314 trivial Post agglomeration. Transition count delta: 314
Iterating post reduction 0 with 320 rules applied. Total rules applied 322 place count 887 transition count 1314
Reduce places removed 314 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 328 rules applied. Total rules applied 650 place count 573 transition count 1300
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 665 place count 559 transition count 1299
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 70 Pre rules applied. Total rules applied 665 place count 559 transition count 1229
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 805 place count 489 transition count 1229
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 827 place count 467 transition count 1201
Iterating global reduction 3 with 22 rules applied. Total rules applied 849 place count 467 transition count 1201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 852 place count 467 transition count 1198
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 852 place count 467 transition count 1192
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 864 place count 461 transition count 1192
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 865 place count 460 transition count 1191
Iterating global reduction 4 with 1 rules applied. Total rules applied 866 place count 460 transition count 1191
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 867 place count 459 transition count 1190
Iterating global reduction 4 with 1 rules applied. Total rules applied 868 place count 459 transition count 1190
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 4 with 218 rules applied. Total rules applied 1086 place count 350 transition count 1081
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1090 place count 350 transition count 1077
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -198
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 1180 place count 305 transition count 1275
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 5 with 40 rules applied. Total rules applied 1220 place count 305 transition count 1235
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -61
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1232 place count 299 transition count 1296
Drop transitions (Redundant composition of simpler transitions.) removed 117 transitions
Redundant transition composition rules discarded 117 transitions
Iterating global reduction 6 with 117 rules applied. Total rules applied 1349 place count 299 transition count 1179
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1351 place count 298 transition count 1192
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1352 place count 298 transition count 1191
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 1364 place count 298 transition count 1179
Free-agglomeration rule applied 62 times with reduction of 24 identical transitions.
Iterating global reduction 7 with 62 rules applied. Total rules applied 1426 place count 298 transition count 1093
Reduce places removed 62 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 101 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 149 transitions.
Iterating post reduction 7 with 211 rules applied. Total rules applied 1637 place count 236 transition count 944
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1638 place count 235 transition count 937
Iterating global reduction 8 with 1 rules applied. Total rules applied 1639 place count 235 transition count 937
Drop transitions (Redundant composition of simpler transitions.) removed 96 transitions
Redundant transition composition rules discarded 96 transitions
Iterating global reduction 8 with 96 rules applied. Total rules applied 1735 place count 235 transition count 841
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1736 place count 235 transition count 846
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1737 place count 234 transition count 846
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1743 place count 234 transition count 846
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1744 place count 234 transition count 845
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1745 place count 233 transition count 844
Applied a total of 1745 rules in 504 ms. Remains 233 /1201 variables (removed 968) and now considering 844/2032 (removed 1188) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 504 ms. Remains : 233/1201 places, 844/2032 transitions.
RANDOM walk for 40000 steps (295 resets) in 1097 ms. (36 steps per ms) remains 18/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
[2025-05-29 23:27:02] [INFO ] Flow matrix only has 554 transitions (discarded 290 similar events)
// Phase 1: matrix 554 rows 233 cols
[2025-05-29 23:27:02] [INFO ] Computed 24 invariants in 4 ms
[2025-05-29 23:27:02] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 177/224 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 9/233 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 554/787 variables, 233/257 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/787 variables, 15/272 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/787 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/787 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 787/787 variables, and 272 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1193 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 233/233 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 177/224 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/224 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 9/233 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 5 (OVERLAPS) 554/787 variables, 233/257 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/787 variables, 15/272 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/787 variables, 17/289 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/787 variables, 0/289 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/787 variables, 0/289 constraints. Problems are: Problem set: 1 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 787/787 variables, and 289 constraints, problems are : Problem set: 1 solved, 17 unsolved in 2396 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 233/233 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 17/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3610ms problems are : Problem set: 1 solved, 17 unsolved
Parikh walk visited 13 properties in 2181 ms.
Support contains 20 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 844/844 transitions.
Graph (trivial) has 136 edges and 233 vertex of which 18 / 233 are part of one of the 7 SCC in 1 ms
Free SCC test removed 11 places
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 33 transitions.
Ensure Unique test removed 1 places
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 0 with 5 rules applied. Total rules applied 6 place count 221 transition count 807
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 217 transition count 806
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 216 transition count 806
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 12 place count 216 transition count 801
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 22 place count 211 transition count 801
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 27 place count 206 transition count 787
Iterating global reduction 3 with 5 rules applied. Total rules applied 32 place count 206 transition count 787
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 33 place count 205 transition count 786
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 205 transition count 786
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 3 with 22 rules applied. Total rules applied 56 place count 194 transition count 775
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 62 place count 194 transition count 769
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 63 place count 193 transition count 759
Iterating global reduction 4 with 1 rules applied. Total rules applied 64 place count 193 transition count 759
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 65 place count 193 transition count 758
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 85 place count 183 transition count 856
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 5 with 31 rules applied. Total rules applied 116 place count 183 transition count 825
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 117 place count 182 transition count 805
Iterating global reduction 6 with 1 rules applied. Total rules applied 118 place count 182 transition count 805
Drop transitions (Redundant composition of simpler transitions.) removed 106 transitions
Redundant transition composition rules discarded 106 transitions
Iterating global reduction 6 with 106 rules applied. Total rules applied 224 place count 182 transition count 699
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 226 place count 182 transition count 697
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 235 place count 180 transition count 690
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 236 place count 179 transition count 682
Iterating global reduction 7 with 1 rules applied. Total rules applied 237 place count 179 transition count 682
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 238 place count 179 transition count 692
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 239 place count 178 transition count 692
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 240 place count 178 transition count 692
Applied a total of 240 rules in 126 ms. Remains 178 /233 variables (removed 55) and now considering 692/844 (removed 152) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 178/233 places, 692/844 transitions.
RANDOM walk for 40000 steps (8 resets) in 259 ms. (153 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 141 ms. (281 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 682084 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :0 out of 4
Probabilistic random walk after 682084 steps, saw 114846 distinct states, run finished after 3006 ms. (steps per millisecond=226 ) properties seen :0
[2025-05-29 23:27:11] [INFO ] Flow matrix only has 382 transitions (discarded 310 similar events)
// Phase 1: matrix 382 rows 178 cols
[2025-05-29 23:27:11] [INFO ] Computed 24 invariants in 2 ms
[2025-05-29 23:27:11] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 158/178 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 382/560 variables, 178/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/560 variables, 9/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/560 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/560 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 560/560 variables, and 211 constraints, problems are : Problem set: 0 solved, 4 unsolved in 213 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 178/178 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 158/178 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 382/560 variables, 178/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/560 variables, 9/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/560 variables, 4/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/560 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/560 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 560/560 variables, and 215 constraints, problems are : Problem set: 0 solved, 4 unsolved in 485 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 178/178 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 712ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 3 properties in 135 ms.
Support contains 2 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 692/692 transitions.
Graph (trivial) has 92 edges and 178 vertex of which 8 / 178 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 1430 edges and 174 vertex of which 158 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 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 0 with 20 rules applied. Total rules applied 22 place count 158 transition count 660
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 26 place count 154 transition count 660
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 26 place count 154 transition count 658
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 place count 152 transition count 658
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 151 transition count 657
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 151 transition count 657
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 48 place count 143 transition count 649
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 54 place count 143 transition count 643
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 142 transition count 633
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 142 transition count 633
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 142 transition count 632
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 63 place count 139 transition count 648
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 65 place count 139 transition count 646
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 5 with 21 rules applied. Total rules applied 86 place count 139 transition count 625
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 87 place count 139 transition count 624
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 98 place count 138 transition count 614
Applied a total of 98 rules in 52 ms. Remains 138 /178 variables (removed 40) and now considering 614/692 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 138/178 places, 614/692 transitions.
RANDOM walk for 40000 steps (8 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1003483 steps, run timeout after 3001 ms. (steps per millisecond=334 ) properties seen :0 out of 1
Probabilistic random walk after 1003483 steps, saw 155134 distinct states, run finished after 3001 ms. (steps per millisecond=334 ) properties seen :0
[2025-05-29 23:27:15] [INFO ] Flow matrix only has 311 transitions (discarded 303 similar events)
// Phase 1: matrix 311 rows 138 cols
[2025-05-29 23:27:15] [INFO ] Computed 21 invariants in 5 ms
[2025-05-29 23:27:15] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/67 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 216/283 variables, 67/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 80/363 variables, 25/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/363 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/363 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 26/389 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/389 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/389 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 52/441 variables, 39/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/441 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 7/448 variables, 5/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/448 variables, 6/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/448 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/449 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/449 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/449 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 168 constraints, problems are : Problem set: 0 solved, 1 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 138/138 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 23:27:15] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 21/67 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp25 is UNSAT
After SMT solving in domain Int declared 283/449 variables, and 86 constraints, problems are : Problem set: 1 solved, 0 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 1/4 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 67/138 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 290ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2025-05-29 23:27:16] [INFO ] Flatten gal took : 79 ms
[2025-05-29 23:27:16] [INFO ] Flatten gal took : 83 ms
[2025-05-29 23:27:16] [INFO ] Input system was already deterministic with 2032 transitions.
Computed a total of 194 stabilizing places and 697 stable transitions
Graph (complete) has 3858 edges and 1201 vertex of which 1177 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.40 ms
Starting structural reductions in LTL mode, iteration 0 : 1201/1201 places, 2032/2032 transitions.
Discarding 67 places :
Symmetric choice reduction at 0 with 67 rule applications. Total rules 67 place count 1134 transition count 1954
Iterating global reduction 0 with 67 rules applied. Total rules applied 134 place count 1134 transition count 1954
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 138 place count 1134 transition count 1950
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 154 place count 1118 transition count 1934
Iterating global reduction 1 with 16 rules applied. Total rules applied 170 place count 1118 transition count 1934
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 176 place count 1118 transition count 1928
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 178 place count 1116 transition count 1926
Iterating global reduction 2 with 2 rules applied. Total rules applied 180 place count 1116 transition count 1926
Applied a total of 180 rules in 109 ms. Remains 1116 /1201 variables (removed 85) and now considering 1926/2032 (removed 106) transitions.
// Phase 1: matrix 1926 rows 1116 cols
[2025-05-29 23:27:16] [INFO ] Computed 18 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:27:16] [INFO ] Implicit Places using invariants in 246 ms returned []
[2025-05-29 23:27:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:27:18] [INFO ] Implicit Places using invariants and state equation in 1542 ms returned [12, 20, 186, 194, 359, 367, 532, 540, 705, 713, 878, 886]
[2025-05-29 23:27:18] [INFO ] Actually due to overlaps returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1795 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1115/1201 places, 1926/2032 transitions.
Applied a total of 0 rules in 26 ms. Remains 1115 /1115 variables (removed 0) and now considering 1926/1926 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1932 ms. Remains : 1115/1201 places, 1926/2032 transitions.
[2025-05-29 23:27:18] [INFO ] Flatten gal took : 64 ms
[2025-05-29 23:27:18] [INFO ] Flatten gal took : 69 ms
[2025-05-29 23:27:18] [INFO ] Input system was already deterministic with 1926 transitions.
[2025-05-29 23:27:18] [INFO ] Flatten gal took : 64 ms
[2025-05-29 23:27:18] [INFO ] Flatten gal took : 66 ms
[2025-05-29 23:27:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality4694184794687569673.gal : 63 ms
[2025-05-29 23:27:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality10735328303742222393.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4694184794687569673.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10735328303742222393.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 23:27:49] [INFO ] Flatten gal took : 64 ms
[2025-05-29 23:27:49] [INFO ] Applying decomposition
[2025-05-29 23:27:49] [INFO ] Flatten gal took : 65 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7324984875906386400.txt' '-o' '/tmp/graph7324984875906386400.bin' '-w' '/tmp/graph7324984875906386400.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7324984875906386400.bin' '-l' '-1' '-v' '-w' '/tmp/graph7324984875906386400.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:27:49] [INFO ] Decomposing Gal with order
[2025-05-29 23:27:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:27:49] [INFO ] Removed a total of 2729 redundant transitions.
[2025-05-29 23:27:49] [INFO ] Flatten gal took : 280 ms
[2025-05-29 23:27:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 102 labels/synchronizations in 104 ms.
[2025-05-29 23:27:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality10434637473221705872.gal : 22 ms
[2025-05-29 23:27:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality9195419799257302657.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10434637473221705872.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9195419799257302657.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1201/1201 places, 2032/2032 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 1139 transition count 1959
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 1139 transition count 1959
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 128 place count 1139 transition count 1955
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 143 place count 1124 transition count 1940
Iterating global reduction 1 with 15 rules applied. Total rules applied 158 place count 1124 transition count 1940
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 164 place count 1124 transition count 1934
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 166 place count 1122 transition count 1932
Iterating global reduction 2 with 2 rules applied. Total rules applied 168 place count 1122 transition count 1932
Applied a total of 168 rules in 136 ms. Remains 1122 /1201 variables (removed 79) and now considering 1932/2032 (removed 100) transitions.
// Phase 1: matrix 1932 rows 1122 cols
[2025-05-29 23:28:20] [INFO ] Computed 18 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:28:20] [INFO ] Implicit Places using invariants in 328 ms returned []
[2025-05-29 23:28:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:28:22] [INFO ] Implicit Places using invariants and state equation in 1462 ms returned [12, 20, 186, 194, 359, 367, 534, 542, 708, 716, 881, 889]
[2025-05-29 23:28:22] [INFO ] Actually due to overlaps returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1797 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1121/1201 places, 1932/2032 transitions.
Applied a total of 0 rules in 29 ms. Remains 1121 /1121 variables (removed 0) and now considering 1932/1932 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1963 ms. Remains : 1121/1201 places, 1932/2032 transitions.
[2025-05-29 23:28:22] [INFO ] Flatten gal took : 63 ms
[2025-05-29 23:28:22] [INFO ] Flatten gal took : 74 ms
[2025-05-29 23:28:22] [INFO ] Input system was already deterministic with 1932 transitions.
[2025-05-29 23:28:22] [INFO ] Flatten gal took : 61 ms
[2025-05-29 23:28:22] [INFO ] Flatten gal took : 70 ms
[2025-05-29 23:28:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality14434467418884958889.gal : 9 ms
[2025-05-29 23:28:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality5773501069020284832.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14434467418884958889.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5773501069020284832.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 23:28:52] [INFO ] Flatten gal took : 55 ms
[2025-05-29 23:28:52] [INFO ] Applying decomposition
[2025-05-29 23:28:52] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10713869710819361000.txt' '-o' '/tmp/graph10713869710819361000.bin' '-w' '/tmp/graph10713869710819361000.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10713869710819361000.bin' '-l' '-1' '-v' '-w' '/tmp/graph10713869710819361000.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:28:53] [INFO ] Decomposing Gal with order
[2025-05-29 23:28:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:28:53] [INFO ] Removed a total of 3162 redundant transitions.
[2025-05-29 23:28:53] [INFO ] Flatten gal took : 100 ms
[2025-05-29 23:28:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 43 ms.
[2025-05-29 23:28:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality15376260498932812262.gal : 11 ms
[2025-05-29 23:28:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality2868667374574818715.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15376260498932812262.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2868667374574818715.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1201/1201 places, 2032/2032 transitions.
Graph (trivial) has 1225 edges and 1201 vertex of which 413 / 1201 are part of one of the 47 SCC in 6 ms
Free SCC test removed 366 places
Ensure Unique test removed 416 transitions
Reduce isomorphic transitions removed 416 transitions.
Graph (complete) has 3400 edges and 835 vertex of which 834 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 329 transitions
Trivial Post-agglo rules discarded 329 transitions
Performed 329 trivial Post agglomeration. Transition count delta: 329
Iterating post reduction 0 with 329 rules applied. Total rules applied 331 place count 833 transition count 1285
Reduce places removed 329 places and 0 transitions.
Iterating post reduction 1 with 329 rules applied. Total rules applied 660 place count 504 transition count 1285
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 660 place count 504 transition count 1231
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 768 place count 450 transition count 1231
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 804 place count 414 transition count 1184
Iterating global reduction 2 with 36 rules applied. Total rules applied 840 place count 414 transition count 1184
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 844 place count 414 transition count 1180
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 844 place count 414 transition count 1173
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 858 place count 407 transition count 1173
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 860 place count 405 transition count 1171
Iterating global reduction 3 with 2 rules applied. Total rules applied 862 place count 405 transition count 1171
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 863 place count 404 transition count 1170
Iterating global reduction 3 with 1 rules applied. Total rules applied 864 place count 404 transition count 1170
Performed 109 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 1082 place count 295 transition count 1059
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1085 place count 295 transition count 1056
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 1110 place count 295 transition count 1031
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 4 with 12 rules applied. Total rules applied 1122 place count 295 transition count 1019
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1134 place count 283 transition count 1019
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 1148 place count 276 transition count 1012
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1149 place count 275 transition count 1011
Applied a total of 1149 rules in 241 ms. Remains 275 /1201 variables (removed 926) and now considering 1011/2032 (removed 1021) transitions.
[2025-05-29 23:29:23] [INFO ] Flow matrix only has 827 transitions (discarded 184 similar events)
// Phase 1: matrix 827 rows 275 cols
[2025-05-29 23:29:23] [INFO ] Computed 18 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:29:23] [INFO ] Implicit Places using invariants in 156 ms returned []
[2025-05-29 23:29:23] [INFO ] Flow matrix only has 827 transitions (discarded 184 similar events)
[2025-05-29 23:29:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:29:23] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-05-29 23:29:24] [INFO ] Implicit Places using invariants and state equation in 552 ms returned [123]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 710 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 274/1201 places, 1011/2032 transitions.
Applied a total of 0 rules in 25 ms. Remains 274 /274 variables (removed 0) and now considering 1011/1011 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 978 ms. Remains : 274/1201 places, 1011/2032 transitions.
[2025-05-29 23:29:24] [INFO ] Flatten gal took : 42 ms
[2025-05-29 23:29:24] [INFO ] Flatten gal took : 47 ms
[2025-05-29 23:29:24] [INFO ] Input system was already deterministic with 1011 transitions.
[2025-05-29 23:29:24] [INFO ] Flatten gal took : 42 ms
[2025-05-29 23:29:24] [INFO ] Flatten gal took : 45 ms
[2025-05-29 23:29:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality14776751583654153388.gal : 9 ms
[2025-05-29 23:29:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality17804031975880519061.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14776751583654153388.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17804031975880519061.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 23:29:54] [INFO ] Flatten gal took : 41 ms
[2025-05-29 23:29:54] [INFO ] Applying decomposition
[2025-05-29 23:29:54] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9501009862357879151.txt' '-o' '/tmp/graph9501009862357879151.bin' '-w' '/tmp/graph9501009862357879151.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9501009862357879151.bin' '-l' '-1' '-v' '-w' '/tmp/graph9501009862357879151.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:29:54] [INFO ] Decomposing Gal with order
[2025-05-29 23:29:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:29:54] [INFO ] Removed a total of 2421 redundant transitions.
[2025-05-29 23:29:54] [INFO ] Flatten gal took : 65 ms
[2025-05-29 23:29:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 150 labels/synchronizations in 18 ms.
[2025-05-29 23:29:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality6357366993679259635.gal : 4 ms
[2025-05-29 23:29:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality11634931999997082026.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6357366993679259635.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11634931999997082026.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,2.2854e+19,0.172262,10904,581,71,13417,569,982,24641,124,1560,0


Converting to forward existential form...Done !
original formula: A(A((EF(((i0.u7.p163==0)||(i3.i1.u32.p835==1))) + A(!((((i6.i0.u60.p1797==1)||(i4.u37.p962==0))||(i3.i0.u23.p612==1))) U AF((i5.u48.p1277...232
=> equivalent forward existential formula: [((Init * !(EG(!((i0.u0.p37==1))))) * !(E(!((i0.u0.p37==1)) U (!(!((E(!(EG(E(TRUE U ((i4.u37.p965==0)||(i6.i1.u6...575
Reverse transition relation is NOT exact ! Due to transitions t148, t245, t365, u82.t1, i0.t346, i0.t344, i0.t252, i0.t135, i0.u0.t147, i0.u1.t143, i0.u2.t...854
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1201/1201 places, 2032/2032 transitions.
Discarding 67 places :
Symmetric choice reduction at 0 with 67 rule applications. Total rules 67 place count 1134 transition count 1954
Iterating global reduction 0 with 67 rules applied. Total rules applied 134 place count 1134 transition count 1954
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 138 place count 1134 transition count 1950
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 154 place count 1118 transition count 1934
Iterating global reduction 1 with 16 rules applied. Total rules applied 170 place count 1118 transition count 1934
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 176 place count 1118 transition count 1928
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 178 place count 1116 transition count 1926
Iterating global reduction 2 with 2 rules applied. Total rules applied 180 place count 1116 transition count 1926
Applied a total of 180 rules in 126 ms. Remains 1116 /1201 variables (removed 85) and now considering 1926/2032 (removed 106) transitions.
// Phase 1: matrix 1926 rows 1116 cols
[2025-05-29 23:30:25] [INFO ] Computed 18 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:30:25] [INFO ] Implicit Places using invariants in 247 ms returned []
[2025-05-29 23:30:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:30:26] [INFO ] Implicit Places using invariants and state equation in 1460 ms returned [12, 20, 186, 194, 359, 367, 532, 540, 705, 713, 878, 886]
[2025-05-29 23:30:26] [INFO ] Actually due to overlaps returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1713 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1115/1201 places, 1926/2032 transitions.
Applied a total of 0 rules in 32 ms. Remains 1115 /1115 variables (removed 0) and now considering 1926/1926 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1872 ms. Remains : 1115/1201 places, 1926/2032 transitions.
[2025-05-29 23:30:26] [INFO ] Flatten gal took : 54 ms
[2025-05-29 23:30:27] [INFO ] Flatten gal took : 57 ms
[2025-05-29 23:30:27] [INFO ] Input system was already deterministic with 1926 transitions.
[2025-05-29 23:30:27] [INFO ] Flatten gal took : 55 ms
[2025-05-29 23:30:27] [INFO ] Flatten gal took : 56 ms
[2025-05-29 23:30:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality3110002719963608402.gal : 15 ms
[2025-05-29 23:30:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality11843047281382201426.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3110002719963608402.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11843047281382201426.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 23:30:57] [INFO ] Flatten gal took : 73 ms
[2025-05-29 23:30:57] [INFO ] Applying decomposition
[2025-05-29 23:30:57] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15508431567648037233.txt' '-o' '/tmp/graph15508431567648037233.bin' '-w' '/tmp/graph15508431567648037233.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15508431567648037233.bin' '-l' '-1' '-v' '-w' '/tmp/graph15508431567648037233.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:30:57] [INFO ] Decomposing Gal with order
[2025-05-29 23:30:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:30:57] [INFO ] Removed a total of 2500 redundant transitions.
[2025-05-29 23:30:57] [INFO ] Flatten gal took : 95 ms
[2025-05-29 23:30:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 111 labels/synchronizations in 27 ms.
[2025-05-29 23:30:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality18262621967567708456.gal : 11 ms
[2025-05-29 23:30:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality9112940764419532653.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18262621967567708456.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9112940764419532653.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1201/1201 places, 2032/2032 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 1140 transition count 1960
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 1140 transition count 1960
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 126 place count 1140 transition count 1956
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 140 place count 1126 transition count 1942
Iterating global reduction 1 with 14 rules applied. Total rules applied 154 place count 1126 transition count 1942
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 159 place count 1126 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 161 place count 1124 transition count 1935
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 1124 transition count 1935
Applied a total of 163 rules in 110 ms. Remains 1124 /1201 variables (removed 77) and now considering 1935/2032 (removed 97) transitions.
// Phase 1: matrix 1935 rows 1124 cols
[2025-05-29 23:31:28] [INFO ] Computed 18 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:31:28] [INFO ] Implicit Places using invariants in 224 ms returned []
[2025-05-29 23:31:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:31:29] [INFO ] Implicit Places using invariants and state equation in 1623 ms returned [12, 22, 189, 197, 363, 373, 539, 547, 712, 720, 886, 894]
[2025-05-29 23:31:29] [INFO ] Actually due to overlaps returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1852 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1123/1201 places, 1935/2032 transitions.
Applied a total of 0 rules in 32 ms. Remains 1123 /1123 variables (removed 0) and now considering 1935/1935 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1994 ms. Remains : 1123/1201 places, 1935/2032 transitions.
[2025-05-29 23:31:30] [INFO ] Flatten gal took : 51 ms
[2025-05-29 23:31:30] [INFO ] Flatten gal took : 55 ms
[2025-05-29 23:31:30] [INFO ] Input system was already deterministic with 1935 transitions.
[2025-05-29 23:31:30] [INFO ] Flatten gal took : 55 ms
[2025-05-29 23:31:30] [INFO ] Flatten gal took : 55 ms
[2025-05-29 23:31:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality15425068530919450380.gal : 11 ms
[2025-05-29 23:31:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality1362614354911623544.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15425068530919450380.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1362614354911623544.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 23:32:00] [INFO ] Flatten gal took : 56 ms
[2025-05-29 23:32:00] [INFO ] Applying decomposition
[2025-05-29 23:32:00] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11880790835070393995.txt' '-o' '/tmp/graph11880790835070393995.bin' '-w' '/tmp/graph11880790835070393995.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11880790835070393995.bin' '-l' '-1' '-v' '-w' '/tmp/graph11880790835070393995.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:32:00] [INFO ] Decomposing Gal with order
[2025-05-29 23:32:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:32:00] [INFO ] Removed a total of 2531 redundant transitions.
[2025-05-29 23:32:00] [INFO ] Flatten gal took : 84 ms
[2025-05-29 23:32:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 23 ms.
[2025-05-29 23:32:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality11614174956285962095.gal : 11 ms
[2025-05-29 23:32:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality17618435075094844366.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11614174956285962095.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17618435075094844366.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1201/1201 places, 2032/2032 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 1140 transition count 1960
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 1140 transition count 1960
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 126 place count 1140 transition count 1956
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 140 place count 1126 transition count 1942
Iterating global reduction 1 with 14 rules applied. Total rules applied 154 place count 1126 transition count 1942
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 159 place count 1126 transition count 1937
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 161 place count 1124 transition count 1935
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 1124 transition count 1935
Applied a total of 163 rules in 107 ms. Remains 1124 /1201 variables (removed 77) and now considering 1935/2032 (removed 97) transitions.
// Phase 1: matrix 1935 rows 1124 cols
[2025-05-29 23:32:31] [INFO ] Computed 18 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:32:31] [INFO ] Implicit Places using invariants in 218 ms returned []
[2025-05-29 23:32:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:32:33] [INFO ] Implicit Places using invariants and state equation in 2007 ms returned [12, 20, 187, 195, 360, 368, 533, 543, 709, 717, 884, 892]
[2025-05-29 23:32:33] [INFO ] Actually due to overlaps returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2232 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1123/1201 places, 1935/2032 transitions.
Applied a total of 0 rules in 30 ms. Remains 1123 /1123 variables (removed 0) and now considering 1935/1935 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2370 ms. Remains : 1123/1201 places, 1935/2032 transitions.
[2025-05-29 23:32:33] [INFO ] Flatten gal took : 51 ms
[2025-05-29 23:32:33] [INFO ] Flatten gal took : 54 ms
[2025-05-29 23:32:33] [INFO ] Input system was already deterministic with 1935 transitions.
[2025-05-29 23:32:33] [INFO ] Flatten gal took : 53 ms
[2025-05-29 23:32:33] [INFO ] Flatten gal took : 54 ms
[2025-05-29 23:32:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality10172503702253056327.gal : 9 ms
[2025-05-29 23:32:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality6364760799396162053.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10172503702253056327.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6364760799396162053.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 23:33:03] [INFO ] Flatten gal took : 55 ms
[2025-05-29 23:33:03] [INFO ] Applying decomposition
[2025-05-29 23:33:03] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10258823188925189952.txt' '-o' '/tmp/graph10258823188925189952.bin' '-w' '/tmp/graph10258823188925189952.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10258823188925189952.bin' '-l' '-1' '-v' '-w' '/tmp/graph10258823188925189952.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:33:03] [INFO ] Decomposing Gal with order
[2025-05-29 23:33:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:33:04] [INFO ] Removed a total of 2396 redundant transitions.
[2025-05-29 23:33:04] [INFO ] Flatten gal took : 83 ms
[2025-05-29 23:33:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 134 labels/synchronizations in 13 ms.
[2025-05-29 23:33:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality4093200144313882430.gal : 11 ms
[2025-05-29 23:33:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality7138719301897200888.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4093200144313882430.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7138719301897200888.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1201/1201 places, 2032/2032 transitions.
Graph (trivial) has 1234 edges and 1201 vertex of which 424 / 1201 are part of one of the 48 SCC in 2 ms
Free SCC test removed 376 places
Ensure Unique test removed 427 transitions
Reduce isomorphic transitions removed 427 transitions.
Graph (complete) has 3391 edges and 825 vertex of which 801 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Discarding 24 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 329 place count 800 transition count 1260
Reduce places removed 327 places and 0 transitions.
Iterating post reduction 1 with 327 rules applied. Total rules applied 656 place count 473 transition count 1260
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 656 place count 473 transition count 1206
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 764 place count 419 transition count 1206
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 798 place count 385 transition count 1172
Iterating global reduction 2 with 34 rules applied. Total rules applied 832 place count 385 transition count 1172
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 836 place count 385 transition count 1168
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 836 place count 385 transition count 1161
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 850 place count 378 transition count 1161
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 852 place count 376 transition count 1159
Iterating global reduction 3 with 2 rules applied. Total rules applied 854 place count 376 transition count 1159
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 855 place count 375 transition count 1158
Iterating global reduction 3 with 1 rules applied. Total rules applied 856 place count 375 transition count 1158
Performed 110 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 220 rules applied. Total rules applied 1076 place count 265 transition count 1046
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1080 place count 265 transition count 1042
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 1105 place count 265 transition count 1017
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 4 with 12 rules applied. Total rules applied 1117 place count 265 transition count 1005
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1129 place count 253 transition count 1005
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 1143 place count 246 transition count 998
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1144 place count 245 transition count 997
Applied a total of 1144 rules in 133 ms. Remains 245 /1201 variables (removed 956) and now considering 997/2032 (removed 1035) transitions.
[2025-05-29 23:33:34] [INFO ] Flow matrix only has 812 transitions (discarded 185 similar events)
// Phase 1: matrix 812 rows 245 cols
[2025-05-29 23:33:34] [INFO ] Computed 6 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:33:34] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-05-29 23:33:34] [INFO ] Flow matrix only has 812 transitions (discarded 185 similar events)
[2025-05-29 23:33:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:33:34] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-05-29 23:33:35] [INFO ] Implicit Places using invariants and state equation in 1426 ms returned []
Implicit Place search using SMT with State Equation took 1556 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 23:33:36] [INFO ] Redundant transitions in 673 ms returned []
Running 948 sub problems to find dead transitions.
[2025-05-29 23:33:36] [INFO ] Flow matrix only has 812 transitions (discarded 185 similar events)
[2025-05-29 23:33:36] [INFO ] Invariant cache hit.
[2025-05-29 23:33:36] [INFO ] State equation strengthened by 36 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 948 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 948 unsolved
At refinement iteration 2 (OVERLAPS) 811/1050 variables, 239/245 constraints. Problems are: Problem set: 0 solved, 948 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1050 variables, 36/281 constraints. Problems are: Problem set: 0 solved, 948 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1050/1057 variables, and 281 constraints, problems are : Problem set: 0 solved, 948 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 239/245 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 948/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 948 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 948 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 948 unsolved
At refinement iteration 2 (OVERLAPS) 811/1050 variables, 239/245 constraints. Problems are: Problem set: 0 solved, 948 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1050 variables, 36/281 constraints. Problems are: Problem set: 0 solved, 948 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1050 variables, 53/334 constraints. Problems are: Problem set: 0 solved, 948 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1050/1057 variables, and 334 constraints, problems are : Problem set: 0 solved, 948 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 239/245 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 486/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61217ms problems are : Problem set: 0 solved, 948 unsolved
Search for dead transitions found 0 dead transitions in 61221ms
Starting structural reductions in SI_CTL mode, iteration 1 : 245/1201 places, 997/2032 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 63596 ms. Remains : 245/1201 places, 997/2032 transitions.
[2025-05-29 23:34:37] [INFO ] Flatten gal took : 33 ms
[2025-05-29 23:34:37] [INFO ] Flatten gal took : 35 ms
[2025-05-29 23:34:37] [INFO ] Input system was already deterministic with 997 transitions.
[2025-05-29 23:34:38] [INFO ] Flatten gal took : 35 ms
[2025-05-29 23:34:38] [INFO ] Flatten gal took : 35 ms
[2025-05-29 23:34:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality13806284956079872914.gal : 6 ms
[2025-05-29 23:34:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality13343085170390777721.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13806284956079872914.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13343085170390777721.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.28191e+18,25.7195,630896,2,60483,5,2.7066e+06,6,0,1901,2.49918e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 23:35:08] [INFO ] Flatten gal took : 36 ms
[2025-05-29 23:35:08] [INFO ] Applying decomposition
[2025-05-29 23:35:08] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5886310273063721664.txt' '-o' '/tmp/graph5886310273063721664.bin' '-w' '/tmp/graph5886310273063721664.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5886310273063721664.bin' '-l' '-1' '-v' '-w' '/tmp/graph5886310273063721664.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:35:08] [INFO ] Decomposing Gal with order
[2025-05-29 23:35:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:35:08] [INFO ] Removed a total of 2392 redundant transitions.
[2025-05-29 23:35:08] [INFO ] Flatten gal took : 52 ms
[2025-05-29 23:35:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 7 ms.
[2025-05-29 23:35:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality1697017889185397052.gal : 4 ms
[2025-05-29 23:35:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality7614418330365968270.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1697017889185397052.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7614418330365968270.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.28191e+18,0.12457,7276,466,90,4954,565,749,7329,104,1624,0


Converting to forward existential form...Done !
original formula: EF((!(E(AF(AG(((i8.u56.p1557==0)||(i8.u61.p1659==1)))) U AF((i7.u44.p1231!=1)))) * (i8.u62.p1731==0)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (i8.u62.p1731==0)) * !(E(!(EG(!(!(E(TRUE U !(((i8.u56.p1557==0)||(i8.u61.p1659==1)))))))) U...196
Reverse transition relation is NOT exact ! Due to transitions t0, t234, t357, t473, t487, t511, t595, t638, t685, t721, t733, t775, t783, t841, u67.t1, i0....981
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1201/1201 places, 2032/2032 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 1136 transition count 1956
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 1136 transition count 1956
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 134 place count 1136 transition count 1952
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 149 place count 1121 transition count 1937
Iterating global reduction 1 with 15 rules applied. Total rules applied 164 place count 1121 transition count 1937
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 169 place count 1121 transition count 1932
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 171 place count 1119 transition count 1930
Iterating global reduction 2 with 2 rules applied. Total rules applied 173 place count 1119 transition count 1930
Applied a total of 173 rules in 109 ms. Remains 1119 /1201 variables (removed 82) and now considering 1930/2032 (removed 102) transitions.
// Phase 1: matrix 1930 rows 1119 cols
[2025-05-29 23:35:38] [INFO ] Computed 18 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:35:38] [INFO ] Implicit Places using invariants in 221 ms returned []
[2025-05-29 23:35:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:35:40] [INFO ] Implicit Places using invariants and state equation in 1800 ms returned [12, 20, 186, 194, 359, 369, 534, 542, 707, 715, 880, 888]
[2025-05-29 23:35:40] [INFO ] Actually due to overlaps returned [12]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2025 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1118/1201 places, 1930/2032 transitions.
Applied a total of 0 rules in 30 ms. Remains 1118 /1118 variables (removed 0) and now considering 1930/1930 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2165 ms. Remains : 1118/1201 places, 1930/2032 transitions.
[2025-05-29 23:35:40] [INFO ] Flatten gal took : 51 ms
[2025-05-29 23:35:40] [INFO ] Flatten gal took : 54 ms
[2025-05-29 23:35:40] [INFO ] Input system was already deterministic with 1930 transitions.
[2025-05-29 23:35:40] [INFO ] Flatten gal took : 51 ms
[2025-05-29 23:35:40] [INFO ] Flatten gal took : 54 ms
[2025-05-29 23:35:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality11275031298893626285.gal : 9 ms
[2025-05-29 23:35:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality2144493506872057958.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11275031298893626285.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2144493506872057958.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 23:36:11] [INFO ] Flatten gal took : 53 ms
[2025-05-29 23:36:11] [INFO ] Applying decomposition
[2025-05-29 23:36:11] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5782754327537652361.txt' '-o' '/tmp/graph5782754327537652361.bin' '-w' '/tmp/graph5782754327537652361.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5782754327537652361.bin' '-l' '-1' '-v' '-w' '/tmp/graph5782754327537652361.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:36:11] [INFO ] Decomposing Gal with order
[2025-05-29 23:36:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:36:11] [INFO ] Removed a total of 2422 redundant transitions.
[2025-05-29 23:36:11] [INFO ] Flatten gal took : 83 ms
[2025-05-29 23:36:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 136 labels/synchronizations in 18 ms.
[2025-05-29 23:36:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality11996142179701032083.gal : 9 ms
[2025-05-29 23:36:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality17871960943266074017.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11996142179701032083.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17871960943266074017.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1201/1201 places, 2032/2032 transitions.
Graph (trivial) has 1225 edges and 1201 vertex of which 425 / 1201 are part of one of the 47 SCC in 3 ms
Free SCC test removed 378 places
Ensure Unique test removed 431 transitions
Reduce isomorphic transitions removed 431 transitions.
Graph (complete) has 3387 edges and 823 vertex of which 799 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.4 ms
Discarding 24 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 320 transitions
Trivial Post-agglo rules discarded 320 transitions
Performed 320 trivial Post agglomeration. Transition count delta: 320
Iterating post reduction 0 with 320 rules applied. Total rules applied 322 place count 798 transition count 1263
Reduce places removed 320 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 325 rules applied. Total rules applied 647 place count 478 transition count 1258
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 653 place count 473 transition count 1257
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 653 place count 473 transition count 1204
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 759 place count 420 transition count 1204
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 794 place count 385 transition count 1169
Iterating global reduction 3 with 35 rules applied. Total rules applied 829 place count 385 transition count 1169
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 833 place count 385 transition count 1165
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 833 place count 385 transition count 1159
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 845 place count 379 transition count 1159
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 847 place count 377 transition count 1157
Iterating global reduction 4 with 2 rules applied. Total rules applied 849 place count 377 transition count 1157
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 850 place count 376 transition count 1156
Iterating global reduction 4 with 1 rules applied. Total rules applied 851 place count 376 transition count 1156
Performed 108 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 108 places in 1 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 4 with 216 rules applied. Total rules applied 1067 place count 268 transition count 1046
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1070 place count 268 transition count 1043
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 5 with 24 rules applied. Total rules applied 1094 place count 268 transition count 1019
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 5 with 11 rules applied. Total rules applied 1105 place count 268 transition count 1008
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 1116 place count 257 transition count 1008
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 1128 place count 251 transition count 1002
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1129 place count 250 transition count 1001
Applied a total of 1129 rules in 132 ms. Remains 250 /1201 variables (removed 951) and now considering 1001/2032 (removed 1031) transitions.
[2025-05-29 23:36:41] [INFO ] Flow matrix only has 811 transitions (discarded 190 similar events)
// Phase 1: matrix 811 rows 250 cols
[2025-05-29 23:36:41] [INFO ] Computed 6 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:36:41] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-05-29 23:36:41] [INFO ] Flow matrix only has 811 transitions (discarded 190 similar events)
[2025-05-29 23:36:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:36:41] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-05-29 23:36:42] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 23:36:43] [INFO ] Redundant transitions in 725 ms returned []
Running 956 sub problems to find dead transitions.
[2025-05-29 23:36:43] [INFO ] Flow matrix only has 811 transitions (discarded 190 similar events)
[2025-05-29 23:36:43] [INFO ] Invariant cache hit.
[2025-05-29 23:36:43] [INFO ] State equation strengthened by 36 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 2 (OVERLAPS) 810/1053 variables, 243/249 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1053 variables, 36/285 constraints. Problems are: Problem set: 0 solved, 956 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1053/1061 variables, and 285 constraints, problems are : Problem set: 0 solved, 956 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 243/250 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 956/523 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 956 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 2 (OVERLAPS) 810/1053 variables, 243/249 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1053 variables, 36/285 constraints. Problems are: Problem set: 0 solved, 956 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1053 variables, 56/341 constraints. Problems are: Problem set: 0 solved, 956 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1053/1061 variables, and 341 constraints, problems are : Problem set: 0 solved, 956 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 243/250 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 489/523 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61085ms problems are : Problem set: 0 solved, 956 unsolved
Search for dead transitions found 0 dead transitions in 61094ms
Starting structural reductions in SI_CTL mode, iteration 1 : 250/1201 places, 1001/2032 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62672 ms. Remains : 250/1201 places, 1001/2032 transitions.
[2025-05-29 23:37:44] [INFO ] Flatten gal took : 31 ms
[2025-05-29 23:37:44] [INFO ] Flatten gal took : 33 ms
[2025-05-29 23:37:44] [INFO ] Input system was already deterministic with 1001 transitions.
[2025-05-29 23:37:44] [INFO ] Flatten gal took : 33 ms
[2025-05-29 23:37:44] [INFO ] Flatten gal took : 32 ms
[2025-05-29 23:37:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality6754168306217235124.gal : 5 ms
[2025-05-29 23:37:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality822149026328685665.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6754168306217235124.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality822149026328685665.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 23:38:14] [INFO ] Flatten gal took : 34 ms
[2025-05-29 23:38:14] [INFO ] Applying decomposition
[2025-05-29 23:38:14] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17898441279670428337.txt' '-o' '/tmp/graph17898441279670428337.bin' '-w' '/tmp/graph17898441279670428337.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17898441279670428337.bin' '-l' '-1' '-v' '-w' '/tmp/graph17898441279670428337.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:38:14] [INFO ] Decomposing Gal with order
[2025-05-29 23:38:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:38:14] [INFO ] Removed a total of 2391 redundant transitions.
[2025-05-29 23:38:14] [INFO ] Flatten gal took : 46 ms
[2025-05-29 23:38:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 110 labels/synchronizations in 7 ms.
[2025-05-29 23:38:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality4860609368364707302.gal : 3 ms
[2025-05-29 23:38:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality3888077611084108257.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4860609368364707302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3888077611084108257.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.7465e+19,0.130304,7972,432,63,6516,608,842,10945,113,1369,0


Converting to forward existential form...Done !
original formula: AF(!(A((((i0.u4.p120==0)||(i5.u46.p1266==1))||(((i4.u36.p988==0)||(i3.u29.p750==1))&&((i5.u48.p1317==0)||(i2.u21.p575==1)))) U AF(((i4.u7...189
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(!(EG(!(((i4.u72.p1826==0)&&(i2.u11.p335==1)))))) U (!((((i0.u4.p120==0)||(i5.u46.p1266==1)...363
Reverse transition relation is NOT exact ! Due to transitions t0, t222, t340, t492, t618, t643, t644, t715, t732, t768, t789, t846, t924, u81.t1, i0.t323, ...967
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1201/1201 places, 2032/2032 transitions.
Graph (trivial) has 1235 edges and 1201 vertex of which 427 / 1201 are part of one of the 47 SCC in 2 ms
Free SCC test removed 380 places
Ensure Unique test removed 434 transitions
Reduce isomorphic transitions removed 434 transitions.
Graph (complete) has 3382 edges and 821 vertex of which 797 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.4 ms
Discarding 24 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 328 place count 796 transition count 1254
Reduce places removed 326 places and 0 transitions.
Iterating post reduction 1 with 326 rules applied. Total rules applied 654 place count 470 transition count 1254
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 654 place count 470 transition count 1200
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 762 place count 416 transition count 1200
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 798 place count 380 transition count 1164
Iterating global reduction 2 with 36 rules applied. Total rules applied 834 place count 380 transition count 1164
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 838 place count 380 transition count 1160
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 838 place count 380 transition count 1153
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 852 place count 373 transition count 1153
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 854 place count 371 transition count 1151
Iterating global reduction 3 with 2 rules applied. Total rules applied 856 place count 371 transition count 1151
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 857 place count 370 transition count 1150
Iterating global reduction 3 with 1 rules applied. Total rules applied 858 place count 370 transition count 1150
Performed 108 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 108 places in 0 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 1074 place count 262 transition count 1040
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1078 place count 262 transition count 1036
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 1102 place count 262 transition count 1012
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 4 with 12 rules applied. Total rules applied 1114 place count 262 transition count 1000
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1126 place count 250 transition count 1000
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1138 place count 244 transition count 994
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1139 place count 243 transition count 993
Applied a total of 1139 rules in 118 ms. Remains 243 /1201 variables (removed 958) and now considering 993/2032 (removed 1039) transitions.
[2025-05-29 23:38:44] [INFO ] Flow matrix only has 803 transitions (discarded 190 similar events)
// Phase 1: matrix 803 rows 243 cols
[2025-05-29 23:38:44] [INFO ] Computed 6 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:38:44] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-05-29 23:38:44] [INFO ] Flow matrix only has 803 transitions (discarded 190 similar events)
[2025-05-29 23:38:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:38:45] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-05-29 23:38:45] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 23:38:46] [INFO ] Redundant transitions in 561 ms returned []
Running 943 sub problems to find dead transitions.
[2025-05-29 23:38:46] [INFO ] Flow matrix only has 803 transitions (discarded 190 similar events)
[2025-05-29 23:38:46] [INFO ] Invariant cache hit.
[2025-05-29 23:38:46] [INFO ] State equation strengthened by 36 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 943 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 943 unsolved
At refinement iteration 2 (OVERLAPS) 802/1038 variables, 236/242 constraints. Problems are: Problem set: 0 solved, 943 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1038 variables, 36/278 constraints. Problems are: Problem set: 0 solved, 943 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1038/1046 variables, and 278 constraints, problems are : Problem set: 0 solved, 943 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/243 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 943/510 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 943 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 943 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 943 unsolved
At refinement iteration 2 (OVERLAPS) 802/1038 variables, 236/242 constraints. Problems are: Problem set: 0 solved, 943 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1038 variables, 36/278 constraints. Problems are: Problem set: 0 solved, 943 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1038 variables, 52/330 constraints. Problems are: Problem set: 0 solved, 943 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1038/1046 variables, and 330 constraints, problems are : Problem set: 0 solved, 943 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/243 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 485/510 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61055ms problems are : Problem set: 0 solved, 943 unsolved
Search for dead transitions found 0 dead transitions in 61058ms
Starting structural reductions in SI_CTL mode, iteration 1 : 243/1201 places, 993/2032 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62418 ms. Remains : 243/1201 places, 993/2032 transitions.
[2025-05-29 23:39:47] [INFO ] Flatten gal took : 30 ms
[2025-05-29 23:39:47] [INFO ] Flatten gal took : 34 ms
[2025-05-29 23:39:47] [INFO ] Input system was already deterministic with 993 transitions.
[2025-05-29 23:39:47] [INFO ] Flatten gal took : 33 ms
[2025-05-29 23:39:47] [INFO ] Flatten gal took : 33 ms
[2025-05-29 23:39:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality13473421731302148514.gal : 6 ms
[2025-05-29 23:39:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality17203603724785433759.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13473421731302148514.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17203603724785433759.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 23:40:17] [INFO ] Flatten gal took : 35 ms
[2025-05-29 23:40:17] [INFO ] Applying decomposition
[2025-05-29 23:40:17] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9524712508031848917.txt' '-o' '/tmp/graph9524712508031848917.bin' '-w' '/tmp/graph9524712508031848917.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9524712508031848917.bin' '-l' '-1' '-v' '-w' '/tmp/graph9524712508031848917.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:40:17] [INFO ] Decomposing Gal with order
[2025-05-29 23:40:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:40:17] [INFO ] Removed a total of 2391 redundant transitions.
[2025-05-29 23:40:17] [INFO ] Flatten gal took : 44 ms
[2025-05-29 23:40:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 112 labels/synchronizations in 9 ms.
[2025-05-29 23:40:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality1222503625559589205.gal : 2 ms
[2025-05-29 23:40:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality15105832638406957048.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1222503625559589205.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15105832638406957048.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,7.13121e+18,0.082569,7260,356,52,3120,430,769,3857,97,894,0


Converting to forward existential form...Done !
original formula: AF(((i0.u5.p141==1)&&(i4.u32.p901==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((i0.u5.p141==1)&&(i4.u32.p901==1))))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,0.850989,43100,1,0,79725,1070,3578,225127,395,6185,73633
FORMULA CloudDeployment-PT-6b-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 1201/1201 places, 2032/2032 transitions.
Graph (trivial) has 1217 edges and 1201 vertex of which 416 / 1201 are part of one of the 48 SCC in 1 ms
Free SCC test removed 368 places
Ensure Unique test removed 416 transitions
Reduce isomorphic transitions removed 416 transitions.
Graph (complete) has 3402 edges and 833 vertex of which 809 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Discarding 24 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 318 transitions
Trivial Post-agglo rules discarded 318 transitions
Performed 318 trivial Post agglomeration. Transition count delta: 318
Iterating post reduction 0 with 318 rules applied. Total rules applied 320 place count 808 transition count 1280
Reduce places removed 318 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 322 rules applied. Total rules applied 642 place count 490 transition count 1276
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 646 place count 486 transition count 1276
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 646 place count 486 transition count 1221
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 756 place count 431 transition count 1221
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 789 place count 398 transition count 1188
Iterating global reduction 3 with 33 rules applied. Total rules applied 822 place count 398 transition count 1188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 825 place count 398 transition count 1185
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 825 place count 398 transition count 1177
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 841 place count 390 transition count 1177
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 842 place count 389 transition count 1176
Iterating global reduction 4 with 1 rules applied. Total rules applied 843 place count 389 transition count 1176
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 844 place count 388 transition count 1175
Iterating global reduction 4 with 1 rules applied. Total rules applied 845 place count 388 transition count 1175
Performed 105 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 105 places in 0 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 4 with 210 rules applied. Total rules applied 1055 place count 283 transition count 1068
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1059 place count 283 transition count 1064
Drop transitions (Redundant composition of simpler transitions.) removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 1085 place count 283 transition count 1038
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 5 with 12 rules applied. Total rules applied 1097 place count 283 transition count 1026
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 1109 place count 271 transition count 1026
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 1125 place count 263 transition count 1018
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1126 place count 262 transition count 1017
Applied a total of 1126 rules in 118 ms. Remains 262 /1201 variables (removed 939) and now considering 1017/2032 (removed 1015) transitions.
[2025-05-29 23:40:18] [INFO ] Flow matrix only has 838 transitions (discarded 179 similar events)
// Phase 1: matrix 838 rows 262 cols
[2025-05-29 23:40:18] [INFO ] Computed 6 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:40:18] [INFO ] Implicit Places using invariants in 299 ms returned []
[2025-05-29 23:40:18] [INFO ] Flow matrix only has 838 transitions (discarded 179 similar events)
[2025-05-29 23:40:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:40:19] [INFO ] State equation strengthened by 36 read => feed constraints.
[2025-05-29 23:40:19] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 879 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 23:40:20] [INFO ] Redundant transitions in 536 ms returned []
Running 965 sub problems to find dead transitions.
[2025-05-29 23:40:20] [INFO ] Flow matrix only has 838 transitions (discarded 179 similar events)
[2025-05-29 23:40:20] [INFO ] Invariant cache hit.
[2025-05-29 23:40:20] [INFO ] State equation strengthened by 36 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 965 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 965 unsolved
At refinement iteration 2 (OVERLAPS) 837/1091 variables, 254/260 constraints. Problems are: Problem set: 0 solved, 965 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1091 variables, 36/296 constraints. Problems are: Problem set: 0 solved, 965 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1091/1100 variables, and 296 constraints, problems are : Problem set: 0 solved, 965 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 254/262 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 965/532 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 965 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 965 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 965 unsolved
At refinement iteration 2 (OVERLAPS) 837/1091 variables, 254/260 constraints. Problems are: Problem set: 0 solved, 965 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1091 variables, 36/296 constraints. Problems are: Problem set: 0 solved, 965 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1091 variables, 65/361 constraints. Problems are: Problem set: 0 solved, 965 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1091/1100 variables, and 361 constraints, problems are : Problem set: 0 solved, 965 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 254/262 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 498/532 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61103ms problems are : Problem set: 0 solved, 965 unsolved
Search for dead transitions found 0 dead transitions in 61105ms
Starting structural reductions in SI_CTL mode, iteration 1 : 262/1201 places, 1017/2032 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62650 ms. Remains : 262/1201 places, 1017/2032 transitions.
[2025-05-29 23:41:21] [INFO ] Flatten gal took : 30 ms
[2025-05-29 23:41:21] [INFO ] Flatten gal took : 32 ms
[2025-05-29 23:41:21] [INFO ] Input system was already deterministic with 1017 transitions.
[2025-05-29 23:41:21] [INFO ] Flatten gal took : 31 ms
[2025-05-29 23:41:21] [INFO ] Flatten gal took : 32 ms
[2025-05-29 23:41:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality6944617143988939728.gal : 5 ms
[2025-05-29 23:41:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality15092759927968810998.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6944617143988939728.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15092759927968810998.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 23:41:51] [INFO ] Flatten gal took : 35 ms
[2025-05-29 23:41:51] [INFO ] Applying decomposition
[2025-05-29 23:41:51] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1847322440426580568.txt' '-o' '/tmp/graph1847322440426580568.bin' '-w' '/tmp/graph1847322440426580568.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1847322440426580568.bin' '-l' '-1' '-v' '-w' '/tmp/graph1847322440426580568.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:41:51] [INFO ] Decomposing Gal with order
[2025-05-29 23:41:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:41:51] [INFO ] Removed a total of 2387 redundant transitions.
[2025-05-29 23:41:51] [INFO ] Flatten gal took : 45 ms
[2025-05-29 23:41:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 11 ms.
[2025-05-29 23:41:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality16956891417364906898.gal : 3 ms
[2025-05-29 23:41:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality14027173842522348409.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16956891417364906898.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14027173842522348409.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,2.30762e+19,0.152616,9784,458,63,9768,653,970,21729,123,1905,0


Converting to forward existential form...Done !
original formula: A((!((!(((i0.u1.p90!=1)&&((i3.i0.u25.p673==1)||((i7.u77.p1861==1)&&((i3.i0.u24.p621==0)||(i0.u12.p291==1)))))) + !(((E(((i0.u2.p304==0)||...335
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !((i5.u52.p1343==0)))))))) * !(E(!(!(E(TRUE U !((i5.u52.p1343==0))))) U (!((!((!(((i...502
Reverse transition relation is NOT exact ! Due to transitions t0, t243, t371, t506, t632, t674, t734, t740, t746, t812, t824, t848, t885, t920, u84.t1, i0....1015
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1201/1201 places, 2032/2032 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 1149 transition count 1969
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 1149 transition count 1969
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 106 place count 1149 transition count 1967
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 120 place count 1135 transition count 1953
Iterating global reduction 1 with 14 rules applied. Total rules applied 134 place count 1135 transition count 1953
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 139 place count 1135 transition count 1948
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 141 place count 1133 transition count 1946
Iterating global reduction 2 with 2 rules applied. Total rules applied 143 place count 1133 transition count 1946
Applied a total of 143 rules in 107 ms. Remains 1133 /1201 variables (removed 68) and now considering 1946/2032 (removed 86) transitions.
// Phase 1: matrix 1946 rows 1133 cols
[2025-05-29 23:42:21] [INFO ] Computed 18 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:42:22] [INFO ] Implicit Places using invariants in 231 ms returned []
[2025-05-29 23:42:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:42:23] [INFO ] Implicit Places using invariants and state equation in 1417 ms returned []
Implicit Place search using SMT with State Equation took 1650 ms to find 0 implicit places.
Running 1945 sub problems to find dead transitions.
[2025-05-29 23:42:23] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1132 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1945 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1132/3079 variables, and 18 constraints, problems are : Problem set: 0 solved, 1945 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/1133 constraints, PredecessorRefiner: 1945/1512 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1945 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1132 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1945 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1132/3079 variables, and 18 constraints, problems are : Problem set: 0 solved, 1945 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/1133 constraints, PredecessorRefiner: 433/1512 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61439ms problems are : Problem set: 0 solved, 1945 unsolved
Search for dead transitions found 0 dead transitions in 61445ms
Starting structural reductions in LTL mode, iteration 1 : 1133/1201 places, 1946/2032 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63210 ms. Remains : 1133/1201 places, 1946/2032 transitions.
[2025-05-29 23:43:24] [INFO ] Flatten gal took : 48 ms
[2025-05-29 23:43:25] [INFO ] Flatten gal took : 69 ms
[2025-05-29 23:43:25] [INFO ] Input system was already deterministic with 1946 transitions.
[2025-05-29 23:43:25] [INFO ] Flatten gal took : 48 ms
[2025-05-29 23:43:25] [INFO ] Flatten gal took : 50 ms
[2025-05-29 23:43:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality16200040956521496907.gal : 8 ms
[2025-05-29 23:43:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality13951275361487693445.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16200040956521496907.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13951275361487693445.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 23:43:55] [INFO ] Flatten gal took : 54 ms
[2025-05-29 23:43:55] [INFO ] Applying decomposition
[2025-05-29 23:43:55] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16303873189450579763.txt' '-o' '/tmp/graph16303873189450579763.bin' '-w' '/tmp/graph16303873189450579763.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16303873189450579763.bin' '-l' '-1' '-v' '-w' '/tmp/graph16303873189450579763.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:43:55] [INFO ] Decomposing Gal with order
[2025-05-29 23:43:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:43:55] [INFO ] Removed a total of 2594 redundant transitions.
[2025-05-29 23:43:55] [INFO ] Flatten gal took : 76 ms
[2025-05-29 23:43:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 116 labels/synchronizations in 22 ms.
[2025-05-29 23:43:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality4975535651000874403.gal : 9 ms
[2025-05-29 23:43:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality2443086419368679706.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4975535651000874403.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2443086419368679706.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1201/1201 places, 2032/2032 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 1137 transition count 1958
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 1137 transition count 1958
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 132 place count 1137 transition count 1954
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 148 place count 1121 transition count 1938
Iterating global reduction 1 with 16 rules applied. Total rules applied 164 place count 1121 transition count 1938
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 170 place count 1121 transition count 1932
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 172 place count 1119 transition count 1930
Iterating global reduction 2 with 2 rules applied. Total rules applied 174 place count 1119 transition count 1930
Applied a total of 174 rules in 107 ms. Remains 1119 /1201 variables (removed 82) and now considering 1930/2032 (removed 102) transitions.
// Phase 1: matrix 1930 rows 1119 cols
[2025-05-29 23:44:25] [INFO ] Computed 18 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:44:26] [INFO ] Implicit Places using invariants in 215 ms returned []
[2025-05-29 23:44:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 23:44:27] [INFO ] Implicit Places using invariants and state equation in 1629 ms returned []
Implicit Place search using SMT with State Equation took 1846 ms to find 0 implicit places.
Running 1929 sub problems to find dead transitions.
[2025-05-29 23:44:27] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1118 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1118/3049 variables, and 18 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/1119 constraints, PredecessorRefiner: 1929/1496 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1929 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1118 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1929 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1118/3049 variables, and 18 constraints, problems are : Problem set: 0 solved, 1929 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/1119 constraints, PredecessorRefiner: 433/1496 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61444ms problems are : Problem set: 0 solved, 1929 unsolved
Search for dead transitions found 0 dead transitions in 61450ms
Starting structural reductions in LTL mode, iteration 1 : 1119/1201 places, 1930/2032 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63410 ms. Remains : 1119/1201 places, 1930/2032 transitions.
[2025-05-29 23:45:29] [INFO ] Flatten gal took : 51 ms
[2025-05-29 23:45:29] [INFO ] Flatten gal took : 52 ms
[2025-05-29 23:45:29] [INFO ] Input system was already deterministic with 1930 transitions.
[2025-05-29 23:45:29] [INFO ] Flatten gal took : 52 ms
[2025-05-29 23:45:29] [INFO ] Flatten gal took : 50 ms
[2025-05-29 23:45:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality14424473301947631980.gal : 9 ms
[2025-05-29 23:45:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality13829757721084432062.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14424473301947631980.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13829757721084432062.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-29 23:45:59] [INFO ] Flatten gal took : 53 ms
[2025-05-29 23:45:59] [INFO ] Applying decomposition
[2025-05-29 23:45:59] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5209196609408710744.txt' '-o' '/tmp/graph5209196609408710744.bin' '-w' '/tmp/graph5209196609408710744.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5209196609408710744.bin' '-l' '-1' '-v' '-w' '/tmp/graph5209196609408710744.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:45:59] [INFO ] Decomposing Gal with order
[2025-05-29 23:45:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:45:59] [INFO ] Removed a total of 2745 redundant transitions.
[2025-05-29 23:46:00] [INFO ] Flatten gal took : 75 ms
[2025-05-29 23:46:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 20 ms.
[2025-05-29 23:46:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality7599526762120841340.gal : 8 ms
[2025-05-29 23:46:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality5900465447070225166.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7599526762120841340.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5900465447070225166.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.68727e+27,5.06678,150500,10485,214,266887,3655,2476,628979,161,9571,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-29 23:46:30] [INFO ] Flatten gal took : 55 ms
[2025-05-29 23:46:30] [INFO ] Flatten gal took : 55 ms
[2025-05-29 23:46:30] [INFO ] Applying decomposition
[2025-05-29 23:46:30] [INFO ] Flatten gal took : 55 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8107706757901255272.txt' '-o' '/tmp/graph8107706757901255272.bin' '-w' '/tmp/graph8107706757901255272.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8107706757901255272.bin' '-l' '-1' '-v' '-w' '/tmp/graph8107706757901255272.weights' '-q' '0' '-e' '0.001'
[2025-05-29 23:46:30] [INFO ] Decomposing Gal with order
[2025-05-29 23:46:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 23:46:30] [INFO ] Removed a total of 2829 redundant transitions.
[2025-05-29 23:46:30] [INFO ] Flatten gal took : 81 ms
[2025-05-29 23:46:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 101 labels/synchronizations in 24 ms.
[2025-05-29 23:46:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality5973550779859183528.gal : 9 ms
[2025-05-29 23:46:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality7809073791795445279.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5973550779859183528.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7809073791795445279.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 12 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 00:13:31] [INFO ] Applying decomposition
[2025-05-30 00:13:31] [INFO ] Flatten gal took : 318 ms
[2025-05-30 00:13:32] [INFO ] Decomposing Gal with order
[2025-05-30 00:13:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 00:13:32] [INFO ] Removed a total of 2962 redundant transitions.
[2025-05-30 00:13:33] [INFO ] Flatten gal took : 531 ms
[2025-05-30 00:13:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 672 labels/synchronizations in 223 ms.
[2025-05-30 00:13:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality18135900042219046429.gal : 29 ms
[2025-05-30 00:13:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality13728114988860630669.ctl : 6 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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18135900042219046429.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13728114988860630669.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 12 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.21308e+29,196.341,2828444,15330,19510,3.4519e+06,915191,1369,1.44009e+07,1723,8.27295e+06,0


Converting to forward existential form...Done !
original formula: EX(AF(EX(AF((i0.i0.i0.i0.i1.u26.p1161==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(EX(!(EG(!((i0.i0.i0.i0.i1.u26.p1161==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1245, t1260, t1270, t1299, t1312, u48.t3, u48.t4, i0.t1969, i0.i0.t188, i0.i0.i0.t388, i0.i0...4721

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="CloudDeployment-PT-6b"
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-5832"
echo " Executing tool itstools"
echo " Input is CloudDeployment-PT-6b, 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 r044-tall-174854027700073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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