Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524200250.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 MedleyA-PT-20, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524200250
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 130K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-20-CTLFireability-2024-15
FORMULA_NAME MedleyA-PT-20-CTLFireability-2025-00
FORMULA_NAME MedleyA-PT-20-CTLFireability-2025-01
FORMULA_NAME MedleyA-PT-20-CTLFireability-2025-02
FORMULA_NAME MedleyA-PT-20-CTLFireability-2025-03
FORMULA_NAME MedleyA-PT-20-CTLFireability-2025-04
FORMULA_NAME MedleyA-PT-20-CTLFireability-2025-05
FORMULA_NAME MedleyA-PT-20-CTLFireability-2025-06
FORMULA_NAME MedleyA-PT-20-CTLFireability-2025-07
FORMULA_NAME MedleyA-PT-20-CTLFireability-2025-08
FORMULA_NAME MedleyA-PT-20-CTLFireability-2025-09
FORMULA_NAME MedleyA-PT-20-CTLFireability-2025-10
FORMULA_NAME MedleyA-PT-20-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748885044677

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 17:24:07] [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-02 17:24:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 17:24:07] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2025-06-02 17:24:07] [INFO ] Transformed 273 places.
[2025-06-02 17:24:07] [INFO ] Transformed 518 transitions.
[2025-06-02 17:24:07] [INFO ] Found NUPN structural information;
[2025-06-02 17:24:07] [INFO ] Parsed PT model containing 273 places and 518 transitions and 1795 arcs in 427 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
Support contains 77 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 518/518 transitions.
Discarding 81 places :
Symmetric choice reduction at 0 with 81 rule applications. Total rules 81 place count 192 transition count 437
Iterating global reduction 0 with 81 rules applied. Total rules applied 162 place count 192 transition count 437
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 164 place count 192 transition count 435
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 183 place count 173 transition count 380
Iterating global reduction 1 with 19 rules applied. Total rules applied 202 place count 173 transition count 380
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 205 place count 173 transition count 377
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 207 place count 171 transition count 373
Iterating global reduction 2 with 2 rules applied. Total rules applied 209 place count 171 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 210 place count 171 transition count 372
Applied a total of 210 rules in 96 ms. Remains 171 /273 variables (removed 102) and now considering 372/518 (removed 146) transitions.
// Phase 1: matrix 372 rows 171 cols
[2025-06-02 17:24:07] [INFO ] Computed 11 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:24:08] [INFO ] Implicit Places using invariants in 481 ms returned []
[2025-06-02 17:24:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:24:09] [INFO ] Implicit Places using invariants and state equation in 693 ms returned []
Implicit Place search using SMT with State Equation took 1227 ms to find 0 implicit places.
Running 371 sub problems to find dead transitions.
[2025-06-02 17:24: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/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:17] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:17] [INFO ] Deduced a trap composed of 59 places in 219 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:17] [INFO ] Deduced a trap composed of 62 places in 117 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:18] [INFO ] Deduced a trap composed of 88 places in 276 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:18] [INFO ] Deduced a trap composed of 97 places in 249 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:18] [INFO ] Deduced a trap composed of 95 places in 272 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:18] [INFO ] Deduced a trap composed of 89 places in 228 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:19] [INFO ] Deduced a trap composed of 89 places in 244 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:19] [INFO ] Deduced a trap composed of 102 places in 229 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:19] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:20] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:20] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:25] [INFO ] Deduced a trap composed of 103 places in 238 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:25] [INFO ] Deduced a trap composed of 107 places in 184 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:25] [INFO ] Deduced a trap composed of 107 places in 196 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:25] [INFO ] Deduced a trap composed of 106 places in 201 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:26] [INFO ] Deduced a trap composed of 107 places in 224 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:26] [INFO ] Deduced a trap composed of 110 places in 236 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:26] [INFO ] Deduced a trap composed of 110 places in 303 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:26] [INFO ] Deduced a trap composed of 102 places in 165 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:27] [INFO ] Deduced a trap composed of 88 places in 214 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:27] [INFO ] Deduced a trap composed of 94 places in 240 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:27] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:28] [INFO ] Deduced a trap composed of 89 places in 219 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:28] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 13/36 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:32] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:34] [INFO ] Deduced a trap composed of 94 places in 257 ms of which 31 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 171/543 variables, and 38 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/171 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:44] [INFO ] Deduced a trap composed of 111 places in 235 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:44] [INFO ] Deduced a trap composed of 111 places in 230 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:44] [INFO ] Deduced a trap composed of 111 places in 203 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:44] [INFO ] Deduced a trap composed of 117 places in 230 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:44] [INFO ] Deduced a trap composed of 118 places in 240 ms of which 47 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 5/43 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:47] [INFO ] Deduced a trap composed of 102 places in 202 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:47] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:24:50] [INFO ] Deduced a trap composed of 96 places in 206 ms of which 24 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 8 (OVERLAPS) 372/543 variables, 171/217 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 371/588 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:00] [INFO ] Deduced a trap composed of 63 places in 178 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:01] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:01] [INFO ] Deduced a trap composed of 44 places in 223 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:01] [INFO ] Deduced a trap composed of 53 places in 209 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:03] [INFO ] Deduced a trap composed of 98 places in 204 ms of which 30 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 543/543 variables, and 593 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60632ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 60667ms
Starting structural reductions in LTL mode, iteration 1 : 171/273 places, 372/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62047 ms. Remains : 171/273 places, 372/518 transitions.
Support contains 77 out of 171 places after structural reductions.
[2025-06-02 17:25:10] [INFO ] Flatten gal took : 121 ms
[2025-06-02 17:25:10] [INFO ] Flatten gal took : 63 ms
[2025-06-02 17:25:10] [INFO ] Input system was already deterministic with 372 transitions.
Support contains 72 out of 171 places (down from 77) after GAL structural reductions.
RANDOM walk for 40000 steps (42 resets) in 2807 ms. (14 steps per ms) remains 28/59 properties
BEST_FIRST walk for 4003 steps (14 resets) in 37 ms. (105 steps per ms) remains 25/28 properties
BEST_FIRST walk for 4004 steps (9 resets) in 18 ms. (210 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4004 steps (15 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (19 resets) in 49 ms. (80 steps per ms) remains 22/24 properties
BEST_FIRST walk for 4004 steps (17 resets) in 29 ms. (133 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4002 steps (15 resets) in 29 ms. (133 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (12 resets) in 27 ms. (142 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (22 resets) in 19 ms. (200 steps per ms) remains 18/20 properties
BEST_FIRST walk for 4003 steps (17 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (17 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (17 resets) in 12 ms. (307 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (15 resets) in 15 ms. (250 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4004 steps (15 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (16 resets) in 15 ms. (250 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (15 resets) in 11 ms. (333 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (13 resets) in 12 ms. (307 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (16 resets) in 13 ms. (285 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (16 resets) in 10 ms. (364 steps per ms) remains 13/14 properties
[2025-06-02 17:25:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 112/135 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/139 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 32/171 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 372/543 variables, 171/182 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/543 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 543/543 variables, and 182 constraints, problems are : Problem set: 1 solved, 12 unsolved in 1289 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 1 (OVERLAPS) 106/126 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 13/139 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 32/171 variables, 2/11 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 372/543 variables, 171/182 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 11/193 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/543 variables, 0/193 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/543 variables, 0/193 constraints. Problems are: Problem set: 2 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 543/543 variables, and 193 constraints, problems are : Problem set: 2 solved, 11 unsolved in 1779 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 11/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3084ms problems are : Problem set: 2 solved, 11 unsolved
Parikh walk visited 10 properties in 1902 ms.
Support contains 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 372/372 transitions.
Graph (trivial) has 138 edges and 171 vertex of which 23 / 171 are part of one of the 3 SCC in 3 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 31 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 151 transition count 336
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 148 transition count 334
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 9 place count 148 transition count 328
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 21 place count 142 transition count 328
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 23 place count 142 transition count 326
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 50 place count 115 transition count 273
Iterating global reduction 3 with 27 rules applied. Total rules applied 77 place count 115 transition count 273
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 9 rules applied. Total rules applied 86 place count 115 transition count 264
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 90 place count 113 transition count 262
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 90 place count 113 transition count 258
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 98 place count 109 transition count 258
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 99 place count 109 transition count 257
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 101 place count 107 transition count 251
Iterating global reduction 6 with 2 rules applied. Total rules applied 103 place count 107 transition count 251
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 133 place count 92 transition count 236
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 139 place count 86 transition count 218
Iterating global reduction 6 with 6 rules applied. Total rules applied 145 place count 86 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 147 place count 86 transition count 216
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 149 place count 84 transition count 212
Iterating global reduction 7 with 2 rules applied. Total rules applied 151 place count 84 transition count 212
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 153 place count 82 transition count 206
Iterating global reduction 7 with 2 rules applied. Total rules applied 155 place count 82 transition count 206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 157 place count 82 transition count 204
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 175 place count 73 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 188 place count 73 transition count 209
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 190 place count 71 transition count 203
Iterating global reduction 8 with 2 rules applied. Total rules applied 192 place count 71 transition count 203
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 194 place count 71 transition count 201
Free-agglomeration rule applied 20 times.
Iterating global reduction 9 with 20 rules applied. Total rules applied 214 place count 71 transition count 181
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 26 rules applied. Total rules applied 240 place count 51 transition count 175
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 246 place count 48 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 247 place count 47 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 248 place count 46 transition count 171
Applied a total of 248 rules in 141 ms. Remains 46 /171 variables (removed 125) and now considering 171/372 (removed 201) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 46/171 places, 171/372 transitions.
RANDOM walk for 3230 steps (46 resets) in 66 ms. (48 steps per ms) remains 0/1 properties
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2025-06-02 17:25:16] [INFO ] Flatten gal took : 37 ms
[2025-06-02 17:25:16] [INFO ] Flatten gal took : 30 ms
[2025-06-02 17:25:16] [INFO ] Input system was already deterministic with 372 transitions.
Computed a total of 15 stabilizing places and 20 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 372/372 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 137 transition count 310
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 137 transition count 310
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 72 place count 137 transition count 306
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 88 place count 121 transition count 268
Iterating global reduction 1 with 16 rules applied. Total rules applied 104 place count 121 transition count 268
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 107 place count 121 transition count 265
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 109 place count 119 transition count 261
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 119 transition count 261
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 113 place count 117 transition count 255
Iterating global reduction 2 with 2 rules applied. Total rules applied 115 place count 117 transition count 255
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 117 place count 117 transition count 253
Applied a total of 117 rules in 13 ms. Remains 117 /171 variables (removed 54) and now considering 253/372 (removed 119) transitions.
// Phase 1: matrix 253 rows 117 cols
[2025-06-02 17:25:16] [INFO ] Computed 11 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:25:17] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-06-02 17:25:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:25:17] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2025-06-02 17:25:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:20] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:20] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:21] [INFO ] Deduced a trap composed of 62 places in 182 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:21] [INFO ] Deduced a trap composed of 68 places in 157 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:21] [INFO ] Deduced a trap composed of 63 places in 153 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:21] [INFO ] Deduced a trap composed of 63 places in 144 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:21] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:21] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:22] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:22] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:24] [INFO ] Deduced a trap composed of 63 places in 157 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:24] [INFO ] Deduced a trap composed of 68 places in 131 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:24] [INFO ] Deduced a trap composed of 62 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:24] [INFO ] Deduced a trap composed of 64 places in 145 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:25] [INFO ] Deduced a trap composed of 67 places in 156 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:25] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:26] [INFO ] Deduced a trap composed of 63 places in 141 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 253/370 variables, 117/145 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:32] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:33] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:33] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 3/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 9 (OVERLAPS) 0/370 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 148 constraints, problems are : Problem set: 0 solved, 252 unsolved in 24052 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 17/28 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (OVERLAPS) 253/370 variables, 117/145 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 252/397 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:44] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:44] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 2/399 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:48] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:48] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:49] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 14 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 3/402 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:55] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:25:55] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 2/404 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 3/407 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 407 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 54150ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 54152ms
Starting structural reductions in LTL mode, iteration 1 : 117/171 places, 253/372 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54527 ms. Remains : 117/171 places, 253/372 transitions.
[2025-06-02 17:26:11] [INFO ] Flatten gal took : 17 ms
[2025-06-02 17:26:11] [INFO ] Flatten gal took : 17 ms
[2025-06-02 17:26:11] [INFO ] Input system was already deterministic with 253 transitions.
[2025-06-02 17:26:11] [INFO ] Flatten gal took : 16 ms
[2025-06-02 17:26:11] [INFO ] Flatten gal took : 16 ms
[2025-06-02 17:26:11] [INFO ] Time to serialize gal into /tmp/CTLFireability10545994684685082839.gal : 38 ms
[2025-06-02 17:26:11] [INFO ] Time to serialize properties into /tmp/CTLFireability8353210801926897799.ctl : 8 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/CTLFireability10545994684685082839.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8353210801926897799.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,6.46299e+08,23.2081,413836,2,17051,5,1.20821e+06,6,0,723,1.76831e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-02 17:26:41] [INFO ] Flatten gal took : 15 ms
[2025-06-02 17:26:41] [INFO ] Applying decomposition
[2025-06-02 17:26:41] [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/graph2234218093617683979.txt' '-o' '/tmp/graph2234218093617683979.bin' '-w' '/tmp/graph2234218093617683979.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2234218093617683979.bin' '-l' '-1' '-v' '-w' '/tmp/graph2234218093617683979.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:26:41] [INFO ] Decomposing Gal with order
[2025-06-02 17:26:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:26:42] [INFO ] Removed a total of 378 redundant transitions.
[2025-06-02 17:26:42] [INFO ] Flatten gal took : 94 ms
[2025-06-02 17:26:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 12 ms.
[2025-06-02 17:26:42] [INFO ] Time to serialize gal into /tmp/CTLFireability3238347115136577279.gal : 9 ms
[2025-06-02 17:26:42] [INFO ] Time to serialize properties into /tmp/CTLFireability2179342539409850893.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/CTLFireability3238347115136577279.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2179342539409850893.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.46299e+08,0.763154,22780,718,55,36101,833,473,64144,91,1404,0


Converting to forward existential form...Done !
original formula: EF(!(E((!(EG((i0.u0.p2==1))) + AX((i0.u6.p27==1))) U EX(!((((i1.u1.p10==1)&&(u3.p17==1))&&(i3.u15.p114==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((!(EG((i0.u0.p2==1))) + !(EX(!((i0.u6.p27==1))))) U EX(!((((i1.u1.p10==1)&&(u3.p17==1))&...188
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t41, t92, t94, t163, t164, t165, t166, t167, t168, t173, t174, t175, t189, t190, t19...596
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,1.55428,35196,1,0,54678,2055,2475,132014,472,4669,145408
FORMULA MedleyA-PT-20-CTLFireability-2025-00 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 : 171/171 places, 372/372 transitions.
Graph (trivial) has 138 edges and 171 vertex of which 23 / 171 are part of one of the 3 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 150 transition count 338
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 147 transition count 336
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 9 place count 147 transition count 330
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 21 place count 141 transition count 330
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 48 place count 114 transition count 277
Iterating global reduction 2 with 27 rules applied. Total rules applied 75 place count 114 transition count 277
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 85 place count 114 transition count 267
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 89 place count 112 transition count 265
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 89 place count 112 transition count 261
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 97 place count 108 transition count 261
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 99 place count 106 transition count 255
Iterating global reduction 4 with 2 rules applied. Total rules applied 101 place count 106 transition count 255
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 127 place count 93 transition count 242
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 133 place count 87 transition count 224
Iterating global reduction 4 with 6 rules applied. Total rules applied 139 place count 87 transition count 224
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 141 place count 87 transition count 222
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 143 place count 85 transition count 218
Iterating global reduction 5 with 2 rules applied. Total rules applied 145 place count 85 transition count 218
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 147 place count 83 transition count 212
Iterating global reduction 5 with 2 rules applied. Total rules applied 149 place count 83 transition count 212
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 151 place count 83 transition count 210
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 154 place count 83 transition count 207
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 160 place count 80 transition count 204
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 162 place count 78 transition count 198
Iterating global reduction 6 with 2 rules applied. Total rules applied 164 place count 78 transition count 198
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 166 place count 78 transition count 196
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 168 place count 76 transition count 194
Applied a total of 168 rules in 121 ms. Remains 76 /171 variables (removed 95) and now considering 194/372 (removed 178) transitions.
[2025-06-02 17:26:43] [INFO ] Flow matrix only has 184 transitions (discarded 10 similar events)
// Phase 1: matrix 184 rows 76 cols
[2025-06-02 17:26:43] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:26:44] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-06-02 17:26:44] [INFO ] Flow matrix only has 184 transitions (discarded 10 similar events)
[2025-06-02 17:26:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:26:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 17:26:44] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:26:44] [INFO ] Redundant transitions in 13 ms returned []
Running 168 sub problems to find dead transitions.
[2025-06-02 17:26:44] [INFO ] Flow matrix only has 184 transitions (discarded 10 similar events)
[2025-06-02 17:26:44] [INFO ] Invariant cache hit.
[2025-06-02 17:26:44] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 2/75 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 1/76 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:48] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:49] [INFO ] Deduced a trap composed of 43 places in 121 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (OVERLAPS) 183/259 variables, 76/89 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:26:57] [INFO ] Deduced a trap along path composed of 2 places in 22 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/259 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:27:00] [INFO ] Deduced a trap along path composed of 2 places in 32 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/259 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/259 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 15 (OVERLAPS) 0/259 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/260 variables, and 92 constraints, problems are : Problem set: 0 solved, 168 unsolved in 22382 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 2/75 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 1/76 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:27:07] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (OVERLAPS) 183/259 variables, 76/90 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 168/259 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/259 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/259 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:27:19] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 3 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/259 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/259 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 16 (OVERLAPS) 0/259 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/260 variables, and 262 constraints, problems are : Problem set: 0 solved, 168 unsolved in 22020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 44461ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 44463ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/171 places, 194/372 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44986 ms. Remains : 76/171 places, 194/372 transitions.
[2025-06-02 17:27:28] [INFO ] Flatten gal took : 12 ms
[2025-06-02 17:27:28] [INFO ] Flatten gal took : 13 ms
[2025-06-02 17:27:28] [INFO ] Input system was already deterministic with 194 transitions.
[2025-06-02 17:27:28] [INFO ] Flatten gal took : 11 ms
[2025-06-02 17:27:28] [INFO ] Flatten gal took : 17 ms
[2025-06-02 17:27:28] [INFO ] Time to serialize gal into /tmp/CTLFireability9368171276701910761.gal : 2 ms
[2025-06-02 17:27:28] [INFO ] Time to serialize properties into /tmp/CTLFireability7147333293209936432.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/CTLFireability9368171276701910761.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7147333293209936432.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,8.00904e+06,10.6296,176228,2,7469,5,471009,6,0,497,632674,0


Converting to forward existential form...Done !
original formula: !(E((((p20==1)&&(p145==1)) + AF((p119==1))) U EF(EG(((p124==1)&&(p254==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(FwdU(Init,(((p20==1)&&(p145==1)) + !(EG(!((p119==1)))))),TRUE),((p124==1)&&(p254==1)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t11, t14, t18, t25, t27, t28, t31, t34, t35, t41, t52, t56, t68, t79, t80, t81, t...479
Detected timeout of ITS tools.
[2025-06-02 17:27:58] [INFO ] Flatten gal took : 11 ms
[2025-06-02 17:27:58] [INFO ] Applying decomposition
[2025-06-02 17:27:58] [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/graph6702196425847363394.txt' '-o' '/tmp/graph6702196425847363394.bin' '-w' '/tmp/graph6702196425847363394.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6702196425847363394.bin' '-l' '-1' '-v' '-w' '/tmp/graph6702196425847363394.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:27:58] [INFO ] Decomposing Gal with order
[2025-06-02 17:27:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:27:58] [INFO ] Removed a total of 305 redundant transitions.
[2025-06-02 17:27:58] [INFO ] Flatten gal took : 22 ms
[2025-06-02 17:27:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 7 ms.
[2025-06-02 17:27:59] [INFO ] Time to serialize gal into /tmp/CTLFireability16344230169610414585.gal : 3 ms
[2025-06-02 17:27:59] [INFO ] Time to serialize properties into /tmp/CTLFireability3307773579361357769.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/CTLFireability16344230169610414585.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3307773579361357769.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,8.00904e+06,0.166811,8120,233,160,7227,869,359,13100,102,3749,0


Converting to forward existential form...Done !
original formula: !(E((((u2.p20==1)&&(i4.u7.p145==1)) + AF((i4.u9.p119==1))) U EF(EG(((i4.u9.p124==1)&&(u14.p254==1))))))
=> equivalent forward existential formula: [FwdG(FwdU(FwdU(Init,(((u2.p20==1)&&(i4.u7.p145==1)) + !(EG(!((i4.u9.p119==1)))))),TRUE),((i4.u9.p124==1)&&(u14....174
Reverse transition relation is NOT exact ! Due to transitions t52, t56, t68, t82, t83, t84, t94, t95, t96, t115, t116, t117, t142, t143, t144, t146, t149, ...453
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,3.7795,99896,1,0,148575,11864,2298,355767,582,69601,324255
FORMULA MedleyA-PT-20-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 372/372 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 139 transition count 314
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 139 transition count 314
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 68 place count 139 transition count 310
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 82 place count 125 transition count 277
Iterating global reduction 1 with 14 rules applied. Total rules applied 96 place count 125 transition count 277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 98 place count 125 transition count 275
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 123 transition count 271
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 123 transition count 271
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 104 place count 121 transition count 265
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 121 transition count 265
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 108 place count 121 transition count 263
Applied a total of 108 rules in 13 ms. Remains 121 /171 variables (removed 50) and now considering 263/372 (removed 109) transitions.
// Phase 1: matrix 263 rows 121 cols
[2025-06-02 17:28:02] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:28:02] [INFO ] Implicit Places using invariants in 147 ms returned []
[2025-06-02 17:28:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:28:03] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2025-06-02 17:28:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:07] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:07] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:07] [INFO ] Deduced a trap composed of 65 places in 176 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:07] [INFO ] Deduced a trap composed of 71 places in 119 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:07] [INFO ] Deduced a trap composed of 72 places in 180 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:07] [INFO ] Deduced a trap composed of 75 places in 178 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:08] [INFO ] Deduced a trap composed of 66 places in 119 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:08] [INFO ] Deduced a trap composed of 66 places in 114 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:08] [INFO ] Deduced a trap composed of 68 places in 159 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:08] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:08] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:08] [INFO ] Deduced a trap composed of 75 places in 135 ms of which 21 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:11] [INFO ] Deduced a trap composed of 66 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:11] [INFO ] Deduced a trap composed of 71 places in 130 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:12] [INFO ] Deduced a trap composed of 65 places in 149 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:12] [INFO ] Deduced a trap composed of 66 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:12] [INFO ] Deduced a trap composed of 66 places in 137 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:12] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:14] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 15 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:15] [INFO ] Deduced a trap composed of 72 places in 140 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:16] [INFO ] Deduced a trap composed of 71 places in 146 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 263/384 variables, 121/153 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:25] [INFO ] Deduced a trap along path composed of 3 places in 58 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:26] [INFO ] Deduced a trap along path composed of 3 places in 44 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:26] [INFO ] Deduced a trap along path composed of 3 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 3/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/384 variables, and 156 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/384 variables, 121/153 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 262/415 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:38] [INFO ] Deduced a trap composed of 73 places in 176 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:38] [INFO ] Deduced a trap composed of 72 places in 185 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:38] [INFO ] Deduced a trap composed of 72 places in 188 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:38] [INFO ] Deduced a trap composed of 76 places in 180 ms of which 25 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 4/419 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:43] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:44] [INFO ] Deduced a trap composed of 71 places in 119 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 2/421 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:50] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:50] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 15 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 2/423 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:58] [INFO ] Deduced a trap composed of 79 places in 110 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:28:58] [INFO ] Deduced a trap composed of 73 places in 135 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 2/425 constraints. Problems are: Problem set: 0 solved, 262 unsolved
SMT process timed out in 60093ms, After SMT, problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in LTL mode, iteration 1 : 121/171 places, 263/372 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60528 ms. Remains : 121/171 places, 263/372 transitions.
[2025-06-02 17:29:03] [INFO ] Flatten gal took : 11 ms
[2025-06-02 17:29:03] [INFO ] Flatten gal took : 11 ms
[2025-06-02 17:29:03] [INFO ] Input system was already deterministic with 263 transitions.
[2025-06-02 17:29:03] [INFO ] Flatten gal took : 10 ms
[2025-06-02 17:29:03] [INFO ] Flatten gal took : 11 ms
[2025-06-02 17:29:03] [INFO ] Time to serialize gal into /tmp/CTLFireability13972651007044605725.gal : 2 ms
[2025-06-02 17:29:03] [INFO ] Time to serialize properties into /tmp/CTLFireability16917396989551813546.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/CTLFireability13972651007044605725.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16917396989551813546.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,7.72638e+08,26.3073,459020,2,18418,5,1.34763e+06,6,0,749,1.92923e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-02 17:29:33] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:29:33] [INFO ] Applying decomposition
[2025-06-02 17:29:33] [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/graph16327189627822553778.txt' '-o' '/tmp/graph16327189627822553778.bin' '-w' '/tmp/graph16327189627822553778.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16327189627822553778.bin' '-l' '-1' '-v' '-w' '/tmp/graph16327189627822553778.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:29:33] [INFO ] Decomposing Gal with order
[2025-06-02 17:29:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:29:33] [INFO ] Removed a total of 389 redundant transitions.
[2025-06-02 17:29:33] [INFO ] Flatten gal took : 26 ms
[2025-06-02 17:29:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 7 ms.
[2025-06-02 17:29:33] [INFO ] Time to serialize gal into /tmp/CTLFireability17509097089690594008.gal : 3 ms
[2025-06-02 17:29:33] [INFO ] Time to serialize properties into /tmp/CTLFireability1864324679802599285.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/CTLFireability17509097089690594008.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1864324679802599285.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.72638e+08,0.823776,23536,701,86,36306,886,480,66422,112,2110,0


Converting to forward existential form...Done !
original formula: EG(AX((!(E(!((((i4.u1.p10==1)&&(u3.p17==1))&&(i5.u19.p182==1))) U EF((((i4.u1.p10==1)&&(u4.p21==1))&&(i2.u12.p107==1))))) + E((i1.u11.p90...182
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((!(E(!((((i4.u1.p10==1)&&(u3.p17==1))&&(i5.u19.p182==1))) U E(TRUE U (((i4.u1.p10==1)&&(u4.p21...237
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t42, t96, t98, t180, t181, t182, t199, t200, t201, t205, t206, t207, t209, t210, t21...602
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 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
(forward)formula 0,0,23.5873,501412,1,0,804376,22517,2965,1.85544e+06,594,121860,1799751
FORMULA MedleyA-PT-20-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 372/372 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 136 transition count 307
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 136 transition count 307
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 75 place count 136 transition count 302
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 91 place count 120 transition count 264
Iterating global reduction 1 with 16 rules applied. Total rules applied 107 place count 120 transition count 264
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 110 place count 120 transition count 261
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 112 place count 118 transition count 257
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 118 transition count 257
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 116 place count 116 transition count 251
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 116 transition count 251
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 120 place count 116 transition count 249
Applied a total of 120 rules in 15 ms. Remains 116 /171 variables (removed 55) and now considering 249/372 (removed 123) transitions.
// Phase 1: matrix 249 rows 116 cols
[2025-06-02 17:29:57] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:29:57] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-06-02 17:29:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:29:57] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2025-06-02 17:29:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:01] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:01] [INFO ] Deduced a trap composed of 47 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-02 17:30:01] [INFO ] Deduced a trap composed of 61 places in 181 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:01] [INFO ] Deduced a trap composed of 67 places in 178 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:01] [INFO ] Deduced a trap composed of 67 places in 191 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:02] [INFO ] Deduced a trap composed of 70 places in 146 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:02] [INFO ] Deduced a trap composed of 62 places in 132 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:02] [INFO ] Deduced a trap composed of 64 places in 141 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:02] [INFO ] Deduced a trap composed of 67 places in 140 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:02] [INFO ] Deduced a trap composed of 67 places in 134 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:02] [INFO ] Deduced a trap composed of 70 places in 138 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:02] [INFO ] Deduced a trap composed of 67 places in 139 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:05] [INFO ] Deduced a trap composed of 62 places in 168 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:05] [INFO ] Deduced a trap composed of 62 places in 131 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:05] [INFO ] Deduced a trap composed of 67 places in 145 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:06] [INFO ] Deduced a trap composed of 61 places in 129 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:06] [INFO ] Deduced a trap composed of 62 places in 124 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:06] [INFO ] Deduced a trap composed of 62 places in 128 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:06] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:08] [INFO ] Deduced a trap composed of 67 places in 117 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:08] [INFO ] Deduced a trap composed of 67 places in 144 ms of which 24 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 249/365 variables, 116/148 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:17] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:18] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:18] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 248 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 365/365 variables, and 151 constraints, problems are : Problem set: 0 solved, 248 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:28] [INFO ] Deduced a trap composed of 68 places in 145 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:28] [INFO ] Deduced a trap composed of 68 places in 160 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:28] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:28] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:30] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 16 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 249/365 variables, 116/153 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 248/401 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:34] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:34] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 16 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:40] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:30:40] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 15 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/365 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/365 variables, 3/408 constraints. Problems are: Problem set: 0 solved, 248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/365 variables, and 408 constraints, problems are : Problem set: 0 solved, 248 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60079ms problems are : Problem set: 0 solved, 248 unsolved
Search for dead transitions found 0 dead transitions in 60080ms
Starting structural reductions in LTL mode, iteration 1 : 116/171 places, 249/372 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60418 ms. Remains : 116/171 places, 249/372 transitions.
[2025-06-02 17:30:57] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:30:57] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:30:57] [INFO ] Input system was already deterministic with 249 transitions.
[2025-06-02 17:30:57] [INFO ] Flatten gal took : 14 ms
[2025-06-02 17:30:57] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:30:57] [INFO ] Time to serialize gal into /tmp/CTLFireability7031598626963787646.gal : 3 ms
[2025-06-02 17:30:57] [INFO ] Time to serialize properties into /tmp/CTLFireability11754989353408477589.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/CTLFireability7031598626963787646.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11754989353408477589.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,6.17259e+08,21.8177,392460,2,17357,5,1.19708e+06,6,0,715,1.74293e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-02 17:31:27] [INFO ] Flatten gal took : 7 ms
[2025-06-02 17:31:27] [INFO ] Applying decomposition
[2025-06-02 17:31:27] [INFO ] Flatten gal took : 7 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/graph6914450756386474671.txt' '-o' '/tmp/graph6914450756386474671.bin' '-w' '/tmp/graph6914450756386474671.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6914450756386474671.bin' '-l' '-1' '-v' '-w' '/tmp/graph6914450756386474671.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:31:27] [INFO ] Decomposing Gal with order
[2025-06-02 17:31:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:31:27] [INFO ] Removed a total of 345 redundant transitions.
[2025-06-02 17:31:27] [INFO ] Flatten gal took : 21 ms
[2025-06-02 17:31:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 5 ms.
[2025-06-02 17:31:27] [INFO ] Time to serialize gal into /tmp/CTLFireability17839734630936999751.gal : 3 ms
[2025-06-02 17:31:27] [INFO ] Time to serialize properties into /tmp/CTLFireability3015516861498838074.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/CTLFireability17839734630936999751.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3015516861498838074.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.17259e+08,0.886579,19640,534,89,30452,1652,431,51051,106,3648,0


Converting to forward existential form...Done !
original formula: EF(AX(((u4.p16==1)&&(i4.u13.p145==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((u4.p16==1)&&(i4.u13.p145==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t41, t91, t93, t169, t170, t171, t172, t173, t174, t198, t199, t200, t201, t202, t20...563
(forward)formula 0,1,1.18738,19768,1,0,30452,1652,2051,51085,532,5891,76486
FORMULA MedleyA-PT-20-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 372/372 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 145 transition count 324
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 145 transition count 324
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 145 transition count 322
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 67 place count 132 transition count 290
Iterating global reduction 1 with 13 rules applied. Total rules applied 80 place count 132 transition count 290
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 82 place count 132 transition count 288
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 131 transition count 286
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 131 transition count 286
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 130 transition count 283
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 130 transition count 283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 130 transition count 282
Applied a total of 87 rules in 11 ms. Remains 130 /171 variables (removed 41) and now considering 282/372 (removed 90) transitions.
// Phase 1: matrix 282 rows 130 cols
[2025-06-02 17:31:29] [INFO ] Computed 11 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:31:29] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-06-02 17:31:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:31:29] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2025-06-02 17:31:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:33] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:33] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:33] [INFO ] Deduced a trap composed of 70 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-02 17:31:33] [INFO ] Deduced a trap composed of 75 places in 191 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:34] [INFO ] Deduced a trap composed of 75 places in 189 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:34] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:34] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:36] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:36] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:37] [INFO ] Deduced a trap composed of 69 places in 137 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:37] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:37] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:37] [INFO ] Deduced a trap composed of 76 places in 151 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:37] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (OVERLAPS) 282/412 variables, 130/155 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:46] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:46] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:31:46] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 3/158 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 9 (OVERLAPS) 0/412 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 412/412 variables, and 158 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 282/412 variables, 130/155 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 281/436 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:04] [INFO ] Deduced a trap composed of 79 places in 157 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:05] [INFO ] Deduced a trap composed of 79 places in 173 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:05] [INFO ] Deduced a trap composed of 82 places in 176 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:05] [INFO ] Deduced a trap composed of 82 places in 180 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:05] [INFO ] Deduced a trap composed of 76 places in 196 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:05] [INFO ] Deduced a trap composed of 82 places in 213 ms of which 42 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 6/442 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 3/445 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:32:22] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 9 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/412 variables, and 446 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Starting structural reductions in LTL mode, iteration 1 : 130/171 places, 282/372 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60456 ms. Remains : 130/171 places, 282/372 transitions.
[2025-06-02 17:32:29] [INFO ] Flatten gal took : 12 ms
[2025-06-02 17:32:29] [INFO ] Flatten gal took : 12 ms
[2025-06-02 17:32:29] [INFO ] Input system was already deterministic with 282 transitions.
[2025-06-02 17:32:29] [INFO ] Flatten gal took : 13 ms
[2025-06-02 17:32:29] [INFO ] Flatten gal took : 13 ms
[2025-06-02 17:32:29] [INFO ] Time to serialize gal into /tmp/CTLFireability10039944377392760123.gal : 3 ms
[2025-06-02 17:32:29] [INFO ] Time to serialize properties into /tmp/CTLFireability6928030831030947055.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/CTLFireability10039944377392760123.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6928030831030947055.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-02 17:32:59] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:32:59] [INFO ] Applying decomposition
[2025-06-02 17:32:59] [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/graph5261421316822861752.txt' '-o' '/tmp/graph5261421316822861752.bin' '-w' '/tmp/graph5261421316822861752.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5261421316822861752.bin' '-l' '-1' '-v' '-w' '/tmp/graph5261421316822861752.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:32:59] [INFO ] Decomposing Gal with order
[2025-06-02 17:32:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:32:59] [INFO ] Removed a total of 405 redundant transitions.
[2025-06-02 17:32:59] [INFO ] Flatten gal took : 25 ms
[2025-06-02 17:32:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 7 ms.
[2025-06-02 17:32:59] [INFO ] Time to serialize gal into /tmp/CTLFireability5881101254847196753.gal : 3 ms
[2025-06-02 17:32:59] [INFO ] Time to serialize properties into /tmp/CTLFireability10884702048840095324.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/CTLFireability5881101254847196753.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10884702048840095324.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.18528e+09,1.68264,38484,809,66,66753,971,568,106297,105,2452,0


Converting to forward existential form...Done !
original formula: (EX(((AX(((((i0.u1.p10==1)&&(i6.u5.p25==1))&&(i4.u13.p107==1))||((i0.u1.p9==1)&&(i9.u30.p265==1)))) * (i9.u30.p264==1)) + A(((((A(((i0.u1...403
=> equivalent forward existential formula: (([((EY(Init) * (i9.u30.p264==1)) * !(EX(!(((((i0.u1.p10==1)&&(i6.u5.p25==1))&&(i4.u13.p107==1))||((i0.u1.p9==1)...733
Reverse transition relation is NOT exact ! Due to transitions t1, t52, t108, t109, t111, t180, t181, t182, t183, t184, t185, t187, t188, t189, t190, t191, ...755
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 372/372 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 139 transition count 314
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 139 transition count 314
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 68 place count 139 transition count 310
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 83 place count 124 transition count 275
Iterating global reduction 1 with 15 rules applied. Total rules applied 98 place count 124 transition count 275
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 101 place count 124 transition count 272
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 123 transition count 270
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 123 transition count 270
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 122 transition count 267
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 122 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 122 transition count 266
Applied a total of 106 rules in 10 ms. Remains 122 /171 variables (removed 49) and now considering 266/372 (removed 106) transitions.
// Phase 1: matrix 266 rows 122 cols
[2025-06-02 17:33:29] [INFO ] Computed 11 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:33:30] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-02 17:33:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:33:30] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2025-06-02 17:33:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (OVERLAPS) 1/122 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:33] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:33] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:33] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:34] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:34] [INFO ] Deduced a trap composed of 71 places in 106 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:34] [INFO ] Deduced a trap composed of 76 places in 171 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:34] [INFO ] Deduced a trap composed of 65 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-02 17:33:34] [INFO ] Deduced a trap composed of 65 places in 141 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:34] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:34] [INFO ] Deduced a trap composed of 70 places in 141 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:35] [INFO ] Deduced a trap composed of 70 places in 144 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:35] [INFO ] Deduced a trap composed of 73 places in 147 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:35] [INFO ] Deduced a trap composed of 71 places in 141 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:35] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:35] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:36] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:36] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:36] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:36] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:36] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:36] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:36] [INFO ] Deduced a trap composed of 15 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-02 17:33:37] [INFO ] Deduced a trap composed of 71 places in 147 ms of which 25 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 266/388 variables, 122/156 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:41] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:41] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 14 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:44] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:45] [INFO ] Deduced a trap along path composed of 3 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:45] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:33:53] [INFO ] Deduced a trap along path composed of 9 places in 40 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/388 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 1.0)
(t2 1.0)
(t3 0.0)
(t4 0.0)
(t5 0.0)
(t6 1.0)
(t7 1.0)
(t8 0.0)
(t9 0.0)
(t10 0.0)
(t11 1.0)
(t12 1.0)
(t13 1.0)
(t14 0.0)
(t15 1.0)
(t16 1.0)
(t17 1.0)
(t18 0.0)
(t19 0.0)
(t20 0.0)
(t21 1.0)
(t22 0.0)
(t23 1.0)
(t24 0.0)
(t25 0.0)
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 0.0)
(t30 0.0)
(t31 0.0)
(t32 0.0)
(t33 0.0)
(t34 0.0)
(t35 0.0)
(t36 0.0)
(t37 0.0)
(t38 0.0)
(t39 0.0)
(t40 0.0)
(t41 1.0)
(t42 1.0)
(t43 1.0)
(t44 1.0)
(t45 0.0)
(t46 1.0)
(t47 0.0)
(t48 0.0)
(t49 0.0)
(t50 0.0)
(t51 0.0)
(t52 0.0)
(t53 0.0)
(t54 0.0)
(t55 0.0)
(t56 0.0)
(t57 0.0)
(t58 0.0)
(t59 0.0)
(t60 0.0)
(t61 0.0)
(t62 0.0)
(t63 0.0)
(t64 0.0)
(t65 0.0)
(t66 0.0)
(t67 1.0)
(t68 1.0)
(t69 0.0)
(t70 2.0)
(t71 1.0)
(t72 1.0)
(t73 0.0)
(t74 1.0)
(t75 0.0)
(t76 0.0)
(t77 0.0)
(t78 0.0)
(t79 0.0)
(t80 0.0)
(t81 0.0)
(t82 0.0)
(t83 0.0)
(t84 0.0)
(t85 0.0)
(t86 0.0)
(t87 0.0)
(t88 0.0)
(t89 0.0)
(t90 0.0)
(t91 0.0)
(t92 0.0)
(t93 0.0)
(t94 1.0)
(t95 1.0)
(t96 1.0)
(t97 1.0)
(t98 1.0)
(t99 1.0)
(t100 1.0)
(t101 1.0)
(t102 0.0)
(t103 0.0)
(t104 0.0)
(t105 0.0)
(t106 0.0)
(t107 0.0)
(t108 0.0)
(t109 0.0)
(t110 0.0)
(t111 0.0)
(t112 0.0)
(t113 0.0)
(t114 1.0)
(t115 0.0)
(t116 0.0)
(t117 0.0)
(t118 0.0)
(t119 0.0)
(t120 0.0)
(t121 0.0)
(t122 0.0)
(t123 0.0)
(t124 0.0)
(t125 0.0)
(t126 0.0)
(t127 0.0)
(t128 0.0)
(t129 0.0)
(t130 0.0)
(t131 0.0)
(t132 0.0)
(t133 0.0)
(t134 0.0)
(t135 0.0)
(t136 0.0)
(t137 0.0)
(t138 0.0)
(t139 0.0)
(t140 0.0)
(t141 1.0)
(t142 0.0)
(t143 0.0)
(t144 0.0)
(t145 1.0)
(t146 1.0)
(t147 0.0)
(t148 0.0)
(t149 0.0)
(t150 0.0)
(t151 0.0)
(t152 0.0)
(t153 0.0)
(t154 0.0)
(t155 0.0)
(t156 0.0)
(t157 0.0)
(t158 0.0)
(t159 0.0)
(t160 0.0)
(t161 0.0)
(t162 0.0)
(t163 0.0)
(t164 0.0)
(t165 0.0)
(t166 0.0)
(t167 0.0)
(t168 0.0)
(t169 0.0)
(t170 0.0)
(t171 0.0)
(t172 0.0)
(t173 0.0)
(t174 0.0)
(t175 0.0)
(t176 1.0)
(t177 0.0)
(t178 0.0)
(t179 0.0)
(t180 0.0)
(t181 0.0)
(t182 0.0)
(t183 0.0)
(t184 0.0)
(t185 0.0)
(t186 0.0)
(t187 0.0)
(t188 0.0)
(t189 0.0)
(t190 0.0)
(t191 0.0)
(t192 0.0)
(t193 0.0)
(t194 0.0)
(t195 0.0)
(t196 0.0)
(t197 0.0)
(t198 0.0)
(t199 0.0)
(t200 0.0)
(t201 0.0)
(t202 0.0)
(t203 0.0)
(t204 0.0)
(t205 0.0)
(t206 0.0)
(t207 0.0)
(t208 0.0)
(t209 0.0)
(t210 0.0)
(t211 0.0)
(t212 0.0)
(t213 0.0)
(t214 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/388 variables, and 162 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (OVERLAPS) 1/122 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:01] [INFO ] Deduced a trap composed of 77 places in 145 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:01] [INFO ] Deduced a trap composed of 72 places in 133 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:01] [INFO ] Deduced a trap composed of 71 places in 156 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:02] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:02] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 266/388 variables, 122/163 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 265/428 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:07] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:07] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:08] [INFO ] Deduced a trap composed of 77 places in 155 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:08] [INFO ] Deduced a trap composed of 71 places in 146 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:34:08] [INFO ] Deduced a trap composed of 78 places in 171 ms of which 23 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 5/433 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/388 variables, and 437 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60081ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Starting structural reductions in LTL mode, iteration 1 : 122/171 places, 266/372 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60399 ms. Remains : 122/171 places, 266/372 transitions.
[2025-06-02 17:34:30] [INFO ] Flatten gal took : 10 ms
[2025-06-02 17:34:30] [INFO ] Flatten gal took : 11 ms
[2025-06-02 17:34:30] [INFO ] Input system was already deterministic with 266 transitions.
[2025-06-02 17:34:30] [INFO ] Flatten gal took : 10 ms
[2025-06-02 17:34:30] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:34:30] [INFO ] Time to serialize gal into /tmp/CTLFireability604352503640110103.gal : 3 ms
[2025-06-02 17:34:30] [INFO ] Time to serialize properties into /tmp/CTLFireability678155322642858552.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/CTLFireability604352503640110103.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability678155322642858552.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 -...281
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.95178e+08,28.8915,551288,2,19119,5,1.59949e+06,6,0,756,2.38088e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-02 17:35:00] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:35:00] [INFO ] Applying decomposition
[2025-06-02 17:35:00] [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/graph15762648357669481798.txt' '-o' '/tmp/graph15762648357669481798.bin' '-w' '/tmp/graph15762648357669481798.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15762648357669481798.bin' '-l' '-1' '-v' '-w' '/tmp/graph15762648357669481798.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:35:00] [INFO ] Decomposing Gal with order
[2025-06-02 17:35:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:35:00] [INFO ] Removed a total of 386 redundant transitions.
[2025-06-02 17:35:00] [INFO ] Flatten gal took : 24 ms
[2025-06-02 17:35:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 5 ms.
[2025-06-02 17:35:00] [INFO ] Time to serialize gal into /tmp/CTLFireability7296474779427946757.gal : 3 ms
[2025-06-02 17:35:00] [INFO ] Time to serialize properties into /tmp/CTLFireability15047072774097777705.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/CTLFireability7296474779427946757.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15047072774097777705.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.95178e+08,2.13942,50100,967,86,99575,1267,517,152062,101,3603,0


Converting to forward existential form...Done !
original formula: E(E(EF(AX(AX(((i2.u17.p153==1)&&(i7.u26.p245==1))))) U EX(EX(EX(((i6.u24.p209==1)&&(i8.u27.p252==1)))))) U E(AX(((u4.p16==1)&&(i6.u22.p21...286
=> equivalent forward existential formula: ([(FwdU((FwdU(FwdU(Init,E(E(TRUE U !(EX(!(!(EX(!(((i2.u17.p153==1)&&(i7.u26.p245==1))))))))) U EX(EX(EX(((i6.u24...720
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t42, t96, t98, t108, t142, t164, t177, t178, t179, t180, t181, t182, t208, t209, t21...657
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 171/171 places, 372/372 transitions.
Graph (trivial) has 140 edges and 171 vertex of which 23 / 171 are part of one of the 3 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 150 transition count 337
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 146 transition count 334
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 12 place count 146 transition count 328
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 140 transition count 328
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 53 place count 111 transition count 271
Iterating global reduction 2 with 29 rules applied. Total rules applied 82 place count 111 transition count 271
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 92 place count 111 transition count 261
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 96 place count 109 transition count 259
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 96 place count 109 transition count 255
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 104 place count 105 transition count 255
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 106 place count 103 transition count 249
Iterating global reduction 4 with 2 rules applied. Total rules applied 108 place count 103 transition count 249
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 134 place count 90 transition count 236
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 140 place count 84 transition count 218
Iterating global reduction 4 with 6 rules applied. Total rules applied 146 place count 84 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 148 place count 84 transition count 216
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 150 place count 82 transition count 212
Iterating global reduction 5 with 2 rules applied. Total rules applied 152 place count 82 transition count 212
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 154 place count 80 transition count 206
Iterating global reduction 5 with 2 rules applied. Total rules applied 156 place count 80 transition count 206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 158 place count 80 transition count 204
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 161 place count 80 transition count 201
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 167 place count 77 transition count 198
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 170 place count 74 transition count 189
Iterating global reduction 6 with 3 rules applied. Total rules applied 173 place count 74 transition count 189
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 176 place count 74 transition count 186
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 178 place count 72 transition count 184
Applied a total of 178 rules in 65 ms. Remains 72 /171 variables (removed 99) and now considering 184/372 (removed 188) transitions.
[2025-06-02 17:35:30] [INFO ] Flow matrix only has 174 transitions (discarded 10 similar events)
// Phase 1: matrix 174 rows 72 cols
[2025-06-02 17:35:30] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:35:30] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-02 17:35:30] [INFO ] Flow matrix only has 174 transitions (discarded 10 similar events)
[2025-06-02 17:35:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:35:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 17:35:30] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:35:30] [INFO ] Redundant transitions in 7 ms returned []
Running 159 sub problems to find dead transitions.
[2025-06-02 17:35:30] [INFO ] Flow matrix only has 174 transitions (discarded 10 similar events)
[2025-06-02 17:35:30] [INFO ] Invariant cache hit.
[2025-06-02 17:35:30] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 2/71 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (OVERLAPS) 1/72 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:35:34] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:35:35] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:35:35] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 173/245 variables, 72/86 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 11 (OVERLAPS) 0/245 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/246 variables, and 87 constraints, problems are : Problem set: 0 solved, 159 unsolved in 12268 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (OVERLAPS) 2/71 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (OVERLAPS) 1/72 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 173/245 variables, 72/86 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 159/246 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:35:48] [INFO ] Deduced a trap along path composed of 2 places in 40 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:35:48] [INFO ] Deduced a trap along path composed of 2 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 13 (OVERLAPS) 0/245 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/246 variables, and 248 constraints, problems are : Problem set: 0 solved, 159 unsolved in 16151 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 28455ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 28456ms
Starting structural reductions in SI_CTL mode, iteration 1 : 72/171 places, 184/372 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28775 ms. Remains : 72/171 places, 184/372 transitions.
[2025-06-02 17:35:59] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:35:59] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:35:59] [INFO ] Input system was already deterministic with 184 transitions.
[2025-06-02 17:35:59] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:35:59] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:35:59] [INFO ] Time to serialize gal into /tmp/CTLFireability9148934216237900307.gal : 2 ms
[2025-06-02 17:35:59] [INFO ] Time to serialize properties into /tmp/CTLFireability11838436546086494336.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/CTLFireability9148934216237900307.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11838436546086494336.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,6.31148e+06,3.57531,83372,2,7524,5,246772,6,0,471,305373,0


Converting to forward existential form...Done !
original formula: EF(AG(AF(((p16!=1)||(p87!=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!(((p16!=1)||(p87!=1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t11, t14, t17, t18, t24, t27, t30, t31, t37, t72, t73, t74, t75, t76, t77, t84, t...459
Detected timeout of ITS tools.
[2025-06-02 17:36:29] [INFO ] Flatten gal took : 5 ms
[2025-06-02 17:36:29] [INFO ] Applying decomposition
[2025-06-02 17:36:29] [INFO ] Flatten gal took : 5 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/graph7936700946801712535.txt' '-o' '/tmp/graph7936700946801712535.bin' '-w' '/tmp/graph7936700946801712535.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7936700946801712535.bin' '-l' '-1' '-v' '-w' '/tmp/graph7936700946801712535.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:36:29] [INFO ] Decomposing Gal with order
[2025-06-02 17:36:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:36:29] [INFO ] Removed a total of 302 redundant transitions.
[2025-06-02 17:36:29] [INFO ] Flatten gal took : 13 ms
[2025-06-02 17:36:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 3 ms.
[2025-06-02 17:36:29] [INFO ] Time to serialize gal into /tmp/CTLFireability13254544400632939207.gal : 2 ms
[2025-06-02 17:36:29] [INFO ] Time to serialize properties into /tmp/CTLFireability8856647635210239195.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/CTLFireability13254544400632939207.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8856647635210239195.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.31148e+06,0.123871,7040,200,95,5649,496,354,9923,83,2188,0


Converting to forward existential form...Done !
original formula: EF(AG(AF(((u1.p16!=1)||(i2.u5.p87!=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!(((u1.p16!=1)||(i2.u5.p87!=1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t72, t73, t74, t84, t85, t86, t102, t103, t104, t133, t134, t136, t138, t141, t143, t145, t14...427
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,1,8.82381,162816,1,0,206533,7188,1895,654294,438,43544,524424
FORMULA MedleyA-PT-20-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 171/171 places, 372/372 transitions.
Graph (trivial) has 136 edges and 171 vertex of which 23 / 171 are part of one of the 3 SCC in 6 ms
Free SCC test removed 20 places
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 150 transition count 337
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 146 transition count 334
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 12 place count 146 transition count 329
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 141 transition count 329
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 50 place count 113 transition count 275
Iterating global reduction 2 with 28 rules applied. Total rules applied 78 place count 113 transition count 275
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 86 place count 113 transition count 267
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 88 place count 112 transition count 266
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 88 place count 112 transition count 263
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 94 place count 109 transition count 263
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 96 place count 107 transition count 257
Iterating global reduction 4 with 2 rules applied. Total rules applied 98 place count 107 transition count 257
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 124 place count 94 transition count 244
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 130 place count 88 transition count 226
Iterating global reduction 4 with 6 rules applied. Total rules applied 136 place count 88 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 138 place count 88 transition count 224
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 140 place count 86 transition count 220
Iterating global reduction 5 with 2 rules applied. Total rules applied 142 place count 86 transition count 220
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 144 place count 84 transition count 214
Iterating global reduction 5 with 2 rules applied. Total rules applied 146 place count 84 transition count 214
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 148 place count 84 transition count 212
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 152 place count 84 transition count 208
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 158 place count 81 transition count 205
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 161 place count 78 transition count 196
Iterating global reduction 6 with 3 rules applied. Total rules applied 164 place count 78 transition count 196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 167 place count 78 transition count 193
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 168 place count 78 transition count 193
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 170 place count 76 transition count 191
Applied a total of 170 rules in 71 ms. Remains 76 /171 variables (removed 95) and now considering 191/372 (removed 181) transitions.
[2025-06-02 17:36:38] [INFO ] Flow matrix only has 182 transitions (discarded 9 similar events)
// Phase 1: matrix 182 rows 76 cols
[2025-06-02 17:36:38] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:36:38] [INFO ] Implicit Places using invariants in 112 ms returned []
[2025-06-02 17:36:38] [INFO ] Flow matrix only has 182 transitions (discarded 9 similar events)
[2025-06-02 17:36:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:36:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-02 17:36:38] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:36:38] [INFO ] Redundant transitions in 8 ms returned []
Running 165 sub problems to find dead transitions.
[2025-06-02 17:36:38] [INFO ] Flow matrix only has 182 transitions (discarded 9 similar events)
[2025-06-02 17:36:38] [INFO ] Invariant cache hit.
[2025-06-02 17:36:38] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 3/75 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 1/76 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:42] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:42] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 181/257 variables, 76/89 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 11 (OVERLAPS) 0/257 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/258 variables, and 91 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11481 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 2/2 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/72 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 3/75 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 1/76 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 181/257 variables, 76/89 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 165/256 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:36:57] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 13 (OVERLAPS) 0/257 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/258 variables, and 257 constraints, problems are : Problem set: 0 solved, 165 unsolved in 15759 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 27283ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 27284ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/171 places, 191/372 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27655 ms. Remains : 76/171 places, 191/372 transitions.
[2025-06-02 17:37:06] [INFO ] Flatten gal took : 5 ms
[2025-06-02 17:37:06] [INFO ] Flatten gal took : 5 ms
[2025-06-02 17:37:06] [INFO ] Input system was already deterministic with 191 transitions.
[2025-06-02 17:37:06] [INFO ] Flatten gal took : 5 ms
[2025-06-02 17:37:06] [INFO ] Flatten gal took : 5 ms
[2025-06-02 17:37:06] [INFO ] Time to serialize gal into /tmp/CTLFireability2139381608832243375.gal : 1 ms
[2025-06-02 17:37:06] [INFO ] Time to serialize properties into /tmp/CTLFireability492030894573026294.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/CTLFireability2139381608832243375.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability492030894573026294.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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.60449e+07,5.07289,96440,2,8270,5,287354,6,0,494,350550,0


Converting to forward existential form...Done !
original formula: AG(EF((((p10==0)||(p25==0))||(p184==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((p10==0)||(p25==0))||(p184==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t15, t18, t19, t25, t28, t31, t32, t38, t76, t77, t78, t79, t80, t81, t88, t89, t...460
(forward)formula 0,1,14.4322,238480,1,0,408,1.27199e+06,400,175,4316,954372,389
FORMULA MedleyA-PT-20-CTLFireability-2025-07 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 : 171/171 places, 372/372 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 137 transition count 308
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 137 transition count 308
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 73 place count 137 transition count 303
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 88 place count 122 transition count 268
Iterating global reduction 1 with 15 rules applied. Total rules applied 103 place count 122 transition count 268
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 106 place count 122 transition count 265
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 108 place count 120 transition count 261
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 120 transition count 261
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 112 place count 118 transition count 255
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 118 transition count 255
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 116 place count 118 transition count 253
Applied a total of 116 rules in 6 ms. Remains 118 /171 variables (removed 53) and now considering 253/372 (removed 119) transitions.
// Phase 1: matrix 253 rows 118 cols
[2025-06-02 17:37:20] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:37:20] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-02 17:37:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:37:21] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2025-06-02 17:37:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:24] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:24] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:24] [INFO ] Deduced a trap composed of 62 places in 167 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:24] [INFO ] Deduced a trap composed of 68 places in 162 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:24] [INFO ] Deduced a trap composed of 68 places in 168 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:24] [INFO ] Deduced a trap composed of 72 places in 169 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:25] [INFO ] Deduced a trap composed of 63 places in 164 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:25] [INFO ] Deduced a trap composed of 63 places in 170 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:25] [INFO ] Deduced a trap composed of 63 places in 139 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:25] [INFO ] Deduced a trap composed of 62 places in 134 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:25] [INFO ] Deduced a trap composed of 67 places in 137 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:25] [INFO ] Deduced a trap composed of 68 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:26] [INFO ] Deduced a trap composed of 64 places in 141 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 13/24 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:28] [INFO ] Deduced a trap composed of 63 places in 120 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:29] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:31] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/118 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 253/371 variables, 118/145 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:36] [INFO ] Deduced a trap composed of 66 places in 123 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:36] [INFO ] Deduced a trap composed of 68 places in 119 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:42] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:42] [INFO ] Deduced a trap along path composed of 3 places in 24 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:42] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 371/371 variables, and 150 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:52] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:52] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:52] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:52] [INFO ] Deduced a trap composed of 72 places in 134 ms of which 22 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 253/371 variables, 118/151 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 252/403 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:37:57] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 17 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:02] [INFO ] Deduced a trap composed of 69 places in 159 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:02] [INFO ] Deduced a trap composed of 70 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-02 17:38:02] [INFO ] Deduced a trap composed of 75 places in 153 ms of which 32 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 3/407 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:08] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:09] [INFO ] Deduced a trap composed of 70 places in 95 ms of which 14 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:18] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:19] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:19] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:19] [INFO ] Deduced a trap composed of 55 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:38:19] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 7 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/371 variables, and 414 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 60084ms
Starting structural reductions in LTL mode, iteration 1 : 118/171 places, 253/372 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60518 ms. Remains : 118/171 places, 253/372 transitions.
[2025-06-02 17:38:21] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:38:21] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:38:21] [INFO ] Input system was already deterministic with 253 transitions.
[2025-06-02 17:38:21] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:38:21] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:38:21] [INFO ] Time to serialize gal into /tmp/CTLFireability11981507186437246007.gal : 2 ms
[2025-06-02 17:38:21] [INFO ] Time to serialize properties into /tmp/CTLFireability3115849196286220976.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/CTLFireability11981507186437246007.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3115849196286220976.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,6.73918e+08,26.4277,492652,2,22008,5,1.47738e+06,6,0,727,2.25357e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-02 17:38:51] [INFO ] Flatten gal took : 6 ms
[2025-06-02 17:38:51] [INFO ] Applying decomposition
[2025-06-02 17:38:51] [INFO ] Flatten gal took : 6 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/graph18099333047857668959.txt' '-o' '/tmp/graph18099333047857668959.bin' '-w' '/tmp/graph18099333047857668959.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18099333047857668959.bin' '-l' '-1' '-v' '-w' '/tmp/graph18099333047857668959.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:38:51] [INFO ] Decomposing Gal with order
[2025-06-02 17:38:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:38:51] [INFO ] Removed a total of 373 redundant transitions.
[2025-06-02 17:38:51] [INFO ] Flatten gal took : 18 ms
[2025-06-02 17:38:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2025-06-02 17:38:51] [INFO ] Time to serialize gal into /tmp/CTLFireability4552858212529443330.gal : 3 ms
[2025-06-02 17:38:51] [INFO ] Time to serialize properties into /tmp/CTLFireability13078310012907027847.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/CTLFireability4552858212529443330.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13078310012907027847.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.73918e+08,0.878556,24596,867,58,38455,630,477,65067,77,1626,0


Converting to forward existential form...Done !
original formula: EX(AG(EX((i5.u24.p220==0))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(EX((i5.u24.p220==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t42, t92, t94, t166, t167, t168, t169, t170, t171, t172, t173, t174, t175, t176, t17...702
(forward)formula 0,0,6.59321,146452,1,0,223260,4867,2648,554179,396,18707,535489
FORMULA MedleyA-PT-20-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 372/372 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 138 transition count 311
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 138 transition count 311
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 71 place count 138 transition count 306
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 85 place count 124 transition count 273
Iterating global reduction 1 with 14 rules applied. Total rules applied 99 place count 124 transition count 273
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 101 place count 124 transition count 271
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 103 place count 122 transition count 267
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 122 transition count 267
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 107 place count 120 transition count 261
Iterating global reduction 2 with 2 rules applied. Total rules applied 109 place count 120 transition count 261
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 111 place count 120 transition count 259
Applied a total of 111 rules in 9 ms. Remains 120 /171 variables (removed 51) and now considering 259/372 (removed 113) transitions.
// Phase 1: matrix 259 rows 120 cols
[2025-06-02 17:38:58] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:38:58] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-02 17:38:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:38:58] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2025-06-02 17:38:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 1/120 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:04] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:04] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:04] [INFO ] Deduced a trap composed of 64 places in 166 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:04] [INFO ] Deduced a trap composed of 70 places in 191 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:04] [INFO ] Deduced a trap composed of 70 places in 178 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:04] [INFO ] Deduced a trap composed of 74 places in 177 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:05] [INFO ] Deduced a trap composed of 65 places in 156 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:05] [INFO ] Deduced a trap composed of 65 places in 140 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:05] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:05] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:05] [INFO ] Deduced a trap composed of 64 places in 130 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:06] [INFO ] Deduced a trap composed of 66 places in 137 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:07] [INFO ] Deduced a trap composed of 65 places in 161 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:07] [INFO ] Deduced a trap composed of 68 places in 123 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:07] [INFO ] Deduced a trap composed of 70 places in 122 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:08] [INFO ] Deduced a trap composed of 70 places in 117 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:08] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:08] [INFO ] Deduced a trap composed of 71 places in 141 ms of which 20 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:09] [INFO ] Deduced a trap composed of 69 places in 151 ms of which 28 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:13] [INFO ] Deduced a trap composed of 70 places in 146 ms of which 25 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 9 (OVERLAPS) 259/379 variables, 120/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:22] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:23] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:24] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 258 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 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 (/ 3.0 4.0))
(s11 0.0)
(s12 (/ 1.0 4.0))
(s13 (/ 3.0 4.0))
(s14 0.0)
(s15 (/ 1.0 4.0))
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 timeout
0.0 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 379/379 variables, and 154 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 1/120 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 259/379 variables, 120/151 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/379 variables, 258/409 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:32] [INFO ] Deduced a trap composed of 35 places in 101 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:32] [INFO ] Deduced a trap composed of 76 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-02 17:39:33] [INFO ] Deduced a trap composed of 71 places in 162 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:33] [INFO ] Deduced a trap composed of 71 places in 179 ms of which 27 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/379 variables, 4/413 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:38] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:38] [INFO ] Deduced a trap composed of 77 places in 103 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:39] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:39] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:39] [INFO ] Deduced a trap composed of 72 places in 147 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:39] [INFO ] Deduced a trap composed of 77 places in 150 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:39] [INFO ] Deduced a trap composed of 77 places in 146 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:39] [INFO ] Deduced a trap composed of 71 places in 151 ms of which 16 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/379 variables, 8/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:47] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:47] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:39:48] [INFO ] Deduced a trap composed of 54 places in 129 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/379 variables, 3/424 constraints. Problems are: Problem set: 0 solved, 258 unsolved
SMT process timed out in 60092ms, After SMT, problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Starting structural reductions in LTL mode, iteration 1 : 120/171 places, 259/372 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60521 ms. Remains : 120/171 places, 259/372 transitions.
[2025-06-02 17:39:58] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:39:58] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:39:58] [INFO ] Input system was already deterministic with 259 transitions.
[2025-06-02 17:39:58] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:39:58] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:39:58] [INFO ] Time to serialize gal into /tmp/CTLFireability13970445399488688822.gal : 2 ms
[2025-06-02 17:39:58] [INFO ] Time to serialize properties into /tmp/CTLFireability7025459373093301936.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/CTLFireability13970445399488688822.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7025459373093301936.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.38857e+08,27.0755,514456,2,22736,5,1.53229e+06,6,0,741,2.35447e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-02 17:40:28] [INFO ] Flatten gal took : 6 ms
[2025-06-02 17:40:28] [INFO ] Applying decomposition
[2025-06-02 17:40:28] [INFO ] Flatten gal took : 7 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/graph14137612305587175444.txt' '-o' '/tmp/graph14137612305587175444.bin' '-w' '/tmp/graph14137612305587175444.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14137612305587175444.bin' '-l' '-1' '-v' '-w' '/tmp/graph14137612305587175444.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:40:28] [INFO ] Decomposing Gal with order
[2025-06-02 17:40:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:40:28] [INFO ] Removed a total of 380 redundant transitions.
[2025-06-02 17:40:28] [INFO ] Flatten gal took : 19 ms
[2025-06-02 17:40:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 3 ms.
[2025-06-02 17:40:28] [INFO ] Time to serialize gal into /tmp/CTLFireability18349897075667904151.gal : 2 ms
[2025-06-02 17:40:28] [INFO ] Time to serialize properties into /tmp/CTLFireability10439199492957540378.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/CTLFireability18349897075667904151.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10439199492957540378.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,7.38857e+08,1.10562,30328,869,65,48928,860,487,92413,87,2087,0


Converting to forward existential form...Done !
original formula: EF((E(AG((((i1.u2.p10==1)&&(u5.p21==1))&&(i6.u22.p223==1))) U (i2.u7.p36==1)) * AX((AG((i6.u24.p220==1)) + AG((((i1.u2.p10==1)&&(i1.u6.p2...185
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * E(!(E(TRUE U !((((i1.u2.p10==1)&&(u5.p21==1))&&(i6.u22.p223==1))))) U (i2.u7.p36==1))) * !(...279
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t42, t95, t97, t169, t170, t171, t179, t180, t181, t182, t204, t205, t206, t207, t20...617
(forward)formula 0,0,1.7273,30584,1,0,48928,1781,2645,102425,466,4357,148219
FORMULA MedleyA-PT-20-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 : 171/171 places, 372/372 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 142 transition count 318
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 142 transition count 318
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 62 place count 142 transition count 314
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 75 place count 129 transition count 283
Iterating global reduction 1 with 13 rules applied. Total rules applied 88 place count 129 transition count 283
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 90 place count 129 transition count 281
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 127 transition count 277
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 127 transition count 277
Applied a total of 94 rules in 6 ms. Remains 127 /171 variables (removed 44) and now considering 277/372 (removed 95) transitions.
// Phase 1: matrix 277 rows 127 cols
[2025-06-02 17:40:30] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:40:30] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-06-02 17:40:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:40:30] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2025-06-02 17:40:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:34] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:35] [INFO ] Deduced a trap composed of 68 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:35] [INFO ] Deduced a trap composed of 74 places in 176 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:35] [INFO ] Deduced a trap composed of 69 places in 178 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:35] [INFO ] Deduced a trap composed of 69 places in 126 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:35] [INFO ] Deduced a trap composed of 77 places in 157 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:35] [INFO ] Deduced a trap composed of 77 places in 154 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:36] [INFO ] Deduced a trap composed of 80 places in 153 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:36] [INFO ] Deduced a trap composed of 73 places in 138 ms of which 24 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:37] [INFO ] Deduced a trap composed of 75 places in 135 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:37] [INFO ] Deduced a trap composed of 75 places in 131 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:38] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:38] [INFO ] Deduced a trap composed of 75 places in 152 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:38] [INFO ] Deduced a trap composed of 78 places in 142 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:40] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:40] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:40] [INFO ] Deduced a trap composed of 68 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-02 17:40:41] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:44] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:44] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (OVERLAPS) 277/404 variables, 127/158 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:55] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:56] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:40:56] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 404/404 variables, and 161 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:02] [INFO ] Deduced a trap composed of 75 places in 150 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:02] [INFO ] Deduced a trap composed of 80 places in 177 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:02] [INFO ] Deduced a trap composed of 81 places in 182 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:02] [INFO ] Deduced a trap composed of 81 places in 161 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:03] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:03] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:04] [INFO ] Deduced a trap composed of 75 places in 175 ms of which 20 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (OVERLAPS) 277/404 variables, 127/165 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 276/441 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:10] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:41:11] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 14 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/404 variables, 3/446 constraints. Problems are: Problem set: 0 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 404/404 variables, and 446 constraints, problems are : Problem set: 0 solved, 276 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Starting structural reductions in LTL mode, iteration 1 : 127/171 places, 277/372 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60406 ms. Remains : 127/171 places, 277/372 transitions.
[2025-06-02 17:41:30] [INFO ] Flatten gal took : 6 ms
[2025-06-02 17:41:30] [INFO ] Flatten gal took : 6 ms
[2025-06-02 17:41:30] [INFO ] Input system was already deterministic with 277 transitions.
[2025-06-02 17:41:30] [INFO ] Flatten gal took : 6 ms
[2025-06-02 17:41:30] [INFO ] Flatten gal took : 6 ms
[2025-06-02 17:41:30] [INFO ] Time to serialize gal into /tmp/CTLFireability1219514687186972208.gal : 1 ms
[2025-06-02 17:41:30] [INFO ] Time to serialize properties into /tmp/CTLFireability12156134476409464774.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/CTLFireability1219514687186972208.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12156134476409464774.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.06701e+09,29.6772,580388,2,23880,5,1.74793e+06,6,0,787,2.59254e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-02 17:42:01] [INFO ] Flatten gal took : 6 ms
[2025-06-02 17:42:01] [INFO ] Applying decomposition
[2025-06-02 17:42:01] [INFO ] Flatten gal took : 5 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/graph8008265105684746926.txt' '-o' '/tmp/graph8008265105684746926.bin' '-w' '/tmp/graph8008265105684746926.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8008265105684746926.bin' '-l' '-1' '-v' '-w' '/tmp/graph8008265105684746926.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:42:01] [INFO ] Decomposing Gal with order
[2025-06-02 17:42:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:42:01] [INFO ] Removed a total of 407 redundant transitions.
[2025-06-02 17:42:01] [INFO ] Flatten gal took : 17 ms
[2025-06-02 17:42:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 3 ms.
[2025-06-02 17:42:01] [INFO ] Time to serialize gal into /tmp/CTLFireability5923635247335769775.gal : 3 ms
[2025-06-02 17:42:01] [INFO ] Time to serialize properties into /tmp/CTLFireability1837037693044074439.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/CTLFireability5923635247335769775.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1837037693044074439.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.06701e+09,0.931811,22064,896,74,33358,957,544,59920,113,2134,0


Converting to forward existential form...Done !
original formula: ((EX(A(((i3.u5.p16==1)&&(i6.u24.p223==1)) U E(EX((i6.u25.p230==1)) U ((((i2.u13.p94==1)&&(i3.u2.p10==1))&&((u6.p21==1)&&(i5.u16.p136==1))...337
=> equivalent forward existential formula: [FwdG((Init * !((EX(!((E(!(E(EX((i6.u25.p230==1)) U ((((i2.u13.p94==1)&&(i3.u2.p10==1))&&((u6.p21==1)&&(i5.u16.p...829
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t49, t103, t104, t106, t178, t179, t180, t185, t186, t187, t192, t193, t194, t213, t...637
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 171/171 places, 372/372 transitions.
Graph (trivial) has 135 edges and 171 vertex of which 21 / 171 are part of one of the 3 SCC in 1 ms
Free SCC test removed 18 places
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 152 transition count 340
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 148 transition count 337
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 12 place count 148 transition count 331
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 142 transition count 331
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 51 place count 115 transition count 276
Iterating global reduction 2 with 27 rules applied. Total rules applied 78 place count 115 transition count 276
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 88 place count 115 transition count 266
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 91 place count 113 transition count 265
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 91 place count 113 transition count 261
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 99 place count 109 transition count 261
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 101 place count 107 transition count 255
Iterating global reduction 4 with 2 rules applied. Total rules applied 103 place count 107 transition count 255
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 129 place count 94 transition count 242
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 133 place count 90 transition count 230
Iterating global reduction 4 with 4 rules applied. Total rules applied 137 place count 90 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 138 place count 90 transition count 229
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 140 place count 88 transition count 225
Iterating global reduction 5 with 2 rules applied. Total rules applied 142 place count 88 transition count 225
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 144 place count 86 transition count 219
Iterating global reduction 5 with 2 rules applied. Total rules applied 146 place count 86 transition count 219
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 148 place count 86 transition count 217
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 152 place count 86 transition count 213
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 158 place count 83 transition count 210
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 161 place count 80 transition count 201
Iterating global reduction 6 with 3 rules applied. Total rules applied 164 place count 80 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 167 place count 80 transition count 198
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 168 place count 80 transition count 198
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 170 place count 78 transition count 196
Applied a total of 170 rules in 42 ms. Remains 78 /171 variables (removed 93) and now considering 196/372 (removed 176) transitions.
[2025-06-02 17:42:31] [INFO ] Flow matrix only has 186 transitions (discarded 10 similar events)
// Phase 1: matrix 186 rows 78 cols
[2025-06-02 17:42:31] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:42:31] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-02 17:42:31] [INFO ] Flow matrix only has 186 transitions (discarded 10 similar events)
[2025-06-02 17:42:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:42:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 17:42:31] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:42:31] [INFO ] Redundant transitions in 2 ms returned []
Running 169 sub problems to find dead transitions.
[2025-06-02 17:42:31] [INFO ] Flow matrix only has 186 transitions (discarded 10 similar events)
[2025-06-02 17:42:31] [INFO ] Invariant cache hit.
[2025-06-02 17:42:31] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 2/77 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 1/78 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:35] [INFO ] Deduced a trap composed of 41 places in 131 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:37] [INFO ] Deduced a trap composed of 47 places in 105 ms of which 14 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (OVERLAPS) 185/263 variables, 78/91 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:40] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 7 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 13 (OVERLAPS) 0/263 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/264 variables, and 93 constraints, problems are : Problem set: 0 solved, 169 unsolved in 16330 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 2/77 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 1/78 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (OVERLAPS) 185/263 variables, 78/92 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/263 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/263 variables, 169/262 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:52] [INFO ] Deduced a trap along path composed of 2 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:52] [INFO ] Deduced a trap along path composed of 2 places in 23 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:42:52] [INFO ] Deduced a trap along path composed of 2 places in 20 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 13 (OVERLAPS) 0/263 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/264 variables, and 265 constraints, problems are : Problem set: 0 solved, 169 unsolved in 17225 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 33586ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 33587ms
Starting structural reductions in SI_CTL mode, iteration 1 : 78/171 places, 196/372 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33919 ms. Remains : 78/171 places, 196/372 transitions.
[2025-06-02 17:43:05] [INFO ] Flatten gal took : 5 ms
[2025-06-02 17:43:05] [INFO ] Flatten gal took : 5 ms
[2025-06-02 17:43:05] [INFO ] Input system was already deterministic with 196 transitions.
[2025-06-02 17:43:05] [INFO ] Flatten gal took : 6 ms
[2025-06-02 17:43:05] [INFO ] Flatten gal took : 5 ms
[2025-06-02 17:43:05] [INFO ] Time to serialize gal into /tmp/CTLFireability11612483786507504244.gal : 1 ms
[2025-06-02 17:43:05] [INFO ] Time to serialize properties into /tmp/CTLFireability11362420141811828764.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/CTLFireability11612483786507504244.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11362420141811828764.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.25218e+06,4.79147,108056,2,8810,5,337401,6,0,507,418849,0


Converting to forward existential form...Done !
original formula: E(EF(((EF((p210==1)) * (p112==1)) * (p41==1))) U (p228==1))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U ((E(TRUE U (p210==1)) * (p112==1)) * (p41==1)))) * (p228==1))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t7, t12, t15, t18, t19, t30, t33, t34, t41, t42, t80, t81, t82, t83, t84, t85, t9...469
Detected timeout of ITS tools.
[2025-06-02 17:43:35] [INFO ] Flatten gal took : 5 ms
[2025-06-02 17:43:35] [INFO ] Applying decomposition
[2025-06-02 17:43:35] [INFO ] Flatten gal took : 5 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/graph17746851349564635075.txt' '-o' '/tmp/graph17746851349564635075.bin' '-w' '/tmp/graph17746851349564635075.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17746851349564635075.bin' '-l' '-1' '-v' '-w' '/tmp/graph17746851349564635075.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:43:35] [INFO ] Decomposing Gal with order
[2025-06-02 17:43:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:43:35] [INFO ] Removed a total of 321 redundant transitions.
[2025-06-02 17:43:35] [INFO ] Flatten gal took : 13 ms
[2025-06-02 17:43:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 2 ms.
[2025-06-02 17:43:35] [INFO ] Time to serialize gal into /tmp/CTLFireability18209838435674484979.gal : 2 ms
[2025-06-02 17:43:35] [INFO ] Time to serialize properties into /tmp/CTLFireability8299888332846015136.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/CTLFireability18209838435674484979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8299888332846015136.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,9.25218e+06,0.265396,8272,266,124,7629,1126,373,14156,104,3290,0


Converting to forward existential form...Done !
original formula: E(EF(((EF((i5.u11.p210==1)) * (i3.u7.p112==1)) * (i2.u4.p41==1))) U (i5.u12.p228==1))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U ((E(TRUE U (i5.u11.p210==1)) * (i3.u7.p112==1)) * (i2.u4.p41==1)))) * (i5.u12.p228==1))] !=...161
Reverse transition relation is NOT exact ! Due to transitions t83, t84, t85, t92, t93, t94, t110, t111, t112, t113, t114, t115, t138, t143, t145, t147, t14...471
(forward)formula 0,1,18.7167,418168,1,0,537391,15235,2076,2.0003e+06,530,179043,1393915
FORMULA MedleyA-PT-20-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 171/171 places, 372/372 transitions.
Graph (trivial) has 140 edges and 171 vertex of which 23 / 171 are part of one of the 3 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 150 transition count 337
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 146 transition count 334
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 12 place count 146 transition count 328
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 140 transition count 328
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 53 place count 111 transition count 271
Iterating global reduction 2 with 29 rules applied. Total rules applied 82 place count 111 transition count 271
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 92 place count 111 transition count 261
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 96 place count 109 transition count 259
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 96 place count 109 transition count 255
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 104 place count 105 transition count 255
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 106 place count 103 transition count 249
Iterating global reduction 4 with 2 rules applied. Total rules applied 108 place count 103 transition count 249
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 134 place count 90 transition count 236
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 140 place count 84 transition count 218
Iterating global reduction 4 with 6 rules applied. Total rules applied 146 place count 84 transition count 218
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 148 place count 84 transition count 216
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 150 place count 82 transition count 212
Iterating global reduction 5 with 2 rules applied. Total rules applied 152 place count 82 transition count 212
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 153 place count 81 transition count 209
Iterating global reduction 5 with 1 rules applied. Total rules applied 154 place count 81 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 155 place count 81 transition count 208
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 158 place count 81 transition count 205
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 164 place count 78 transition count 202
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 167 place count 75 transition count 193
Iterating global reduction 6 with 3 rules applied. Total rules applied 170 place count 75 transition count 193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 173 place count 75 transition count 190
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 175 place count 73 transition count 188
Applied a total of 175 rules in 37 ms. Remains 73 /171 variables (removed 98) and now considering 188/372 (removed 184) transitions.
[2025-06-02 17:43:54] [INFO ] Flow matrix only has 178 transitions (discarded 10 similar events)
// Phase 1: matrix 178 rows 73 cols
[2025-06-02 17:43:54] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:43:54] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-02 17:43:54] [INFO ] Flow matrix only has 178 transitions (discarded 10 similar events)
[2025-06-02 17:43:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:43:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-02 17:43:54] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:43:54] [INFO ] Redundant transitions in 2 ms returned []
Running 162 sub problems to find dead transitions.
[2025-06-02 17:43:54] [INFO ] Flow matrix only has 178 transitions (discarded 10 similar events)
[2025-06-02 17:43:54] [INFO ] Invariant cache hit.
[2025-06-02 17:43:54] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 2/72 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 1/73 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 162 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:58] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 162 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:43:59] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (OVERLAPS) 177/250 variables, 73/86 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 162 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:02] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 10 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 162 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:03] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 162 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:07] [INFO ] Deduced a trap along path composed of 2 places in 26 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 15 (OVERLAPS) 0/250 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/251 variables, and 90 constraints, problems are : Problem set: 0 solved, 162 unsolved in 19030 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 2/72 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 1/73 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 8 (OVERLAPS) 177/250 variables, 73/88 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 162/251 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 162 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:19] [INFO ] Deduced a trap along path composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 14 (OVERLAPS) 0/250 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/251 variables, and 253 constraints, problems are : Problem set: 0 solved, 162 unsolved in 17270 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 36328ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 36329ms
Starting structural reductions in SI_CTL mode, iteration 1 : 73/171 places, 188/372 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36697 ms. Remains : 73/171 places, 188/372 transitions.
[2025-06-02 17:44:30] [INFO ] Flatten gal took : 5 ms
[2025-06-02 17:44:30] [INFO ] Flatten gal took : 5 ms
[2025-06-02 17:44:30] [INFO ] Input system was already deterministic with 188 transitions.
[2025-06-02 17:44:30] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:44:30] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:44:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4076432104021802378.gal : 1 ms
[2025-06-02 17:44:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1634207636967775982.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4076432104021802378.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1634207636967775982.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1634207636967775982.prop.
RANDOM walk for 30242 steps (24 resets) in 241 ms. (124 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-20-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :10 after 300
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :300 after 480
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :480 after 1072
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 372/372 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 142 transition count 319
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 142 transition count 319
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 63 place count 142 transition count 314
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 75 place count 130 transition count 285
Iterating global reduction 1 with 12 rules applied. Total rules applied 87 place count 130 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 88 place count 130 transition count 284
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 128 transition count 280
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 128 transition count 280
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 126 transition count 274
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 126 transition count 274
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 98 place count 126 transition count 272
Applied a total of 98 rules in 10 ms. Remains 126 /171 variables (removed 45) and now considering 272/372 (removed 100) transitions.
// Phase 1: matrix 272 rows 126 cols
[2025-06-02 17:44:30] [INFO ] Computed 11 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:44:30] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-02 17:44:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:44:31] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2025-06-02 17:44:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:35] [INFO ] Deduced a trap composed of 38 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:36] [INFO ] Deduced a trap composed of 67 places in 189 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:36] [INFO ] Deduced a trap composed of 74 places in 182 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:36] [INFO ] Deduced a trap composed of 72 places in 194 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:36] [INFO ] Deduced a trap composed of 78 places in 197 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:36] [INFO ] Deduced a trap composed of 75 places in 161 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:36] [INFO ] Deduced a trap composed of 75 places in 151 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:37] [INFO ] Deduced a trap composed of 78 places in 166 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:37] [INFO ] Deduced a trap composed of 75 places in 169 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:37] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:40] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (OVERLAPS) 272/398 variables, 126/148 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:49] [INFO ] Deduced a trap along path composed of 3 places in 32 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:51] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:51] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 3/151 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:44:52] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 398/398 variables, and 152 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (OVERLAPS) 272/398 variables, 126/149 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 271/420 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:05] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:05] [INFO ] Deduced a trap composed of 74 places in 123 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:05] [INFO ] Deduced a trap composed of 79 places in 136 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:05] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:06] [INFO ] Deduced a trap composed of 80 places in 150 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:06] [INFO ] Deduced a trap composed of 73 places in 155 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 6/426 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:13] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:13] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:13] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:45:13] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 4/430 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 3/433 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 398/398 variables, and 433 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60104ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Starting structural reductions in LTL mode, iteration 1 : 126/171 places, 272/372 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60541 ms. Remains : 126/171 places, 272/372 transitions.
[2025-06-02 17:45:31] [INFO ] Flatten gal took : 6 ms
[2025-06-02 17:45:31] [INFO ] Flatten gal took : 5 ms
[2025-06-02 17:45:31] [INFO ] Input system was already deterministic with 272 transitions.
[2025-06-02 17:45:31] [INFO ] Flatten gal took : 7 ms
[2025-06-02 17:45:31] [INFO ] Flatten gal took : 7 ms
[2025-06-02 17:45:31] [INFO ] Time to serialize gal into /tmp/CTLFireability9996910014326292516.gal : 1 ms
[2025-06-02 17:45:31] [INFO ] Time to serialize properties into /tmp/CTLFireability7470634192755527475.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/CTLFireability9996910014326292516.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7470634192755527475.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-02 17:46:01] [INFO ] Flatten gal took : 7 ms
[2025-06-02 17:46:01] [INFO ] Applying decomposition
[2025-06-02 17:46:01] [INFO ] Flatten gal took : 7 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/graph9419797769148787935.txt' '-o' '/tmp/graph9419797769148787935.bin' '-w' '/tmp/graph9419797769148787935.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9419797769148787935.bin' '-l' '-1' '-v' '-w' '/tmp/graph9419797769148787935.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:46:01] [INFO ] Decomposing Gal with order
[2025-06-02 17:46:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:46:01] [INFO ] Removed a total of 401 redundant transitions.
[2025-06-02 17:46:01] [INFO ] Flatten gal took : 18 ms
[2025-06-02 17:46:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 3 ms.
[2025-06-02 17:46:01] [INFO ] Time to serialize gal into /tmp/CTLFireability2923302123620879687.gal : 2 ms
[2025-06-02 17:46:01] [INFO ] Time to serialize properties into /tmp/CTLFireability8926949159481369308.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/CTLFireability2923302123620879687.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8926949159481369308.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.27223e+09,1.97582,40828,1033,81,70551,748,533,112552,98,1790,0


Converting to forward existential form...Done !
original formula: A(EX(!(A(!(EF(((i3.u12.p93==1)&&(i8.u30.p259==1)))) U (i4.u14.p108==1)))) U (E(((A(((i3.u12.p58==1)||(u5.p23==1)) U (((i6.u1.p10==1)&&(i6...416
=> equivalent forward existential formula: [((Init * !(EG(!((E(((!((E(!((((i6.u1.p10==1)&&(i6.u3.p17==1))&&(i5.u21.p171==1))) U (!(((i3.u12.p58==1)||(u5.p2...1637
Reverse transition relation is NOT exact ! Due to transitions t1, t17, t45, t100, t104, t176, t177, t178, t179, t180, t181, t186, t187, t188, t202, t203, t...664
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 372/372 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 140 transition count 313
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 140 transition count 313
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 67 place count 140 transition count 308
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 81 place count 126 transition count 275
Iterating global reduction 1 with 14 rules applied. Total rules applied 95 place count 126 transition count 275
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 98 place count 126 transition count 272
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 124 transition count 268
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 124 transition count 268
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 104 place count 122 transition count 262
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 122 transition count 262
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 108 place count 122 transition count 260
Applied a total of 108 rules in 11 ms. Remains 122 /171 variables (removed 49) and now considering 260/372 (removed 112) transitions.
// Phase 1: matrix 260 rows 122 cols
[2025-06-02 17:46:31] [INFO ] Computed 11 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:46:31] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-06-02 17:46:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:46:32] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2025-06-02 17:46:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:36] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:36] [INFO ] Deduced a trap composed of 47 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:36] [INFO ] Deduced a trap composed of 64 places in 183 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:36] [INFO ] Deduced a trap composed of 69 places in 178 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:37] [INFO ] Deduced a trap composed of 70 places in 196 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:37] [INFO ] Deduced a trap composed of 75 places in 174 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:37] [INFO ] Deduced a trap composed of 65 places in 182 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:37] [INFO ] Deduced a trap composed of 65 places in 149 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:37] [INFO ] Deduced a trap composed of 71 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-02 17:46:38] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 23 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:40] [INFO ] Deduced a trap composed of 65 places in 166 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:40] [INFO ] Deduced a trap composed of 65 places in 142 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:41] [INFO ] Deduced a trap composed of 69 places in 132 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:41] [INFO ] Deduced a trap composed of 70 places in 131 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:41] [INFO ] Deduced a trap composed of 64 places in 138 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:41] [INFO ] Deduced a trap composed of 69 places in 147 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:41] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:43] [INFO ] Deduced a trap composed of 72 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:43] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:44] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 260/382 variables, 122/153 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:52] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:54] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:46:54] [INFO ] Deduced a trap along path composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 3/156 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 382/382 variables, and 156 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 260/382 variables, 122/153 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 259/412 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:06] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:06] [INFO ] Deduced a trap composed of 71 places in 140 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:07] [INFO ] Deduced a trap composed of 70 places in 131 ms of which 23 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 3/415 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:12] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:12] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 12 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:19] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:20] [INFO ] Deduced a trap composed of 76 places in 144 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:20] [INFO ] Deduced a trap composed of 70 places in 125 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 3/420 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:30] [INFO ] Deduced a trap composed of 54 places in 117 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:30] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:30] [INFO ] Deduced a trap composed of 57 places in 130 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:47:30] [INFO ] Deduced a trap composed of 55 places in 125 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/382 variables, and 424 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/3 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 60093ms
Starting structural reductions in LTL mode, iteration 1 : 122/171 places, 260/372 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60588 ms. Remains : 122/171 places, 260/372 transitions.
[2025-06-02 17:47:32] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:47:32] [INFO ] Flatten gal took : 10 ms
[2025-06-02 17:47:32] [INFO ] Input system was already deterministic with 260 transitions.
[2025-06-02 17:47:32] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:47:32] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:47:32] [INFO ] Time to serialize gal into /tmp/CTLFireability12576725617904680820.gal : 3 ms
[2025-06-02 17:47:32] [INFO ] Time to serialize properties into /tmp/CTLFireability953031443919229033.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/CTLFireability12576725617904680820.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability953031443919229033.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,9.90611e+08,25.8269,474120,2,21723,5,1.5033e+06,6,0,750,2.17753e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-06-02 17:48:02] [INFO ] Flatten gal took : 6 ms
[2025-06-02 17:48:02] [INFO ] Applying decomposition
[2025-06-02 17:48:02] [INFO ] Flatten gal took : 6 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/graph17859543575162438062.txt' '-o' '/tmp/graph17859543575162438062.bin' '-w' '/tmp/graph17859543575162438062.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17859543575162438062.bin' '-l' '-1' '-v' '-w' '/tmp/graph17859543575162438062.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:48:02] [INFO ] Decomposing Gal with order
[2025-06-02 17:48:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:48:02] [INFO ] Removed a total of 350 redundant transitions.
[2025-06-02 17:48:02] [INFO ] Flatten gal took : 15 ms
[2025-06-02 17:48:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 2 ms.
[2025-06-02 17:48:02] [INFO ] Time to serialize gal into /tmp/CTLFireability1207197823371055170.gal : 3 ms
[2025-06-02 17:48:02] [INFO ] Time to serialize properties into /tmp/CTLFireability13354189038191013210.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/CTLFireability1207197823371055170.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13354189038191013210.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,9.90611e+08,1.06894,24328,691,193,36840,3573,489,60297,135,7829,0


Converting to forward existential form...Done !
original formula: EF((E(A((u4.p18!=1) U !(AG((i4.u13.p111==1)))) U (AX(EG((i2.u7.p37==1))) * AX(E((i2.u10.p58==1) U ((i5.u14.p195==1)&&(i9.u27.p271==1)))))...181
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * E(!((E(!(!(!(E(TRUE U !((i4.u13.p111==1)))))) U (!((u4.p18!=1)) * !(!(!(E(TRUE U !((i4....354
Reverse transition relation is NOT exact ! Due to transitions t1, t16, t41, t95, t97, t110, t145, t168, t173, t174, t175, t176, t177, t178, t202, t203, t20...660
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local 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
(forward)formula 0,1,18.374,369572,1,0,527647,46186,3496,1.33151e+06,834,260077,1357633
FORMULA MedleyA-PT-20-CTLFireability-2024-14 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 : 171/171 places, 372/372 transitions.
Graph (trivial) has 134 edges and 171 vertex of which 23 / 171 are part of one of the 3 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 150 transition count 339
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 9 place count 148 transition count 335
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 12 place count 146 transition count 334
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 12 place count 146 transition count 329
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 22 place count 141 transition count 329
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 49 place count 114 transition count 276
Iterating global reduction 3 with 27 rules applied. Total rules applied 76 place count 114 transition count 276
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 9 rules applied. Total rules applied 85 place count 114 transition count 267
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 89 place count 112 transition count 265
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 89 place count 112 transition count 262
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 95 place count 109 transition count 262
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 97 place count 107 transition count 256
Iterating global reduction 5 with 2 rules applied. Total rules applied 99 place count 107 transition count 256
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 125 place count 94 transition count 243
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 131 place count 88 transition count 225
Iterating global reduction 5 with 6 rules applied. Total rules applied 137 place count 88 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 139 place count 88 transition count 223
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 141 place count 86 transition count 219
Iterating global reduction 6 with 2 rules applied. Total rules applied 143 place count 86 transition count 219
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 145 place count 84 transition count 213
Iterating global reduction 6 with 2 rules applied. Total rules applied 147 place count 84 transition count 213
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 149 place count 84 transition count 211
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 152 place count 84 transition count 208
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 158 place count 81 transition count 205
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 160 place count 79 transition count 199
Iterating global reduction 7 with 2 rules applied. Total rules applied 162 place count 79 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 164 place count 79 transition count 197
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 166 place count 77 transition count 195
Applied a total of 166 rules in 45 ms. Remains 77 /171 variables (removed 94) and now considering 195/372 (removed 177) transitions.
[2025-06-02 17:48:20] [INFO ] Flow matrix only has 186 transitions (discarded 9 similar events)
// Phase 1: matrix 186 rows 77 cols
[2025-06-02 17:48:20] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:48:21] [INFO ] Implicit Places using invariants in 185 ms returned []
[2025-06-02 17:48:21] [INFO ] Flow matrix only has 186 transitions (discarded 9 similar events)
[2025-06-02 17:48:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 17:48:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-02 17:48:21] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 17:48:21] [INFO ] Redundant transitions in 1 ms returned []
Running 168 sub problems to find dead transitions.
[2025-06-02 17:48:21] [INFO ] Flow matrix only has 186 transitions (discarded 9 similar events)
[2025-06-02 17:48:21] [INFO ] Invariant cache hit.
[2025-06-02 17:48:21] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 3/76 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 1/77 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:24] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:24] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:25] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 185/262 variables, 77/91 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:28] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 12 (OVERLAPS) 0/262 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/263 variables, and 94 constraints, problems are : Problem set: 0 solved, 168 unsolved in 14769 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 3/76 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 1/77 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 185/262 variables, 77/92 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 168/262 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:42] [INFO ] Deduced a trap along path composed of 2 places in 43 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 17:48:43] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 13 (OVERLAPS) 0/262 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/263 variables, and 264 constraints, problems are : Problem set: 0 solved, 168 unsolved in 16037 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 30839ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 30840ms
Starting structural reductions in SI_CTL mode, iteration 1 : 77/171 places, 195/372 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31244 ms. Remains : 77/171 places, 195/372 transitions.
[2025-06-02 17:48:52] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:48:52] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:48:52] [INFO ] Input system was already deterministic with 195 transitions.
[2025-06-02 17:48:52] [INFO ] Flatten gal took : 9 ms
[2025-06-02 17:48:52] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:48:52] [INFO ] Time to serialize gal into /tmp/CTLFireability12282105425397511809.gal : 2 ms
[2025-06-02 17:48:52] [INFO ] Time to serialize properties into /tmp/CTLFireability7594926449324978786.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/CTLFireability12282105425397511809.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7594926449324978786.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.71308e+07,3.78271,86668,2,8402,5,288898,6,0,502,330548,0


Converting to forward existential form...Done !
original formula: (AF((((p10==0)||(p21==0))||(p39==0))) * EF(EG((p121==1))))
=> equivalent forward existential formula: ([FwdG(Init,!((((p10==0)||(p21==0))||(p39==0))))] = FALSE * [(Init * !(E(TRUE U EG((p121==1)))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t5, t11, t14, t17, t18, t25, t28, t31, t32, t39, t77, t78, t79, t80, t81, t82, t92, t...465
Detected timeout of ITS tools.
[2025-06-02 17:49:22] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:49:22] [INFO ] Applying decomposition
[2025-06-02 17:49:22] [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/graph10626669338678660221.txt' '-o' '/tmp/graph10626669338678660221.bin' '-w' '/tmp/graph10626669338678660221.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10626669338678660221.bin' '-l' '-1' '-v' '-w' '/tmp/graph10626669338678660221.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:49:22] [INFO ] Decomposing Gal with order
[2025-06-02 17:49:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:49:22] [INFO ] Removed a total of 316 redundant transitions.
[2025-06-02 17:49:22] [INFO ] Flatten gal took : 18 ms
[2025-06-02 17:49:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 3 ms.
[2025-06-02 17:49:22] [INFO ] Time to serialize gal into /tmp/CTLFireability3512110090325623428.gal : 3 ms
[2025-06-02 17:49:22] [INFO ] Time to serialize properties into /tmp/CTLFireability2208954839701626137.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/CTLFireability3512110090325623428.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2208954839701626137.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.71308e+07,0.268698,8080,255,124,6845,631,355,13201,110,2419,0


Converting to forward existential form...Done !
original formula: (AF((((u0.p10==0)||(u2.p21==0))||(i0.u4.p39==0))) * EF(EG((i2.u9.p121==1))))
=> equivalent forward existential formula: ([FwdG(Init,!((((u0.p10==0)||(u2.p21==0))||(i0.u4.p39==0))))] = FALSE * [(Init * !(E(TRUE U EG((i2.u9.p121==1)))...167
Reverse transition relation is NOT exact ! Due to transitions t77, t78, t79, t92, t93, t94, t110, t111, t112, t138, t142, t146, t147, t148, t149, t151, t15...439
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
(forward)formula 0,1,6.3184,144528,1,0,197014,10568,2070,570350,556,62663,540593
FORMULA MedleyA-PT-20-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2025-06-02 17:49:28] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:49:28] [INFO ] Flatten gal took : 8 ms
[2025-06-02 17:49:28] [INFO ] Applying decomposition
[2025-06-02 17:49:28] [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/graph18097401005798729262.txt' '-o' '/tmp/graph18097401005798729262.bin' '-w' '/tmp/graph18097401005798729262.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18097401005798729262.bin' '-l' '-1' '-v' '-w' '/tmp/graph18097401005798729262.weights' '-q' '0' '-e' '0.001'
[2025-06-02 17:49:28] [INFO ] Decomposing Gal with order
[2025-06-02 17:49:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 17:49:28] [INFO ] Removed a total of 581 redundant transitions.
[2025-06-02 17:49:28] [INFO ] Flatten gal took : 31 ms
[2025-06-02 17:49:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 8 ms.
[2025-06-02 17:49:28] [INFO ] Time to serialize gal into /tmp/CTLFireability9662347385941675749.gal : 5 ms
[2025-06-02 17:49:28] [INFO ] Time to serialize properties into /tmp/CTLFireability10966928006091482720.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/CTLFireability9662347385941675749.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10966928006091482720.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 4 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.09081e+09,4.85541,103036,2283,244,165383,2175,813,331080,144,7198,0


Converting to forward existential form...Done !
original formula: (EX(((AX(((((i0.u1.p10==1)&&(u5.p25==1))&&(i2.i2.u17.p107==1))||((i0.u1.p9==1)&&(i9.i0.u47.p265==1)))) * (i9.i0.u47.p264==1)) + A(((((A((...418
=> equivalent forward existential formula: (([((EY(Init) * (i9.i0.u47.p264==1)) * !(EX(!(((((i0.u1.p10==1)&&(u5.p25==1))&&(i2.i2.u17.p107==1))||((i0.u1.p9=...742
Reverse transition relation is NOT exact ! Due to transitions t8, t63, t139, t143, t154, t158, t159, t166, t187, t196, t200, t201, t215, t224, t228, t229, ...1010
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 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
(forward)formula 0,1,174.31,2201696,1,0,2.86916e+06,63697,2667,1.06681e+07,450,504903,3593000
FORMULA MedleyA-PT-20-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(E(EF(AX(AX(((i2.i2.u25.p153==1)&&(i7.u41.p245==1))))) U EX(EX(EX(((i4.u38.p209==1)&&(i8.u42.p252==1)))))) U E(AX(((i0.u3.p16==1)&&(i4.u...301
=> equivalent forward existential formula: ([(FwdU((FwdU(FwdU(Init,E(E(TRUE U !(EX(!(!(EX(!(((i2.i2.u25.p153==1)&&(i7.u41.p245==1))))))))) U EX(EX(EX(((i4....747
(forward)formula 1,1,612.536,3149940,1,0,4.08268e+06,63697,2592,1.6575e+07,406,504903,2633761
FORMULA MedleyA-PT-20-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: ((EX(A(((i0.u3.p16==1)&&(i6.i1.u36.p223==1)) U E(EX((i4.u38.p230==1)) U ((((i1.i0.u11.p94==1)&&(i0.u1.p10==1))&&((u4.p21==1)&&(i2.i2.u23....355
=> equivalent forward existential formula: [FwdG((Init * !((EX(!((E(!(E(EX((i4.u38.p230==1)) U ((((i1.i0.u11.p94==1)&&(i0.u1.p10==1))&&((u4.p21==1)&&(i2.i2...865
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 a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 2,0,1436.3,5030364,1,0,6.47732e+06,80920,1734,2.40214e+07,322,937098,1654125
FORMULA MedleyA-PT-20-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
Detected timeout of ITS tools.
[2025-06-02 18:17:56] [INFO ] Applying decomposition
[2025-06-02 18:17:56] [INFO ] Flatten gal took : 8 ms
[2025-06-02 18:17:56] [INFO ] Decomposing Gal with order
[2025-06-02 18:17:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:17:56] [INFO ] Removed a total of 409 redundant transitions.
[2025-06-02 18:17:56] [INFO ] Flatten gal took : 18 ms
[2025-06-02 18:17:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 247 labels/synchronizations in 5 ms.
[2025-06-02 18:17:56] [INFO ] Time to serialize gal into /tmp/CTLFireability2068747856885024139.gal : 2 ms
[2025-06-02 18:17:56] [INFO ] Time to serialize properties into /tmp/CTLFireability7620086634769525557.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/CTLFireability2068747856885024139.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7620086634769525557.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.09081e+09,33.1023,844028,2076,2873,1.28766e+06,75511,329,5.2615e+06,392,1.40189e+06,0


Converting to forward existential form...Done !
original formula: A(EX(!(A(!(EF(((i0.i1.i0.u11.p93==1)&&(i1.i0.u17.p259==1)))) U (i0.i1.i0.u12.p108==1)))) U (E(((A(((i0.i1.i0.u11.p58==1)||(i0.i0.i1.u8.p2...534
=> equivalent forward existential formula: [((Init * !(EG(!((E(((!((E(!((((i0.i0.u3.p10==1)&&(i0.i0.i1.i0.u6.p17==1))&&(i0.i1.u13.p171==1))) U (!(((i0.i1.i...2063
Reverse transition relation is NOT exact ! Due to transitions t158, t169, t218, t228, i0.t289, i0.t240, i0.t239, i0.i0.t139, i0.i0.u3.t149, i0.i0.i1.u8.t14...954

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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="MedleyA-PT-20"
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 MedleyA-PT-20, 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 r128-smll-174876524200250"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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