fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r142-tall-174876812000154
Last Updated
June 24, 2025

About the Execution of ITS-Tools for NoC3x3-PT-1A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 3600000.00 0.00 0.00 TF?T?TTFFFTFTFF? normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K 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 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K 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.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K 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 81K 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 NoC3x3-PT-1A-CTLFireability-2023-12
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-2023-13
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-2023-14
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-2023-15
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-2025-00
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-2025-01
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-2025-02
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-2025-03
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-2025-04
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-2025-05
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-2025-06
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-2025-07
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-2025-08
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-2025-09
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-2025-10
FORMULA_NAME NoC3x3-PT-1A-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748811953398

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-1A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-01 21:05:55] [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-01 21:05:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 21:05:55] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2025-06-01 21:05:55] [INFO ] Transformed 165 places.
[2025-06-01 21:05:55] [INFO ] Transformed 355 transitions.
[2025-06-01 21:05:55] [INFO ] Found NUPN structural information;
[2025-06-01 21:05:55] [INFO ] Parsed PT model containing 165 places and 355 transitions and 1069 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 108 transitions
Reduce redundant transitions removed 108 transitions.
FORMULA NoC3x3-PT-1A-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 87 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 247/247 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 151 transition count 230
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 151 transition count 230
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 0 with 31 rules applied. Total rules applied 59 place count 151 transition count 199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 60 place count 150 transition count 199
Applied a total of 60 rules in 32 ms. Remains 150 /165 variables (removed 15) and now considering 199/247 (removed 48) transitions.
// Phase 1: matrix 199 rows 150 cols
[2025-06-01 21:05:55] [INFO ] Computed 39 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:05:55] [INFO ] Implicit Places using invariants in 229 ms returned []
[2025-06-01 21:05:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:05:55] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2025-06-01 21:05:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 5/150 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 199/349 variables, 150/189 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/349 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 189 constraints, problems are : Problem set: 0 solved, 198 unsolved in 8855 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (OVERLAPS) 5/150 variables, 5/39 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 199/349 variables, 150/189 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 198/387 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 0/349 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 387 constraints, problems are : Problem set: 0 solved, 198 unsolved in 10783 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19718ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 19736ms
Starting structural reductions in LTL mode, iteration 1 : 150/165 places, 199/247 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20200 ms. Remains : 150/165 places, 199/247 transitions.
Support contains 87 out of 150 places after structural reductions.
[2025-06-01 21:06:16] [INFO ] Flatten gal took : 45 ms
[2025-06-01 21:06:16] [INFO ] Flatten gal took : 17 ms
[2025-06-01 21:06:16] [INFO ] Input system was already deterministic with 199 transitions.
Support contains 84 out of 150 places (down from 87) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1481 ms. (26 steps per ms) remains 2/62 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 2/2 properties
[2025-06-01 21:06:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 127/150 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 199/349 variables, 150/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/349 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 189 constraints, problems are : Problem set: 0 solved, 2 unsolved in 370 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 127/150 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 199/349 variables, 150/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/349 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 191 constraints, problems are : Problem set: 0 solved, 2 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, State Equation: 150/150 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 571ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 84 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=16 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 9 ms.
[2025-06-01 21:06:17] [INFO ] Flatten gal took : 12 ms
[2025-06-01 21:06:17] [INFO ] Flatten gal took : 12 ms
[2025-06-01 21:06:18] [INFO ] Input system was already deterministic with 199 transitions.
Computed a total of 6 stabilizing places and 1 stable transitions
Graph (complete) has 461 edges and 150 vertex of which 145 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 199/199 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 145 transition count 199
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 19 place count 131 transition count 185
Iterating global reduction 1 with 14 rules applied. Total rules applied 33 place count 131 transition count 185
Applied a total of 33 rules in 8 ms. Remains 131 /150 variables (removed 19) and now considering 185/199 (removed 14) transitions.
// Phase 1: matrix 185 rows 131 cols
[2025-06-01 21:06:18] [INFO ] Computed 34 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:06:18] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-01 21:06:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:06:18] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2025-06-01 21:06:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 185/316 variables, 131/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 0/316 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 165 constraints, problems are : Problem set: 0 solved, 184 unsolved in 5688 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 185/316 variables, 131/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 184/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/316 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 349 constraints, problems are : Problem set: 0 solved, 184 unsolved in 7758 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13478ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 13478ms
Starting structural reductions in LTL mode, iteration 1 : 131/150 places, 185/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13664 ms. Remains : 131/150 places, 185/199 transitions.
[2025-06-01 21:06:31] [INFO ] Flatten gal took : 10 ms
[2025-06-01 21:06:31] [INFO ] Flatten gal took : 10 ms
[2025-06-01 21:06:31] [INFO ] Input system was already deterministic with 185 transitions.
[2025-06-01 21:06:31] [INFO ] Flatten gal took : 10 ms
[2025-06-01 21:06:31] [INFO ] Flatten gal took : 9 ms
[2025-06-01 21:06:31] [INFO ] Time to serialize gal into /tmp/CTLFireability13284113138176668999.gal : 7 ms
[2025-06-01 21:06:31] [INFO ] Time to serialize properties into /tmp/CTLFireability8399083005383251640.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/CTLFireability13284113138176668999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8399083005383251640.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.04304e+19,0.116473,8888,2,356,5,23412,6,0,711,29358,0


Converting to forward existential form...Done !
original formula: (!(E((!(A(((p0==1)||(p108==1)) U (p105==1))) * !((!(((p25==1)&&(p38==1))) * EX(((p36==1)&&(p44==1)))))) U AF(!(EF(((p124==1)&&(p139==1)))...189
=> equivalent forward existential formula: ([(FwdU(Init,(!(!((E(!((p105==1)) U (!(((p0==1)||(p108==1))) * !((p105==1)))) + EG(!((p105==1)))))) * !((!(((p25...312
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 178/0/7
Detected timeout of ITS tools.
[2025-06-01 21:07:01] [INFO ] Flatten gal took : 10 ms
[2025-06-01 21:07:01] [INFO ] Applying decomposition
[2025-06-01 21:07:01] [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/graph8796050633515747238.txt' '-o' '/tmp/graph8796050633515747238.bin' '-w' '/tmp/graph8796050633515747238.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8796050633515747238.bin' '-l' '-1' '-v' '-w' '/tmp/graph8796050633515747238.weights' '-q' '0' '-e' '0.001'
[2025-06-01 21:07:01] [INFO ] Decomposing Gal with order
[2025-06-01 21:07:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 21:07:01] [INFO ] Removed a total of 40 redundant transitions.
[2025-06-01 21:07:02] [INFO ] Flatten gal took : 43 ms
[2025-06-01 21:07:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 7 ms.
[2025-06-01 21:07:02] [INFO ] Time to serialize gal into /tmp/CTLFireability8279685545091913674.gal : 4 ms
[2025-06-01 21:07:02] [INFO ] Time to serialize properties into /tmp/CTLFireability17671480447293092353.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/CTLFireability8279685545091913674.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17671480447293092353.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.04304e+19,0.042778,5576,62,34,3012,391,308,4667,57,1804,0


Converting to forward existential form...Done !
original formula: (!(E((!(A(((i5.u16.p0==1)||(i5.u20.p108==1)) U (i6.u19.p105==1))) * !((!(((i2.u4.p25==1)&&(i2.u6.p38==1))) * EX(((i2.u5.p36==1)&&(i2.u8.p...262
=> equivalent forward existential formula: ([(FwdU(Init,(!(!((E(!((i6.u19.p105==1)) U (!(((i5.u16.p0==1)||(i5.u20.p108==1))) * !((i6.u19.p105==1)))) + EG(!...399
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 199/199 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 145 transition count 199
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 19 place count 131 transition count 185
Iterating global reduction 1 with 14 rules applied. Total rules applied 33 place count 131 transition count 185
Applied a total of 33 rules in 8 ms. Remains 131 /150 variables (removed 19) and now considering 185/199 (removed 14) transitions.
[2025-06-01 21:07:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:07:32] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-01 21:07:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:07:32] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2025-06-01 21:07:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 185/316 variables, 131/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 0/316 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 165 constraints, problems are : Problem set: 0 solved, 184 unsolved in 6012 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 185/316 variables, 131/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 184/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/316 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 349 constraints, problems are : Problem set: 0 solved, 184 unsolved in 8496 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14535ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 14536ms
Starting structural reductions in LTL mode, iteration 1 : 131/150 places, 185/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14712 ms. Remains : 131/150 places, 185/199 transitions.
[2025-06-01 21:07:46] [INFO ] Flatten gal took : 10 ms
[2025-06-01 21:07:46] [INFO ] Flatten gal took : 8 ms
[2025-06-01 21:07:46] [INFO ] Input system was already deterministic with 185 transitions.
[2025-06-01 21:07:46] [INFO ] Flatten gal took : 7 ms
[2025-06-01 21:07:46] [INFO ] Flatten gal took : 8 ms
[2025-06-01 21:07:46] [INFO ] Time to serialize gal into /tmp/CTLFireability5124170668569243024.gal : 2 ms
[2025-06-01 21:07:46] [INFO ] Time to serialize properties into /tmp/CTLFireability4856525423866420238.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/CTLFireability5124170668569243024.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4856525423866420238.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.04304e+19,0.115408,8980,2,356,5,23412,6,0,711,29358,0


Converting to forward existential form...Done !
original formula: AG(EX(EF((p139==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(E(TRUE U (p139==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.162769,9236,1,0,6,23412,14,0,3389,29358,5
FORMULA NoC3x3-PT-1A-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 199/199 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 145 transition count 199
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 19 place count 131 transition count 185
Iterating global reduction 1 with 14 rules applied. Total rules applied 33 place count 131 transition count 185
Applied a total of 33 rules in 12 ms. Remains 131 /150 variables (removed 19) and now considering 185/199 (removed 14) transitions.
[2025-06-01 21:07:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:07:47] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-01 21:07:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:07:47] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2025-06-01 21:07:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 185/316 variables, 131/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 0/316 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 165 constraints, problems are : Problem set: 0 solved, 184 unsolved in 5961 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 185/316 variables, 131/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 184/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/316 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 349 constraints, problems are : Problem set: 0 solved, 184 unsolved in 8488 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14484ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 14485ms
Starting structural reductions in LTL mode, iteration 1 : 131/150 places, 185/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14684 ms. Remains : 131/150 places, 185/199 transitions.
[2025-06-01 21:08:01] [INFO ] Flatten gal took : 15 ms
[2025-06-01 21:08:01] [INFO ] Flatten gal took : 8 ms
[2025-06-01 21:08:01] [INFO ] Input system was already deterministic with 185 transitions.
[2025-06-01 21:08:01] [INFO ] Flatten gal took : 7 ms
[2025-06-01 21:08:01] [INFO ] Flatten gal took : 7 ms
[2025-06-01 21:08:01] [INFO ] Time to serialize gal into /tmp/CTLFireability2138993327678547572.gal : 2 ms
[2025-06-01 21:08:01] [INFO ] Time to serialize properties into /tmp/CTLFireability5542777309892971470.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/CTLFireability2138993327678547572.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5542777309892971470.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.04304e+19,0.110356,8940,2,356,5,23412,6,0,711,29358,0


Converting to forward existential form...Done !
original formula: (EX(AG(((p119==1)&&(p132==1)))) + AG(EX((p139==0))))
=> equivalent forward existential formula: [(FwdU((Init * !(EX(!(E(TRUE U !(((p119==1)&&(p132==1)))))))),TRUE) * !(EX((p139==0))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.152454,9196,1,0,6,23412,10,0,3295,29358,4
FORMULA NoC3x3-PT-1A-CTLFireability-2025-02 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 : 150/150 places, 199/199 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 145 transition count 199
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 18 place count 132 transition count 186
Iterating global reduction 1 with 13 rules applied. Total rules applied 31 place count 132 transition count 186
Applied a total of 31 rules in 6 ms. Remains 132 /150 variables (removed 18) and now considering 186/199 (removed 13) transitions.
// Phase 1: matrix 186 rows 132 cols
[2025-06-01 21:08:01] [INFO ] Computed 34 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:08:02] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-01 21:08:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:08:02] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2025-06-01 21:08:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 186/318 variables, 132/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 166 constraints, problems are : Problem set: 0 solved, 185 unsolved in 6313 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 186/318 variables, 132/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 185/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 0/318 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 351 constraints, problems are : Problem set: 0 solved, 185 unsolved in 8403 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14731ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 14732ms
Starting structural reductions in LTL mode, iteration 1 : 132/150 places, 186/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14922 ms. Remains : 132/150 places, 186/199 transitions.
[2025-06-01 21:08:16] [INFO ] Flatten gal took : 11 ms
[2025-06-01 21:08:16] [INFO ] Flatten gal took : 9 ms
[2025-06-01 21:08:16] [INFO ] Input system was already deterministic with 186 transitions.
[2025-06-01 21:08:16] [INFO ] Flatten gal took : 7 ms
[2025-06-01 21:08:16] [INFO ] Flatten gal took : 6 ms
[2025-06-01 21:08:16] [INFO ] Time to serialize gal into /tmp/CTLFireability10981484347167523356.gal : 1 ms
[2025-06-01 21:08:16] [INFO ] Time to serialize properties into /tmp/CTLFireability1434733413075854328.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/CTLFireability10981484347167523356.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1434733413075854328.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.5538e+19,0.122963,9208,2,359,5,24573,6,0,716,30719,0


Converting to forward existential form...Done !
original formula: E(((p11==1)&&(p15==1)) U AG(EX(AX((p18!=1)))))
=> equivalent forward existential formula: [(FwdU(Init,((p11==1)&&(p15==1))) * !(E(TRUE U !(EX(!(EX(!((p18!=1)))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 178/8/8
(forward)formula 0,0,5.0448,171500,1,0,13,693414,22,4,3433,1.03894e+06,10
FORMULA NoC3x3-PT-1A-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 199/199 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 145 transition count 199
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 16 place count 134 transition count 188
Iterating global reduction 1 with 11 rules applied. Total rules applied 27 place count 134 transition count 188
Applied a total of 27 rules in 9 ms. Remains 134 /150 variables (removed 16) and now considering 188/199 (removed 11) transitions.
// Phase 1: matrix 188 rows 134 cols
[2025-06-01 21:08:22] [INFO ] Computed 34 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:08:22] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-01 21:08:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:08:22] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 187 sub problems to find dead transitions.
[2025-06-01 21:08:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 188/322 variables, 134/168 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 0/322 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 168 constraints, problems are : Problem set: 0 solved, 187 unsolved in 6159 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 188/322 variables, 134/168 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 187/355 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (OVERLAPS) 0/322 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 355 constraints, problems are : Problem set: 0 solved, 187 unsolved in 7978 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 134/134 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14173ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 14174ms
Starting structural reductions in LTL mode, iteration 1 : 134/150 places, 188/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14404 ms. Remains : 134/150 places, 188/199 transitions.
[2025-06-01 21:08:36] [INFO ] Flatten gal took : 8 ms
[2025-06-01 21:08:36] [INFO ] Flatten gal took : 6 ms
[2025-06-01 21:08:36] [INFO ] Input system was already deterministic with 188 transitions.
[2025-06-01 21:08:36] [INFO ] Flatten gal took : 6 ms
[2025-06-01 21:08:36] [INFO ] Flatten gal took : 5 ms
[2025-06-01 21:08:36] [INFO ] Time to serialize gal into /tmp/CTLFireability11886828167188578716.gal : 1 ms
[2025-06-01 21:08:36] [INFO ] Time to serialize properties into /tmp/CTLFireability15144421470579136250.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/CTLFireability11886828167188578716.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15144421470579136250.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,3.67747e+19,0.146285,10388,2,365,5,29514,6,0,726,38146,0


Converting to forward existential form...Done !
original formula: E((!(((((p1==1)&&(p21==1)) * !(EG((p80==1)))) + ((AG(((p9==1)&&(p43==1))) + !(AX((p69==1)))) * AX(AG((p14==1)))))) + (E(((p47==1)&&(p79==...359
=> equivalent forward existential formula: [(FwdU(Init,(!(((((p1==1)&&(p21==1)) * !(EG((p80==1)))) + ((!(E(TRUE U !(((p9==1)&&(p43==1))))) + !(!(EX(!((p69=...640
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.202853,10644,1,0,9,29514,19,1,3645,38146,8
FORMULA NoC3x3-PT-1A-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 199/199 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 145 transition count 199
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 19 place count 131 transition count 185
Iterating global reduction 1 with 14 rules applied. Total rules applied 33 place count 131 transition count 185
Applied a total of 33 rules in 12 ms. Remains 131 /150 variables (removed 19) and now considering 185/199 (removed 14) transitions.
// Phase 1: matrix 185 rows 131 cols
[2025-06-01 21:08:36] [INFO ] Computed 34 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:08:36] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-01 21:08:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:08:36] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 184 sub problems to find dead transitions.
[2025-06-01 21:08:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 185/316 variables, 131/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (OVERLAPS) 0/316 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 165 constraints, problems are : Problem set: 0 solved, 184 unsolved in 6079 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 185/316 variables, 131/165 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 184/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 0/316 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 349 constraints, problems are : Problem set: 0 solved, 184 unsolved in 8393 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14486ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 14486ms
Starting structural reductions in LTL mode, iteration 1 : 131/150 places, 185/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14646 ms. Remains : 131/150 places, 185/199 transitions.
[2025-06-01 21:08:51] [INFO ] Flatten gal took : 8 ms
[2025-06-01 21:08:51] [INFO ] Flatten gal took : 5 ms
[2025-06-01 21:08:51] [INFO ] Input system was already deterministic with 185 transitions.
[2025-06-01 21:08:51] [INFO ] Flatten gal took : 5 ms
[2025-06-01 21:08:51] [INFO ] Flatten gal took : 5 ms
[2025-06-01 21:08:51] [INFO ] Time to serialize gal into /tmp/CTLFireability17927831206335283432.gal : 1 ms
[2025-06-01 21:08:51] [INFO ] Time to serialize properties into /tmp/CTLFireability6090329605580515214.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/CTLFireability17927831206335283432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6090329605580515214.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.04304e+19,0.108451,8936,2,356,5,23412,6,0,711,29358,0


Converting to forward existential form...Done !
original formula: EG(EF(AG(EX(AF((p133==1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(TRUE U !(EX(!(EG(!((p133==1))))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.168445,9192,1,0,10,23412,27,2,3671,29358,10
FORMULA NoC3x3-PT-1A-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 199/199 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 145 transition count 199
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 17 place count 133 transition count 187
Iterating global reduction 1 with 12 rules applied. Total rules applied 29 place count 133 transition count 187
Applied a total of 29 rules in 5 ms. Remains 133 /150 variables (removed 17) and now considering 187/199 (removed 12) transitions.
// Phase 1: matrix 187 rows 133 cols
[2025-06-01 21:08:51] [INFO ] Computed 34 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:08:51] [INFO ] Implicit Places using invariants in 59 ms returned []
[2025-06-01 21:08:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:08:51] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2025-06-01 21:08:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (OVERLAPS) 187/320 variables, 133/167 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 0/320 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 167 constraints, problems are : Problem set: 0 solved, 186 unsolved in 6353 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (OVERLAPS) 187/320 variables, 133/167 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/320 variables, 186/353 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 0/320 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 353 constraints, problems are : Problem set: 0 solved, 186 unsolved in 8176 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14543ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 14543ms
Starting structural reductions in LTL mode, iteration 1 : 133/150 places, 187/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14719 ms. Remains : 133/150 places, 187/199 transitions.
[2025-06-01 21:09:06] [INFO ] Flatten gal took : 8 ms
[2025-06-01 21:09:06] [INFO ] Flatten gal took : 5 ms
[2025-06-01 21:09:06] [INFO ] Input system was already deterministic with 187 transitions.
[2025-06-01 21:09:06] [INFO ] Flatten gal took : 5 ms
[2025-06-01 21:09:06] [INFO ] Flatten gal took : 4 ms
[2025-06-01 21:09:06] [INFO ] Time to serialize gal into /tmp/CTLFireability6535697730364483781.gal : 1 ms
[2025-06-01 21:09:06] [INFO ] Time to serialize properties into /tmp/CTLFireability3220302243028084711.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/CTLFireability6535697730364483781.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3220302243028084711.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.94197e+19,0.143378,10240,2,362,5,28318,6,0,721,37301,0


Converting to forward existential form...Done !
original formula: E(!(AG((p38==1))) U (EG(!(AX((p159==1)))) * (AX(((p29==1)&&(p44==1))) + (A(((p52==1)&&(p137==1)) U ((p139==1)&&(p18!=1))) * AG((!(((p2==1...189
=> equivalent forward existential formula: ([((FwdU(Init,!(!(E(TRUE U !((p38==1)))))) * EG(!(!(EX(!((p159==1))))))) * !(EX(!(((p29==1)&&(p44==1))))))] != F...433
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 176/0/11
(forward)formula 0,1,9.0063,284052,1,0,20,1.1226e+06,46,7,3941,1.74457e+06,25
FORMULA NoC3x3-PT-1A-CTLFireability-2025-06 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 : 150/150 places, 199/199 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 145 transition count 199
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 18 place count 132 transition count 186
Iterating global reduction 1 with 13 rules applied. Total rules applied 31 place count 132 transition count 186
Applied a total of 31 rules in 5 ms. Remains 132 /150 variables (removed 18) and now considering 186/199 (removed 13) transitions.
// Phase 1: matrix 186 rows 132 cols
[2025-06-01 21:09:15] [INFO ] Computed 34 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:09:15] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-01 21:09:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:09:15] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2025-06-01 21:09:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 186/318 variables, 132/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 166 constraints, problems are : Problem set: 0 solved, 185 unsolved in 6323 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 186/318 variables, 132/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 185/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 0/318 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 351 constraints, problems are : Problem set: 0 solved, 185 unsolved in 8047 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14382ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 14384ms
Starting structural reductions in LTL mode, iteration 1 : 132/150 places, 186/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14550 ms. Remains : 132/150 places, 186/199 transitions.
[2025-06-01 21:09:29] [INFO ] Flatten gal took : 9 ms
[2025-06-01 21:09:29] [INFO ] Flatten gal took : 5 ms
[2025-06-01 21:09:29] [INFO ] Input system was already deterministic with 186 transitions.
[2025-06-01 21:09:29] [INFO ] Flatten gal took : 5 ms
[2025-06-01 21:09:29] [INFO ] Flatten gal took : 5 ms
[2025-06-01 21:09:29] [INFO ] Time to serialize gal into /tmp/CTLFireability17134047767883610656.gal : 1 ms
[2025-06-01 21:09:29] [INFO ] Time to serialize properties into /tmp/CTLFireability13237439383353075702.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/CTLFireability17134047767883610656.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13237439383353075702.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.38354e+19,0.115557,9080,2,359,5,23953,6,0,716,29966,0


Converting to forward existential form...Done !
original formula: EX(AG((AX((((p148==0)||(p163==0))&&((p74==0)||(p95==0)))) + (p156==0))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((!(EX(!((((p148==0)||(p163==0))&&((p74==0)||(p95==0)))))) + (p156==0))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,8.63211,283484,1,0,14,1.03684e+06,16,5,3647,1.85163e+06,8
FORMULA NoC3x3-PT-1A-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 199/199 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 145 transition count 199
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 18 place count 132 transition count 186
Iterating global reduction 1 with 13 rules applied. Total rules applied 31 place count 132 transition count 186
Applied a total of 31 rules in 8 ms. Remains 132 /150 variables (removed 18) and now considering 186/199 (removed 13) transitions.
// Phase 1: matrix 186 rows 132 cols
[2025-06-01 21:09:38] [INFO ] Computed 34 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:09:38] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-01 21:09:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:09:38] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2025-06-01 21:09:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 186/318 variables, 132/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 0/318 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 166 constraints, problems are : Problem set: 0 solved, 185 unsolved in 6107 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 186/318 variables, 132/166 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/318 variables, 185/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/318 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 0/318 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 318/318 variables, and 351 constraints, problems are : Problem set: 0 solved, 185 unsolved in 8013 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14133ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 14134ms
Starting structural reductions in LTL mode, iteration 1 : 132/150 places, 186/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14285 ms. Remains : 132/150 places, 186/199 transitions.
[2025-06-01 21:09:52] [INFO ] Flatten gal took : 10 ms
[2025-06-01 21:09:52] [INFO ] Flatten gal took : 4 ms
[2025-06-01 21:09:52] [INFO ] Input system was already deterministic with 186 transitions.
[2025-06-01 21:09:52] [INFO ] Flatten gal took : 4 ms
[2025-06-01 21:09:52] [INFO ] Flatten gal took : 5 ms
[2025-06-01 21:09:52] [INFO ] Time to serialize gal into /tmp/CTLFireability15050944361053877558.gal : 1 ms
[2025-06-01 21:09:52] [INFO ] Time to serialize properties into /tmp/CTLFireability3309280733344953014.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/CTLFireability15050944361053877558.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3309280733344953014.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.45165e+19,0.12425,9456,2,359,5,25464,6,0,716,31881,0


Converting to forward existential form...Done !
original formula: EF(AX((E(((p45!=1) * EX(((p60==1)&&(p78==1)))) U EX(((p59==1)&&(p110==1)))) + E(AX(((p1==1)&&(p18==1))) U AX((p72==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((E(((p45!=1) * EX(((p60==1)&&(p78==1)))) U EX(((p59==1)&&(p110==1)))) + E(!(EX(!(((p1...210
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.223712,10992,1,0,22,41322,22,10,3330,31881,19
FORMULA NoC3x3-PT-1A-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 150/150 places, 199/199 transitions.
Graph (trivial) has 79 edges and 150 vertex of which 41 / 150 are part of one of the 18 SCC in 5 ms
Free SCC test removed 23 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Graph (complete) has 415 edges and 127 vertex of which 122 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 116 transition count 136
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 35 place count 104 transition count 136
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 48 place count 91 transition count 123
Iterating global reduction 2 with 13 rules applied. Total rules applied 61 place count 91 transition count 123
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 77 place count 91 transition count 107
Applied a total of 77 rules in 29 ms. Remains 91 /150 variables (removed 59) and now considering 107/199 (removed 92) transitions.
// Phase 1: matrix 107 rows 91 cols
[2025-06-01 21:09:53] [INFO ] Computed 29 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:09:53] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-01 21:09:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:09:53] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-06-01 21:09:53] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 21:09:53] [INFO ] Redundant transitions in 40 ms returned []
Running 93 sub problems to find dead transitions.
[2025-06-01 21:09:53] [INFO ] Invariant cache hit.
[2025-06-01 21:09:53] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 106/197 variables, 91/120 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 26/146 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/198 variables, and 146 constraints, problems are : Problem set: 0 solved, 93 unsolved in 2456 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, State Equation: 91/91 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 106/197 variables, 91/120 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 26/146 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 93/239 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 0/197 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/198 variables, and 239 constraints, problems are : Problem set: 0 solved, 93 unsolved in 2390 ms.
Refiners :[Positive P Invariants (semi-flows): 29/29 constraints, State Equation: 91/91 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4855ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 4857ms
Starting structural reductions in SI_CTL mode, iteration 1 : 91/150 places, 107/199 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5060 ms. Remains : 91/150 places, 107/199 transitions.
[2025-06-01 21:09:58] [INFO ] Flatten gal took : 7 ms
[2025-06-01 21:09:58] [INFO ] Flatten gal took : 5 ms
[2025-06-01 21:09:58] [INFO ] Input system was already deterministic with 107 transitions.
[2025-06-01 21:09:58] [INFO ] Flatten gal took : 3 ms
[2025-06-01 21:09:58] [INFO ] Flatten gal took : 3 ms
[2025-06-01 21:09:58] [INFO ] Time to serialize gal into /tmp/CTLFireability7184296190990864963.gal : 1 ms
[2025-06-01 21:09:58] [INFO ] Time to serialize properties into /tmp/CTLFireability15126406680487362288.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/CTLFireability7184296190990864963.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15126406680487362288.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,3.71085e+13,0.028542,4968,2,329,5,5602,5,0,472,5109,0


Converting to forward existential form...Done !
original formula: E(!(AG(EF((p21==1)))) U AG(((p2==1)&&(p15==1))))
=> equivalent forward existential formula: [(FwdU(Init,!(!(E(TRUE U !(E(TRUE U (p21==1))))))) * !(E(TRUE U !(((p2==1)&&(p15==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.063735,6504,1,0,6,16308,13,0,2167,5109,5
FORMULA NoC3x3-PT-1A-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 150/150 places, 199/199 transitions.
Graph (trivial) has 83 edges and 150 vertex of which 44 / 150 are part of one of the 19 SCC in 0 ms
Free SCC test removed 25 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Graph (complete) has 411 edges and 125 vertex of which 121 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 16 place count 107 transition count 135
Iterating global reduction 0 with 14 rules applied. Total rules applied 30 place count 107 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 31 place count 107 transition count 134
Applied a total of 31 rules in 11 ms. Remains 107 /150 variables (removed 43) and now considering 134/199 (removed 65) transitions.
[2025-06-01 21:09:58] [INFO ] Flow matrix only has 116 transitions (discarded 18 similar events)
// Phase 1: matrix 116 rows 107 cols
[2025-06-01 21:09:58] [INFO ] Computed 35 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:09:58] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-01 21:09:58] [INFO ] Flow matrix only has 116 transitions (discarded 18 similar events)
[2025-06-01 21:09:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:09:58] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-01 21:09:58] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 21:09:58] [INFO ] Redundant transitions in 4 ms returned []
Running 133 sub problems to find dead transitions.
[2025-06-01 21:09:58] [INFO ] Flow matrix only has 116 transitions (discarded 18 similar events)
[2025-06-01 21:09:58] [INFO ] Invariant cache hit.
[2025-06-01 21:09:58] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 115/222 variables, 107/142 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 54/196 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 1/223 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 0/223 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 197 constraints, problems are : Problem set: 0 solved, 133 unsolved in 4991 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, State Equation: 107/107 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (OVERLAPS) 1/107 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 115/222 variables, 107/142 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 54/196 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 133/329 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 1/223 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (OVERLAPS) 0/223 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 330 constraints, problems are : Problem set: 0 solved, 133 unsolved in 6400 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, State Equation: 107/107 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11402ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 11403ms
Starting structural reductions in SI_CTL mode, iteration 1 : 107/150 places, 134/199 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11609 ms. Remains : 107/150 places, 134/199 transitions.
[2025-06-01 21:10:09] [INFO ] Flatten gal took : 6 ms
[2025-06-01 21:10:09] [INFO ] Flatten gal took : 3 ms
[2025-06-01 21:10:09] [INFO ] Input system was already deterministic with 134 transitions.
[2025-06-01 21:10:09] [INFO ] Flatten gal took : 3 ms
[2025-06-01 21:10:09] [INFO ] Flatten gal took : 4 ms
[2025-06-01 21:10:10] [INFO ] Time to serialize gal into /tmp/CTLFireability17307522037738847618.gal : 0 ms
[2025-06-01 21:10:10] [INFO ] Time to serialize properties into /tmp/CTLFireability814690818419641537.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/CTLFireability17307522037738847618.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability814690818419641537.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.44e+14,0.077178,7604,2,285,5,19171,6,0,530,19315,0


Converting to forward existential form...Done !
original formula: AG(EF(((p104==1)&&(p111==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p104==1)&&(p111==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,1.38473,55068,1,0,8,215594,14,2,2549,295637,5
FORMULA NoC3x3-PT-1A-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 199/199 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 146 transition count 199
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 13 place count 137 transition count 190
Iterating global reduction 1 with 9 rules applied. Total rules applied 22 place count 137 transition count 190
Applied a total of 22 rules in 3 ms. Remains 137 /150 variables (removed 13) and now considering 190/199 (removed 9) transitions.
// Phase 1: matrix 190 rows 137 cols
[2025-06-01 21:10:11] [INFO ] Computed 35 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:10:11] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-01 21:10:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:10:11] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2025-06-01 21:10:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 1/137 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 190/327 variables, 137/172 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (OVERLAPS) 0/327 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 172 constraints, problems are : Problem set: 0 solved, 189 unsolved in 7728 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/136 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 1/137 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (OVERLAPS) 190/327 variables, 137/172 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 189/361 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 8 (OVERLAPS) 0/327 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 361 constraints, problems are : Problem set: 0 solved, 189 unsolved in 9583 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17326ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 17326ms
Starting structural reductions in LTL mode, iteration 1 : 137/150 places, 190/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17478 ms. Remains : 137/150 places, 190/199 transitions.
[2025-06-01 21:10:28] [INFO ] Flatten gal took : 10 ms
[2025-06-01 21:10:28] [INFO ] Flatten gal took : 4 ms
[2025-06-01 21:10:28] [INFO ] Input system was already deterministic with 190 transitions.
[2025-06-01 21:10:28] [INFO ] Flatten gal took : 5 ms
[2025-06-01 21:10:28] [INFO ] Flatten gal took : 4 ms
[2025-06-01 21:10:28] [INFO ] Time to serialize gal into /tmp/CTLFireability18319357305487287710.gal : 1 ms
[2025-06-01 21:10:28] [INFO ] Time to serialize properties into /tmp/CTLFireability8873266826716335184.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/CTLFireability18319357305487287710.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8873266826716335184.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,5.08373e+19,0.167609,11728,2,373,5,34904,6,0,737,46618,0


Converting to forward existential form...Done !
original formula: EX(A(A((!(EX((p133==1))) + !(A(((p16==1)&&(p62==1)) U ((p124==1)&&(p133==1))))) U ((A(((p2==1)&&(p77==1)) U (p69==1)) * (p106!=1)) * ((((...271
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(E(TRUE U !(EX(!((((p72==1)&&(p107==1))&&(p151==1)))))))))) * !(E(!(E(TRUE U !(EX(!((((p72==...951
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 183/0/7
Hit Full ! (commute/partial/dont) 179/0/11
Detected timeout of ITS tools.
[2025-06-01 21:10:59] [INFO ] Flatten gal took : 5 ms
[2025-06-01 21:10:59] [INFO ] Applying decomposition
[2025-06-01 21:10:59] [INFO ] Flatten gal took : 4 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/graph18241804184649455784.txt' '-o' '/tmp/graph18241804184649455784.bin' '-w' '/tmp/graph18241804184649455784.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18241804184649455784.bin' '-l' '-1' '-v' '-w' '/tmp/graph18241804184649455784.weights' '-q' '0' '-e' '0.001'
[2025-06-01 21:10:59] [INFO ] Decomposing Gal with order
[2025-06-01 21:10:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 21:10:59] [INFO ] Removed a total of 38 redundant transitions.
[2025-06-01 21:10:59] [INFO ] Flatten gal took : 10 ms
[2025-06-01 21:10:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2025-06-01 21:10:59] [INFO ] Time to serialize gal into /tmp/CTLFireability16444890914239038350.gal : 2 ms
[2025-06-01 21:10:59] [INFO ] Time to serialize properties into /tmp/CTLFireability16714368209838709279.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/CTLFireability16444890914239038350.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16714368209838709279.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.08373e+19,0.095776,8072,130,115,6919,3724,396,8804,110,14590,0


Converting to forward existential form...Done !
original formula: EX(A(A((!(EX((i7.u25.p133==1))) + !(A(((i0.i1.u2.p16==1)&&(i5.u11.p62==1)) U ((i7.u24.p124==1)&&(i7.u25.p133==1))))) U ((A(((i0.i1.u2.p2=...395
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(E(TRUE U !(EX(!((((i3.u12.p72==1)&&(i6.u18.p107==1))&&(i8.u29.p151==1)))))))))) * !(E(!(E(T...1319
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 199/199 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 148 transition count 199
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 14 place count 136 transition count 187
Iterating global reduction 1 with 12 rules applied. Total rules applied 26 place count 136 transition count 187
Applied a total of 26 rules in 3 ms. Remains 136 /150 variables (removed 14) and now considering 187/199 (removed 12) transitions.
// Phase 1: matrix 187 rows 136 cols
[2025-06-01 21:11:29] [INFO ] Computed 37 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:11:29] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-01 21:11:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:11:29] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2025-06-01 21:11:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (OVERLAPS) 3/136 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 187/323 variables, 136/173 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 0/323 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 173 constraints, problems are : Problem set: 0 solved, 186 unsolved in 7197 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (OVERLAPS) 3/136 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 187/323 variables, 136/173 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 186/359 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 0/323 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 359 constraints, problems are : Problem set: 0 solved, 186 unsolved in 8818 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16033ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 16033ms
Starting structural reductions in LTL mode, iteration 1 : 136/150 places, 187/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16196 ms. Remains : 136/150 places, 187/199 transitions.
[2025-06-01 21:11:45] [INFO ] Flatten gal took : 8 ms
[2025-06-01 21:11:45] [INFO ] Flatten gal took : 5 ms
[2025-06-01 21:11:45] [INFO ] Input system was already deterministic with 187 transitions.
[2025-06-01 21:11:45] [INFO ] Flatten gal took : 4 ms
[2025-06-01 21:11:45] [INFO ] Flatten gal took : 5 ms
[2025-06-01 21:11:45] [INFO ] Time to serialize gal into /tmp/CTLFireability2592427771271913911.gal : 1 ms
[2025-06-01 21:11:45] [INFO ] Time to serialize properties into /tmp/CTLFireability6930957187822172090.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/CTLFireability2592427771271913911.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6930957187822172090.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,3.06456e+19,0.119959,9488,2,368,5,25509,6,0,724,31815,0


Converting to forward existential form...Done !
original formula: E(EX(!(((!(((!((p97==1)&&(p109==1)))||((p138==1)&&(p45==1)))) + EX(((p29==1)&&(p44==1)))) + AF(((p11==1)&&(p43==1)))))) U EX((A(((((p19==...310
=> equivalent forward existential formula: [(FwdU((EY(FwdU(Init,EX(!(((!(((!((p97==1)&&(p109==1)))||((p138==1)&&(p45==1)))) + EX(((p29==1)&&(p44==1)))) + !...486
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.162843,9744,1,0,6,25509,15,0,3465,31815,5
FORMULA NoC3x3-PT-1A-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 150/150 places, 199/199 transitions.
Graph (trivial) has 74 edges and 150 vertex of which 40 / 150 are part of one of the 18 SCC in 0 ms
Free SCC test removed 22 places
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Graph (complete) has 417 edges and 128 vertex of which 123 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 16 place count 109 transition count 141
Iterating global reduction 0 with 14 rules applied. Total rules applied 30 place count 109 transition count 141
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 109 transition count 139
Applied a total of 32 rules in 10 ms. Remains 109 /150 variables (removed 41) and now considering 139/199 (removed 60) transitions.
[2025-06-01 21:11:45] [INFO ] Flow matrix only has 122 transitions (discarded 17 similar events)
// Phase 1: matrix 122 rows 109 cols
[2025-06-01 21:11:45] [INFO ] Computed 34 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:11:45] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-01 21:11:45] [INFO ] Flow matrix only has 122 transitions (discarded 17 similar events)
[2025-06-01 21:11:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:11:45] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-06-01 21:11:45] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 21:11:45] [INFO ] Redundant transitions in 3 ms returned []
Running 138 sub problems to find dead transitions.
[2025-06-01 21:11:45] [INFO ] Flow matrix only has 122 transitions (discarded 17 similar events)
[2025-06-01 21:11:45] [INFO ] Invariant cache hit.
[2025-06-01 21:11:45] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (OVERLAPS) 121/230 variables, 109/143 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 46/189 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 1/231 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/231 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 190 constraints, problems are : Problem set: 0 solved, 138 unsolved in 4029 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 109/109 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (OVERLAPS) 121/230 variables, 109/143 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 46/189 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 138/327 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 1/231 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (OVERLAPS) 0/231 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 328 constraints, problems are : Problem set: 0 solved, 138 unsolved in 5691 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 109/109 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9732ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 9732ms
Starting structural reductions in SI_CTL mode, iteration 1 : 109/150 places, 139/199 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9916 ms. Remains : 109/150 places, 139/199 transitions.
[2025-06-01 21:11:55] [INFO ] Flatten gal took : 3 ms
[2025-06-01 21:11:55] [INFO ] Flatten gal took : 3 ms
[2025-06-01 21:11:55] [INFO ] Input system was already deterministic with 139 transitions.
[2025-06-01 21:11:55] [INFO ] Flatten gal took : 2 ms
[2025-06-01 21:11:55] [INFO ] Flatten gal took : 2 ms
[2025-06-01 21:11:55] [INFO ] Time to serialize gal into /tmp/CTLFireability9445780422132307017.gal : 1 ms
[2025-06-01 21:11:55] [INFO ] Time to serialize properties into /tmp/CTLFireability777251939114442021.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/CTLFireability9445780422132307017.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability777251939114442021.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.64e+14,0.096964,7672,2,292,5,19254,6,0,551,20493,0


Converting to forward existential form...Done !
original formula: AF((((p27==1)&&(p41==1)) + (((p130==1)&&(p138==1)) * ((p80==0) * AF((p18==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((((p27==1)&&(p41==1)) + (((p130==1)&&(p138==1)) * ((p80==0) * !(EG(!((p18==1)))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-01 21:12:25] [INFO ] Flatten gal took : 7 ms
[2025-06-01 21:12:25] [INFO ] Applying decomposition
[2025-06-01 21:12:25] [INFO ] Flatten gal took : 3 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/graph16948488046546323532.txt' '-o' '/tmp/graph16948488046546323532.bin' '-w' '/tmp/graph16948488046546323532.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16948488046546323532.bin' '-l' '-1' '-v' '-w' '/tmp/graph16948488046546323532.weights' '-q' '0' '-e' '0.001'
[2025-06-01 21:12:25] [INFO ] Decomposing Gal with order
[2025-06-01 21:12:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 21:12:25] [INFO ] Removed a total of 22 redundant transitions.
[2025-06-01 21:12:25] [INFO ] Flatten gal took : 7 ms
[2025-06-01 21:12:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 4 ms.
[2025-06-01 21:12:25] [INFO ] Time to serialize gal into /tmp/CTLFireability8794668736091305518.gal : 2 ms
[2025-06-01 21:12:25] [INFO ] Time to serialize properties into /tmp/CTLFireability15042117413804108960.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/CTLFireability8794668736091305518.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15042117413804108960.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.64e+14,0.043112,5580,108,41,3328,402,397,4559,71,1578,0


Converting to forward existential form...Done !
original formula: AF((((i1.u4.p27==1)&&(i1.u7.p41==1)) + (((i4.u21.p130==1)&&(i4.u24.p138==1)) * ((i2.i0.u13.p80==0) * AF((i0.u2.p18==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((((i1.u4.p27==1)&&(i1.u7.p41==1)) + (((i4.u21.p130==1)&&(i4.u24.p138==1)) * ((i2.i0.u13.p80==0) * !...192
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 199/199 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 147 transition count 199
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 14 place count 136 transition count 188
Iterating global reduction 1 with 11 rules applied. Total rules applied 25 place count 136 transition count 188
Applied a total of 25 rules in 4 ms. Remains 136 /150 variables (removed 14) and now considering 188/199 (removed 11) transitions.
// Phase 1: matrix 188 rows 136 cols
[2025-06-01 21:12:55] [INFO ] Computed 36 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:12:55] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-01 21:12:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:12:55] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Running 187 sub problems to find dead transitions.
[2025-06-01 21:12:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 2/136 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 188/324 variables, 136/172 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (OVERLAPS) 0/324 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Real declared 324/324 variables, and 172 constraints, problems are : Problem set: 0 solved, 187 unsolved in 7518 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (OVERLAPS) 2/136 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 5 (OVERLAPS) 188/324 variables, 136/172 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 187/359 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 0/324 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 187 unsolved
No progress, stopping.
After SMT solving in domain Int declared 324/324 variables, and 359 constraints, problems are : Problem set: 0 solved, 187 unsolved in 9419 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16948ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 16949ms
Starting structural reductions in LTL mode, iteration 1 : 136/150 places, 188/199 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17107 ms. Remains : 136/150 places, 188/199 transitions.
[2025-06-01 21:13:12] [INFO ] Flatten gal took : 10 ms
[2025-06-01 21:13:12] [INFO ] Flatten gal took : 4 ms
[2025-06-01 21:13:12] [INFO ] Input system was already deterministic with 188 transitions.
[2025-06-01 21:13:12] [INFO ] Flatten gal took : 4 ms
[2025-06-01 21:13:12] [INFO ] Flatten gal took : 4 ms
[2025-06-01 21:13:12] [INFO ] Time to serialize gal into /tmp/CTLFireability12946080488167914318.gal : 1 ms
[2025-06-01 21:13:12] [INFO ] Time to serialize properties into /tmp/CTLFireability14524212939030173536.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/CTLFireability12946080488167914318.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14524212939030173536.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,3.53037e+19,0.13899,9892,2,369,5,27078,6,0,728,34149,0


Converting to forward existential form...Done !
original formula: EF(((((A(((p28==1)&&(p113==1)) U ((p68==1)&&(p72==1))) * AF(((p27==1)&&(p41==1)))) * (EF((p14!=1)) * (p112==1))) * (((p90==1)&&(p105==1))...332
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (((!((E(!(((p68==1)&&(p72==1))) U (!(((p28==1)&&(p113==1))) * !(((p68==1)&&(p72==1))))) + ...841
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 181/0/7
Hit Full ! (commute/partial/dont) 180/0/8
(forward)formula 0,1,4.70568,166944,1,0,28,610021,52,11,3958,1.05744e+06,26
FORMULA NoC3x3-PT-1A-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-06-01 21:13:17] [INFO ] Flatten gal took : 4 ms
[2025-06-01 21:13:17] [INFO ] Flatten gal took : 4 ms
[2025-06-01 21:13:17] [INFO ] Applying decomposition
[2025-06-01 21:13:17] [INFO ] Flatten gal took : 4 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/graph5449703591805716199.txt' '-o' '/tmp/graph5449703591805716199.bin' '-w' '/tmp/graph5449703591805716199.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5449703591805716199.bin' '-l' '-1' '-v' '-w' '/tmp/graph5449703591805716199.weights' '-q' '0' '-e' '0.001'
[2025-06-01 21:13:17] [INFO ] Decomposing Gal with order
[2025-06-01 21:13:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 21:13:17] [INFO ] Removed a total of 39 redundant transitions.
[2025-06-01 21:13:17] [INFO ] Flatten gal took : 9 ms
[2025-06-01 21:13:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2025-06-01 21:13:17] [INFO ] Time to serialize gal into /tmp/CTLFireability502040547183449417.gal : 1 ms
[2025-06-01 21:13:17] [INFO ] Time to serialize properties into /tmp/CTLFireability16879977753393348391.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/CTLFireability502040547183449417.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16879977753393348391.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 3 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.44121e+20,0.121637,9680,220,158,11501,3409,480,13519,139,11072,0


Converting to forward existential form...Done !
original formula: (!(E((!(A(((u0.p0==1)||(i7.i1.u16.p108==1)) U (i7.i0.u15.p105==1))) * !((!(((i3.u4.p25==1)&&(i3.u6.p38==1))) * EX(((i3.u8.p36==1)&&(i3.u8...273
=> equivalent forward existential formula: ([(FwdU(Init,(!(!((E(!((i7.i0.u15.p105==1)) U (!(((u0.p0==1)||(i7.i1.u16.p108==1))) * !((i7.i0.u15.p105==1)))) +...416
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Detected timeout of ITS tools.
[2025-06-01 21:35:44] [INFO ] Applying decomposition
[2025-06-01 21:35:44] [INFO ] Flatten gal took : 5 ms
[2025-06-01 21:35:44] [INFO ] Decomposing Gal with order
[2025-06-01 21:35:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 21:35:44] [INFO ] Removed a total of 58 redundant transitions.
[2025-06-01 21:35:44] [INFO ] Flatten gal took : 9 ms
[2025-06-01 21:35:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 2 ms.
[2025-06-01 21:35:44] [INFO ] Time to serialize gal into /tmp/CTLFireability883692123735879014.gal : 1 ms
[2025-06-01 21:35:44] [INFO ] Time to serialize properties into /tmp/CTLFireability6658762435370637569.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/CTLFireability883692123735879014.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6658762435370637569.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 3 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.44121e+20,0.094742,8056,90,15,8701,416,375,12438,64,2077,0


Converting to forward existential form...Done !
original formula: (!(E((!(A(((u41.p0==1)||(u26.p108==1)) U (u25.p105==1))) * !((!(((u7.p25==1)&&(u10.p38==1))) * EX(((u8.p36==1)&&(u12.p44==1)))))) U AF(!(...231
=> equivalent forward existential formula: ([(FwdU(Init,(!(!((E(!((u25.p105==1)) U (!(((u41.p0==1)||(u26.p108==1))) * !((u25.p105==1)))) + EG(!((u25.p105==...362
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 28
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Detected timeout of ITS tools.
[2025-06-01 21:58:12] [INFO ] Flatten gal took : 11 ms
[2025-06-01 21:58:12] [INFO ] Input system was already deterministic with 199 transitions.
[2025-06-01 21:58:12] [INFO ] Transformed 150 places.
[2025-06-01 21:58:12] [INFO ] Transformed 199 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-01 21:58:12] [INFO ] Time to serialize gal into /tmp/CTLFireability11594912324279342421.gal : 1 ms
[2025-06-01 21:58:12] [INFO ] Time to serialize properties into /tmp/CTLFireability2854506900284139091.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/CTLFireability11594912324279342421.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2854506900284139091.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 3 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.44121e+20,1.35134,55344,2,3102,5,275789,6,0,786,250236,0


Converting to forward existential form...Done !
original formula: (!(E((!(A(((p0==1)||(p108==1)) U (p105==1))) * !((!(((p25==1)&&(p38==1))) * EX(((p36==1)&&(p44==1)))))) U AF(!(EF(((p124==1)&&(p139==1)))...189
=> equivalent forward existential formula: ([(FwdU(Init,(!(!((E(!((p105==1)) U (!(((p0==1)||(p108==1))) * !((p105==1)))) + EG(!((p105==1)))))) * !((!(((p25...312
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 192/0/7

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-1A"
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 NoC3x3-PT-1A, 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 r142-tall-174876812000154"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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