Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339300098.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 Champagne-PT-H08T0R, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339300098
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.3K Jun 6 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Jun 6 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Jun 6 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 6 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 6 11:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 11:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 11:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 11:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 8.0K Jun 6 08:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 6 08:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 6 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 6 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 179K Jun 5 20:08 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 Champagne-PT-H08T0R-CTLFireability-2025-00
FORMULA_NAME Champagne-PT-H08T0R-CTLFireability-2025-01
FORMULA_NAME Champagne-PT-H08T0R-CTLFireability-2025-02
FORMULA_NAME Champagne-PT-H08T0R-CTLFireability-2025-03
FORMULA_NAME Champagne-PT-H08T0R-CTLFireability-2025-04
FORMULA_NAME Champagne-PT-H08T0R-CTLFireability-2025-05
FORMULA_NAME Champagne-PT-H08T0R-CTLFireability-2025-06
FORMULA_NAME Champagne-PT-H08T0R-CTLFireability-2025-07
FORMULA_NAME Champagne-PT-H08T0R-CTLFireability-2025-08
FORMULA_NAME Champagne-PT-H08T0R-CTLFireability-2025-09
FORMULA_NAME Champagne-PT-H08T0R-CTLFireability-2025-10
FORMULA_NAME Champagne-PT-H08T0R-CTLFireability-2025-11
FORMULA_NAME Champagne-PT-H08T0R-CTLFireability-2025-12
FORMULA_NAME Champagne-PT-H08T0R-CTLFireability-2025-13
FORMULA_NAME Champagne-PT-H08T0R-CTLFireability-2025-14
FORMULA_NAME Champagne-PT-H08T0R-CTLFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749325361923

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H08T0R
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-07 19:42:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 19:42:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 19:42:43] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2025-06-07 19:42:43] [INFO ] Transformed 739 places.
[2025-06-07 19:42:43] [INFO ] Transformed 1088 transitions.
[2025-06-07 19:42:43] [INFO ] Found NUPN structural information;
[2025-06-07 19:42:43] [INFO ] Parsed PT model containing 739 places and 1088 transitions and 2936 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 126 out of 739 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 739/739 places, 1088/1088 transitions.
Discarding 151 places :
Symmetric choice reduction at 0 with 151 rule applications. Total rules 151 place count 588 transition count 937
Iterating global reduction 0 with 151 rules applied. Total rules applied 302 place count 588 transition count 937
Discarding 75 places :
Symmetric choice reduction at 0 with 75 rule applications. Total rules 377 place count 513 transition count 862
Iterating global reduction 0 with 75 rules applied. Total rules applied 452 place count 513 transition count 862
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 485 place count 480 transition count 802
Iterating global reduction 0 with 33 rules applied. Total rules applied 518 place count 480 transition count 802
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 529 place count 480 transition count 791
Applied a total of 529 rules in 132 ms. Remains 480 /739 variables (removed 259) and now considering 791/1088 (removed 297) transitions.
// Phase 1: matrix 791 rows 480 cols
[2025-06-07 19:42:43] [INFO ] Computed 37 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:42:43] [INFO ] Implicit Places using invariants in 369 ms returned []
[2025-06-07 19:42:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:42:44] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 729 ms to find 0 implicit places.
Running 790 sub problems to find dead transitions.
[2025-06-07 19:42:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 1 (OVERLAPS) 1/480 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 790 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:00] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:00] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:01] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:01] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:02] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:02] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:02] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:02] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:02] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:02] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:02] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:02] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:03] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:03] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:03] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:03] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:03] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:03] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:03] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:04] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 790 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:04] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:04] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:06] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:06] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:06] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:07] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:07] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:07] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:07] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:07] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:07] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:07] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:07] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:08] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:08] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:08] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:08] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:08] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:08] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:08] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 790 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 480/1271 variables, and 77 constraints, problems are : Problem set: 0 solved, 790 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 0/480 constraints, PredecessorRefiner: 790/790 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 790 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 1 (OVERLAPS) 1/480 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 40/77 constraints. Problems are: Problem set: 0 solved, 790 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:24] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:24] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:24] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:24] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:24] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 5/82 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 5 (OVERLAPS) 791/1271 variables, 480/562 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1271 variables, 790/1352 constraints. Problems are: Problem set: 0 solved, 790 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:40] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:40] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:40] [INFO ] Deduced a trap composed of 46 places in 182 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:41] [INFO ] Deduced a trap composed of 48 places in 168 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:41] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:42] [INFO ] Deduced a trap composed of 57 places in 194 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:42] [INFO ] Deduced a trap composed of 57 places in 174 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:42] [INFO ] Deduced a trap composed of 58 places in 162 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:42] [INFO ] Deduced a trap composed of 64 places in 153 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:43] [INFO ] Deduced a trap composed of 57 places in 188 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:44] [INFO ] Deduced a trap composed of 58 places in 186 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:44] [INFO ] Deduced a trap composed of 58 places in 183 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:44] [INFO ] Deduced a trap composed of 64 places in 187 ms of which 30 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)timeout

(s43 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1271/1271 variables, and 1365 constraints, problems are : Problem set: 0 solved, 790 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 480/480 constraints, PredecessorRefiner: 790/790 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60312ms problems are : Problem set: 0 solved, 790 unsolved
Search for dead transitions found 0 dead transitions in 60334ms
Starting structural reductions in LTL mode, iteration 1 : 480/739 places, 791/1088 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61226 ms. Remains : 480/739 places, 791/1088 transitions.
Support contains 126 out of 480 places after structural reductions.
[2025-06-07 19:43:44] [INFO ] Flatten gal took : 75 ms
[2025-06-07 19:43:44] [INFO ] Flatten gal took : 41 ms
[2025-06-07 19:43:44] [INFO ] Input system was already deterministic with 791 transitions.
RANDOM walk for 40000 steps (80 resets) in 1809 ms. (22 steps per ms) remains 9/89 properties
BEST_FIRST walk for 40003 steps (8 resets) in 183 ms. (217 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 73 ms. (540 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 5/5 properties
[2025-06-07 19:43:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 110/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 363/480 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 791/1271 variables, 480/517 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:46] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:46] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1271 variables, 2/519 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1271 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1271 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1271/1271 variables, and 519 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1112 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 480/480 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 110/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 363/480 variables, 30/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:46] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:47] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:43:47] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 791/1271 variables, 480/522 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1271 variables, 5/527 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1271 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1271 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1271/1271 variables, and 527 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1033 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 480/480 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2154ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 4109 steps, including 21 resets, run visited all 1 properties in 12 ms. (steps per millisecond=342 )
Parikh walk visited 5 properties in 74 ms.
[2025-06-07 19:43:47] [INFO ] Flatten gal took : 30 ms
[2025-06-07 19:43:48] [INFO ] Flatten gal took : 29 ms
[2025-06-07 19:43:48] [INFO ] Input system was already deterministic with 791 transitions.
Computed a total of 81 stabilizing places and 81 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 791/791 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 418 transition count 684
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 418 transition count 684
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 132 place count 418 transition count 676
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 166 place count 384 transition count 621
Iterating global reduction 1 with 34 rules applied. Total rules applied 200 place count 384 transition count 621
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 208 place count 384 transition count 613
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 227 place count 365 transition count 572
Iterating global reduction 2 with 19 rules applied. Total rules applied 246 place count 365 transition count 572
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 252 place count 365 transition count 566
Applied a total of 252 rules in 49 ms. Remains 365 /480 variables (removed 115) and now considering 566/791 (removed 225) transitions.
// Phase 1: matrix 566 rows 365 cols
[2025-06-07 19:43:48] [INFO ] Computed 37 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:43:48] [INFO ] Implicit Places using invariants in 112 ms returned []
[2025-06-07 19:43:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:43:48] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 565 sub problems to find dead transitions.
[2025-06-07 19:43:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 1 (OVERLAPS) 1/365 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 3 (OVERLAPS) 566/931 variables, 365/402 constraints. Problems are: Problem set: 0 solved, 565 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 931/931 variables, and 402 constraints, problems are : Problem set: 0 solved, 565 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 365/365 constraints, PredecessorRefiner: 565/565 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 565 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 1 (OVERLAPS) 1/365 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/365 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 3 (OVERLAPS) 566/931 variables, 365/402 constraints. Problems are: Problem set: 0 solved, 565 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/931 variables, 565/967 constraints. Problems are: Problem set: 0 solved, 565 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:44:38] [INFO ] Deduced a trap along path composed of 9 places in 50 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/931 variables, 1/968 constraints. Problems are: Problem set: 0 solved, 565 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 931/931 variables, and 968 constraints, problems are : Problem set: 0 solved, 565 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 365/365 constraints, PredecessorRefiner: 565/565 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 565 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Starting structural reductions in LTL mode, iteration 1 : 365/480 places, 566/791 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60497 ms. Remains : 365/480 places, 566/791 transitions.
[2025-06-07 19:44:48] [INFO ] Flatten gal took : 19 ms
[2025-06-07 19:44:48] [INFO ] Flatten gal took : 17 ms
[2025-06-07 19:44:48] [INFO ] Input system was already deterministic with 566 transitions.
[2025-06-07 19:44:48] [INFO ] Flatten gal took : 16 ms
[2025-06-07 19:44:48] [INFO ] Flatten gal took : 15 ms
[2025-06-07 19:44:48] [INFO ] Time to serialize gal into /tmp/CTLFireability17423283083409742529.gal : 14 ms
[2025-06-07 19:44:48] [INFO ] Time to serialize properties into /tmp/CTLFireability326434136094860864.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/CTLFireability17423283083409742529.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability326434136094860864.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 -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 19:45:18] [INFO ] Flatten gal took : 14 ms
[2025-06-07 19:45:18] [INFO ] Applying decomposition
[2025-06-07 19:45:18] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3575574874130804741.txt' '-o' '/tmp/graph3575574874130804741.bin' '-w' '/tmp/graph3575574874130804741.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3575574874130804741.bin' '-l' '-1' '-v' '-w' '/tmp/graph3575574874130804741.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:45:18] [INFO ] Decomposing Gal with order
[2025-06-07 19:45:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:45:19] [INFO ] Removed a total of 465 redundant transitions.
[2025-06-07 19:45:19] [INFO ] Flatten gal took : 66 ms
[2025-06-07 19:45:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 15 ms.
[2025-06-07 19:45:19] [INFO ] Time to serialize gal into /tmp/CTLFireability8232285947642953155.gal : 8 ms
[2025-06-07 19:45:19] [INFO ] Time to serialize properties into /tmp/CTLFireability1802099055596845938.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/CTLFireability8232285947642953155.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1802099055596845938.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.30636e+35,0.159086,9972,895,30,10742,811,764,13839,75,1892,0


Converting to forward existential form...Done !
original formula: A(A(AG(A((i6.u15.p113!=1) U (i14.u37.p276!=1))) U AF((i6.u16.p120==1))) U A((!(((i16.u46.p336==1)&&(((i34.u109.p701==1)||((i11.i1.u30.p22...331
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(EX(EG(EX((i18.i1.u51.p359==1))))) U (!((!(((i16.u46.p336==1)&&(((i34.u109.p701==1)||((i1...1325
Reverse transition relation is NOT exact ! Due to transitions t7, t27, t46, t75, t114, t153, t204, i0.i1.t310, i1.i1.u6.t370, i2.t361, i3.u10.t351, i4.u12....939
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 791/791 transitions.
Graph (trivial) has 456 edges and 480 vertex of which 67 / 480 are part of one of the 12 SCC in 3 ms
Free SCC test removed 55 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 101 place count 424 transition count 627
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 165 rules applied. Total rules applied 266 place count 324 transition count 562
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 298 place count 292 transition count 562
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 298 place count 292 transition count 552
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 318 place count 282 transition count 552
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 368 place count 232 transition count 451
Iterating global reduction 3 with 50 rules applied. Total rules applied 418 place count 232 transition count 451
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 427 place count 232 transition count 442
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 427 place count 232 transition count 427
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 457 place count 217 transition count 427
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 463 place count 211 transition count 394
Iterating global reduction 4 with 6 rules applied. Total rules applied 469 place count 211 transition count 394
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 475 place count 211 transition count 388
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 5 with 190 rules applied. Total rules applied 665 place count 116 transition count 293
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 669 place count 112 transition count 261
Iterating global reduction 5 with 4 rules applied. Total rules applied 673 place count 112 transition count 261
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 677 place count 112 transition count 257
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 679 place count 110 transition count 255
Applied a total of 679 rules in 103 ms. Remains 110 /480 variables (removed 370) and now considering 255/791 (removed 536) transitions.
[2025-06-07 19:45:49] [INFO ] Flow matrix only has 114 transitions (discarded 141 similar events)
// Phase 1: matrix 114 rows 110 cols
[2025-06-07 19:45:49] [INFO ] Computed 37 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:45:49] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-07 19:45:49] [INFO ] Flow matrix only has 114 transitions (discarded 141 similar events)
[2025-06-07 19:45:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:45:49] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:45:49] [INFO ] Redundant transitions in 10 ms returned []
Running 178 sub problems to find dead transitions.
[2025-06-07 19:45:49] [INFO ] Flow matrix only has 114 transitions (discarded 141 similar events)
[2025-06-07 19:45:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 113/223 variables, 110/147 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (OVERLAPS) 0/223 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/224 variables, and 147 constraints, problems are : Problem set: 0 solved, 178 unsolved in 5135 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 2/110 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 113/223 variables, 110/147 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 178/325 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/223 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/224 variables, and 325 constraints, problems are : Problem set: 0 solved, 178 unsolved in 5416 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10577ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 10578ms
Starting structural reductions in SI_CTL mode, iteration 1 : 110/480 places, 255/791 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10863 ms. Remains : 110/480 places, 255/791 transitions.
[2025-06-07 19:46:00] [INFO ] Flatten gal took : 10 ms
[2025-06-07 19:46:00] [INFO ] Flatten gal took : 6 ms
[2025-06-07 19:46:00] [INFO ] Input system was already deterministic with 255 transitions.
[2025-06-07 19:46:00] [INFO ] Flatten gal took : 5 ms
[2025-06-07 19:46:00] [INFO ] Flatten gal took : 5 ms
[2025-06-07 19:46:00] [INFO ] Time to serialize gal into /tmp/CTLFireability5107025235173798460.gal : 1 ms
[2025-06-07 19:46:00] [INFO ] Time to serialize properties into /tmp/CTLFireability8107449780128857512.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/CTLFireability5107025235173798460.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8107449780128857512.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 -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.24689e+16,0.042313,5440,2,184,5,3300,6,0,686,1553,0


Converting to forward existential form...Done !
original formula: E(!(((p647==1) + EG((p258==1)))) U (p396==1))
=> equivalent forward existential formula: [(FwdU(Init,!(((p647==1) + EG((p258==1))))) * (p396==1))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.497578,21876,1,0,101,95800,24,97,3283,114415,146
FORMULA Champagne-PT-H08T0R-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 791/791 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 421 transition count 690
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 421 transition count 690
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 127 place count 421 transition count 681
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 157 place count 391 transition count 633
Iterating global reduction 1 with 30 rules applied. Total rules applied 187 place count 391 transition count 633
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 194 place count 391 transition count 626
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 212 place count 373 transition count 577
Iterating global reduction 2 with 18 rules applied. Total rules applied 230 place count 373 transition count 577
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 236 place count 373 transition count 571
Applied a total of 236 rules in 27 ms. Remains 373 /480 variables (removed 107) and now considering 571/791 (removed 220) transitions.
// Phase 1: matrix 571 rows 373 cols
[2025-06-07 19:46:00] [INFO ] Computed 37 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:46:00] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-06-07 19:46:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:46:00] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 570 sub problems to find dead transitions.
[2025-06-07 19:46:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (OVERLAPS) 1/373 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 3 (OVERLAPS) 571/944 variables, 373/410 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 944/944 variables, and 410 constraints, problems are : Problem set: 0 solved, 570 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 570/570 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (OVERLAPS) 1/373 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 3 (OVERLAPS) 571/944 variables, 373/410 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/944 variables, 570/980 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:46:51] [INFO ] Deduced a trap along path composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/944 variables, 1/981 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 944/944 variables, and 981 constraints, problems are : Problem set: 0 solved, 570 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 570/570 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 570 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Starting structural reductions in LTL mode, iteration 1 : 373/480 places, 571/791 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60472 ms. Remains : 373/480 places, 571/791 transitions.
[2025-06-07 19:47:01] [INFO ] Flatten gal took : 12 ms
[2025-06-07 19:47:01] [INFO ] Flatten gal took : 13 ms
[2025-06-07 19:47:01] [INFO ] Input system was already deterministic with 571 transitions.
[2025-06-07 19:47:01] [INFO ] Flatten gal took : 11 ms
[2025-06-07 19:47:01] [INFO ] Flatten gal took : 12 ms
[2025-06-07 19:47:01] [INFO ] Time to serialize gal into /tmp/CTLFireability15362470791808627244.gal : 3 ms
[2025-06-07 19:47:01] [INFO ] Time to serialize properties into /tmp/CTLFireability1627258598446033801.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/CTLFireability15362470791808627244.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1627258598446033801.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-06-07 19:47:31] [INFO ] Flatten gal took : 17 ms
[2025-06-07 19:47:31] [INFO ] Applying decomposition
[2025-06-07 19:47:31] [INFO ] Flatten gal took : 12 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/graph12596620147087052088.txt' '-o' '/tmp/graph12596620147087052088.bin' '-w' '/tmp/graph12596620147087052088.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12596620147087052088.bin' '-l' '-1' '-v' '-w' '/tmp/graph12596620147087052088.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:47:31] [INFO ] Decomposing Gal with order
[2025-06-07 19:47:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:47:31] [INFO ] Removed a total of 495 redundant transitions.
[2025-06-07 19:47:31] [INFO ] Flatten gal took : 26 ms
[2025-06-07 19:47:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 9 ms.
[2025-06-07 19:47:31] [INFO ] Time to serialize gal into /tmp/CTLFireability8981383728489791403.gal : 5 ms
[2025-06-07 19:47:31] [INFO ] Time to serialize properties into /tmp/CTLFireability3289857176030260953.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/CTLFireability8981383728489791403.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3289857176030260953.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,2.8177e+35,0.212753,12492,1617,34,16186,903,817,19341,82,1997,0


Converting to forward existential form...Done !
original formula: AG((((A((((E(((i9.u22.p178==1)&&(i15.u40.p288==1)) U (i3.i0.u4.p8==1)) * AX((i25.i0.u77.p600==1))) + EG((i26.i1.u80.p531==1))) * AG(((i21...370
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * !(((!((E(!(!(EX(!(!(EX(!((i15.u40.p299==1)))))))) U (!((((E(((i9.u22.p178==1)&&(i15.u40.p...1051
Reverse transition relation is NOT exact ! Due to transitions t7, t26, t57, t76, t117, t156, t209, i0.t173, i0.u58.t170, i1.i1.t304, i2.t373, i3.i1.t364, i...962
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
(forward)formula 0,0,5.1478,179148,1,0,354308,1166,6255,439738,571,2853,612003
FORMULA Champagne-PT-H08T0R-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 791/791 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 421 transition count 696
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 421 transition count 696
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 125 place count 421 transition count 689
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 157 place count 389 transition count 636
Iterating global reduction 1 with 32 rules applied. Total rules applied 189 place count 389 transition count 636
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 197 place count 389 transition count 628
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 217 place count 369 transition count 571
Iterating global reduction 2 with 20 rules applied. Total rules applied 237 place count 369 transition count 571
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 245 place count 369 transition count 563
Applied a total of 245 rules in 31 ms. Remains 369 /480 variables (removed 111) and now considering 563/791 (removed 228) transitions.
// Phase 1: matrix 563 rows 369 cols
[2025-06-07 19:47:36] [INFO ] Computed 37 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:47:36] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-07 19:47:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:47:36] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 562 sub problems to find dead transitions.
[2025-06-07 19:47:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 1 (OVERLAPS) 1/369 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/369 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 3 (OVERLAPS) 563/932 variables, 369/406 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 932/932 variables, and 406 constraints, problems are : Problem set: 0 solved, 562 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 369/369 constraints, PredecessorRefiner: 562/562 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 562 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 1 (OVERLAPS) 1/369 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/369 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 3 (OVERLAPS) 563/932 variables, 369/406 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/932 variables, 562/968 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:48:26] [INFO ] Deduced a trap along path composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/932 variables, 1/969 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 932/932 variables, and 969 constraints, problems are : Problem set: 0 solved, 562 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 369/369 constraints, PredecessorRefiner: 562/562 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 562 unsolved
Search for dead transitions found 0 dead transitions in 60095ms
Starting structural reductions in LTL mode, iteration 1 : 369/480 places, 563/791 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60480 ms. Remains : 369/480 places, 563/791 transitions.
[2025-06-07 19:48:37] [INFO ] Flatten gal took : 27 ms
[2025-06-07 19:48:37] [INFO ] Flatten gal took : 10 ms
[2025-06-07 19:48:37] [INFO ] Input system was already deterministic with 563 transitions.
[2025-06-07 19:48:37] [INFO ] Flatten gal took : 10 ms
[2025-06-07 19:48:37] [INFO ] Flatten gal took : 10 ms
[2025-06-07 19:48:37] [INFO ] Time to serialize gal into /tmp/CTLFireability12361521390569023341.gal : 2 ms
[2025-06-07 19:48:37] [INFO ] Time to serialize properties into /tmp/CTLFireability11824948398000314726.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/CTLFireability12361521390569023341.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11824948398000314726.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-06-07 19:49:07] [INFO ] Flatten gal took : 10 ms
[2025-06-07 19:49:07] [INFO ] Applying decomposition
[2025-06-07 19:49:07] [INFO ] Flatten gal took : 10 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/graph15957637919639356980.txt' '-o' '/tmp/graph15957637919639356980.bin' '-w' '/tmp/graph15957637919639356980.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15957637919639356980.bin' '-l' '-1' '-v' '-w' '/tmp/graph15957637919639356980.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:49:07] [INFO ] Decomposing Gal with order
[2025-06-07 19:49:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:49:07] [INFO ] Removed a total of 486 redundant transitions.
[2025-06-07 19:49:07] [INFO ] Flatten gal took : 31 ms
[2025-06-07 19:49:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 10 ms.
[2025-06-07 19:49:07] [INFO ] Time to serialize gal into /tmp/CTLFireability12828043837597156991.gal : 5 ms
[2025-06-07 19:49:07] [INFO ] Time to serialize properties into /tmp/CTLFireability18277131633230365186.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/CTLFireability12828043837597156991.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18277131633230365186.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,1.91421e+35,0.198221,11124,1111,31,13131,851,819,21355,79,1928,0


Converting to forward existential form...Done !
original formula: AG(EX(((i5.u14.p103==0)||(((i20.u58.p412==1)||((i17.i1.u63.p437==1)&&(i22.i1.u67.p452==1)))&&(((i15.u44.p315==0)||(i30.i0.u96.p638==0))||...225
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(((i5.u14.p103==0)||(((i20.u58.p412==1)||((i17.i1.u63.p437==1)&&(i22.i1.u67.p452==1)))&&...279
Reverse transition relation is NOT exact ! Due to transitions t7, t26, t46, t75, t114, t206, i0.i1.t312, i1.i1.t373, i2.t364, i3.t354, i4.t344, i5.t334, i6...960
(forward)formula 0,0,1.31089,69876,1,0,204764,851,4389,196948,360,1928,361992
FORMULA Champagne-PT-H08T0R-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 791/791 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 416 transition count 676
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 416 transition count 676
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 138 place count 416 transition count 666
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 171 place count 383 transition count 612
Iterating global reduction 1 with 33 rules applied. Total rules applied 204 place count 383 transition count 612
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 212 place count 383 transition count 604
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 233 place count 362 transition count 546
Iterating global reduction 2 with 21 rules applied. Total rules applied 254 place count 362 transition count 546
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 262 place count 362 transition count 538
Applied a total of 262 rules in 24 ms. Remains 362 /480 variables (removed 118) and now considering 538/791 (removed 253) transitions.
// Phase 1: matrix 538 rows 362 cols
[2025-06-07 19:49:08] [INFO ] Computed 37 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:49:08] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-07 19:49:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:49:09] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 537 sub problems to find dead transitions.
[2025-06-07 19:49:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (OVERLAPS) 1/362 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (OVERLAPS) 538/900 variables, 362/399 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 900/900 variables, and 399 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 537 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (OVERLAPS) 1/362 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (OVERLAPS) 538/900 variables, 362/399 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/900 variables, 537/936 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:49:57] [INFO ] Deduced a trap along path composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/900 variables, 1/937 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:50:08] [INFO ] Deduced a trap composed of 47 places in 131 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 900/900 variables, and 938 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 537 unsolved
Search for dead transitions found 0 dead transitions in 60084ms
Starting structural reductions in LTL mode, iteration 1 : 362/480 places, 538/791 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60453 ms. Remains : 362/480 places, 538/791 transitions.
[2025-06-07 19:50:09] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:50:09] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:50:09] [INFO ] Input system was already deterministic with 538 transitions.
[2025-06-07 19:50:09] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:50:09] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:50:09] [INFO ] Time to serialize gal into /tmp/CTLFireability14167564422336589878.gal : 3 ms
[2025-06-07 19:50:09] [INFO ] Time to serialize properties into /tmp/CTLFireability13476610202285234751.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/CTLFireability14167564422336589878.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13476610202285234751.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,9.14415e+34,0.392774,17892,2,2860,5,82708,6,0,1988,48525,0


Converting to forward existential form...Done !
original formula: EX((AG(EF(AX((p460==0)))) * ((p539==0)||(p393==0))))
=> equivalent forward existential formula: [((EY(Init) * ((p539==0)||(p393==0))) * !(E(TRUE U !(E(TRUE U !(EX(!((p460==0)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t26, t27, t31, t36, t40, t45, t46, t50, t56, t60, t65, t69, t74, t75, t79, t85, t89, t95,...543
(forward)formula 0,1,4.83423,150396,1,0,897,949538,1099,470,12948,618600,1092
FORMULA Champagne-PT-H08T0R-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 791/791 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 419 transition count 685
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 419 transition count 685
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 131 place count 419 transition count 676
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 164 place count 386 transition count 622
Iterating global reduction 1 with 33 rules applied. Total rules applied 197 place count 386 transition count 622
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 204 place count 386 transition count 615
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 224 place count 366 transition count 558
Iterating global reduction 2 with 20 rules applied. Total rules applied 244 place count 366 transition count 558
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 252 place count 366 transition count 550
Applied a total of 252 rules in 21 ms. Remains 366 /480 variables (removed 114) and now considering 550/791 (removed 241) transitions.
// Phase 1: matrix 550 rows 366 cols
[2025-06-07 19:50:14] [INFO ] Computed 37 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:50:14] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-06-07 19:50:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:50:14] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 549 sub problems to find dead transitions.
[2025-06-07 19:50:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 1/366 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:50:25] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:50:25] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (OVERLAPS) 550/916 variables, 366/405 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 916/916 variables, and 405 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 366/366 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 549 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 1/366 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (OVERLAPS) 550/916 variables, 366/405 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/916 variables, 549/954 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:50:54] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:50:55] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:50:55] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:50:55] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:50:55] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:50:55] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:50:56] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:50:56] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:50:56] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:50:56] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:50:57] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:50:57] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/916 variables, 12/966 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:51:07] [INFO ] Deduced a trap along path composed of 9 places in 34 ms of which 0 ms to minimize.
(s244 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 1)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 1)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 1)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 1)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 1)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0timeout
)
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 916/916 variables, and 967 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 366/366 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 549 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Starting structural reductions in LTL mode, iteration 1 : 366/480 places, 550/791 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60447 ms. Remains : 366/480 places, 550/791 transitions.
[2025-06-07 19:51:14] [INFO ] Flatten gal took : 8 ms
[2025-06-07 19:51:14] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:51:14] [INFO ] Input system was already deterministic with 550 transitions.
[2025-06-07 19:51:14] [INFO ] Flatten gal took : 13 ms
[2025-06-07 19:51:14] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:51:14] [INFO ] Time to serialize gal into /tmp/CTLFireability2589419823766557668.gal : 2 ms
[2025-06-07 19:51:14] [INFO ] Time to serialize properties into /tmp/CTLFireability2029209621001774545.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/CTLFireability2589419823766557668.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2029209621001774545.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 -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 19:51:44] [INFO ] Flatten gal took : 10 ms
[2025-06-07 19:51:44] [INFO ] Applying decomposition
[2025-06-07 19:51:44] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11196026018257786612.txt' '-o' '/tmp/graph11196026018257786612.bin' '-w' '/tmp/graph11196026018257786612.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11196026018257786612.bin' '-l' '-1' '-v' '-w' '/tmp/graph11196026018257786612.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:51:44] [INFO ] Decomposing Gal with order
[2025-06-07 19:51:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:51:44] [INFO ] Removed a total of 458 redundant transitions.
[2025-06-07 19:51:44] [INFO ] Flatten gal took : 19 ms
[2025-06-07 19:51:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 7 ms.
[2025-06-07 19:51:44] [INFO ] Time to serialize gal into /tmp/CTLFireability13277382743098350579.gal : 3 ms
[2025-06-07 19:51:44] [INFO ] Time to serialize properties into /tmp/CTLFireability6699477924168703708.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/CTLFireability13277382743098350579.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6699477924168703708.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,1.41349e+35,0.424157,19784,2167,29,23897,908,784,89972,75,2208,0


Converting to forward existential form...Done !
original formula: EF((AX(EG(!(E((i14.u39.p264==1) U (i28.u84.p543==1))))) * ((EG((i17.u47.p335==1)) + EF(((i13.u38.p261==1)&&(i21.u60.p407==1)))) + (AG((i3...217
=> equivalent forward existential formula: (([FwdG((FwdU(Init,TRUE) * !(EX(!(EG(!(E((i14.u39.p264==1) U (i28.u84.p543==1)))))))),(i17.u47.p335==1))] != FAL...484
Reverse transition relation is NOT exact ! Due to transitions t7, t26, t45, t55, t85, t115, t135, t154, t185, t204, t255, t357, i0.t155, i0.u65.t159, i1.i1...949
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 791/791 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 421 transition count 714
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 421 transition count 714
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 124 place count 421 transition count 708
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 156 place count 389 transition count 658
Iterating global reduction 1 with 32 rules applied. Total rules applied 188 place count 389 transition count 658
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 195 place count 389 transition count 651
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 216 place count 368 transition count 593
Iterating global reduction 2 with 21 rules applied. Total rules applied 237 place count 368 transition count 593
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 245 place count 368 transition count 585
Applied a total of 245 rules in 23 ms. Remains 368 /480 variables (removed 112) and now considering 585/791 (removed 206) transitions.
// Phase 1: matrix 585 rows 368 cols
[2025-06-07 19:52:14] [INFO ] Computed 37 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:52:14] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-06-07 19:52:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:52:15] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 584 sub problems to find dead transitions.
[2025-06-07 19:52:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (OVERLAPS) 1/368 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/368 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 3 (OVERLAPS) 585/953 variables, 368/405 constraints. Problems are: Problem set: 0 solved, 584 unsolved
(t142 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 1.0)
(t2 1.0)
(t3 1.0)
(t4 1.0)
(t5 1.0)
(t6 1.0)
(t7 1.0)
(t8 1.0)
(t9 0.0)
(t10 0.0)
(t11 0.0)
(t12 0.0)
(t13 0.0)
(t14 1.0)
(t15 0.0)
(t16 0.0)
(t17 1.0)
(t18 0.0)
(t19 0.0)
(t20 0.0)
(t21 0.0)
(t22 0.0)
(t23 1.0)
(t24 0.0)
(t25 0.0)
(t26 1.0)
(t27 1.0)
(t28 0.0)
(t29 0.0)
(t30 0.0)
(t31 0.0)
(t32 0.0)
(t33 1.0)
(t34 0.0)
(t35 0.0)
(t36 1.0)
(t37 0.0)
(t38 0.0)
(t39 0.0)
(t40 0.0)
(t41 0.0)
(t42 1.0)
(t43 0.0)
(t44 0.0)
(t45 1.0)
(t46 1.0)
(t47 0.0)
(t48 0.0)
(t49 0.0)
(t50 0.0)
(t51 0.0)
(t52 1.0)
(t53 0.0)
(t54 0.0)
(t55 1.0)
(t56 1.0)
(t57 0.0)
(t58 0.0)
(t59 0.0)
(t60 0.0)
(t61 0.0)
(t62 1.0)
(t63 0.0)
(t64 0.0)
(t65 1.0)
(t66 0.0)
(t67 0.0)
(t68 0.0)
(t69 0.0)
(t70 0.0)
(t71 1.0)
(t72 0.0)
(t73 0.0)
(t74 1.0)
(t75 1.0)
(t76 0.0)
(t77 0.0)
(t78 0.0)
(t79 0.0)
(t80 0.0)
(t81 1.0)
(t82 0.0)
(t83 0.0)
(t84 1.0)
(t85 1.0)
(t86 0.0)
(t87 0.0)
(t88 0.0)
(t89 0.0)
(t90 0.0)
(t91 0.0)
(t92 1.0)
(t93 0.0)
(t94 0.0)
(t95 1.0)
(t96 1.0)
(t97 0.0)
(t98 0.0)
(t99 0.0)
(t100 0.0)
(t101 0.0)
(t102 1.0)
(t103 0.0)
(t104 0.0)
(t105 1.0)
(t106 0.0)
(t107 0.0)
(t108 0.0)
(t109 0.0)
(t110 0.0)
(t111 1.0)
(t112 0.0)
(t113 0.0)
(t114 1.0)
(t115 1.0)
(t116 1.0)
(t117 1.0)
(t118 0.0)
(t119 0.0)
(t120 0.0)
(t121 0.0)
(t122 0.0)
(t123 1.0)
(t124 1.0)
(t125 0.0)
(t126 0.0)
(t127 1.0)
(t128 1.0)
(t129 0.0)
(t130 0.0)
(t131 0.0)
(t132 0.0)
(t133 0.0)
(t134 0.0)
(t135 1.0)
(t136 0.0)
(t137 0.0)
(t138 1.0)
(t139 1.0)
(t140 0.0)
(t141 0.0)
(t142 0.0timeout
)
(t143 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 953/953 variables, and 405 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 368/368 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 584 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (OVERLAPS) 1/368 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/368 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 3 (OVERLAPS) 585/953 variables, 368/405 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/953 variables, 584/989 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:53:05] [INFO ] Deduced a trap along path composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/953 variables, 1/990 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 953/953 variables, and 990 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 368/368 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 584 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Starting structural reductions in LTL mode, iteration 1 : 368/480 places, 585/791 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60456 ms. Remains : 368/480 places, 585/791 transitions.
[2025-06-07 19:53:15] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:53:15] [INFO ] Flatten gal took : 10 ms
[2025-06-07 19:53:15] [INFO ] Input system was already deterministic with 585 transitions.
[2025-06-07 19:53:15] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:53:15] [INFO ] Flatten gal took : 10 ms
[2025-06-07 19:53:15] [INFO ] Time to serialize gal into /tmp/CTLFireability9360696324660990519.gal : 3 ms
[2025-06-07 19:53:15] [INFO ] Time to serialize properties into /tmp/CTLFireability9068708112130782250.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/CTLFireability9360696324660990519.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9068708112130782250.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 -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 19:53:45] [INFO ] Flatten gal took : 10 ms
[2025-06-07 19:53:45] [INFO ] Applying decomposition
[2025-06-07 19:53:45] [INFO ] Flatten gal took : 9 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/graph4274912205778703069.txt' '-o' '/tmp/graph4274912205778703069.bin' '-w' '/tmp/graph4274912205778703069.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4274912205778703069.bin' '-l' '-1' '-v' '-w' '/tmp/graph4274912205778703069.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:53:45] [INFO ] Decomposing Gal with order
[2025-06-07 19:53:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:53:45] [INFO ] Removed a total of 495 redundant transitions.
[2025-06-07 19:53:45] [INFO ] Flatten gal took : 23 ms
[2025-06-07 19:53:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 6 ms.
[2025-06-07 19:53:45] [INFO ] Time to serialize gal into /tmp/CTLFireability4056625751181402646.gal : 4 ms
[2025-06-07 19:53:45] [INFO ] Time to serialize properties into /tmp/CTLFireability5569310242881985238.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/CTLFireability4056625751181402646.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5569310242881985238.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.71752e+35,0.171043,10556,1032,27,11632,605,752,19046,57,1228,0


Converting to forward existential form...Done !
original formula: !(E(EX(EF(((((i6.u22.p121==1)&&(i15.u51.p291==1))&&((i17.u59.p337==1)&&(i22.u71.p410==1))) * EX((i30.u108.p638==1))))) U E(EG(E(((i1.i1.u...354
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,EX(E(TRUE U ((((i6.u22.p121==1)&&(i15.u51.p291==1))&&((i17.u59.p337==1)&&(i22.u71.p410==1))) ...652
Reverse transition relation is NOT exact ! Due to transitions t7, t26, t45, t74, t138, t157, t207, i0.i1.t304, i1.i1.t373, i2.t364, i3.t354, i4.t344, i5.t3...937
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 791/791 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 427 transition count 711
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 427 transition count 711
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 113 place count 427 transition count 704
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 141 place count 399 transition count 658
Iterating global reduction 1 with 28 rules applied. Total rules applied 169 place count 399 transition count 658
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 175 place count 399 transition count 652
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 194 place count 380 transition count 605
Iterating global reduction 2 with 19 rules applied. Total rules applied 213 place count 380 transition count 605
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 220 place count 380 transition count 598
Applied a total of 220 rules in 31 ms. Remains 380 /480 variables (removed 100) and now considering 598/791 (removed 193) transitions.
// Phase 1: matrix 598 rows 380 cols
[2025-06-07 19:54:15] [INFO ] Computed 37 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:54:15] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-06-07 19:54:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:54:16] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Running 597 sub problems to find dead transitions.
[2025-06-07 19:54:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/379 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 1 (OVERLAPS) 1/380 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 597 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:27] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:27] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:27] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:27] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:28] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:28] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:28] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 4 (OVERLAPS) 598/978 variables, 380/424 constraints. Problems are: Problem set: 0 solved, 597 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 978/978 variables, and 424 constraints, problems are : Problem set: 0 solved, 597 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 380/380 constraints, PredecessorRefiner: 597/597 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 597 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/379 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 1 (OVERLAPS) 1/380 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 4 (OVERLAPS) 598/978 variables, 380/424 constraints. Problems are: Problem set: 0 solved, 597 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/978 variables, 597/1021 constraints. Problems are: Problem set: 0 solved, 597 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:57] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:57] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:58] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:58] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:58] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:58] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:58] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:58] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:59] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:59] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:54:59] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:55:00] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:55:00] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:55:01] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/978 variables, 14/1035 constraints. Problems are: Problem set: 0 solved, 597 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:55:07] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:55:07] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:55:08] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:55:09] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:55:10] [INFO ] Deduced a trap composed of 49 places in 84 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 978/978 variables, and 1040 constraints, problems are : Problem set: 0 solved, 597 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 380/380 constraints, PredecessorRefiner: 597/597 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 597 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Starting structural reductions in LTL mode, iteration 1 : 380/480 places, 598/791 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60473 ms. Remains : 380/480 places, 598/791 transitions.
[2025-06-07 19:55:16] [INFO ] Flatten gal took : 10 ms
[2025-06-07 19:55:16] [INFO ] Flatten gal took : 10 ms
[2025-06-07 19:55:16] [INFO ] Input system was already deterministic with 598 transitions.
[2025-06-07 19:55:16] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:55:16] [INFO ] Flatten gal took : 10 ms
[2025-06-07 19:55:16] [INFO ] Time to serialize gal into /tmp/CTLFireability16766381985309069150.gal : 2 ms
[2025-06-07 19:55:16] [INFO ] Time to serialize properties into /tmp/CTLFireability14628979582617493367.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/CTLFireability16766381985309069150.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14628979582617493367.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-06-07 19:55:46] [INFO ] Flatten gal took : 10 ms
[2025-06-07 19:55:46] [INFO ] Applying decomposition
[2025-06-07 19:55:46] [INFO ] Flatten gal took : 10 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/graph1317462049387307123.txt' '-o' '/tmp/graph1317462049387307123.bin' '-w' '/tmp/graph1317462049387307123.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1317462049387307123.bin' '-l' '-1' '-v' '-w' '/tmp/graph1317462049387307123.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:55:46] [INFO ] Decomposing Gal with order
[2025-06-07 19:55:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:55:46] [INFO ] Removed a total of 497 redundant transitions.
[2025-06-07 19:55:46] [INFO ] Flatten gal took : 22 ms
[2025-06-07 19:55:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 5 ms.
[2025-06-07 19:55:46] [INFO ] Time to serialize gal into /tmp/CTLFireability11829509446420007403.gal : 3 ms
[2025-06-07 19:55:46] [INFO ] Time to serialize properties into /tmp/CTLFireability18360898468613175171.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/CTLFireability11829509446420007403.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18360898468613175171.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,5.05597e+35,0.425078,23720,6501,26,36353,712,883,32710,71,1513,0


Converting to forward existential form...Done !
original formula: E(A(((AF((((i6.u19.p102==1)&&(i12.u39.p212==1))||((i10.u35.p197==1)&&(i15.u51.p288==1)))) + (E((i23.u80.p422==1) U ((i17.u61.p337==1)&&(i...566
=> equivalent forward existential formula: (((([((FwdU(FwdU(Init,!((E(!(EG(E(TRUE U ((i26.u89.p512==1)&&(i16.u57.p313==1))))) U (!(((!(EG(!((((i6.u19.p102=...2675
Reverse transition relation is NOT exact ! Due to transitions t7, t26, t45, t77, t98, t129, t140, t159, t212, t268, t288, t371, i0.u25.t323, i2.t385, i3.t3...1034
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 791/791 transitions.
Graph (trivial) has 460 edges and 480 vertex of which 66 / 480 are part of one of the 12 SCC in 2 ms
Free SCC test removed 54 places
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 106 place count 425 transition count 624
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 1 with 173 rules applied. Total rules applied 279 place count 320 transition count 556
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 312 place count 287 transition count 556
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 312 place count 287 transition count 546
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 332 place count 277 transition count 546
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 383 place count 226 transition count 444
Iterating global reduction 3 with 51 rules applied. Total rules applied 434 place count 226 transition count 444
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 443 place count 226 transition count 435
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 443 place count 226 transition count 419
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 475 place count 210 transition count 419
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 481 place count 204 transition count 386
Iterating global reduction 4 with 6 rules applied. Total rules applied 487 place count 204 transition count 386
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 493 place count 204 transition count 380
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 5 with 190 rules applied. Total rules applied 683 place count 109 transition count 285
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 688 place count 104 transition count 249
Iterating global reduction 5 with 5 rules applied. Total rules applied 693 place count 104 transition count 249
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 698 place count 104 transition count 244
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 700 place count 102 transition count 242
Applied a total of 700 rules in 65 ms. Remains 102 /480 variables (removed 378) and now considering 242/791 (removed 549) transitions.
[2025-06-07 19:56:16] [INFO ] Flow matrix only has 95 transitions (discarded 147 similar events)
// Phase 1: matrix 95 rows 102 cols
[2025-06-07 19:56:16] [INFO ] Computed 37 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:56:16] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-07 19:56:16] [INFO ] Flow matrix only has 95 transitions (discarded 147 similar events)
[2025-06-07 19:56:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:56:16] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 19:56:16] [INFO ] Redundant transitions in 3 ms returned []
Running 165 sub problems to find dead transitions.
[2025-06-07 19:56:16] [INFO ] Flow matrix only has 95 transitions (discarded 147 similar events)
[2025-06-07 19:56:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 2/102 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 94/196 variables, 102/139 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 0/196 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/197 variables, and 139 constraints, problems are : Problem set: 0 solved, 165 unsolved in 4384 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 2/102 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 94/196 variables, 102/139 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 165/304 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/197 variables, and 304 constraints, problems are : Problem set: 0 solved, 165 unsolved in 4470 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8871ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 8872ms
Starting structural reductions in SI_CTL mode, iteration 1 : 102/480 places, 242/791 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9099 ms. Remains : 102/480 places, 242/791 transitions.
[2025-06-07 19:56:25] [INFO ] Flatten gal took : 8 ms
[2025-06-07 19:56:25] [INFO ] Flatten gal took : 4 ms
[2025-06-07 19:56:25] [INFO ] Input system was already deterministic with 242 transitions.
RANDOM walk for 178 steps (2 resets) in 8 ms. (19 steps per ms) remains 0/1 properties
FORMULA Champagne-PT-H08T0R-CTLFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-07 19:56:25] [INFO ] Flatten gal took : 7 ms
[2025-06-07 19:56:25] [INFO ] Flatten gal took : 4 ms
[2025-06-07 19:56:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17281359806027463191.gal : 1 ms
[2025-06-07 19:56:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12127639353800821822.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17281359806027463191.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12127639353800821822.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 791/791 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 417 transition count 677
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 417 transition count 677
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 136 place count 417 transition count 667
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 169 place count 384 transition count 616
Iterating global reduction 1 with 33 rules applied. Total rules applied 202 place count 384 transition count 616
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 209 place count 384 transition count 609
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 231 place count 362 transition count 550
Iterating global reduction 2 with 22 rules applied. Total rules applied 253 place count 362 transition count 550
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 261 place count 362 transition count 542
Applied a total of 261 rules in 23 ms. Remains 362 /480 variables (removed 118) and now considering 542/791 (removed 249) transitions.
// Phase 1: matrix 542 rows 362 cols
[2025-06-07 19:56:25] [INFO ] Computed 37 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:56:25] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-06-07 19:56:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:56:25] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 541 sub problems to find dead transitions.
[2025-06-07 19:56:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (OVERLAPS) 1/362 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:56:36] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:56:36] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (OVERLAPS) 542/904 variables, 362/401 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 904/904 variables, and 401 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 541 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (OVERLAPS) 1/362 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (OVERLAPS) 542/904 variables, 362/401 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/904 variables, 541/942 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:57:06] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:57:06] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:57:06] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:57:06] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:57:07] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:57:07] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:57:08] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:57:08] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:57:08] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/904 variables, 9/951 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:57:13] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:57:15] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/904 variables, 2/953 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:57:24] [INFO ] Deduced a trap composed of 55 places in 133 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 904/904 variables, and 954 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 362/362 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 541 unsolved
Search for dead transitions found 0 dead transitions in 60075ms
Starting structural reductions in LTL mode, iteration 1 : 362/480 places, 542/791 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60425 ms. Remains : 362/480 places, 542/791 transitions.
[2025-06-07 19:57:26] [INFO ] Flatten gal took : 16 ms
[2025-06-07 19:57:26] [INFO ] Flatten gal took : 8 ms
[2025-06-07 19:57:26] [INFO ] Input system was already deterministic with 542 transitions.
[2025-06-07 19:57:26] [INFO ] Flatten gal took : 8 ms
[2025-06-07 19:57:26] [INFO ] Flatten gal took : 8 ms
[2025-06-07 19:57:26] [INFO ] Time to serialize gal into /tmp/CTLFireability2577467080224917815.gal : 2 ms
[2025-06-07 19:57:26] [INFO ] Time to serialize properties into /tmp/CTLFireability15604653407370619447.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/CTLFireability2577467080224917815.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15604653407370619447.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.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.3394e+34,0.583916,23928,2,3613,5,115631,6,0,1992,78506,0


Converting to forward existential form...Done !
original formula: AG((EX((p585==1)) + EF((p87==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(E(TRUE U (p87==1)))) * !(EX((p585==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t26, t27, t31, t36, t40, t45, t46, t50, t55, t56, t60, t65, t69, t74, t75, t79, t83, t87,...589
Detected timeout of ITS tools.
[2025-06-07 19:57:56] [INFO ] Flatten gal took : 16 ms
[2025-06-07 19:57:56] [INFO ] Applying decomposition
[2025-06-07 19:57:56] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10732274991053444393.txt' '-o' '/tmp/graph10732274991053444393.bin' '-w' '/tmp/graph10732274991053444393.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10732274991053444393.bin' '-l' '-1' '-v' '-w' '/tmp/graph10732274991053444393.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:57:56] [INFO ] Decomposing Gal with order
[2025-06-07 19:57:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:57:56] [INFO ] Removed a total of 440 redundant transitions.
[2025-06-07 19:57:56] [INFO ] Flatten gal took : 23 ms
[2025-06-07 19:57:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-07 19:57:56] [INFO ] Time to serialize gal into /tmp/CTLFireability15031711593010854817.gal : 4 ms
[2025-06-07 19:57:56] [INFO ] Time to serialize properties into /tmp/CTLFireability17822742953191472144.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/CTLFireability15031711593010854817.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17822742953191472144.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,9.3394e+34,0.242458,14956,1785,32,19106,770,756,48987,66,1657,0


Converting to forward existential form...Done !
original formula: AG((EX((i29.i1.u86.p585==1)) + EF((i5.u14.p87==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(E(TRUE U (i5.u14.p87==1)))) * !(EX((i29.i1.u86.p585==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t26, t45, t55, t74, t96, t115, t135, t154, t184, t203, t253, t353, i0.i1.t307, i1.i1.t367...989
(forward)formula 0,0,28.7793,386540,1,0,682818,770,4733,1.49938e+06,367,1657,771010
FORMULA Champagne-PT-H08T0R-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 791/791 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 417 transition count 677
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 417 transition count 677
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 136 place count 417 transition count 667
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 168 place count 385 transition count 623
Iterating global reduction 1 with 32 rules applied. Total rules applied 200 place count 385 transition count 623
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 207 place count 385 transition count 616
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 228 place count 364 transition count 558
Iterating global reduction 2 with 21 rules applied. Total rules applied 249 place count 364 transition count 558
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 257 place count 364 transition count 550
Applied a total of 257 rules in 20 ms. Remains 364 /480 variables (removed 116) and now considering 550/791 (removed 241) transitions.
// Phase 1: matrix 550 rows 364 cols
[2025-06-07 19:58:25] [INFO ] Computed 37 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:58:25] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-06-07 19:58:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 19:58:25] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 549 sub problems to find dead transitions.
[2025-06-07 19:58:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 1/364 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:58:34] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:58:34] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:58:34] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:58:35] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:58:35] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:58:35] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:58:35] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:58:35] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:58:36] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:58:36] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:58:36] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:58:37] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:58:37] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 13/50 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (OVERLAPS) 550/914 variables, 364/414 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 914/914 variables, and 414 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 549 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 1/364 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 13/50 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/364 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (OVERLAPS) 550/914 variables, 364/414 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/914 variables, 549/963 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:59:08] [INFO ] Deduced a trap composed of 72 places in 138 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/914 variables, 1/964 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:59:12] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:59:13] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:59:13] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:59:15] [INFO ] Deduced a trap composed of 74 places in 143 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:59:15] [INFO ] Deduced a trap composed of 75 places in 131 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:59:16] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/914 variables, 6/970 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:59:21] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:59:22] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:59:22] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:59:22] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:59:23] [INFO ] Deduced a trap composed of 75 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:59:23] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:59:23] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 19:59:25] [INFO ] Deduced a trap composed of 61 places in 106 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 914/914 variables, and 978 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 549 unsolved
Search for dead transitions found 0 dead transitions in 60084ms
Starting structural reductions in LTL mode, iteration 1 : 364/480 places, 550/791 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60449 ms. Remains : 364/480 places, 550/791 transitions.
[2025-06-07 19:59:25] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:59:25] [INFO ] Flatten gal took : 9 ms
[2025-06-07 19:59:25] [INFO ] Input system was already deterministic with 550 transitions.
[2025-06-07 19:59:25] [INFO ] Flatten gal took : 8 ms
[2025-06-07 19:59:25] [INFO ] Flatten gal took : 8 ms
[2025-06-07 19:59:25] [INFO ] Time to serialize gal into /tmp/CTLFireability6993278641345077097.gal : 1 ms
[2025-06-07 19:59:25] [INFO ] Time to serialize properties into /tmp/CTLFireability14694344559189466855.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/CTLFireability6993278641345077097.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14694344559189466855.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-06-07 19:59:55] [INFO ] Flatten gal took : 17 ms
[2025-06-07 19:59:55] [INFO ] Applying decomposition
[2025-06-07 19:59:55] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13473203993759489131.txt' '-o' '/tmp/graph13473203993759489131.bin' '-w' '/tmp/graph13473203993759489131.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13473203993759489131.bin' '-l' '-1' '-v' '-w' '/tmp/graph13473203993759489131.weights' '-q' '0' '-e' '0.001'
[2025-06-07 19:59:55] [INFO ] Decomposing Gal with order
[2025-06-07 19:59:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 19:59:55] [INFO ] Removed a total of 452 redundant transitions.
[2025-06-07 19:59:55] [INFO ] Flatten gal took : 22 ms
[2025-06-07 19:59:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2025-06-07 19:59:55] [INFO ] Time to serialize gal into /tmp/CTLFireability14309165875775231075.gal : 4 ms
[2025-06-07 19:59:55] [INFO ] Time to serialize properties into /tmp/CTLFireability5093366032326365771.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/CTLFireability14309165875775231075.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5093366032326365771.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,1.13034e+35,0.193379,11356,1132,30,13870,833,750,21068,68,1886,0


Converting to forward existential form...Done !
original formula: EF(!(A(EF(((E((i34.u106.p682==1) U (i12.u33.p233==1)) + (i4.u15.p104==1)) + (i23.u72.p477==1))) U !(AX((i1.i1.u6.p25==1))))))
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,TRUE),!(!(!(EX(!((i1.i1.u6.p25==1))))))) * !(E(TRUE U ((E((i34.u106.p682==1) U (i12.u33.p233=...314
Reverse transition relation is NOT exact ! Due to transitions t7, t26, t46, t56, t75, t95, t114, t134, t153, t183, t202, t252, t273, t354, i0.t339, i1.i1.t...988
(forward)formula 0,1,8.48301,233948,1,0,530814,833,4853,882945,373,1886,796262
FORMULA Champagne-PT-H08T0R-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 791/791 transitions.
Graph (trivial) has 452 edges and 480 vertex of which 58 / 480 are part of one of the 11 SCC in 0 ms
Free SCC test removed 47 places
Ensure Unique test removed 53 transitions
Reduce isomorphic transitions removed 53 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 108 place count 432 transition count 630
Reduce places removed 107 places and 0 transitions.
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 173 rules applied. Total rules applied 281 place count 325 transition count 564
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 33 rules applied. Total rules applied 314 place count 293 transition count 563
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 315 place count 292 transition count 563
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 315 place count 292 transition count 553
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 335 place count 282 transition count 553
Discarding 50 places :
Symmetric choice reduction at 4 with 50 rule applications. Total rules 385 place count 232 transition count 452
Iterating global reduction 4 with 50 rules applied. Total rules applied 435 place count 232 transition count 452
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 444 place count 232 transition count 443
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 444 place count 232 transition count 427
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 476 place count 216 transition count 427
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 481 place count 211 transition count 398
Iterating global reduction 5 with 5 rules applied. Total rules applied 486 place count 211 transition count 398
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 491 place count 211 transition count 393
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 6 with 192 rules applied. Total rules applied 683 place count 115 transition count 297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 684 place count 115 transition count 296
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 689 place count 110 transition count 260
Iterating global reduction 7 with 5 rules applied. Total rules applied 694 place count 110 transition count 260
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 699 place count 110 transition count 255
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 701 place count 108 transition count 253
Applied a total of 701 rules in 58 ms. Remains 108 /480 variables (removed 372) and now considering 253/791 (removed 538) transitions.
[2025-06-07 20:00:04] [INFO ] Flow matrix only has 118 transitions (discarded 135 similar events)
// Phase 1: matrix 118 rows 108 cols
[2025-06-07 20:00:04] [INFO ] Computed 37 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:00:04] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-07 20:00:04] [INFO ] Flow matrix only has 118 transitions (discarded 135 similar events)
[2025-06-07 20:00:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:00:04] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 20:00:04] [INFO ] Redundant transitions in 3 ms returned []
Running 176 sub problems to find dead transitions.
[2025-06-07 20:00:04] [INFO ] Flow matrix only has 118 transitions (discarded 135 similar events)
[2025-06-07 20:00:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 3/108 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 117/225 variables, 108/145 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 0/225 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/226 variables, and 145 constraints, problems are : Problem set: 0 solved, 176 unsolved in 4993 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 3/108 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 117/225 variables, 108/145 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 176/321 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/225 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/226 variables, and 321 constraints, problems are : Problem set: 0 solved, 176 unsolved in 5192 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10201ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 10201ms
Starting structural reductions in SI_CTL mode, iteration 1 : 108/480 places, 253/791 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10419 ms. Remains : 108/480 places, 253/791 transitions.
[2025-06-07 20:00:14] [INFO ] Flatten gal took : 10 ms
[2025-06-07 20:00:14] [INFO ] Flatten gal took : 4 ms
[2025-06-07 20:00:14] [INFO ] Input system was already deterministic with 253 transitions.
[2025-06-07 20:00:14] [INFO ] Flatten gal took : 4 ms
[2025-06-07 20:00:14] [INFO ] Flatten gal took : 4 ms
[2025-06-07 20:00:14] [INFO ] Time to serialize gal into /tmp/CTLFireability8805433258685976150.gal : 1 ms
[2025-06-07 20:00:14] [INFO ] Time to serialize properties into /tmp/CTLFireability13627691113800499039.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/CTLFireability8805433258685976150.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13627691113800499039.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.
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.80861e+16,0.042886,5452,2,180,5,2667,6,0,677,1284,0


Converting to forward existential form...Done !
original formula: EF(((p32==1) + !(E(!(((p64==1)&&(p81==1))) U (p629==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (p32==1))] != FALSE + [(FwdU(Init,TRUE) * !(E(!(((p64==1)&&(p81==1))) U (p629==1))))] != FA...159
(forward)formula 0,1,0.043645,5708,1,0,7,2667,8,1,680,1284,1
FORMULA Champagne-PT-H08T0R-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 791/791 transitions.
Graph (trivial) has 446 edges and 480 vertex of which 61 / 480 are part of one of the 11 SCC in 1 ms
Free SCC test removed 50 places
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 103 place count 429 transition count 631
Reduce places removed 102 places and 0 transitions.
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 1 with 168 rules applied. Total rules applied 271 place count 327 transition count 565
Reduce places removed 32 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 34 rules applied. Total rules applied 305 place count 295 transition count 563
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 309 place count 293 transition count 561
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 310 place count 292 transition count 561
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 310 place count 292 transition count 550
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 332 place count 281 transition count 550
Discarding 47 places :
Symmetric choice reduction at 5 with 47 rule applications. Total rules 379 place count 234 transition count 461
Iterating global reduction 5 with 47 rules applied. Total rules applied 426 place count 234 transition count 461
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 434 place count 234 transition count 453
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 14 Pre rules applied. Total rules applied 434 place count 234 transition count 439
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 462 place count 220 transition count 439
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 468 place count 214 transition count 406
Iterating global reduction 6 with 6 rules applied. Total rules applied 474 place count 214 transition count 406
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 480 place count 214 transition count 400
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 7 with 192 rules applied. Total rules applied 672 place count 118 transition count 304
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 673 place count 118 transition count 303
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 678 place count 113 transition count 267
Iterating global reduction 8 with 5 rules applied. Total rules applied 683 place count 113 transition count 267
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 688 place count 113 transition count 262
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 690 place count 111 transition count 260
Applied a total of 690 rules in 62 ms. Remains 111 /480 variables (removed 369) and now considering 260/791 (removed 531) transitions.
[2025-06-07 20:00:14] [INFO ] Flow matrix only has 117 transitions (discarded 143 similar events)
// Phase 1: matrix 117 rows 111 cols
[2025-06-07 20:00:14] [INFO ] Computed 37 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:00:14] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-07 20:00:14] [INFO ] Flow matrix only has 117 transitions (discarded 143 similar events)
[2025-06-07 20:00:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:00:14] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 20:00:14] [INFO ] Redundant transitions in 1 ms returned []
Running 189 sub problems to find dead transitions.
[2025-06-07 20:00:15] [INFO ] Flow matrix only has 117 transitions (discarded 143 similar events)
[2025-06-07 20:00:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 6/111 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 116/227 variables, 111/148 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (OVERLAPS) 0/227 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/228 variables, and 148 constraints, problems are : Problem set: 0 solved, 189 unsolved in 5493 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (OVERLAPS) 6/111 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 116/227 variables, 111/148 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 189/337 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:00:23] [INFO ] Deduced a trap along path composed of 3 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/228 variables, and 338 constraints, problems are : Problem set: 0 solved, 189 unsolved in 7443 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 12954ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 12955ms
Starting structural reductions in SI_CTL mode, iteration 1 : 111/480 places, 260/791 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13178 ms. Remains : 111/480 places, 260/791 transitions.
[2025-06-07 20:00:27] [INFO ] Flatten gal took : 6 ms
[2025-06-07 20:00:27] [INFO ] Flatten gal took : 6 ms
[2025-06-07 20:00:27] [INFO ] Input system was already deterministic with 260 transitions.
[2025-06-07 20:00:27] [INFO ] Flatten gal took : 7 ms
[2025-06-07 20:00:28] [INFO ] Flatten gal took : 4 ms
[2025-06-07 20:00:28] [INFO ] Time to serialize gal into /tmp/CTLFireability9765972883345588346.gal : 1 ms
[2025-06-07 20:00:28] [INFO ] Time to serialize properties into /tmp/CTLFireability6489798269987071166.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/CTLFireability9765972883345588346.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6489798269987071166.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 -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.01223e+17,0.04133,5444,2,190,5,2862,6,0,694,1342,0


Converting to forward existential form...Done !
original formula: (EG(((p658==0)&&(p207==1))) + (EF(((p243==0) * AG((p478==0)))) * EG((((p64==1)&&(p288==1)) + EF((p479==0))))))
=> equivalent forward existential formula: ([FwdG(Init,((p658==0)&&(p207==1)))] != FALSE + [FwdG((Init * E(TRUE U ((p243==0) * !(E(TRUE U !((p478==0)))))))...213
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.189238,8260,1,0,15,22883,28,9,3577,12634,18
FORMULA Champagne-PT-H08T0R-CTLFireability-2025-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 480/480 places, 791/791 transitions.
Graph (trivial) has 454 edges and 480 vertex of which 67 / 480 are part of one of the 12 SCC in 1 ms
Free SCC test removed 55 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 103 place count 424 transition count 625
Reduce places removed 102 places and 0 transitions.
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 1 with 170 rules applied. Total rules applied 273 place count 322 transition count 557
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 306 place count 289 transition count 557
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 306 place count 289 transition count 544
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 332 place count 276 transition count 544
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 382 place count 226 transition count 447
Iterating global reduction 3 with 50 rules applied. Total rules applied 432 place count 226 transition count 447
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 440 place count 226 transition count 439
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 440 place count 226 transition count 424
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 470 place count 211 transition count 424
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 476 place count 205 transition count 391
Iterating global reduction 4 with 6 rules applied. Total rules applied 482 place count 205 transition count 391
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 488 place count 205 transition count 385
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 0 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 5 with 190 rules applied. Total rules applied 678 place count 110 transition count 290
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 683 place count 105 transition count 254
Iterating global reduction 5 with 5 rules applied. Total rules applied 688 place count 105 transition count 254
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 693 place count 105 transition count 249
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 695 place count 103 transition count 247
Applied a total of 695 rules in 47 ms. Remains 103 /480 variables (removed 377) and now considering 247/791 (removed 544) transitions.
[2025-06-07 20:00:28] [INFO ] Flow matrix only has 101 transitions (discarded 146 similar events)
// Phase 1: matrix 101 rows 103 cols
[2025-06-07 20:00:28] [INFO ] Computed 37 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:00:28] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-07 20:00:28] [INFO ] Flow matrix only has 101 transitions (discarded 146 similar events)
[2025-06-07 20:00:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:00:28] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 20:00:28] [INFO ] Redundant transitions in 1 ms returned []
Running 171 sub problems to find dead transitions.
[2025-06-07 20:00:28] [INFO ] Flow matrix only has 101 transitions (discarded 146 similar events)
[2025-06-07 20:00:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 3/103 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 100/203 variables, 103/140 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (OVERLAPS) 0/203 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/204 variables, and 140 constraints, problems are : Problem set: 0 solved, 171 unsolved in 4505 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 3/103 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 100/203 variables, 103/140 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 171/311 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 0/203 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/204 variables, and 311 constraints, problems are : Problem set: 0 solved, 171 unsolved in 4754 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9272ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 9273ms
Starting structural reductions in SI_CTL mode, iteration 1 : 103/480 places, 247/791 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9475 ms. Remains : 103/480 places, 247/791 transitions.
[2025-06-07 20:00:37] [INFO ] Flatten gal took : 6 ms
[2025-06-07 20:00:37] [INFO ] Flatten gal took : 3 ms
[2025-06-07 20:00:37] [INFO ] Input system was already deterministic with 247 transitions.
[2025-06-07 20:00:37] [INFO ] Flatten gal took : 3 ms
[2025-06-07 20:00:37] [INFO ] Flatten gal took : 4 ms
[2025-06-07 20:00:37] [INFO ] Time to serialize gal into /tmp/CTLFireability14298173041904743472.gal : 0 ms
[2025-06-07 20:00:37] [INFO ] Time to serialize properties into /tmp/CTLFireability4389468425846575629.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/CTLFireability14298173041904743472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4389468425846575629.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.
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.3882e+16,0.044775,5444,2,170,5,2354,6,0,650,1083,0


Converting to forward existential form...Done !
original formula: EF(AG(((p437==0)||(p487==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p437==0)||(p487==0))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.127766,7108,1,0,9,16620,15,3,2933,7792,5
FORMULA Champagne-PT-H08T0R-CTLFireability-2025-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 791/791 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 432 transition count 707
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 432 transition count 707
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 103 place count 432 transition count 700
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 125 place count 410 transition count 660
Iterating global reduction 1 with 22 rules applied. Total rules applied 147 place count 410 transition count 660
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 152 place count 410 transition count 655
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 165 place count 397 transition count 633
Iterating global reduction 2 with 13 rules applied. Total rules applied 178 place count 397 transition count 633
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 182 place count 397 transition count 629
Applied a total of 182 rules in 20 ms. Remains 397 /480 variables (removed 83) and now considering 629/791 (removed 162) transitions.
// Phase 1: matrix 629 rows 397 cols
[2025-06-07 20:00:37] [INFO ] Computed 37 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:00:37] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-06-07 20:00:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:00:38] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Running 628 sub problems to find dead transitions.
[2025-06-07 20:00:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 1 (OVERLAPS) 1/397 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 628 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:00:49] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:00:50] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:00:50] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:00:50] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 4 (OVERLAPS) 629/1026 variables, 397/438 constraints. Problems are: Problem set: 0 solved, 628 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1026/1026 variables, and 438 constraints, problems are : Problem set: 0 solved, 628 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 397/397 constraints, PredecessorRefiner: 628/628 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 628 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 1 (OVERLAPS) 1/397 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 4 (OVERLAPS) 629/1026 variables, 397/438 constraints. Problems are: Problem set: 0 solved, 628 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 628/1066 constraints. Problems are: Problem set: 0 solved, 628 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:01:21] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:01:21] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:01:22] [INFO ] Deduced a trap composed of 53 places in 135 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:01:22] [INFO ] Deduced a trap composed of 53 places in 125 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:01:23] [INFO ] Deduced a trap composed of 54 places in 141 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:01:23] [INFO ] Deduced a trap composed of 62 places in 120 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:01:23] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:01:24] [INFO ] Deduced a trap composed of 63 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:01:24] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1026 variables, 9/1075 constraints. Problems are: Problem set: 0 solved, 628 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:01:31] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:01:32] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:01:32] [INFO ] Deduced a trap composed of 33 places in 139 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:01:33] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:01:34] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:01:34] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:01:34] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:01:35] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:01:35] [INFO ] Deduced a trap composed of 107 places in 115 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1026/1026 variables, and 1084 constraints, problems are : Problem set: 0 solved, 628 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 397/397 constraints, PredecessorRefiner: 628/628 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 628 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Starting structural reductions in LTL mode, iteration 1 : 397/480 places, 629/791 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60505 ms. Remains : 397/480 places, 629/791 transitions.
[2025-06-07 20:01:38] [INFO ] Flatten gal took : 9 ms
[2025-06-07 20:01:38] [INFO ] Flatten gal took : 9 ms
[2025-06-07 20:01:38] [INFO ] Input system was already deterministic with 629 transitions.
[2025-06-07 20:01:38] [INFO ] Flatten gal took : 9 ms
[2025-06-07 20:01:38] [INFO ] Flatten gal took : 9 ms
[2025-06-07 20:01:38] [INFO ] Time to serialize gal into /tmp/CTLFireability15929921623004972068.gal : 2 ms
[2025-06-07 20:01:38] [INFO ] Time to serialize properties into /tmp/CTLFireability9707963721775841430.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/CTLFireability15929921623004972068.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9707963721775841430.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-06-07 20:02:08] [INFO ] Flatten gal took : 13 ms
[2025-06-07 20:02:08] [INFO ] Applying decomposition
[2025-06-07 20:02:08] [INFO ] Flatten gal took : 19 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/graph2808131269568338544.txt' '-o' '/tmp/graph2808131269568338544.bin' '-w' '/tmp/graph2808131269568338544.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2808131269568338544.bin' '-l' '-1' '-v' '-w' '/tmp/graph2808131269568338544.weights' '-q' '0' '-e' '0.001'
[2025-06-07 20:02:08] [INFO ] Decomposing Gal with order
[2025-06-07 20:02:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:02:08] [INFO ] Removed a total of 524 redundant transitions.
[2025-06-07 20:02:08] [INFO ] Flatten gal took : 21 ms
[2025-06-07 20:02:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 6 ms.
[2025-06-07 20:02:08] [INFO ] Time to serialize gal into /tmp/CTLFireability5882236761071321280.gal : 4 ms
[2025-06-07 20:02:08] [INFO ] Time to serialize properties into /tmp/CTLFireability18260018628783505.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/CTLFireability5882236761071321280.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18260018628783505.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 -...260
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.69301e+36,0.287203,15920,2149,34,23242,749,950,31014,82,1669,0


Converting to forward existential form...Done !
original formula: EF(((EG(((A(((i3.u13.p64==1)&&(i16.u53.p288==1)) U (i11.u61.p327==1)) * EX((i29.u110.p618==0))) * (i3.u11.p55==1))) + ((((i20.u69.p374==1...732
=> equivalent forward existential formula: (([FwdG(FwdU(Init,TRUE),((!((E(!((i11.u61.p327==1)) U (!(((i3.u13.p64==1)&&(i16.u53.p288==1))) * !((i11.u61.p327...2101
Reverse transition relation is NOT exact ! Due to transitions t7, t26, t46, t56, t88, t121, t180, t226, t284, t303, t388, i1.t402, i2.t393, i3.u12.t381, i4...1094
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
(forward)formula 0,1,9.6359,309296,1,0,643868,749,6195,851369,419,2064,951734
FORMULA Champagne-PT-H08T0R-CTLFireability-2025-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 480/480 places, 791/791 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 423 transition count 683
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 423 transition count 683
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 124 place count 423 transition count 673
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 150 place count 397 transition count 635
Iterating global reduction 1 with 26 rules applied. Total rules applied 176 place count 397 transition count 635
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 183 place count 397 transition count 628
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 198 place count 382 transition count 591
Iterating global reduction 2 with 15 rules applied. Total rules applied 213 place count 382 transition count 591
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 219 place count 382 transition count 585
Applied a total of 219 rules in 20 ms. Remains 382 /480 variables (removed 98) and now considering 585/791 (removed 206) transitions.
// Phase 1: matrix 585 rows 382 cols
[2025-06-07 20:02:18] [INFO ] Computed 37 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:02:18] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-06-07 20:02:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 20:02:18] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Running 584 sub problems to find dead transitions.
[2025-06-07 20:02:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (OVERLAPS) 1/382 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 3 (OVERLAPS) 585/967 variables, 382/419 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 967/967 variables, and 419 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 382/382 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 584 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/381 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (OVERLAPS) 1/382 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/382 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 3 (OVERLAPS) 585/967 variables, 382/419 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/967 variables, 584/1003 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 20:03:09] [INFO ] Deduced a trap along path composed of 9 places in 39 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 967/967 variables, and 1004 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 382/382 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 584 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Starting structural reductions in LTL mode, iteration 1 : 382/480 places, 585/791 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60474 ms. Remains : 382/480 places, 585/791 transitions.
[2025-06-07 20:03:18] [INFO ] Flatten gal took : 8 ms
[2025-06-07 20:03:18] [INFO ] Flatten gal took : 9 ms
[2025-06-07 20:03:18] [INFO ] Input system was already deterministic with 585 transitions.
[2025-06-07 20:03:18] [INFO ] Flatten gal took : 9 ms
[2025-06-07 20:03:18] [INFO ] Flatten gal took : 9 ms
[2025-06-07 20:03:18] [INFO ] Time to serialize gal into /tmp/CTLFireability9901498017042864057.gal : 2 ms
[2025-06-07 20:03:18] [INFO ] Time to serialize properties into /tmp/CTLFireability3673592678625246871.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/CTLFireability9901498017042864057.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3673592678625246871.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 -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-06-07 20:03:48] [INFO ] Flatten gal took : 17 ms
[2025-06-07 20:03:48] [INFO ] Applying decomposition
[2025-06-07 20:03:48] [INFO ] Flatten gal took : 9 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/graph13989776684685483823.txt' '-o' '/tmp/graph13989776684685483823.bin' '-w' '/tmp/graph13989776684685483823.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13989776684685483823.bin' '-l' '-1' '-v' '-w' '/tmp/graph13989776684685483823.weights' '-q' '0' '-e' '0.001'
[2025-06-07 20:03:48] [INFO ] Decomposing Gal with order
[2025-06-07 20:03:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:03:48] [INFO ] Removed a total of 467 redundant transitions.
[2025-06-07 20:03:48] [INFO ] Flatten gal took : 19 ms
[2025-06-07 20:03:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 5 ms.
[2025-06-07 20:03:48] [INFO ] Time to serialize gal into /tmp/CTLFireability15571986254498569039.gal : 3 ms
[2025-06-07 20:03:48] [INFO ] Time to serialize properties into /tmp/CTLFireability2084879113373511684.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/CTLFireability15571986254498569039.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2084879113373511684.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,6.73946e+35,0.203188,11840,1183,34,14296,809,829,23253,72,1726,0


Converting to forward existential form...Done !
original formula: AX(((EG((EF((i13.u49.p277==0)) * E(((i2.u5.p22==1)||((i9.u34.p197==1)&&(i11.u42.p231==1))) U ((i27.u94.p542==1)||(i33.i0.u125.p696==1))))...440
=> equivalent forward existential formula: ([((EY(Init) * !((EG((E(TRUE U (i13.u49.p277==0)) * E(((i2.u5.p22==1)||((i9.u34.p197==1)&&(i11.u42.p231==1))) U ...1102
Reverse transition relation is NOT exact ! Due to transitions t7, t26, t57, t99, t120, t159, t209, t289, i0.i1.t314, i1.i1.t364, i2.t384, i3.t376, i4.t354,...1019
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Detected timeout of ITS tools.
[2025-06-07 20:04:19] [INFO ] Flatten gal took : 15 ms
[2025-06-07 20:04:19] [INFO ] Flatten gal took : 12 ms
[2025-06-07 20:04:19] [INFO ] Applying decomposition
[2025-06-07 20:04:19] [INFO ] Flatten gal took : 12 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/graph543751418972231646.txt' '-o' '/tmp/graph543751418972231646.bin' '-w' '/tmp/graph543751418972231646.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph543751418972231646.bin' '-l' '-1' '-v' '-w' '/tmp/graph543751418972231646.weights' '-q' '0' '-e' '0.001'
[2025-06-07 20:04:19] [INFO ] Decomposing Gal with order
[2025-06-07 20:04:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:04:19] [INFO ] Removed a total of 658 redundant transitions.
[2025-06-07 20:04:19] [INFO ] Flatten gal took : 24 ms
[2025-06-07 20:04:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 96 labels/synchronizations in 7 ms.
[2025-06-07 20:04:19] [INFO ] Time to serialize gal into /tmp/CTLFireability6863319124685202093.gal : 4 ms
[2025-06-07 20:04:19] [INFO ] Time to serialize properties into /tmp/CTLFireability8920750956431482530.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/CTLFireability6863319124685202093.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8920750956431482530.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 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.83556e+39,0.431783,19736,1864,59,26535,791,1079,70045,101,1911,0


Converting to forward existential form...Done !
original formula: A(A(AG(A((i6.u26.p113!=1) U (i9.u59.p276!=1))) U AF((i6.u28.p120==1))) U A((!(((i16.u77.p336==1)&&(((i31.u154.p701==1)||((i10.u48.p223==1...331
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(EX(EG(EX((i19.i1.u82.p359==1))))) U (!((!(((i16.u77.p336==1)&&(((i31.u154.p701==1)||((i1...1325
Reverse transition relation is NOT exact ! Due to transitions t7, t27, t65, t173, t269, t375, i0.t402, i1.t450, i1.u17.t457, i2.t476, i2.u6.t473, i3.t465, ...1479
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Detected timeout of ITS tools.
[2025-06-07 20:31:30] [INFO ] Applying decomposition
[2025-06-07 20:31:30] [INFO ] Flatten gal took : 13 ms
[2025-06-07 20:31:30] [INFO ] Decomposing Gal with order
[2025-06-07 20:31:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-07 20:31:30] [INFO ] Removed a total of 502 redundant transitions.
[2025-06-07 20:31:30] [INFO ] Flatten gal took : 29 ms
[2025-06-07 20:31:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 269 labels/synchronizations in 9 ms.
[2025-06-07 20:31:30] [INFO ] Time to serialize gal into /tmp/CTLFireability13405369516332802320.gal : 3 ms
[2025-06-07 20:31:30] [INFO ] Time to serialize properties into /tmp/CTLFireability8114802376981223959.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/CTLFireability13405369516332802320.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8114802376981223959.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 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.83556e+39,0.354636,18944,1206,842,25728,3384,825,69375,269,31814,0


Converting to forward existential form...Done !
original formula: A(A(AG(A((i0.i0.i0.i0.i0.u15.p113!=1) U (i1.i0.i0.i0.i0.u30.p276!=1))) U AF((i0.i0.i0.i0.i0.u15.p120==1))) U A((!(((i1.i0.u33.p336==1)&&(...474
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(EX(EG(EX((i1.i1.i0.i0.i0.i0.u39.p359==1))))) U (!((!(((i1.i0.u33.p336==1)&&(((i1.i1.i1.i...1796
Reverse transition relation is NOT exact ! Due to transitions i0.u19.t366, i0.u19.t370, i0.i0.t375, i0.i0.u18.t380, i0.i0.i0.u17.t392, i0.i0.i0.i0.u16.t402...2911
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 1
Fast SCC detection found an SCC at level 2

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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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 CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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