Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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 27K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K 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 75K 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-05-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-05-CTLFireability-2024-15
FORMULA_NAME MedleyA-PT-05-CTLFireability-2025-00
FORMULA_NAME MedleyA-PT-05-CTLFireability-2025-01
FORMULA_NAME MedleyA-PT-05-CTLFireability-2025-02
FORMULA_NAME MedleyA-PT-05-CTLFireability-2025-03
FORMULA_NAME MedleyA-PT-05-CTLFireability-2025-04
FORMULA_NAME MedleyA-PT-05-CTLFireability-2025-05
FORMULA_NAME MedleyA-PT-05-CTLFireability-2025-06
FORMULA_NAME MedleyA-PT-05-CTLFireability-2025-07
FORMULA_NAME MedleyA-PT-05-CTLFireability-2025-08
FORMULA_NAME MedleyA-PT-05-CTLFireability-2025-09
FORMULA_NAME MedleyA-PT-05-CTLFireability-2025-10
FORMULA_NAME MedleyA-PT-05-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748844466114

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-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 06:07:48] [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 06:07:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 06:07:48] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2025-06-02 06:07:48] [INFO ] Transformed 115 places.
[2025-06-02 06:07:48] [INFO ] Transformed 257 transitions.
[2025-06-02 06:07:48] [INFO ] Found NUPN structural information;
[2025-06-02 06:07:48] [INFO ] Parsed PT model containing 115 places and 257 transitions and 1160 arcs in 290 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Support contains 68 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 254/254 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 111 transition count 246
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 111 transition count 246
Applied a total of 8 rules in 33 ms. Remains 111 /115 variables (removed 4) and now considering 246/254 (removed 8) transitions.
[2025-06-02 06:07:48] [INFO ] Flow matrix only has 245 transitions (discarded 1 similar events)
// Phase 1: matrix 245 rows 111 cols
[2025-06-02 06:07:48] [INFO ] Computed 20 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:07:48] [INFO ] Implicit Places using invariants in 399 ms returned []
[2025-06-02 06:07:48] [INFO ] Flow matrix only has 245 transitions (discarded 1 similar events)
[2025-06-02 06:07:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:07:49] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 06:07:49] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 902 ms to find 0 implicit places.
Running 245 sub problems to find dead transitions.
[2025-06-02 06:07:49] [INFO ] Flow matrix only has 245 transitions (discarded 1 similar events)
[2025-06-02 06:07:49] [INFO ] Invariant cache hit.
[2025-06-02 06:07:49] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (OVERLAPS) 1/111 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:53] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:53] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:53] [INFO ] Deduced a trap composed of 20 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 06:07:53] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:53] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:54] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:54] [INFO ] Deduced a trap composed of 32 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 06:07:54] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:54] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:54] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:54] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:54] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:07:55] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 13/33 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (OVERLAPS) 244/355 variables, 111/144 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 93/237 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/355 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (OVERLAPS) 1/356 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:08:03] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 11 (OVERLAPS) 0/356 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 239 constraints, problems are : Problem set: 0 solved, 245 unsolved in 22955 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 111/111 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (OVERLAPS) 1/111 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:08:14] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:08:14] [INFO ] Deduced a trap composed of 35 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 06:08:14] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:08:14] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:08:14] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:08:15] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:08:16] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (OVERLAPS) 244/355 variables, 111/152 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/355 variables, 93/245 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/355 variables, 245/490 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:08:22] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:08:22] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:08:24] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/355 variables, 3/493 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/355 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 12 (OVERLAPS) 1/356 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 245 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 356/356 variables, and 494 constraints, problems are : Problem set: 0 solved, 245 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 111/111 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53376ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 53399ms
Starting structural reductions in LTL mode, iteration 1 : 111/115 places, 246/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54372 ms. Remains : 111/115 places, 246/254 transitions.
Support contains 68 out of 111 places after structural reductions.
[2025-06-02 06:08:43] [INFO ] Flatten gal took : 70 ms
[2025-06-02 06:08:43] [INFO ] Flatten gal took : 53 ms
[2025-06-02 06:08:43] [INFO ] Input system was already deterministic with 246 transitions.
Reduction of identical properties reduced properties to check from 72 to 69
RANDOM walk for 40000 steps (2967 resets) in 3517 ms. (11 steps per ms) remains 24/69 properties
BEST_FIRST walk for 4003 steps (46 resets) in 33 ms. (117 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (52 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (48 resets) in 32 ms. (121 steps per ms) remains 22/24 properties
BEST_FIRST walk for 4003 steps (37 resets) in 44 ms. (88 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (46 resets) in 40 ms. (97 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (49 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (44 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (44 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (48 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (42 resets) in 10 ms. (363 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (40 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (41 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (35 resets) in 11 ms. (333 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4003 steps (42 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (49 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (39 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (41 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (44 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (45 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (43 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (44 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (47 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
[2025-06-02 06:08:44] [INFO ] Flow matrix only has 245 transitions (discarded 1 similar events)
[2025-06-02 06:08:44] [INFO ] Invariant cache hit.
[2025-06-02 06:08:44] [INFO ] State equation strengthened by 94 read => feed constraints.
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/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 61/91 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:08:44] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:08:45] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 5 ms to minimize.
Problem AtomicPropp28 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 2/14 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 9/100 variables, 3/17 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 10/110 variables, 5/22 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 243/353 variables, 110/132 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/353 variables, 93/225 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 2/355 variables, 1/226 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 0/226 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 1/356 variables, 1/227 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/356 variables, 0/227 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 0/356 variables, 0/227 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 356/356 variables, and 227 constraints, problems are : Problem set: 1 solved, 20 unsolved in 1794 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 111/111 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 20 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 62/90 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 2/14 constraints. Problems are: Problem set: 1 solved, 20 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:08:46] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 9/99 variables, 3/18 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 11/110 variables, 5/23 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 243/353 variables, 110/133 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 93/226 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/353 variables, 8/234 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/353 variables, 0/234 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 2/355 variables, 1/235 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 12/247 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 0/247 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 16 (OVERLAPS) 1/356 variables, 1/248 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/356 variables, 0/248 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 18 (OVERLAPS) 0/356 variables, 0/248 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 356/356 variables, and 248 constraints, problems are : Problem set: 1 solved, 20 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 111/111 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 20/21 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6825ms problems are : Problem set: 1 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 246/246 transitions.
Graph (complete) has 442 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 110 transition count 243
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 110 transition count 242
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 109 transition count 242
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 15 place count 99 transition count 222
Iterating global reduction 1 with 10 rules applied. Total rules applied 25 place count 99 transition count 222
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 41 place count 91 transition count 267
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 91 transition count 265
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 2 with 30 rules applied. Total rules applied 73 place count 91 transition count 235
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 80 place count 91 transition count 254
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 93 place count 84 transition count 248
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 101 place count 84 transition count 248
Applied a total of 101 rules in 109 ms. Remains 84 /111 variables (removed 27) and now considering 248/246 (removed -2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 84/111 places, 248/246 transitions.
RANDOM walk for 40000 steps (3951 resets) in 720 ms. (55 steps per ms) remains 4/20 properties
BEST_FIRST walk for 40004 steps (512 resets) in 114 ms. (347 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (527 resets) in 133 ms. (298 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (516 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (518 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
// Phase 1: matrix 248 rows 84 cols
[2025-06-02 06:08:52] [INFO ] Computed 20 invariants in 5 ms
[2025-06-02 06:08:52] [INFO ] State equation strengthened by 125 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 41/72 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:08:52] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 11/83 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 248/331 variables, 83/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/331 variables, 125/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/331 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/332 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/332 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 230 constraints, problems are : Problem set: 0 solved, 3 unsolved in 367 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 84/84 constraints, ReadFeed: 125/125 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 41/72 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 11/83 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 248/331 variables, 83/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/331 variables, 125/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/331 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/331 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/332 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/332 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/332 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 332/332 variables, and 233 constraints, problems are : Problem set: 0 solved, 3 unsolved in 575 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 84/84 constraints, ReadFeed: 125/125 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 958ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 1 properties in 391 ms.
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 248/248 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 83 transition count 247
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 81 transition count 251
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 81 transition count 247
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 14 place count 77 transition count 247
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 20 place count 77 transition count 389
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 47 place count 71 transition count 368
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 70 transition count 367
Applied a total of 48 rules in 101 ms. Remains 70 /84 variables (removed 14) and now considering 367/248 (removed -119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 70/84 places, 367/248 transitions.
RANDOM walk for 40000 steps (5124 resets) in 1114 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (476 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (469 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 232979 steps, run visited all 2 properties in 760 ms. (steps per millisecond=306 )
Probabilistic random walk after 232979 steps, saw 41492 distinct states, run finished after 766 ms. (steps per millisecond=304 ) properties seen :2
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2025-06-02 06:08:54] [INFO ] Flatten gal took : 22 ms
[2025-06-02 06:08:54] [INFO ] Flatten gal took : 22 ms
[2025-06-02 06:08:54] [INFO ] Input system was already deterministic with 246 transitions.
Computed a total of 15 stabilizing places and 90 stable transitions
Graph (complete) has 544 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 246/246 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 98 transition count 220
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 98 transition count 220
Applied a total of 26 rules in 8 ms. Remains 98 /111 variables (removed 13) and now considering 220/246 (removed 26) transitions.
[2025-06-02 06:08:54] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
// Phase 1: matrix 219 rows 98 cols
[2025-06-02 06:08:54] [INFO ] Computed 20 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:08:54] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-06-02 06:08:54] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
[2025-06-02 06:08:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:08:55] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 06:08:55] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2025-06-02 06:08:55] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
[2025-06-02 06:08:55] [INFO ] Invariant cache hit.
[2025-06-02 06:08:55] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:08:57] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 218/316 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 93/212 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:09:04] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 1/317 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (OVERLAPS) 0/317 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 214 constraints, problems are : Problem set: 0 solved, 219 unsolved in 21087 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 218/316 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 93/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 219/432 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 1/317 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/317 variables, and 433 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51201ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 51203ms
Starting structural reductions in LTL mode, iteration 1 : 98/111 places, 220/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51669 ms. Remains : 98/111 places, 220/246 transitions.
[2025-06-02 06:09:46] [INFO ] Flatten gal took : 24 ms
[2025-06-02 06:09:46] [INFO ] Flatten gal took : 24 ms
[2025-06-02 06:09:46] [INFO ] Input system was already deterministic with 220 transitions.
[2025-06-02 06:09:46] [INFO ] Flatten gal took : 23 ms
[2025-06-02 06:09:46] [INFO ] Flatten gal took : 22 ms
[2025-06-02 06:09:46] [INFO ] Time to serialize gal into /tmp/CTLFireability13270758390913548122.gal : 9 ms
[2025-06-02 06:09:46] [INFO ] Time to serialize properties into /tmp/CTLFireability18138705785737456610.ctl : 4 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/CTLFireability13270758390913548122.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18138705785737456610.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,2.42977e+09,3.17486,80800,2,6988,5,308179,6,0,605,319460,0


Converting to forward existential form...Done !
original formula: E(!(A(AG(AX((((p69==1)&&(p72==1))&&(p90==1)))) U AG(AX((p38==1))))) U AF((p27==1)))
=> equivalent forward existential formula: [(FwdU(Init,!(!((E(!(!(E(TRUE U !(!(EX(!((p38==1)))))))) U (!(!(E(TRUE U !(!(EX(!((((p69==1)&&(p72==1))&&(p90==1...286
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t9, t10, t14, t16, t17, t18, t19, t22, t23, t24, t27, t28, t40, t42, ...407
Detected timeout of ITS tools.
[2025-06-02 06:10:16] [INFO ] Flatten gal took : 16 ms
[2025-06-02 06:10:16] [INFO ] Applying decomposition
[2025-06-02 06:10:16] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9669299457879679115.txt' '-o' '/tmp/graph9669299457879679115.bin' '-w' '/tmp/graph9669299457879679115.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9669299457879679115.bin' '-l' '-1' '-v' '-w' '/tmp/graph9669299457879679115.weights' '-q' '0' '-e' '0.001'
[2025-06-02 06:10:16] [INFO ] Decomposing Gal with order
[2025-06-02 06:10:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 06:10:17] [INFO ] Removed a total of 442 redundant transitions.
[2025-06-02 06:10:17] [INFO ] Flatten gal took : 139 ms
[2025-06-02 06:10:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 19 ms.
[2025-06-02 06:10:17] [INFO ] Time to serialize gal into /tmp/CTLFireability18034646518507042593.gal : 10 ms
[2025-06-02 06:10:17] [INFO ] Time to serialize properties into /tmp/CTLFireability7817516000119726530.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/CTLFireability18034646518507042593.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7817516000119726530.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.42977e+09,0.235923,8764,396,25,9094,179,307,20000,50,485,0


Converting to forward existential form...Done !
original formula: E(!(A(AG(AX((((i4.u17.p69==1)&&(i3.u18.p72==1))&&(i4.u23.p90==1)))) U AG(AX((i2.i0.u10.p38==1))))) U AF((i1.u7.p27==1)))
=> equivalent forward existential formula: [(FwdU(Init,!(!((E(!(!(E(TRUE U !(!(EX(!((i2.i0.u10.p38==1)))))))) U (!(!(E(TRUE U !(!(EX(!((((i4.u17.p69==1)&&(...343
Reverse transition relation is NOT exact ! Due to transitions t173, t175, t177, t179, i0.t219, i0.t69, i0.t68, i0.t63, i0.u1.t50, i0.u1.t74, i0.u3.t71, i0....610
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
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
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 246/246 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 98 transition count 220
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 98 transition count 220
Applied a total of 26 rules in 6 ms. Remains 98 /111 variables (removed 13) and now considering 220/246 (removed 26) transitions.
[2025-06-02 06:10:47] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
// Phase 1: matrix 219 rows 98 cols
[2025-06-02 06:10:47] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:10:47] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-06-02 06:10:47] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
[2025-06-02 06:10:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:10:47] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 06:10:47] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2025-06-02 06:10:47] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
[2025-06-02 06:10:47] [INFO ] Invariant cache hit.
[2025-06-02 06:10:47] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:10:50] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 218/316 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 93/212 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 1/317 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (OVERLAPS) 0/317 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 213 constraints, problems are : Problem set: 0 solved, 219 unsolved in 15825 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 218/316 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 93/212 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 219/431 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 1/317 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/317 variables, and 432 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45965ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 45966ms
Starting structural reductions in LTL mode, iteration 1 : 98/111 places, 220/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46359 ms. Remains : 98/111 places, 220/246 transitions.
[2025-06-02 06:11:33] [INFO ] Flatten gal took : 21 ms
[2025-06-02 06:11:33] [INFO ] Flatten gal took : 22 ms
[2025-06-02 06:11:33] [INFO ] Input system was already deterministic with 220 transitions.
[2025-06-02 06:11:33] [INFO ] Flatten gal took : 21 ms
[2025-06-02 06:11:33] [INFO ] Flatten gal took : 13 ms
[2025-06-02 06:11:33] [INFO ] Time to serialize gal into /tmp/CTLFireability8046643334135409607.gal : 4 ms
[2025-06-02 06:11:33] [INFO ] Time to serialize properties into /tmp/CTLFireability9129792279616196485.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8046643334135409607.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9129792279616196485.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,2.45809e+09,1.87676,48384,2,5274,5,195181,6,0,605,172593,0


Converting to forward existential form...Done !
original formula: EF(AX(EX(AG(((p61==1)||(p1==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EX(!(E(TRUE U !(((p61==1)||(p1==1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t9, t10, t16, t17, t18, t19, t27, t28, t30, t31, t42, t44, t45, t47, t48,...363
(forward)formula 0,1,8.81996,184076,1,0,357,975527,460,141,5434,715700,459
FORMULA MedleyA-PT-05-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 246/246 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 97 transition count 218
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 97 transition count 218
Applied a total of 28 rules in 6 ms. Remains 97 /111 variables (removed 14) and now considering 218/246 (removed 28) transitions.
[2025-06-02 06:11:42] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
// Phase 1: matrix 217 rows 97 cols
[2025-06-02 06:11:42] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:11:42] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-02 06:11:42] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2025-06-02 06:11:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:11:42] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 06:11:43] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-06-02 06:11:43] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2025-06-02 06:11:43] [INFO ] Invariant cache hit.
[2025-06-02 06:11:43] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:11:45] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 14903 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44998ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 44999ms
Starting structural reductions in LTL mode, iteration 1 : 97/111 places, 218/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45299 ms. Remains : 97/111 places, 218/246 transitions.
[2025-06-02 06:12:28] [INFO ] Flatten gal took : 17 ms
[2025-06-02 06:12:28] [INFO ] Flatten gal took : 18 ms
[2025-06-02 06:12:28] [INFO ] Input system was already deterministic with 218 transitions.
[2025-06-02 06:12:28] [INFO ] Flatten gal took : 17 ms
[2025-06-02 06:12:28] [INFO ] Flatten gal took : 18 ms
[2025-06-02 06:12:28] [INFO ] Time to serialize gal into /tmp/CTLFireability2566452619375510353.gal : 5 ms
[2025-06-02 06:12:28] [INFO ] Time to serialize properties into /tmp/CTLFireability12802632728274045270.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/CTLFireability2566452619375510353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12802632728274045270.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,2.19389e+09,2.02628,50728,2,5366,5,203096,6,0,599,177228,0


Converting to forward existential form...Done !
original formula: E(((EF(EX((p70==1))) + AF(!((((p36==1)&&(p44==1))&&((p69==1)&&(p98==1)))))) * (!(((E((p38==1) U (((p36==1)&&(p50==1))&&(p67==1))) + A((((...350
=> equivalent forward existential formula: [(FwdU(Init,((E(TRUE U EX((p70==1))) + !(EG(!(!((((p36==1)&&(p44==1))&&((p69==1)&&(p98==1)))))))) * (!(((E((p38=...529
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t9, t10, t16, t17, t18, t19, t27, t28, t40, t42, t43, t45, t46, t51, t52,...353
Detected timeout of ITS tools.
[2025-06-02 06:12:58] [INFO ] Flatten gal took : 10 ms
[2025-06-02 06:12:58] [INFO ] Applying decomposition
[2025-06-02 06:12:58] [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/graph10279050860802111408.txt' '-o' '/tmp/graph10279050860802111408.bin' '-w' '/tmp/graph10279050860802111408.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10279050860802111408.bin' '-l' '-1' '-v' '-w' '/tmp/graph10279050860802111408.weights' '-q' '0' '-e' '0.001'
[2025-06-02 06:12:58] [INFO ] Decomposing Gal with order
[2025-06-02 06:12:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 06:12:58] [INFO ] Removed a total of 431 redundant transitions.
[2025-06-02 06:12:58] [INFO ] Flatten gal took : 48 ms
[2025-06-02 06:12:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 10 ms.
[2025-06-02 06:12:58] [INFO ] Time to serialize gal into /tmp/CTLFireability7363006026104204325.gal : 4 ms
[2025-06-02 06:12:58] [INFO ] Time to serialize properties into /tmp/CTLFireability15684373322081796606.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/CTLFireability7363006026104204325.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15684373322081796606.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.19389e+09,0.131641,8500,285,23,8647,153,317,21028,47,404,0


Converting to forward existential form...Done !
original formula: E(((EF(EX((i2.u17.p70==1))) + AF(!((((i1.i1.u8.p36==1)&&(i1.i0.u11.p44==1))&&((i3.u16.p69==1)&&(i3.u24.p98==1)))))) * (!(((E((i1.i0.u9.p3...552
=> equivalent forward existential formula: [(FwdU(Init,((E(TRUE U EX((i2.u17.p70==1))) + !(EG(!(!((((i1.i1.u8.p36==1)&&(i1.i0.u11.p44==1))&&((i3.u16.p69==1...773
Reverse transition relation is NOT exact ! Due to transitions t170, t172, t174, t176, i0.i0.t66, i0.i0.t67, i0.i0.t217, i0.i0.u3.t69, i0.i0.u3.t70, i0.i0.u...516
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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 246/246 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 100 transition count 224
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 100 transition count 224
Applied a total of 22 rules in 7 ms. Remains 100 /111 variables (removed 11) and now considering 224/246 (removed 22) transitions.
[2025-06-02 06:13:28] [INFO ] Flow matrix only has 223 transitions (discarded 1 similar events)
// Phase 1: matrix 223 rows 100 cols
[2025-06-02 06:13:28] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:13:28] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-02 06:13:28] [INFO ] Flow matrix only has 223 transitions (discarded 1 similar events)
[2025-06-02 06:13:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:13:28] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 06:13:28] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2025-06-02 06:13:28] [INFO ] Flow matrix only has 223 transitions (discarded 1 similar events)
[2025-06-02 06:13:28] [INFO ] Invariant cache hit.
[2025-06-02 06:13:28] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:13:31] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:13:31] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 222/322 variables, 100/122 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 93/215 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 1/323 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/323 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (OVERLAPS) 0/323 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 216 constraints, problems are : Problem set: 0 solved, 223 unsolved in 16576 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 100/100 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 222/322 variables, 100/122 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 93/215 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 223/438 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (OVERLAPS) 1/323 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 323/323 variables, and 439 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 100/100 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46666ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 46667ms
Starting structural reductions in LTL mode, iteration 1 : 100/111 places, 224/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46993 ms. Remains : 100/111 places, 224/246 transitions.
[2025-06-02 06:14:15] [INFO ] Flatten gal took : 14 ms
[2025-06-02 06:14:15] [INFO ] Flatten gal took : 16 ms
[2025-06-02 06:14:15] [INFO ] Input system was already deterministic with 224 transitions.
[2025-06-02 06:14:15] [INFO ] Flatten gal took : 15 ms
[2025-06-02 06:14:15] [INFO ] Flatten gal took : 14 ms
[2025-06-02 06:14:15] [INFO ] Time to serialize gal into /tmp/CTLFireability5523666346626222751.gal : 5 ms
[2025-06-02 06:14:15] [INFO ] Time to serialize properties into /tmp/CTLFireability2107992424547755765.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/CTLFireability5523666346626222751.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2107992424547755765.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,2.95616e+09,6.54748,148696,2,13396,5,569878,6,0,617,599287,0


Converting to forward existential form...Done !
original formula: AX(EF(((((p36==1)&&(p39==1))&&(p62==1)) + (E((p26==1) U (((p34==1)&&(p100==1))&&((p111==1)&&(p93==1)))) * AF(AX((p21==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((((p36==1)&&(p39==1))&&(p62==1)) + (E((p26==1) U (((p34==1)&&(p100==1))&&((p111==1)&&(p...209
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t15, t16, t18, t19, t20, t21, t22, t24, t25, t...441
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2025-06-02 06:14:45] [INFO ] Flatten gal took : 9 ms
[2025-06-02 06:14:45] [INFO ] Applying decomposition
[2025-06-02 06:14:45] [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/graph12559323694500663303.txt' '-o' '/tmp/graph12559323694500663303.bin' '-w' '/tmp/graph12559323694500663303.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12559323694500663303.bin' '-l' '-1' '-v' '-w' '/tmp/graph12559323694500663303.weights' '-q' '0' '-e' '0.001'
[2025-06-02 06:14:45] [INFO ] Decomposing Gal with order
[2025-06-02 06:14:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 06:14:45] [INFO ] Removed a total of 442 redundant transitions.
[2025-06-02 06:14:45] [INFO ] Flatten gal took : 25 ms
[2025-06-02 06:14:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 24 ms.
[2025-06-02 06:14:45] [INFO ] Time to serialize gal into /tmp/CTLFireability14664409558768237918.gal : 4 ms
[2025-06-02 06:14:45] [INFO ] Time to serialize properties into /tmp/CTLFireability3037161909992149363.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/CTLFireability14664409558768237918.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3037161909992149363.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.95616e+09,0.256332,12008,565,27,14869,173,346,36815,53,491,0


Converting to forward existential form...Done !
original formula: AX(EF(((((i2.i1.u9.p36==1)&&(i2.i0.u10.p39==1))&&(i2.i1.u16.p62==1)) + (E((i1.u8.p26==1) U (((i5.u28.p34==1)&&(i5.u26.p100==1))&&((i5.u31...213
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U ((((i2.i1.u9.p36==1)&&(i2.i0.u10.p39==1))&&(i2.i1.u16.p62==1)) + (E((i1.u8.p26==1) U (((...278
Reverse transition relation is NOT exact ! Due to transitions t176, t178, t180, t182, i0.t223, i0.t73, i0.t72, i0.t67, i0.u1.t52, i0.u1.t78, i0.u3.t75, i0....673
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
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
(forward)formula 0,1,4.98775,112360,1,0,159520,361,2446,527997,252,815,187891
FORMULA MedleyA-PT-05-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 246/246 transitions.
Graph (complete) has 544 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 109 transition count 244
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 17 place count 95 transition count 216
Iterating global reduction 2 with 14 rules applied. Total rules applied 31 place count 95 transition count 216
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 95 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 2 with 6 rules applied. Total rules applied 40 place count 92 transition count 210
Applied a total of 40 rules in 36 ms. Remains 92 /111 variables (removed 19) and now considering 210/246 (removed 36) transitions.
[2025-06-02 06:14:50] [INFO ] Flow matrix only has 209 transitions (discarded 1 similar events)
// Phase 1: matrix 209 rows 92 cols
[2025-06-02 06:14:50] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:14:50] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-02 06:14:50] [INFO ] Flow matrix only has 209 transitions (discarded 1 similar events)
[2025-06-02 06:14:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:14:50] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 06:14:51] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:14:51] [INFO ] Redundant transitions in 49 ms returned []
Running 209 sub problems to find dead transitions.
[2025-06-02 06:14:51] [INFO ] Flow matrix only has 209 transitions (discarded 1 similar events)
[2025-06-02 06:14:51] [INFO ] Invariant cache hit.
[2025-06-02 06:14:51] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:14:53] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 208/300 variables, 92/113 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 93/206 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 8 (OVERLAPS) 1/301 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 10 (OVERLAPS) 0/301 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 207 constraints, problems are : Problem set: 0 solved, 209 unsolved in 12308 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 208/300 variables, 92/113 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 93/206 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 209/415 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:09] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 10 (OVERLAPS) 1/301 variables, 1/417 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1)
(t1 0)
(t2 0)
(t3 14)
(t4 0)
(t5 4)
(t6 0)
(t7 11)
(t8 1)
(t9 0)
(t10 7)
(t11 0)
(t12 1)
(t13 1)
(t14 1)
(t15 0)
(t16 0)
(t17 0)
(t18 4)
(t19 0)
(t20 4)
(t21 0)
(t22 4)
(t23 0)
(t24 0)
(t25 15)
(t26 0)
(t27 0)
(t28 0)
(t29 15)
(t30 4)
(t31 0)
(t32 4)
(t33 0)
(t34 1)
(t35 1)
(t36 1)
(t37 0)
(t38 0)
(t39 1)
(t40 2)
(t41 1)
(t42 0)
(t43 2)
(t44 1)
(t45 0)
(t46 0)
(t47 10)
(t48 0)
(t49 4)
(t50 0)
(t51 8)
(t52 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/301 variables, and 417 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42382ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 42382ms
Starting structural reductions in SI_CTL mode, iteration 1 : 92/111 places, 210/246 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42781 ms. Remains : 92/111 places, 210/246 transitions.
[2025-06-02 06:15:33] [INFO ] Flatten gal took : 10 ms
[2025-06-02 06:15:33] [INFO ] Flatten gal took : 9 ms
[2025-06-02 06:15:33] [INFO ] Input system was already deterministic with 210 transitions.
[2025-06-02 06:15:33] [INFO ] Flatten gal took : 18 ms
[2025-06-02 06:15:33] [INFO ] Flatten gal took : 17 ms
[2025-06-02 06:15:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3507887893433876752.gal : 7 ms
[2025-06-02 06:15:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14085809138473203941.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/ReachabilityCardinality3507887893433876752.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14085809138473203941.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 40000 steps (3077 resets) in 435 ms. (91 steps per ms) remains 1/1 properties
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 ...329
Loading property file /tmp/ReachabilityCardinality14085809138473203941.prop.
BEST_FIRST walk for 39999 steps (485 resets) in 217 ms. (183 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-05-CTLFireability-2025-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 246/246 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 100 transition count 224
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 100 transition count 224
Applied a total of 22 rules in 12 ms. Remains 100 /111 variables (removed 11) and now considering 224/246 (removed 22) transitions.
[2025-06-02 06:15:33] [INFO ] Flow matrix only has 223 transitions (discarded 1 similar events)
// Phase 1: matrix 223 rows 100 cols
[2025-06-02 06:15:33] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:15:33] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-06-02 06:15:33] [INFO ] Flow matrix only has 223 transitions (discarded 1 similar events)
[2025-06-02 06:15:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:15:34] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 06:15:34] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 223 sub problems to find dead transitions.
[2025-06-02 06:15:34] [INFO ] Flow matrix only has 223 transitions (discarded 1 similar events)
[2025-06-02 06:15:34] [INFO ] Invariant cache hit.
[2025-06-02 06:15:34] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:36] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:15:38] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (OVERLAPS) 222/322 variables, 100/122 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 93/215 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (OVERLAPS) 1/323 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 11 (OVERLAPS) 0/323 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 216 constraints, problems are : Problem set: 0 solved, 223 unsolved in 19648 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 100/100 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 223 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 2 (OVERLAPS) 1/100 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 222/322 variables, 100/122 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 93/215 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 223/438 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 9 (OVERLAPS) 1/323 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 223 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 323/323 variables, and 439 constraints, problems are : Problem set: 0 solved, 223 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 100/100 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 223/223 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49755ms problems are : Problem set: 0 solved, 223 unsolved
Search for dead transitions found 0 dead transitions in 49757ms
Starting structural reductions in LTL mode, iteration 1 : 100/111 places, 224/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50180 ms. Remains : 100/111 places, 224/246 transitions.
[2025-06-02 06:16:24] [INFO ] Flatten gal took : 13 ms
[2025-06-02 06:16:24] [INFO ] Flatten gal took : 10 ms
[2025-06-02 06:16:24] [INFO ] Input system was already deterministic with 224 transitions.
[2025-06-02 06:16:24] [INFO ] Flatten gal took : 11 ms
[2025-06-02 06:16:24] [INFO ] Flatten gal took : 11 ms
[2025-06-02 06:16:24] [INFO ] Time to serialize gal into /tmp/CTLFireability6893622523981446983.gal : 3 ms
[2025-06-02 06:16:24] [INFO ] Time to serialize properties into /tmp/CTLFireability8276006385556867317.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/CTLFireability6893622523981446983.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8276006385556867317.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,2.92829e+09,4.03053,78476,2,8372,5,316290,6,0,617,286522,0


Converting to forward existential form...Done !
original formula: E((!((EX((AX((((p36==1)&&(p37==1))&&(p57==1))) * AF((((p3==1)&&(p17==1))&&((p69==1)&&(p98==1)))))) + (((((p3==1)&&(p8==1)) + E((((p36==1)...363
=> equivalent forward existential formula: [(((FwdU(Init,(!((EX((!(EX(!((((p36==1)&&(p37==1))&&(p57==1))))) * !(EG(!((((p3==1)&&(p17==1))&&((p69==1)&&(p98=...439
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t9, t10, t11, t12, t13, t17, t18, t19, t20, t21, t24, t25, t26, t28, ...432
Detected timeout of ITS tools.
[2025-06-02 06:16:54] [INFO ] Flatten gal took : 7 ms
[2025-06-02 06:16:54] [INFO ] Applying decomposition
[2025-06-02 06:16:54] [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/graph15544784702895809239.txt' '-o' '/tmp/graph15544784702895809239.bin' '-w' '/tmp/graph15544784702895809239.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15544784702895809239.bin' '-l' '-1' '-v' '-w' '/tmp/graph15544784702895809239.weights' '-q' '0' '-e' '0.001'
[2025-06-02 06:16:54] [INFO ] Decomposing Gal with order
[2025-06-02 06:16:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 06:16:54] [INFO ] Removed a total of 386 redundant transitions.
[2025-06-02 06:16:54] [INFO ] Flatten gal took : 24 ms
[2025-06-02 06:16:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 7 ms.
[2025-06-02 06:16:54] [INFO ] Time to serialize gal into /tmp/CTLFireability2865245869940244562.gal : 3 ms
[2025-06-02 06:16:54] [INFO ] Time to serialize properties into /tmp/CTLFireability8219539426236675120.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/CTLFireability2865245869940244562.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8219539426236675120.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92829e+09,0.344709,11248,490,61,13217,1285,327,31329,110,1898,0


Converting to forward existential form...Done !
original formula: E((!((EX((AX((((u13.p36==1)&&(i1.u8.p37==1))&&(u13.p57==1))) * AF((((i0.i1.u0.p3==1)&&(i0.i0.u5.p17==1))&&((i3.u14.p69==1)&&(i4.u21.p98==...521
=> equivalent forward existential formula: [(((FwdU(Init,(!((EX((!(EX(!((((u13.p36==1)&&(i1.u8.p37==1))&&(u13.p57==1))))) * !(EG(!((((i0.i1.u0.p3==1)&&(i0....597
Reverse transition relation is NOT exact ! Due to transitions t177, t179, t181, t183, u13.t29, u13.t30, u13.t32, u13.t33, u13.t35, u13.t36, i0.i0.t72, i0.i...650
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 246/246 transitions.
Graph (complete) has 544 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 109 transition count 244
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 16 place count 96 transition count 218
Iterating global reduction 2 with 13 rules applied. Total rules applied 29 place count 96 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 96 transition count 215
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 2 with 6 rules applied. Total rules applied 38 place count 93 transition count 212
Applied a total of 38 rules in 33 ms. Remains 93 /111 variables (removed 18) and now considering 212/246 (removed 34) transitions.
[2025-06-02 06:17:24] [INFO ] Flow matrix only has 211 transitions (discarded 1 similar events)
// Phase 1: matrix 211 rows 93 cols
[2025-06-02 06:17:24] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:17:24] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-02 06:17:24] [INFO ] Flow matrix only has 211 transitions (discarded 1 similar events)
[2025-06-02 06:17:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:17:24] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 06:17:24] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:17:24] [INFO ] Redundant transitions in 47 ms returned []
Running 211 sub problems to find dead transitions.
[2025-06-02 06:17:24] [INFO ] Flow matrix only has 211 transitions (discarded 1 similar events)
[2025-06-02 06:17:24] [INFO ] Invariant cache hit.
[2025-06-02 06:17:24] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:17:28] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 210/303 variables, 93/114 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 93/207 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 1/304 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 10 (OVERLAPS) 0/304 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 208 constraints, problems are : Problem set: 0 solved, 211 unsolved in 16156 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 210/303 variables, 93/114 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 93/207 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 211/418 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (OVERLAPS) 1/304 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 11 (OVERLAPS) 0/304 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 419 constraints, problems are : Problem set: 0 solved, 211 unsolved in 29742 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45975ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 45976ms
Starting structural reductions in SI_CTL mode, iteration 1 : 93/111 places, 212/246 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46357 ms. Remains : 93/111 places, 212/246 transitions.
[2025-06-02 06:18:10] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:18:10] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:18:10] [INFO ] Input system was already deterministic with 212 transitions.
[2025-06-02 06:18:10] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:18:10] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:18:10] [INFO ] Time to serialize gal into /tmp/CTLFireability18314617718323251979.gal : 2 ms
[2025-06-02 06:18:10] [INFO ] Time to serialize properties into /tmp/CTLFireability8428778127437916887.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/CTLFireability18314617718323251979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8428778127437916887.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.26767e+09,1.87646,48516,2,5927,5,202541,6,0,578,174953,0


Converting to forward existential form...Done !
original formula: AG(!(A((p58==1) U ((AF(((p3==1)&&(p32==1))) * (p48==1)) * (p51==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(((!(EG(!(((p3==1)&&(p32==1))))) * (p48==1)) * (p51==1)))))) * !(E(!(((!(EG(!(((p3==1...284
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t8, t9, t15, t16, t17, t18, t23, t24, t25, t30, t31, t36, t38, t39, t41, ...371
Detected timeout of ITS tools.
[2025-06-02 06:18:40] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:18:40] [INFO ] Applying decomposition
[2025-06-02 06:18:40] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1631546753956646159.txt' '-o' '/tmp/graph1631546753956646159.bin' '-w' '/tmp/graph1631546753956646159.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1631546753956646159.bin' '-l' '-1' '-v' '-w' '/tmp/graph1631546753956646159.weights' '-q' '0' '-e' '0.001'
[2025-06-02 06:18:40] [INFO ] Decomposing Gal with order
[2025-06-02 06:18:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 06:18:40] [INFO ] Removed a total of 435 redundant transitions.
[2025-06-02 06:18:40] [INFO ] Flatten gal took : 19 ms
[2025-06-02 06:18:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 4 ms.
[2025-06-02 06:18:40] [INFO ] Time to serialize gal into /tmp/CTLFireability4862844543575119906.gal : 3 ms
[2025-06-02 06:18:40] [INFO ] Time to serialize properties into /tmp/CTLFireability11744004848248335648.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/CTLFireability4862844543575119906.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11744004848248335648.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.26767e+09,0.170086,9120,360,29,8928,150,323,26698,49,359,0


Converting to forward existential form...Done !
original formula: AG(!(A((i2.u14.p58==1) U ((AF(((i0.i1.u0.p3==1)&&(i0.i1.u7.p32==1))) * (i1.u12.p48==1)) * (i1.u13.p51==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(((!(EG(!(((i0.i1.u0.p3==1)&&(i0.i1.u7.p32==1))))) * (i1.u12.p48==1)) * (i1.u13.p51==...387
Reverse transition relation is NOT exact ! Due to transitions t164, t166, t208, t210, i0.i0.t63, i0.i0.t64, i0.i0.t199, i0.i0.u3.t66, i0.i0.u3.t67, i0.i0.u...528
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 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
(forward)formula 0,0,9.69842,202272,1,0,318757,399,2133,713280,201,1198,312674
FORMULA MedleyA-PT-05-CTLFireability-2025-06 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 : 111/111 places, 246/246 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 97 transition count 218
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 97 transition count 218
Applied a total of 28 rules in 3 ms. Remains 97 /111 variables (removed 14) and now considering 218/246 (removed 28) transitions.
[2025-06-02 06:18:50] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
// Phase 1: matrix 217 rows 97 cols
[2025-06-02 06:18:50] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:18:50] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-02 06:18:50] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2025-06-02 06:18:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:18:50] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 06:18:50] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-06-02 06:18:50] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2025-06-02 06:18:50] [INFO ] Invariant cache hit.
[2025-06-02 06:18:50] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:18:52] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 16015 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46100ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 46101ms
Starting structural reductions in LTL mode, iteration 1 : 97/111 places, 218/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46400 ms. Remains : 97/111 places, 218/246 transitions.
[2025-06-02 06:19:37] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:19:37] [INFO ] Flatten gal took : 5 ms
[2025-06-02 06:19:37] [INFO ] Input system was already deterministic with 218 transitions.
[2025-06-02 06:19:37] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:19:37] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:19:37] [INFO ] Time to serialize gal into /tmp/CTLFireability10869597462923247498.gal : 1 ms
[2025-06-02 06:19:37] [INFO ] Time to serialize properties into /tmp/CTLFireability7563450238712430960.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/CTLFireability10869597462923247498.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7563450238712430960.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,2.19389e+09,1.94913,50808,2,5366,5,203096,6,0,599,177228,0


Converting to forward existential form...Done !
original formula: EX(AG(EF((AX((((p36==1)&&(p65==1))&&((p100==1)&&(p111==1)))) + (A((((p34==1)&&(p69==1))&&(p83==1)) U (p95==1)) * (p0==0))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U (!(EX(!((((p36==1)&&(p65==1))&&((p100==1)&&(p111==1)))))) + (!((E(!((p95==1))...257
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t9, t10, t16, t17, t18, t19, t27, t28, t40, t42, t43, t45, t46, t51, t52,...353
Detected timeout of ITS tools.
[2025-06-02 06:20:07] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:20:07] [INFO ] Applying decomposition
[2025-06-02 06:20:07] [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/graph3347303648916197348.txt' '-o' '/tmp/graph3347303648916197348.bin' '-w' '/tmp/graph3347303648916197348.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3347303648916197348.bin' '-l' '-1' '-v' '-w' '/tmp/graph3347303648916197348.weights' '-q' '0' '-e' '0.001'
[2025-06-02 06:20:07] [INFO ] Decomposing Gal with order
[2025-06-02 06:20:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 06:20:07] [INFO ] Removed a total of 386 redundant transitions.
[2025-06-02 06:20:07] [INFO ] Flatten gal took : 16 ms
[2025-06-02 06:20:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 4 ms.
[2025-06-02 06:20:07] [INFO ] Time to serialize gal into /tmp/CTLFireability6365492322414803680.gal : 2 ms
[2025-06-02 06:20:07] [INFO ] Time to serialize properties into /tmp/CTLFireability14035225610819581815.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/CTLFireability6365492322414803680.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14035225610819581815.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.19389e+09,0.12753,8280,288,58,8542,342,332,17977,94,913,0


Converting to forward existential form...Done !
original formula: EX(AG(EF((AX((((i1.u13.p36==1)&&(i1.u13.p65==1))&&((i4.u23.p100==1)&&(i4.u28.p111==1)))) + (A((((i4.u25.p34==1)&&(i3.u14.p69==1))&&(i2.u1...206
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U (!(EX(!((((i1.u13.p36==1)&&(i1.u13.p65==1))&&((i4.u23.p100==1)&&(i4.u28.p111=...334
Reverse transition relation is NOT exact ! Due to transitions t170, t172, t174, t176, i0.i0.t66, i0.i0.t67, i0.i0.t217, i0.i0.u3.t69, i0.i0.u3.t70, i0.i0.u...496
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
(forward)formula 0,0,3.45281,87896,1,0,128003,5089,2374,459867,510,30407,157210
FORMULA MedleyA-PT-05-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 246/246 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 98 transition count 220
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 98 transition count 220
Applied a total of 26 rules in 3 ms. Remains 98 /111 variables (removed 13) and now considering 220/246 (removed 26) transitions.
[2025-06-02 06:20:10] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
// Phase 1: matrix 219 rows 98 cols
[2025-06-02 06:20:10] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:20:10] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-02 06:20:10] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
[2025-06-02 06:20:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:20:10] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 06:20:10] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2025-06-02 06:20:10] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
[2025-06-02 06:20:10] [INFO ] Invariant cache hit.
[2025-06-02 06:20:10] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:20:13] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 14 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 218/316 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 93/212 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 1/317 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (OVERLAPS) 0/317 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 213 constraints, problems are : Problem set: 0 solved, 219 unsolved in 17022 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 218/316 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 93/212 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 219/431 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 1/317 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (OVERLAPS) 0/317 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 432 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47105ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 47106ms
Starting structural reductions in LTL mode, iteration 1 : 98/111 places, 220/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47386 ms. Remains : 98/111 places, 220/246 transitions.
[2025-06-02 06:20:58] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:20:58] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:20:58] [INFO ] Input system was already deterministic with 220 transitions.
[2025-06-02 06:20:58] [INFO ] Flatten gal took : 5 ms
[2025-06-02 06:20:58] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:20:58] [INFO ] Time to serialize gal into /tmp/CTLFireability9891462373194617284.gal : 2 ms
[2025-06-02 06:20:58] [INFO ] Time to serialize properties into /tmp/CTLFireability2757846451631780192.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/CTLFireability9891462373194617284.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2757846451631780192.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,2.43052e+09,3.35875,77288,2,7532,5,304574,6,0,605,293158,0


Converting to forward existential form...Done !
original formula: E(A(EF((EF((p4==1)) * A((((p69==1)&&(p70==1))&&(p95==1)) U (p21==1)))) U !((AF(EX(((p16==1)&&(p19==1)))) + (!(EG((((p36==1)&&(p65==1))&&(...343
=> equivalent forward existential formula: [(FwdU(Init,!((E(!(!((!(EG(!(EX(((p16==1)&&(p19==1)))))) + (!(EG((((p36==1)&&(p65==1))&&((p69==1)&&(p83==1))))) ...868
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t9, t10, t13, t16, t17, t18, t19, t20, t24, t27, t28, t40, t42, t43, ...402
Detected timeout of ITS tools.
[2025-06-02 06:21:28] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:21:28] [INFO ] Applying decomposition
[2025-06-02 06:21:28] [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/graph5976613237012784429.txt' '-o' '/tmp/graph5976613237012784429.bin' '-w' '/tmp/graph5976613237012784429.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5976613237012784429.bin' '-l' '-1' '-v' '-w' '/tmp/graph5976613237012784429.weights' '-q' '0' '-e' '0.001'
[2025-06-02 06:21:28] [INFO ] Decomposing Gal with order
[2025-06-02 06:21:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 06:21:28] [INFO ] Removed a total of 442 redundant transitions.
[2025-06-02 06:21:28] [INFO ] Flatten gal took : 23 ms
[2025-06-02 06:21:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 4 ms.
[2025-06-02 06:21:28] [INFO ] Time to serialize gal into /tmp/CTLFireability13439660677553711369.gal : 6 ms
[2025-06-02 06:21:28] [INFO ] Time to serialize properties into /tmp/CTLFireability14135190164333759213.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/CTLFireability13439660677553711369.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14135190164333759213.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.43052e+09,0.174883,9404,399,25,9890,164,299,25506,50,426,0


Converting to forward existential form...Done !
original formula: E(A(EF((EF((i0.u1.p4==1)) * A((((i4.u17.p69==1)&&(i3.u18.p70==1))&&(i4.u25.p95==1)) U (i1.u6.p21==1)))) U !((AF(EX(((i0.u4.p16==1)&&(i0.u...503
=> equivalent forward existential formula: [(FwdU(Init,!((E(!(!((!(EG(!(EX(((i0.u4.p16==1)&&(i0.u5.p19==1)))))) + (!(EG((((i2.i1.u9.p36==1)&&(i2.i1.u16.p65...1190
Reverse transition relation is NOT exact ! Due to transitions t173, t175, t177, t179, i0.t219, i0.t69, i0.t68, i0.t63, i0.u1.t50, i0.u1.t74, i0.u3.t71, i0....594
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 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
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 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 3
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 3
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 246/246 transitions.
Graph (complete) has 544 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 109 transition count 244
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 16 place count 96 transition count 218
Iterating global reduction 2 with 13 rules applied. Total rules applied 29 place count 96 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 96 transition count 216
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 35 place count 94 transition count 214
Applied a total of 35 rules in 23 ms. Remains 94 /111 variables (removed 17) and now considering 214/246 (removed 32) transitions.
[2025-06-02 06:21:58] [INFO ] Flow matrix only has 213 transitions (discarded 1 similar events)
// Phase 1: matrix 213 rows 94 cols
[2025-06-02 06:21:58] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:21:58] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-06-02 06:21:58] [INFO ] Flow matrix only has 213 transitions (discarded 1 similar events)
[2025-06-02 06:21:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:21:58] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 06:21:58] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:21:58] [INFO ] Redundant transitions in 46 ms returned []
Running 213 sub problems to find dead transitions.
[2025-06-02 06:21:58] [INFO ] Flow matrix only has 213 transitions (discarded 1 similar events)
[2025-06-02 06:21:58] [INFO ] Invariant cache hit.
[2025-06-02 06:21:58] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:22:01] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 212/306 variables, 94/115 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 93/208 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 1/307 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (OVERLAPS) 0/307 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 209 constraints, problems are : Problem set: 0 solved, 213 unsolved in 14845 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 212/306 variables, 94/115 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 93/208 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 213/421 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (OVERLAPS) 1/307 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/307 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:22:37] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 9 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/307 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 307/307 variables, and 423 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44954ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 44956ms
Starting structural reductions in SI_CTL mode, iteration 1 : 94/111 places, 214/246 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45369 ms. Remains : 94/111 places, 214/246 transitions.
[2025-06-02 06:22:43] [INFO ] Flatten gal took : 25 ms
[2025-06-02 06:22:43] [INFO ] Flatten gal took : 9 ms
[2025-06-02 06:22:43] [INFO ] Input system was already deterministic with 214 transitions.
[2025-06-02 06:22:43] [INFO ] Flatten gal took : 9 ms
[2025-06-02 06:22:43] [INFO ] Flatten gal took : 9 ms
[2025-06-02 06:22:43] [INFO ] Time to serialize gal into /tmp/CTLFireability9317789020968740933.gal : 3 ms
[2025-06-02 06:22:43] [INFO ] Time to serialize properties into /tmp/CTLFireability15268896096584452583.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/CTLFireability9317789020968740933.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15268896096584452583.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.36468e+09,3.38641,75016,2,6137,5,277216,6,0,584,286035,0


Converting to forward existential form...Done !
original formula: AG((((((p3==0)||(p6==0))||(p24==0)) * (EF(((p69==0)||(p96==0))) + (((p3==1)&&(p17==1))&&(p67==1)))) * ((AF(((p55==0)&&(p70==0))) + (p36==...184
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !((((p3==0)||(p6==0))||(p24==0))))] = FALSE * [((FwdU(Init,TRUE) * !((((p3==1)&&(p17==1))&...317
Hit Full ! (commute/partial/dont) 201/0/13
(forward)formula 0,0,4.78629,75016,1,0,16,356809,24,7,3706,286035,11
FORMULA MedleyA-PT-05-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 246/246 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 101 transition count 226
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 101 transition count 226
Applied a total of 20 rules in 2 ms. Remains 101 /111 variables (removed 10) and now considering 226/246 (removed 20) transitions.
[2025-06-02 06:22:48] [INFO ] Flow matrix only has 225 transitions (discarded 1 similar events)
// Phase 1: matrix 225 rows 101 cols
[2025-06-02 06:22:48] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:22:48] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-02 06:22:48] [INFO ] Flow matrix only has 225 transitions (discarded 1 similar events)
[2025-06-02 06:22:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:22:48] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 06:22:48] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2025-06-02 06:22:48] [INFO ] Flow matrix only has 225 transitions (discarded 1 similar events)
[2025-06-02 06:22:48] [INFO ] Invariant cache hit.
[2025-06-02 06:22:48] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:22:51] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:22:51] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:22:52] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:22:52] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 224/325 variables, 101/125 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 93/218 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 1/326 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (OVERLAPS) 0/326 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 219 constraints, problems are : Problem set: 0 solved, 225 unsolved in 15948 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 101/101 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 224/325 variables, 101/125 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 93/218 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 225/443 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:23:10] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 1/444 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 10 (OVERLAPS) 1/326 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 326/326 variables, and 445 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 101/101 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46052ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 46053ms
Starting structural reductions in LTL mode, iteration 1 : 101/111 places, 226/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46354 ms. Remains : 101/111 places, 226/246 transitions.
[2025-06-02 06:23:34] [INFO ] Flatten gal took : 9 ms
[2025-06-02 06:23:34] [INFO ] Flatten gal took : 9 ms
[2025-06-02 06:23:34] [INFO ] Input system was already deterministic with 226 transitions.
[2025-06-02 06:23:35] [INFO ] Flatten gal took : 10 ms
[2025-06-02 06:23:35] [INFO ] Flatten gal took : 10 ms
[2025-06-02 06:23:35] [INFO ] Time to serialize gal into /tmp/CTLFireability15278870091882824404.gal : 2 ms
[2025-06-02 06:23:35] [INFO ] Time to serialize properties into /tmp/CTLFireability4366816444476104646.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/CTLFireability15278870091882824404.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4366816444476104646.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,2.9885e+09,3.23134,78932,2,10786,5,325286,6,0,623,300802,0


Converting to forward existential form...Done !
original formula: ((EG(E((p44!=1) U A(((((p3==1)&&(p4==1))&&(p24==1))||(p57==1)) U ((((p36==1)&&(p37==1))&&(p62==1))||(p54==1))))) + E((((((p6==1) + !((EF(...490
=> equivalent forward existential formula: ([((Init * !(E((((((p6==1) + !((E(TRUE U (((p36==1)&&(p65==1))&&((p69==1)&&(p83==1)))) + ((p69==1)&&(p96==1)))))...692
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t12, t13, t14, t16, t17, t19, t20, t21, t22, t23, t2...412
Detected timeout of ITS tools.
[2025-06-02 06:24:05] [INFO ] Flatten gal took : 10 ms
[2025-06-02 06:24:05] [INFO ] Applying decomposition
[2025-06-02 06:24:05] [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/graph13632136136965672604.txt' '-o' '/tmp/graph13632136136965672604.bin' '-w' '/tmp/graph13632136136965672604.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13632136136965672604.bin' '-l' '-1' '-v' '-w' '/tmp/graph13632136136965672604.weights' '-q' '0' '-e' '0.001'
[2025-06-02 06:24:05] [INFO ] Decomposing Gal with order
[2025-06-02 06:24:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 06:24:05] [INFO ] Removed a total of 439 redundant transitions.
[2025-06-02 06:24:05] [INFO ] Flatten gal took : 27 ms
[2025-06-02 06:24:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 5 ms.
[2025-06-02 06:24:05] [INFO ] Time to serialize gal into /tmp/CTLFireability789872348661805142.gal : 3 ms
[2025-06-02 06:24:05] [INFO ] Time to serialize properties into /tmp/CTLFireability9543849696409227285.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/CTLFireability789872348661805142.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9543849696409227285.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 -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.9885e+09,0.523406,13792,647,33,17887,164,362,46078,57,483,0


Converting to forward existential form...Done !
original formula: ((EG(E((i1.u11.p44!=1) U A(((((i0.i1.u0.p3==1)&&(i0.i0.u1.p4==1))&&(i0.i1.u6.p24==1))||(i2.u14.p57==1)) U ((((i2.u8.p36==1)&&(i1.u9.p37==...757
=> equivalent forward existential formula: ([((Init * !(E((((((i0.i0.u1.p6==1) + !((E(TRUE U (((i2.u8.p36==1)&&(i2.u15.p65==1))&&((i3.u17.p69==1)&&(i3.u22....1011
Reverse transition relation is NOT exact ! Due to transitions i0.i0.t74, i0.i0.t75, i0.i0.t225, i0.i0.u3.t77, i0.i0.u3.t78, i0.i0.u5.t72, i0.i1.t60, i0.i1....683
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 246/246 transitions.
Graph (complete) has 544 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 244
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 109 transition count 244
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 16 place count 96 transition count 218
Iterating global reduction 2 with 13 rules applied. Total rules applied 29 place count 96 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 96 transition count 215
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 2 with 6 rules applied. Total rules applied 38 place count 93 transition count 212
Applied a total of 38 rules in 32 ms. Remains 93 /111 variables (removed 18) and now considering 212/246 (removed 34) transitions.
[2025-06-02 06:24:35] [INFO ] Flow matrix only has 211 transitions (discarded 1 similar events)
// Phase 1: matrix 211 rows 93 cols
[2025-06-02 06:24:35] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:24:35] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-02 06:24:35] [INFO ] Flow matrix only has 211 transitions (discarded 1 similar events)
[2025-06-02 06:24:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:24:35] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 06:24:35] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:24:35] [INFO ] Redundant transitions in 41 ms returned []
Running 211 sub problems to find dead transitions.
[2025-06-02 06:24:35] [INFO ] Flow matrix only has 211 transitions (discarded 1 similar events)
[2025-06-02 06:24:35] [INFO ] Invariant cache hit.
[2025-06-02 06:24:35] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:24:38] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 210/303 variables, 93/114 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 93/207 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 1/304 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 10 (OVERLAPS) 0/304 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 208 constraints, problems are : Problem set: 0 solved, 211 unsolved in 11574 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 210/303 variables, 93/114 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 93/207 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 211/418 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (OVERLAPS) 1/304 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 11 (OVERLAPS) 0/304 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 419 constraints, problems are : Problem set: 0 solved, 211 unsolved in 25658 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37291ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 37292ms
Starting structural reductions in SI_CTL mode, iteration 1 : 93/111 places, 212/246 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37652 ms. Remains : 93/111 places, 212/246 transitions.
[2025-06-02 06:25:12] [INFO ] Flatten gal took : 5 ms
[2025-06-02 06:25:12] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:25:12] [INFO ] Input system was already deterministic with 212 transitions.
[2025-06-02 06:25:12] [INFO ] Flatten gal took : 5 ms
[2025-06-02 06:25:12] [INFO ] Flatten gal took : 5 ms
[2025-06-02 06:25:12] [INFO ] Time to serialize gal into /tmp/CTLFireability3923288127526022056.gal : 1 ms
[2025-06-02 06:25:12] [INFO ] Time to serialize properties into /tmp/CTLFireability13658624045187891163.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/CTLFireability3923288127526022056.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13658624045187891163.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.33794e+09,2.10143,43952,2,4495,5,179238,6,0,578,154915,0


Converting to forward existential form...Done !
original formula: EF(!(A(AG((EF((((p3==1)&&(p17==1))&&((p69==1)&&(p98==1)))) * !((((p68==1)&&(p73==1))&&(p99==1))))) U EG(!(((p28==1)||((p36==1)&&(p41==1))...161
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,TRUE),!(EG(!(((p28==1)||((p36==1)&&(p41==1))))))) * !(!(E(TRUE U !((E(TRUE U (((p3==1)&&(p17=...362
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t8, t9, t15, t16, t17, t18, t24, t25, t37, t39, t40, t42, t43, t46, t47, ...356
Detected timeout of ITS tools.
[2025-06-02 06:25:42] [INFO ] Flatten gal took : 5 ms
[2025-06-02 06:25:42] [INFO ] Applying decomposition
[2025-06-02 06:25:43] [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/graph11704718412501468233.txt' '-o' '/tmp/graph11704718412501468233.bin' '-w' '/tmp/graph11704718412501468233.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11704718412501468233.bin' '-l' '-1' '-v' '-w' '/tmp/graph11704718412501468233.weights' '-q' '0' '-e' '0.001'
[2025-06-02 06:25:43] [INFO ] Decomposing Gal with order
[2025-06-02 06:25:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 06:25:43] [INFO ] Removed a total of 379 redundant transitions.
[2025-06-02 06:25:43] [INFO ] Flatten gal took : 16 ms
[2025-06-02 06:25:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 3 ms.
[2025-06-02 06:25:43] [INFO ] Time to serialize gal into /tmp/CTLFireability13592629182730969597.gal : 2 ms
[2025-06-02 06:25:43] [INFO ] Time to serialize properties into /tmp/CTLFireability16701106150560288298.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/CTLFireability13592629182730969597.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16701106150560288298.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.33794e+09,0.210747,8484,301,67,7523,359,320,22745,98,842,0


Converting to forward existential form...Done !
original formula: EF(!(A(AG((EF((((i0.u5.p3==1)&&(i0.u4.p17==1))&&((i2.u14.p69==1)&&(i3.u22.p98==1)))) * !((((i2.u14.p68==1)&&(i2.u15.p73==1))&&(i3.u21.p99...232
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,TRUE),!(EG(!(((i0.u5.p28==1)||((i1.i1.u6.p36==1)&&(i1.i0.u8.p41==1))))))) * !(!(E(TRUE U !((E...481
Reverse transition relation is NOT exact ! Due to transitions t164, t166, t208, t210, i0.t199, i0.t64, i0.t63, i0.u2.t66, i0.u2.t67, i0.u4.t61, i0.u5.t46, ...500
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
(forward)formula 0,1,7.7217,172808,1,0,228335,10221,2344,948566,534,70330,175586
FORMULA MedleyA-PT-05-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 246/246 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 98 transition count 220
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 98 transition count 220
Applied a total of 26 rules in 4 ms. Remains 98 /111 variables (removed 13) and now considering 220/246 (removed 26) transitions.
[2025-06-02 06:25:50] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
// Phase 1: matrix 219 rows 98 cols
[2025-06-02 06:25:50] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:25:50] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-02 06:25:50] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
[2025-06-02 06:25:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:25:51] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 06:25:51] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2025-06-02 06:25:51] [INFO ] Flow matrix only has 219 transitions (discarded 1 similar events)
[2025-06-02 06:25:51] [INFO ] Invariant cache hit.
[2025-06-02 06:25:51] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:25:53] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 218/316 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 93/212 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 1/317 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/317 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (OVERLAPS) 0/317 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 213 constraints, problems are : Problem set: 0 solved, 219 unsolved in 14506 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 218/316 variables, 98/119 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 93/212 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 219/431 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 1/317 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/317 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (OVERLAPS) 0/317 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 432 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 98/98 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44581ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 44582ms
Starting structural reductions in LTL mode, iteration 1 : 98/111 places, 220/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44881 ms. Remains : 98/111 places, 220/246 transitions.
[2025-06-02 06:26:35] [INFO ] Flatten gal took : 7 ms
[2025-06-02 06:26:35] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:26:35] [INFO ] Input system was already deterministic with 220 transitions.
[2025-06-02 06:26:35] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:26:35] [INFO ] Flatten gal took : 5 ms
[2025-06-02 06:26:35] [INFO ] Time to serialize gal into /tmp/CTLFireability6872406718052101970.gal : 2 ms
[2025-06-02 06:26:35] [INFO ] Time to serialize properties into /tmp/CTLFireability21953184484078651.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/CTLFireability6872406718052101970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability21953184484078651.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,2.39146e+09,2.59512,57172,2,6254,5,228382,6,0,605,220668,0


Converting to forward existential form...Done !
original formula: E(((p55==1) * !(AG((EX((((p36==1)&&(p50==1))&&(p67==1))) * AX((((p36==1)&&(p44==1))&&(p67==1))))))) U AG(AX(EF(((((p34==1)&&(p100==1))&&(...202
=> equivalent forward existential formula: [(FwdU(Init,((p55==1) * !(!(E(TRUE U !((EX((((p36==1)&&(p50==1))&&(p67==1))) * !(EX(!((((p36==1)&&(p44==1))&&(p6...290
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t7, t9, t10, t13, t16, t17, t18, t19, t21, t24, t26, t27, t28, t34, t35, ...402
Detected timeout of ITS tools.
[2025-06-02 06:27:05] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:27:05] [INFO ] Applying decomposition
[2025-06-02 06:27:05] [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/graph17407729348053549379.txt' '-o' '/tmp/graph17407729348053549379.bin' '-w' '/tmp/graph17407729348053549379.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17407729348053549379.bin' '-l' '-1' '-v' '-w' '/tmp/graph17407729348053549379.weights' '-q' '0' '-e' '0.001'
[2025-06-02 06:27:05] [INFO ] Decomposing Gal with order
[2025-06-02 06:27:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 06:27:05] [INFO ] Removed a total of 384 redundant transitions.
[2025-06-02 06:27:05] [INFO ] Flatten gal took : 16 ms
[2025-06-02 06:27:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 3 ms.
[2025-06-02 06:27:05] [INFO ] Time to serialize gal into /tmp/CTLFireability13661295579453753068.gal : 2 ms
[2025-06-02 06:27:05] [INFO ] Time to serialize properties into /tmp/CTLFireability1033946992405763832.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/CTLFireability13661295579453753068.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1033946992405763832.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.39146e+09,0.151832,8300,335,68,8095,430,313,16862,104,863,0


Converting to forward existential form...Done !
original formula: E(((u13.p55==1) * !(AG((EX((((u13.p36==1)&&(i1.u12.p50==1))&&(i4.u26.p67==1))) * AX((((u13.p36==1)&&(i1.u10.p44==1))&&(i4.u26.p67==1)))))...288
=> equivalent forward existential formula: [(FwdU(Init,((u13.p55==1) * !(!(E(TRUE U !((EX((((u13.p36==1)&&(i1.u12.p50==1))&&(i4.u26.p67==1))) * !(EX(!((((u...376
Reverse transition relation is NOT exact ! Due to transitions t172, t174, t176, t178, u13.t27, u13.t28, u13.t34, u13.t35, i0.i0.t68, i0.i0.t69, i0.i0.t219,...592
(forward)formula 0,0,3.8981,89196,1,0,123025,4944,2106,382394,548,12192,198313
FORMULA MedleyA-PT-05-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 246/246 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 97 transition count 218
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 97 transition count 218
Applied a total of 28 rules in 2 ms. Remains 97 /111 variables (removed 14) and now considering 218/246 (removed 28) transitions.
[2025-06-02 06:27:09] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
// Phase 1: matrix 217 rows 97 cols
[2025-06-02 06:27:09] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:27:09] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-02 06:27:09] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2025-06-02 06:27:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:27:09] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 06:27:10] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-06-02 06:27:10] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2025-06-02 06:27:10] [INFO ] Invariant cache hit.
[2025-06-02 06:27:10] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:27:12] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 15204 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45281ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 45282ms
Starting structural reductions in LTL mode, iteration 1 : 97/111 places, 218/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45542 ms. Remains : 97/111 places, 218/246 transitions.
[2025-06-02 06:27:55] [INFO ] Flatten gal took : 5 ms
[2025-06-02 06:27:55] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:27:55] [INFO ] Input system was already deterministic with 218 transitions.
[2025-06-02 06:27:55] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:27:55] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:27:55] [INFO ] Time to serialize gal into /tmp/CTLFireability10622572909483501296.gal : 1 ms
[2025-06-02 06:27:55] [INFO ] Time to serialize properties into /tmp/CTLFireability17086249204599582765.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/CTLFireability10622572909483501296.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17086249204599582765.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,2.19389e+09,1.9234,51088,2,5366,5,203096,6,0,599,177228,0


Converting to forward existential form...Done !
original formula: AX(EF(AG(AX((((p36==0)||(p50==0))||((p69==0)||(p98==0)))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U !(!(EX(!((((p36==0)||(p50==0))||((p69==0)||(p98==0))))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t9, t10, t16, t17, t18, t19, t27, t28, t40, t42, t43, t45, t46, t51, t52,...353
(forward)formula 0,1,12.7429,268952,1,0,372,1.41696e+06,456,149,5425,1.0027e+06,486
FORMULA MedleyA-PT-05-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 246/246 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 97 transition count 218
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 97 transition count 218
Applied a total of 28 rules in 3 ms. Remains 97 /111 variables (removed 14) and now considering 218/246 (removed 28) transitions.
[2025-06-02 06:28:08] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2025-06-02 06:28:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:28:08] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-02 06:28:08] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2025-06-02 06:28:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:28:08] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 06:28:08] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-06-02 06:28:08] [INFO ] Flow matrix only has 217 transitions (discarded 1 similar events)
[2025-06-02 06:28:08] [INFO ] Invariant cache hit.
[2025-06-02 06:28:08] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:28:11] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 1/314 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/314 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 212 constraints, problems are : Problem set: 0 solved, 217 unsolved in 12552 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 216/313 variables, 97/118 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 93/211 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 217/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 1/314 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/314 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 429 constraints, problems are : Problem set: 0 solved, 217 unsolved in 28366 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 97/97 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40978ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 40979ms
Starting structural reductions in LTL mode, iteration 1 : 97/111 places, 218/246 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41296 ms. Remains : 97/111 places, 218/246 transitions.
[2025-06-02 06:28:49] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:28:49] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:28:49] [INFO ] Input system was already deterministic with 218 transitions.
[2025-06-02 06:28:49] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:28:49] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:28:49] [INFO ] Time to serialize gal into /tmp/CTLFireability14227955494188866864.gal : 2 ms
[2025-06-02 06:28:49] [INFO ] Time to serialize properties into /tmp/CTLFireability2814540209525528047.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/CTLFireability14227955494188866864.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2814540209525528047.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,2.19389e+09,1.91313,50776,2,5366,5,203096,6,0,599,177228,0


Converting to forward existential form...Done !
original formula: AX(EF(EG((E(((p81==1)&&(p84==1)) U (p1==1)) + ((AF((p62==1)) * (p9==1)) * (p12==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U EG((E(((p81==1)&&(p84==1)) U (p1==1)) + ((!(EG(!((p62==1)))) * (p9==1)) * (p12==1)))))))...164
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t9, t10, t16, t17, t18, t19, t27, t28, t40, t42, t43, t45, t46, t51, t52,...353
Detected timeout of ITS tools.
[2025-06-02 06:29:19] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:29:19] [INFO ] Applying decomposition
[2025-06-02 06:29:19] [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/graph356453282295843203.txt' '-o' '/tmp/graph356453282295843203.bin' '-w' '/tmp/graph356453282295843203.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph356453282295843203.bin' '-l' '-1' '-v' '-w' '/tmp/graph356453282295843203.weights' '-q' '0' '-e' '0.001'
[2025-06-02 06:29:19] [INFO ] Decomposing Gal with order
[2025-06-02 06:29:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 06:29:19] [INFO ] Removed a total of 431 redundant transitions.
[2025-06-02 06:29:19] [INFO ] Flatten gal took : 16 ms
[2025-06-02 06:29:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 9 ms.
[2025-06-02 06:29:19] [INFO ] Time to serialize gal into /tmp/CTLFireability17318639189733451672.gal : 2 ms
[2025-06-02 06:29:19] [INFO ] Time to serialize properties into /tmp/CTLFireability9464325108163622276.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/CTLFireability17318639189733451672.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9464325108163622276.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.19389e+09,0.194176,8248,261,23,8282,133,279,18792,47,340,0


Converting to forward existential form...Done !
original formula: AX(EF(EG((E(((i2.u20.p81==1)&&(i2.u21.p84==1)) U (i4.u26.p1==1)) + ((AF((i1.i1.u15.p62==1)) * (i0.i0.u2.p9==1)) * (i0.i0.u3.p12==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U EG((E(((i2.u20.p81==1)&&(i2.u21.p84==1)) U (i4.u26.p1==1)) + ((!(EG(!((i1.i1.u15.p62==1)...213
Reverse transition relation is NOT exact ! Due to transitions t170, t172, t174, t176, i0.i0.t66, i0.i0.t67, i0.i0.t217, i0.i0.u3.t69, i0.i0.u3.t70, i0.i0.u...516
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
(forward)formula 0,1,4.07666,96440,1,0,141911,335,2009,479311,212,973,169691
FORMULA MedleyA-PT-05-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 : 111/111 places, 246/246 transitions.
Graph (complete) has 544 edges and 111 vertex of which 110 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 110 transition count 244
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 109 transition count 244
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 16 place count 96 transition count 218
Iterating global reduction 0 with 13 rules applied. Total rules applied 29 place count 96 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 96 transition count 215
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 0 with 6 rules applied. Total rules applied 38 place count 93 transition count 212
Applied a total of 38 rules in 26 ms. Remains 93 /111 variables (removed 18) and now considering 212/246 (removed 34) transitions.
[2025-06-02 06:29:23] [INFO ] Flow matrix only has 211 transitions (discarded 1 similar events)
// Phase 1: matrix 211 rows 93 cols
[2025-06-02 06:29:23] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:29:23] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-02 06:29:23] [INFO ] Flow matrix only has 211 transitions (discarded 1 similar events)
[2025-06-02 06:29:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 06:29:24] [INFO ] State equation strengthened by 94 read => feed constraints.
[2025-06-02 06:29:24] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 06:29:24] [INFO ] Redundant transitions in 30 ms returned []
Running 211 sub problems to find dead transitions.
[2025-06-02 06:29:24] [INFO ] Flow matrix only has 211 transitions (discarded 1 similar events)
[2025-06-02 06:29:24] [INFO ] Invariant cache hit.
[2025-06-02 06:29:24] [INFO ] State equation strengthened by 94 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:29:26] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:29:26] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 06:29:26] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 210/303 variables, 93/116 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 93/209 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 1/304 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/304 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 10 (OVERLAPS) 0/304 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 210 constraints, problems are : Problem set: 0 solved, 211 unsolved in 12406 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 210/303 variables, 93/116 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 93/209 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 211/420 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (OVERLAPS) 1/304 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 11 (OVERLAPS) 0/304 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 421 constraints, problems are : Problem set: 0 solved, 211 unsolved in 24883 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, ReadFeed: 94/94 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37349ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 37350ms
Starting structural reductions in SI_CTL mode, iteration 1 : 93/111 places, 212/246 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37667 ms. Remains : 93/111 places, 212/246 transitions.
[2025-06-02 06:30:01] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:30:01] [INFO ] Flatten gal took : 5 ms
[2025-06-02 06:30:01] [INFO ] Input system was already deterministic with 212 transitions.
[2025-06-02 06:30:01] [INFO ] Flatten gal took : 9 ms
[2025-06-02 06:30:01] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:30:01] [INFO ] Time to serialize gal into /tmp/CTLFireability8922000387231897556.gal : 1 ms
[2025-06-02 06:30:01] [INFO ] Time to serialize properties into /tmp/CTLFireability14948562476033845837.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/CTLFireability8922000387231897556.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14948562476033845837.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.19523e+09,1.98964,52028,2,5429,5,201518,6,0,578,185514,0


Converting to forward existential form...Done !
original formula: EF((((EF(((p20==1)||(((p69==1)&&(p98==1))&&((p100==1)&&(p113==1))))) * (p3==1)) * ((p17==1)&&(p69==1))) * ((p98==1) * ((AG(EF(((p48==1)&&...250
=> equivalent forward existential formula: (([(((FwdU(Init,TRUE) * ((E(TRUE U ((p20==1)||(((p69==1)&&(p98==1))&&((p100==1)&&(p113==1))))) * (p3==1)) * ((p1...634
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t8, t9, t15, t16, t17, t18, t24, t25, t37, t39, t40, t42, t43, t46, t47, ...367
Detected timeout of ITS tools.
[2025-06-02 06:30:31] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:30:31] [INFO ] Applying decomposition
[2025-06-02 06:30:31] [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/graph4088277108029317162.txt' '-o' '/tmp/graph4088277108029317162.bin' '-w' '/tmp/graph4088277108029317162.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4088277108029317162.bin' '-l' '-1' '-v' '-w' '/tmp/graph4088277108029317162.weights' '-q' '0' '-e' '0.001'
[2025-06-02 06:30:31] [INFO ] Decomposing Gal with order
[2025-06-02 06:30:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 06:30:31] [INFO ] Removed a total of 424 redundant transitions.
[2025-06-02 06:30:31] [INFO ] Flatten gal took : 14 ms
[2025-06-02 06:30:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 4 ms.
[2025-06-02 06:30:31] [INFO ] Time to serialize gal into /tmp/CTLFireability6156463417911159456.gal : 1 ms
[2025-06-02 06:30:31] [INFO ] Time to serialize properties into /tmp/CTLFireability2664833569150285950.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/CTLFireability6156463417911159456.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2664833569150285950.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.19523e+09,0.13452,8332,343,36,7577,177,309,22679,51,437,0


Converting to forward existential form...Done !
original formula: EF((((EF(((i1.u7.p20==1)||(((i3.u16.p69==1)&&(i4.u22.p98==1))&&((i5.u28.p100==1)&&(i5.u30.p113==1))))) * (i1.u0.p3==1)) * ((i0.u5.p17==1)...375
=> equivalent forward existential formula: (([(((FwdU(Init,TRUE) * ((E(TRUE U ((i1.u7.p20==1)||(((i3.u16.p69==1)&&(i4.u22.p98==1))&&((i5.u28.p100==1)&&(i5....879
Reverse transition relation is NOT exact ! Due to transitions t164, t166, t209, t211, i0.t198, i0.t64, i0.t63, i0.u1.t57, i0.u3.t66, i0.u3.t67, i0.u5.t61, ...508
(forward)formula 0,1,1.12557,25484,1,0,38723,324,1936,112345,215,721,78656
FORMULA MedleyA-PT-05-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2025-06-02 06:30:32] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:30:32] [INFO ] Flatten gal took : 6 ms
[2025-06-02 06:30:32] [INFO ] Applying decomposition
[2025-06-02 06:30:32] [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/graph15100478140883750226.txt' '-o' '/tmp/graph15100478140883750226.bin' '-w' '/tmp/graph15100478140883750226.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15100478140883750226.bin' '-l' '-1' '-v' '-w' '/tmp/graph15100478140883750226.weights' '-q' '0' '-e' '0.001'
[2025-06-02 06:30:32] [INFO ] Decomposing Gal with order
[2025-06-02 06:30:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 06:30:32] [INFO ] Removed a total of 367 redundant transitions.
[2025-06-02 06:30:32] [INFO ] Flatten gal took : 15 ms
[2025-06-02 06:30:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 3 ms.
[2025-06-02 06:30:32] [INFO ] Time to serialize gal into /tmp/CTLFireability9944761038450873424.gal : 2 ms
[2025-06-02 06:30:32] [INFO ] Time to serialize properties into /tmp/CTLFireability7396503341560223766.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/CTLFireability9944761038450873424.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7396503341560223766.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 5 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.46765e+09,0.959564,25244,1180,234,33368,1133,323,95138,158,5874,0


Converting to forward existential form...Done !
original formula: E(!(A(AG(AX((((i4.u14.p69==1)&&(i4.u15.p72==1))&&(u20.p90==1)))) U AG(AX((i2.u8.p38==1))))) U AF((i1.u7.p27==1)))
=> equivalent forward existential formula: [(FwdU(Init,!(!((E(!(!(E(TRUE U !(!(EX(!((i2.u8.p38==1)))))))) U (!(!(E(TRUE U !(!(EX(!((((i4.u14.p69==1)&&(i4.u...328
Reverse transition relation is NOT exact ! Due to transitions u20.t3, u20.t4, u20.t5, u20.t6, u20.t7, u20.t8, u20.t9, u20.t10, u20.t11, u20.t12, u20.t13, u...972
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 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
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,1,254.855,2223080,1,0,2.66055e+06,10610,774,6.7717e+06,388,35976,1110717
FORMULA MedleyA-PT-05-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(((EF(EX((i4.u15.p70==1))) + AF(!((((u13.p36==1)&&(i2.u10.p44==1))&&((i4.u14.p69==1)&&(u20.p98==1)))))) * (!(((E((i2.u8.p38==1) U (((u13...493
=> equivalent forward existential formula: [(FwdU(Init,((E(TRUE U EX((i4.u15.p70==1))) + !(EG(!(!((((u13.p36==1)&&(i2.u10.p44==1))&&((i4.u14.p69==1)&&(u20....714
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 1,1,514.437,2446696,1,0,3.04914e+06,23665,774,8.14094e+06,388,89572,2291633
FORMULA MedleyA-PT-05-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E((!((EX((AX((((u13.p36==1)&&(i2.u8.p37==1))&&(u13.p57==1))) * AF((((i0.u0.p3==1)&&(i0.u5.p17==1))&&((i4.u14.p69==1)&&(u20.p98==1)))))) +...497
=> equivalent forward existential formula: [(((FwdU(Init,(!((EX((!(EX(!((((u13.p36==1)&&(i2.u8.p37==1))&&(u13.p57==1))))) * !(EG(!((((i0.u0.p3==1)&&(i0.u5....573
(forward)formula 2,1,818.353,2990056,1,0,3.53128e+06,23665,782,9.13083e+06,390,89572,367279
FORMULA MedleyA-PT-05-CTLFireability-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(A(EF((EF((i0.u1.p4==1)) * A((((i4.u14.p69==1)&&(i4.u15.p70==1))&&(u20.p95==1)) U (i1.u6.p21==1)))) U !((AF(EX(((i0.u4.p16==1)&&(i0.u5.p...478
=> equivalent forward existential formula: [(FwdU(Init,!((E(!(!((!(EG(!(EX(((i0.u4.p16==1)&&(i0.u5.p19==1)))))) + (!(EG((((u13.p36==1)&&(u13.p65==1))&&((i4...1143
Using saturation style SCC detection
Using saturation style SCC detection
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
Using saturation style SCC detection
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
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 3,1,1279.95,3490408,1,0,4.09944e+06,23665,774,1.0129e+07,388,89572,3373975
FORMULA MedleyA-PT-05-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: ((EG(E((i2.u10.p44!=1) U A(((((i0.u0.p3==1)&&(i0.u1.p4==1))&&(i1.u6.p24==1))||(u13.p57==1)) U ((((u13.p36==1)&&(i2.u8.p37==1))&&(u13.p62=...686
=> equivalent forward existential formula: ([((Init * !(E((((((i0.u1.p6==1) + !((E(TRUE U (((u13.p36==1)&&(u13.p65==1))&&((i4.u14.p69==1)&&(i4.u19.p83==1))...924
(forward)formula 4,0,1495.15,3918440,1,0,4.60088e+06,23665,775,1.07275e+07,388,89572,2473428
FORMULA MedleyA-PT-05-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 2862316 ms.

BK_STOP 1748847330409

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-05"
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-05, 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-174876524000130"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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