fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r100-smll-174867007800386
Last Updated
June 24, 2025

About the Execution of ITS-Tools for GPUForwardProgress-PT-04b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 287597.00 0.00 0.00 FTTTFTTFTFFTTTTT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K 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.3K 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 108K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 27K 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 GPUForwardProgress-PT-04b-CTLFireability-2023-12
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2023-13
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2023-14
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2023-15
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2025-00
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2025-01
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2025-02
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2025-03
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2025-04
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2025-05
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2025-06
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2025-07
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2025-08
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2025-09
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2025-10
FORMULA_NAME GPUForwardProgress-PT-04b-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748957101357

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-03 13:25:03] [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-03 13:25:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 13:25:04] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2025-06-03 13:25:04] [INFO ] Transformed 112 places.
[2025-06-03 13:25:04] [INFO ] Transformed 117 transitions.
[2025-06-03 13:25:04] [INFO ] Found NUPN structural information;
[2025-06-03 13:25:04] [INFO ] Parsed PT model containing 112 places and 117 transitions and 277 arcs in 365 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Support contains 72 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 117/117 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 111 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 116
Applied a total of 2 rules in 46 ms. Remains 111 /112 variables (removed 1) and now considering 116/117 (removed 1) transitions.
// Phase 1: matrix 116 rows 111 cols
[2025-06-03 13:25:04] [INFO ] Computed 6 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:25:04] [INFO ] Implicit Places using invariants in 375 ms returned []
[2025-06-03 13:25:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:25:05] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2025-06-03 13:25:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 116/226 variables, 110/116 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 1/227 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 0/227 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 117 constraints, problems are : Problem set: 0 solved, 115 unsolved in 8906 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 116/226 variables, 110/116 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 115/231 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 1/227 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/227 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 232 constraints, problems are : Problem set: 0 solved, 115 unsolved in 10258 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19233ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 19250ms
Starting structural reductions in LTL mode, iteration 1 : 111/112 places, 116/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20020 ms. Remains : 111/112 places, 116/117 transitions.
Support contains 72 out of 111 places after structural reductions.
[2025-06-03 13:25:24] [INFO ] Flatten gal took : 59 ms
[2025-06-03 13:25:24] [INFO ] Flatten gal took : 25 ms
[2025-06-03 13:25:24] [INFO ] Input system was already deterministic with 116 transitions.
RANDOM walk for 40000 steps (885 resets) in 2852 ms. (14 steps per ms) remains 9/76 properties
BEST_FIRST walk for 40003 steps (176 resets) in 245 ms. (162 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (93 resets) in 161 ms. (246 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (191 resets) in 86 ms. (459 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (187 resets) in 103 ms. (384 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (194 resets) in 76 ms. (519 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (40 resets) in 114 ms. (347 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (183 resets) in 62 ms. (634 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (203 resets) in 80 ms. (493 steps per ms) remains 5/6 properties
[2025-06-03 13:25:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp22 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 95/110 variables, 5/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 116/226 variables, 110/116 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/116 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/227 variables, 1/117 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 0/117 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/227 variables, 0/117 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 117 constraints, problems are : Problem set: 3 solved, 2 unsolved in 285 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 102/110 variables, 5/6 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 116/226 variables, 110/116 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 2/118 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/118 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/227 variables, 1/119 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/119 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/227 variables, 0/119 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 119 constraints, problems are : Problem set: 3 solved, 2 unsolved in 301 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 594ms problems are : Problem set: 3 solved, 2 unsolved
Parikh walk visited 0 properties in 398 ms.
Support contains 8 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 116/116 transitions.
Graph (trivial) has 97 edges and 111 vertex of which 6 / 111 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 106 transition count 54
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 60 rules applied. Total rules applied 116 place count 51 transition count 49
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 120 place count 50 transition count 46
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 124 place count 47 transition count 45
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 124 place count 47 transition count 37
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 140 place count 39 transition count 37
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 142 place count 37 transition count 35
Iterating global reduction 4 with 2 rules applied. Total rules applied 144 place count 37 transition count 35
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 172 place count 23 transition count 21
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 175 place count 23 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 177 place count 22 transition count 20
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 178 place count 22 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 179 place count 21 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 180 place count 20 transition count 18
Applied a total of 180 rules in 61 ms. Remains 20 /111 variables (removed 91) and now considering 18/116 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 20/111 places, 18/116 transitions.
RANDOM walk for 40000 steps (4126 resets) in 618 ms. (64 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (979 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
// Phase 1: matrix 18 rows 20 cols
[2025-06-03 13:25:27] [INFO ] Computed 6 invariants in 2 ms
[2025-06-03 13:25:27] [INFO ] State equation strengthened by 12 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/20 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/38 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Real declared 38/38 variables, and 38 constraints, problems are : Problem set: 1 solved, 0 unsolved in 66 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 20/20 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 80ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2025-06-03 13:25:27] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-06-03 13:25:27] [INFO ] Flatten gal took : 17 ms
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2025-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-03 13:25:27] [INFO ] Flatten gal took : 15 ms
[2025-06-03 13:25:27] [INFO ] Input system was already deterministic with 116 transitions.
Support contains 68 out of 111 places (down from 70) after GAL structural reductions.
Computed a total of 24 stabilizing places and 24 stable transitions
Graph (complete) has 163 edges and 111 vertex of which 102 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 116/116 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 116
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 98 transition count 104
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 98 transition count 104
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 93 transition count 99
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 93 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 38 place count 93 transition count 96
Applied a total of 38 rules in 25 ms. Remains 93 /111 variables (removed 18) and now considering 96/116 (removed 20) transitions.
// Phase 1: matrix 96 rows 93 cols
[2025-06-03 13:25:27] [INFO ] Computed 5 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:25:27] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-03 13:25:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:25:27] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2025-06-03 13:25:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 96/188 variables, 92/97 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 1/189 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 0/189 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 98 constraints, problems are : Problem set: 0 solved, 95 unsolved in 5517 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 96/188 variables, 92/97 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 95/192 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 1/189 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 193 constraints, problems are : Problem set: 0 solved, 95 unsolved in 6538 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12084ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 12086ms
Starting structural reductions in LTL mode, iteration 1 : 93/111 places, 96/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12289 ms. Remains : 93/111 places, 96/116 transitions.
[2025-06-03 13:25:40] [INFO ] Flatten gal took : 13 ms
[2025-06-03 13:25:40] [INFO ] Flatten gal took : 11 ms
[2025-06-03 13:25:40] [INFO ] Input system was already deterministic with 96 transitions.
[2025-06-03 13:25:40] [INFO ] Flatten gal took : 11 ms
[2025-06-03 13:25:40] [INFO ] Flatten gal took : 10 ms
[2025-06-03 13:25:40] [INFO ] Time to serialize gal into /tmp/CTLFireability1272806516224063384.gal : 5 ms
[2025-06-03 13:25:40] [INFO ] Time to serialize properties into /tmp/CTLFireability974604234789976848.ctl : 7 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/CTLFireability1272806516224063384.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability974604234789976848.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,3.16207e+06,0.285495,9192,2,2167,5,21849,6,0,470,24342,0


Converting to forward existential form...Done !
original formula: E(EG(AX((p56==1))) U E(E((!(((p69==1)||(p18==1))) + AG((p67==1))) U (((p10==1)&&(p93==1))&&(p108==1))) U (!(((p72!=1)&&(p41!=1))) + ((AX(...244
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,EG(!(EX(!((p56==1)))))),E((!(((p69==1)||(p18==1))) + !(E(TRUE U !((p67==1))))) U (((p10==1)&&(...463
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t10, t14, t22, t24, t30, t41, t47, t54, t61, t68, t74, t81, t86, Intersectio...241
Using saturation style SCC detection
(forward)formula 0,0,2.59507,71168,1,0,400,378112,255,223,2905,374380,425
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 116/116 transitions.
Graph (trivial) has 94 edges and 111 vertex of which 6 / 111 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 157 edges and 106 vertex of which 97 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 96 transition count 56
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 107 place count 46 transition count 51
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 112 place count 45 transition count 47
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 116 place count 41 transition count 47
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 116 place count 41 transition count 39
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 132 place count 33 transition count 39
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 138 place count 27 transition count 33
Iterating global reduction 4 with 6 rules applied. Total rules applied 144 place count 27 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 145 place count 27 transition count 32
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 145 place count 27 transition count 31
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 147 place count 26 transition count 31
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 159 place count 20 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 161 place count 19 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 162 place count 18 transition count 23
Applied a total of 162 rules in 17 ms. Remains 18 /111 variables (removed 93) and now considering 23/116 (removed 93) transitions.
// Phase 1: matrix 23 rows 18 cols
[2025-06-03 13:25:42] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:25:42] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-03 13:25:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:25:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 13:25:42] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:25:42] [INFO ] Redundant transitions in 0 ms returned []
Running 21 sub problems to find dead transitions.
[2025-06-03 13:25:42] [INFO ] Invariant cache hit.
[2025-06-03 13:25:42] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 22/39 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/40 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 1/41 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/41 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 19 constraints, problems are : Problem set: 0 solved, 21 unsolved in 592 ms.
Refiners :[State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 22/39 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 21/38 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 1/41 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/41 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/41 variables, and 40 constraints, problems are : Problem set: 0 solved, 21 unsolved in 848 ms.
Refiners :[State Equation: 18/18 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1453ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1453ms
Starting structural reductions in SI_CTL mode, iteration 1 : 18/111 places, 23/116 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1552 ms. Remains : 18/111 places, 23/116 transitions.
[2025-06-03 13:25:44] [INFO ] Flatten gal took : 4 ms
[2025-06-03 13:25:44] [INFO ] Flatten gal took : 3 ms
[2025-06-03 13:25:44] [INFO ] Input system was already deterministic with 23 transitions.
[2025-06-03 13:25:44] [INFO ] Flatten gal took : 3 ms
[2025-06-03 13:25:44] [INFO ] Flatten gal took : 3 ms
[2025-06-03 13:25:44] [INFO ] Time to serialize gal into /tmp/CTLFireability16122697840185926728.gal : 1 ms
[2025-06-03 13:25:44] [INFO ] Time to serialize properties into /tmp/CTLFireability18382466468650592995.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/CTLFireability16122697840185926728.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18382466468650592995.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,2452,0.029021,4352,2,117,5,2655,6,0,94,2909,0


Converting to forward existential form...Done !
original formula: E(!((AG((p12==1)) + (p59==1))) U AF((p40==1)))
=> equivalent forward existential formula: [(FwdU(Init,!((!(E(TRUE U !((p12==1)))) + (p59==1)))) * !(EG(!((p40==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t7, t8, t10, t12, t14, t15, t17, Intersection with reachable at each step en...209
(forward)formula 0,1,0.105189,6144,1,0,168,12237,80,82,584,14953,184
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 116/116 transitions.
Graph (trivial) has 88 edges and 111 vertex of which 6 / 111 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 105 transition count 63
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 50 rules applied. Total rules applied 97 place count 59 transition count 59
Reduce places removed 1 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 8 rules applied. Total rules applied 105 place count 58 transition count 52
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 112 place count 51 transition count 52
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 112 place count 51 transition count 46
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 124 place count 45 transition count 46
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 127 place count 42 transition count 43
Iterating global reduction 4 with 3 rules applied. Total rules applied 130 place count 42 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 132 place count 42 transition count 41
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 132 place count 42 transition count 39
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 136 place count 40 transition count 39
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 154 place count 31 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 156 place count 30 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 157 place count 29 transition count 28
Applied a total of 157 rules in 29 ms. Remains 29 /111 variables (removed 82) and now considering 28/116 (removed 88) transitions.
// Phase 1: matrix 28 rows 29 cols
[2025-06-03 13:25:44] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:25:44] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-03 13:25:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:25:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-03 13:25:44] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:25:44] [INFO ] Redundant transitions in 1 ms returned []
Running 23 sub problems to find dead transitions.
[2025-06-03 13:25:44] [INFO ] Invariant cache hit.
[2025-06-03 13:25:44] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 4/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 27/56 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 1/57 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/57 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 57/57 variables, and 36 constraints, problems are : Problem set: 0 solved, 23 unsolved in 852 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 29/29 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 4/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 27/56 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 23/58 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 1/57 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 0/57 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/57 variables, and 59 constraints, problems are : Problem set: 0 solved, 23 unsolved in 1033 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 29/29 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1893ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 1893ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/111 places, 28/116 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2049 ms. Remains : 29/111 places, 28/116 transitions.
[2025-06-03 13:25:46] [INFO ] Flatten gal took : 4 ms
[2025-06-03 13:25:46] [INFO ] Flatten gal took : 4 ms
[2025-06-03 13:25:46] [INFO ] Input system was already deterministic with 28 transitions.
[2025-06-03 13:25:46] [INFO ] Flatten gal took : 4 ms
[2025-06-03 13:25:46] [INFO ] Flatten gal took : 4 ms
[2025-06-03 13:25:46] [INFO ] Time to serialize gal into /tmp/CTLFireability8560441514955154707.gal : 1 ms
[2025-06-03 13:25:46] [INFO ] Time to serialize properties into /tmp/CTLFireability15448608935973862680.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/CTLFireability8560441514955154707.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15448608935973862680.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,5040,0.025746,4292,2,155,5,2530,6,0,146,2022,0


Converting to forward existential form...Done !
original formula: (EF(((p101==1) + AG((EG(((((p9==1)&&(p27==1))&&((p45==1)&&(p63==1)))&&((p78==1)&&(p98==1)))) + AG((p81==1)))))) + !(E(EF((p12==1)) U (p66...162
=> equivalent forward existential formula: [(FwdU((Init * !(E(TRUE U ((p101==1) + !(E(TRUE U !((EG(((((p9==1)&&(p27==1))&&((p45==1)&&(p63==1)))&&((p78==1)&...243
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t15, t16, Intersection with reachable at each step enabled. (destroyed/reverse/inter...177
(forward)formula 0,1,0.090165,5316,1,0,88,7947,91,43,933,6683,113
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 116/116 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 116
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 99 transition count 105
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 99 transition count 105
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 94 transition count 100
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 94 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 36 place count 94 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 93 transition count 96
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 93 transition count 96
Applied a total of 38 rules in 38 ms. Remains 93 /111 variables (removed 18) and now considering 96/116 (removed 20) transitions.
// Phase 1: matrix 96 rows 93 cols
[2025-06-03 13:25:46] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:25:46] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-03 13:25:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:25:46] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2025-06-03 13:25:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 96/188 variables, 92/97 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 1/189 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 0/189 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 98 constraints, problems are : Problem set: 0 solved, 95 unsolved in 6483 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 96/188 variables, 92/97 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 95/192 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 1/189 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 193 constraints, problems are : Problem set: 0 solved, 95 unsolved in 7032 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13534ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 13535ms
Starting structural reductions in LTL mode, iteration 1 : 93/111 places, 96/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13809 ms. Remains : 93/111 places, 96/116 transitions.
[2025-06-03 13:26:00] [INFO ] Flatten gal took : 9 ms
[2025-06-03 13:26:00] [INFO ] Flatten gal took : 9 ms
[2025-06-03 13:26:00] [INFO ] Input system was already deterministic with 96 transitions.
[2025-06-03 13:26:00] [INFO ] Flatten gal took : 9 ms
[2025-06-03 13:26:00] [INFO ] Flatten gal took : 9 ms
[2025-06-03 13:26:00] [INFO ] Time to serialize gal into /tmp/CTLFireability935132226336245488.gal : 3 ms
[2025-06-03 13:26:00] [INFO ] Time to serialize properties into /tmp/CTLFireability3284106613483297185.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/CTLFireability935132226336245488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3284106613483297185.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,3.60788e+06,0.26497,9620,2,2274,5,24945,6,0,470,26309,0


Converting to forward existential form...Done !
original formula: AF((((EF((p83==1)) * AG((p12==0))) * (AX((p59==0)) * EF((p19==1)))) * ((EX((p85==0)) * (((p70==0)||(p93==0))||(p108==0))) * ((p53==1) + (...205
=> equivalent forward existential formula: [FwdG(Init,!((((E(TRUE U (p83==1)) * !(E(TRUE U !((p12==0))))) * (!(EX(!((p59==0)))) * E(TRUE U (p19==1)))) * ((...280
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t10, t24, t26, t30, t37, t44, t51, t58, t68, t74, t81, t86, Intersection wit...236
(forward)formula 0,0,3.66356,103500,1,0,389,574946,232,198,2898,549445,450
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 116/116 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 116
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 99 transition count 105
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 99 transition count 105
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 96 transition count 102
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 96 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 96 transition count 101
Applied a total of 30 rules in 10 ms. Remains 96 /111 variables (removed 15) and now considering 101/116 (removed 15) transitions.
// Phase 1: matrix 101 rows 96 cols
[2025-06-03 13:26:04] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:26:04] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-03 13:26:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:26:04] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 100 sub problems to find dead transitions.
[2025-06-03 13:26:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 101/196 variables, 95/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (OVERLAPS) 1/197 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 0/197 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 101 constraints, problems are : Problem set: 0 solved, 100 unsolved in 6843 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 101/196 variables, 95/100 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 100/200 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (OVERLAPS) 1/197 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (OVERLAPS) 0/197 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 201 constraints, problems are : Problem set: 0 solved, 100 unsolved in 7925 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14780ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 14781ms
Starting structural reductions in LTL mode, iteration 1 : 96/111 places, 101/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14949 ms. Remains : 96/111 places, 101/116 transitions.
[2025-06-03 13:26:19] [INFO ] Flatten gal took : 6 ms
[2025-06-03 13:26:19] [INFO ] Flatten gal took : 6 ms
[2025-06-03 13:26:19] [INFO ] Input system was already deterministic with 101 transitions.
[2025-06-03 13:26:19] [INFO ] Flatten gal took : 5 ms
[2025-06-03 13:26:19] [INFO ] Flatten gal took : 6 ms
[2025-06-03 13:26:19] [INFO ] Time to serialize gal into /tmp/CTLFireability1426691076513801944.gal : 2 ms
[2025-06-03 13:26:19] [INFO ] Time to serialize properties into /tmp/CTLFireability9536741185166259472.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/CTLFireability1426691076513801944.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9536741185166259472.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.81394e+06,0.179506,9656,2,2298,5,24108,6,0,487,25741,0


Converting to forward existential form...Done !
original formula: AX(((p4==1) + E(((p68==1) + E(((p19==1)||(p13==1)) U (p25!=1))) U (AF(AG((((p46==1)&&(p93==1))&&(p108==1)))) * ((((p72==1)||(p24==1))||((...202
=> equivalent forward existential formula: [((EY(Init) * !((p4==1))) * !(E(((p68==1) + E(((p19==1)||(p13==1)) U (p25!=1))) U (!(EG(!(!(E(TRUE U !((((p46==1...270
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t10, t14, t22, t24, t29, t38, t46, t54, t60, t70, t76, t86, t91, Intersectio...242
(forward)formula 0,0,6.07114,143524,1,0,414,893815,239,209,2860,751987,473
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 116/116 transitions.
Graph (trivial) has 91 edges and 111 vertex of which 6 / 111 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 157 edges and 106 vertex of which 97 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 96 transition count 56
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 55 rules applied. Total rules applied 107 place count 46 transition count 51
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 111 place count 43 transition count 50
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 111 place count 43 transition count 42
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 127 place count 35 transition count 42
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 131 place count 31 transition count 38
Iterating global reduction 3 with 4 rules applied. Total rules applied 135 place count 31 transition count 38
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 149 place count 24 transition count 31
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 24 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 23 transition count 30
Applied a total of 152 rules in 19 ms. Remains 23 /111 variables (removed 88) and now considering 30/116 (removed 86) transitions.
// Phase 1: matrix 30 rows 23 cols
[2025-06-03 13:26:25] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:26:25] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-03 13:26:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:26:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-06-03 13:26:25] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 13:26:25] [INFO ] Redundant transitions in 1 ms returned []
Running 29 sub problems to find dead transitions.
[2025-06-03 13:26:25] [INFO ] Invariant cache hit.
[2025-06-03 13:26:25] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 29/51 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 1/52 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 1/53 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 0/53 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 25 constraints, problems are : Problem set: 0 solved, 29 unsolved in 823 ms.
Refiners :[State Equation: 23/23 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 29/51 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 29/52 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 1/52 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 1/53 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/53 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/53 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 54 constraints, problems are : Problem set: 0 solved, 29 unsolved in 1351 ms.
Refiners :[State Equation: 23/23 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2182ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 2184ms
Starting structural reductions in SI_CTL mode, iteration 1 : 23/111 places, 30/116 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2277 ms. Remains : 23/111 places, 30/116 transitions.
[2025-06-03 13:26:27] [INFO ] Flatten gal took : 4 ms
[2025-06-03 13:26:27] [INFO ] Flatten gal took : 3 ms
[2025-06-03 13:26:27] [INFO ] Input system was already deterministic with 30 transitions.
[2025-06-03 13:26:27] [INFO ] Flatten gal took : 3 ms
[2025-06-03 13:26:27] [INFO ] Flatten gal took : 3 ms
[2025-06-03 13:26:27] [INFO ] Time to serialize gal into /tmp/CTLFireability13855946762461124236.gal : 1 ms
[2025-06-03 13:26:27] [INFO ] Time to serialize properties into /tmp/CTLFireability7708766845121175903.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/CTLFireability13855946762461124236.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7708766845121175903.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,7925,0.042018,4384,2,151,5,2598,6,0,121,3555,0


Converting to forward existential form...Done !
original formula: (EG(((p33==1)||(p103==1))) + EF(EG(((AG((p91==1)) + (p7==0)) + ((p26==0)||(p2==1))))))
=> equivalent forward existential formula: ([FwdG(Init,((p33==1)||(p103==1)))] != FALSE + [FwdG(FwdU(Init,TRUE),((!(E(TRUE U !((p91==1)))) + (p7==0)) + ((p...184
Reverse transition relation is NOT exact ! Due to transitions t0, t4, t5, t8, t15, t18, t21, t22, t23, t25, t29, Intersection with reachable at each step ...211
(forward)formula 0,1,0.083845,5024,1,0,82,5555,95,40,791,7085,81
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 116/116 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 97 transition count 102
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 97 transition count 102
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 92 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 92 transition count 97
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 92 transition count 93
Applied a total of 42 rules in 7 ms. Remains 92 /111 variables (removed 19) and now considering 93/116 (removed 23) transitions.
// Phase 1: matrix 93 rows 92 cols
[2025-06-03 13:26:27] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:26:27] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-03 13:26:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:26:27] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2025-06-03 13:26:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 93/184 variables, 91/97 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 1/185 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/185 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 185/185 variables, and 98 constraints, problems are : Problem set: 0 solved, 92 unsolved in 5198 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 93/184 variables, 91/97 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 92/189 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 1/185 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/185 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 185/185 variables, and 190 constraints, problems are : Problem set: 0 solved, 92 unsolved in 5988 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11200ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 11202ms
Starting structural reductions in LTL mode, iteration 1 : 92/111 places, 93/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11431 ms. Remains : 92/111 places, 93/116 transitions.
[2025-06-03 13:26:39] [INFO ] Flatten gal took : 5 ms
[2025-06-03 13:26:39] [INFO ] Flatten gal took : 4 ms
[2025-06-03 13:26:39] [INFO ] Input system was already deterministic with 93 transitions.
[2025-06-03 13:26:39] [INFO ] Flatten gal took : 5 ms
[2025-06-03 13:26:39] [INFO ] Flatten gal took : 5 ms
[2025-06-03 13:26:39] [INFO ] Time to serialize gal into /tmp/CTLFireability16924783971329774315.gal : 1 ms
[2025-06-03 13:26:39] [INFO ] Time to serialize properties into /tmp/CTLFireability17549063038026370559.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/CTLFireability16924783971329774315.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17549063038026370559.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.6705e+06,0.176792,9592,2,2119,5,23517,6,0,463,24800,0


Converting to forward existential form...Done !
original formula: (!(A(A((p105!=1) U EG(((p101==1)||(p29==1)))) U AG(!((EX((p95==1)) + AF((p15==1))))))) * !(E((AG(A((((p64==1)&&(p93==1))&&(p108==1)) U (p...259
=> equivalent forward existential formula: ([((Init * !(EG(!(!(E(TRUE U !(!((EX((p95==1)) + !(EG(!((p15==1))))))))))))) * !(E(!(!(E(TRUE U !(!((EX((p95==1)...611
Reverse transition relation is NOT exact ! Due to transitions t3, t6, t7, t11, t15, t23, t25, t30, t37, t44, t51, t58, t65, t71, t78, t83, Intersection wi...237
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2025-06-03 13:27:09] [INFO ] Flatten gal took : 5 ms
[2025-06-03 13:27:09] [INFO ] Applying decomposition
[2025-06-03 13:27:09] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16047451825319260441.txt' '-o' '/tmp/graph16047451825319260441.bin' '-w' '/tmp/graph16047451825319260441.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16047451825319260441.bin' '-l' '-1' '-v' '-w' '/tmp/graph16047451825319260441.weights' '-q' '0' '-e' '0.001'
[2025-06-03 13:27:09] [INFO ] Decomposing Gal with order
[2025-06-03 13:27:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 13:27:09] [INFO ] Removed a total of 31 redundant transitions.
[2025-06-03 13:27:09] [INFO ] Flatten gal took : 60 ms
[2025-06-03 13:27:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2025-06-03 13:27:09] [INFO ] Time to serialize gal into /tmp/CTLFireability7508196270402561930.gal : 4 ms
[2025-06-03 13:27:09] [INFO ] Time to serialize properties into /tmp/CTLFireability11017582662297830793.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/CTLFireability7508196270402561930.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11017582662297830793.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.6705e+06,0.039325,4940,212,31,2172,219,280,2819,47,377,0


Converting to forward existential form...Done !
original formula: (!(A(A((i7.u36.p105!=1) U EG(((i7.u35.p101==1)||(i1.i1.u9.p29==1)))) U AG(!((EX((i6.u28.p95==1)) + AF((i0.i0.u3.p15==1))))))) * !(E((AG(A...394
=> equivalent forward existential formula: ([((Init * !(EG(!(!(E(TRUE U !(!((EX((i6.u28.p95==1)) + !(EG(!((i0.i0.u3.p15==1))))))))))))) * !(E(!(!(E(TRUE U ...828
Reverse transition relation is NOT exact ! Due to transitions t3, t51, t83, i0.t78, i0.i2.t71, i1.t65, i1.i2.t58, i3.i0.t44, i5.t37, i5.i1.t30, i6.t25, i6....300
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 5
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
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 5
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,1.58948,55244,1,0,110146,290,1759,171256,240,669,121573
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 116/116 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 116
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 97 transition count 103
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 97 transition count 103
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 32 place count 92 transition count 98
Iterating global reduction 1 with 5 rules applied. Total rules applied 37 place count 92 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 92 transition count 96
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 91 transition count 95
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 91 transition count 95
Applied a total of 41 rules in 7 ms. Remains 91 /111 variables (removed 20) and now considering 95/116 (removed 21) transitions.
// Phase 1: matrix 95 rows 91 cols
[2025-06-03 13:27:11] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:27:11] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-06-03 13:27:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:27:11] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Running 94 sub problems to find dead transitions.
[2025-06-03 13:27: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/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 95/185 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 1/186 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 0/186 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 96 constraints, problems are : Problem set: 0 solved, 94 unsolved in 3803 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (OVERLAPS) 95/185 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 94/189 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 1/186 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/186 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 190 constraints, problems are : Problem set: 0 solved, 94 unsolved in 5799 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9615ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 9615ms
Starting structural reductions in LTL mode, iteration 1 : 91/111 places, 95/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9892 ms. Remains : 91/111 places, 95/116 transitions.
[2025-06-03 13:27:21] [INFO ] Flatten gal took : 7 ms
[2025-06-03 13:27:21] [INFO ] Flatten gal took : 8 ms
[2025-06-03 13:27:21] [INFO ] Input system was already deterministic with 95 transitions.
[2025-06-03 13:27:21] [INFO ] Flatten gal took : 7 ms
[2025-06-03 13:27:21] [INFO ] Flatten gal took : 7 ms
[2025-06-03 13:27:21] [INFO ] Time to serialize gal into /tmp/CTLFireability4855457143370390547.gal : 2 ms
[2025-06-03 13:27:21] [INFO ] Time to serialize properties into /tmp/CTLFireability12375311500624631749.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/CTLFireability4855457143370390547.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12375311500624631749.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.18271e+06,0.165911,9472,2,2141,5,23512,6,0,461,25032,0


Converting to forward existential form...Done !
original formula: AF((AF((EF(EG((p24==1))) + E(((p88==1)||(p18==1)) U AF((p69==1))))) * (((p41==0) + AG(((p48==0)||(p14==0)))) + EX(AF((p2==0))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!((E(TRUE U EG((p24==1))) + E(((p88==1)||(p18==1)) U !(EG(!((p69==1))))))))) * (((p41==0) + !...228
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t10, t21, t22, t27, t34, t41, t48, t55, t65, t71, t80, t85, Intersection wit...236
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,21.4909,538660,1,0,1498,3.73486e+06,246,783,2844,3.14542e+06,1637
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 116/116 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 116
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 98 transition count 104
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 98 transition count 104
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 92 transition count 98
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 92 transition count 98
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 41 place count 92 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 91 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 91 transition count 93
Applied a total of 43 rules in 5 ms. Remains 91 /111 variables (removed 20) and now considering 93/116 (removed 23) transitions.
// Phase 1: matrix 93 rows 91 cols
[2025-06-03 13:27:42] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:27:42] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-03 13:27:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:27:42] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2025-06-03 13:27:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 93/183 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 1/184 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 0/184 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 184/184 variables, and 96 constraints, problems are : Problem set: 0 solved, 92 unsolved in 5390 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 93/183 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 92/187 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 1/184 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 0/184 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 184/184 variables, and 188 constraints, problems are : Problem set: 0 solved, 92 unsolved in 6859 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12261ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 12263ms
Starting structural reductions in LTL mode, iteration 1 : 91/111 places, 93/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12455 ms. Remains : 91/111 places, 93/116 transitions.
[2025-06-03 13:27:55] [INFO ] Flatten gal took : 7 ms
[2025-06-03 13:27:55] [INFO ] Flatten gal took : 6 ms
[2025-06-03 13:27:55] [INFO ] Input system was already deterministic with 93 transitions.
[2025-06-03 13:27:55] [INFO ] Flatten gal took : 6 ms
[2025-06-03 13:27:55] [INFO ] Flatten gal took : 6 ms
[2025-06-03 13:27:55] [INFO ] Time to serialize gal into /tmp/CTLFireability102457185849356641.gal : 2 ms
[2025-06-03 13:27:55] [INFO ] Time to serialize properties into /tmp/CTLFireability16844269132005349677.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/CTLFireability102457185849356641.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16844269132005349677.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.84951e+06,0.236279,9196,2,2151,5,22612,6,0,459,25279,0


Converting to forward existential form...Done !
original formula: AF(!(E((p8==1) U E(EF(((p79==1)&&(p99==1))) U (EX((p109==1)) * EG((p71==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E((p8==1) U E(E(TRUE U ((p79==1)&&(p99==1))) U (EX((p109==1)) * EG((p71==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t8, t12, t13, t23, t24, t29, t36, t43, t50, t57, t64, t71, t79, t83, Intersection wi...237
(forward)formula 0,1,3.19298,89760,1,0,566,499039,226,306,2680,460844,627
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 116/116 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 116
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 99 transition count 105
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 99 transition count 105
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 94 transition count 100
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 94 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 36 place count 94 transition count 97
Applied a total of 36 rules in 4 ms. Remains 94 /111 variables (removed 17) and now considering 97/116 (removed 19) transitions.
// Phase 1: matrix 97 rows 94 cols
[2025-06-03 13:27:58] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:27:58] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-03 13:27:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:27:58] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2025-06-03 13:27:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 97/190 variables, 93/98 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 1/191 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/191 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 99 constraints, problems are : Problem set: 0 solved, 96 unsolved in 6663 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 97/190 variables, 93/98 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 96/194 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (OVERLAPS) 1/191 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 195 constraints, problems are : Problem set: 0 solved, 96 unsolved in 7409 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14084ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 14086ms
Starting structural reductions in LTL mode, iteration 1 : 94/111 places, 97/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14287 ms. Remains : 94/111 places, 97/116 transitions.
[2025-06-03 13:28:12] [INFO ] Flatten gal took : 6 ms
[2025-06-03 13:28:12] [INFO ] Flatten gal took : 9 ms
[2025-06-03 13:28:12] [INFO ] Input system was already deterministic with 97 transitions.
[2025-06-03 13:28:12] [INFO ] Flatten gal took : 6 ms
[2025-06-03 13:28:12] [INFO ] Flatten gal took : 6 ms
[2025-06-03 13:28:12] [INFO ] Time to serialize gal into /tmp/CTLFireability9068728479882963197.gal : 1 ms
[2025-06-03 13:28:12] [INFO ] Time to serialize properties into /tmp/CTLFireability2633015453144351851.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/CTLFireability9068728479882963197.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2633015453144351851.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.36423e+06,0.230268,8980,2,2252,5,21793,6,0,475,22889,0


Converting to forward existential form...Done !
original formula: EG((((p97==1) + E((p80!=1) U AX(((p7==1) + EG((p76==1)))))) + (EX(E((p59==1) U (p103==1))) * E(AG((p33==1)) U (EF((p54==1)) + (p111==1)))...158
=> equivalent forward existential formula: [FwdG(Init,(((p97==1) + E((p80!=1) U !(EX(!(((p7==1) + EG((p76==1)))))))) + (EX(E((p59==1) U (p103==1))) * E(!(E...225
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t6, t8, t13, t16, t24, t25, t28, t32, t39, t46, t53, t60, t67, t73, t82, t87, Inters...246
(forward)formula 0,1,12.782,331800,1,0,1085,1.87761e+06,243,602,2765,2.2361e+06,1087
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 116/116 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 116
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 98 transition count 104
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 98 transition count 104
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 92 transition count 98
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 92 transition count 98
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 41 place count 92 transition count 94
Applied a total of 41 rules in 5 ms. Remains 92 /111 variables (removed 19) and now considering 94/116 (removed 22) transitions.
// Phase 1: matrix 94 rows 92 cols
[2025-06-03 13:28:25] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:28:25] [INFO ] Implicit Places using invariants in 57 ms returned []
[2025-06-03 13:28:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:28:25] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2025-06-03 13:28:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 94/185 variables, 91/96 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 1/186 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 0/186 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 97 constraints, problems are : Problem set: 0 solved, 93 unsolved in 5177 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 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/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (OVERLAPS) 94/185 variables, 91/96 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 93/189 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 1/186 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 0/186 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 190 constraints, problems are : Problem set: 0 solved, 93 unsolved in 7096 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12284ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 12284ms
Starting structural reductions in LTL mode, iteration 1 : 92/111 places, 94/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12440 ms. Remains : 92/111 places, 94/116 transitions.
[2025-06-03 13:28:38] [INFO ] Flatten gal took : 7 ms
[2025-06-03 13:28:38] [INFO ] Flatten gal took : 6 ms
[2025-06-03 13:28:38] [INFO ] Input system was already deterministic with 94 transitions.
[2025-06-03 13:28:38] [INFO ] Flatten gal took : 7 ms
[2025-06-03 13:28:38] [INFO ] Flatten gal took : 6 ms
[2025-06-03 13:28:38] [INFO ] Time to serialize gal into /tmp/CTLFireability5137594977412159523.gal : 2 ms
[2025-06-03 13:28:38] [INFO ] Time to serialize properties into /tmp/CTLFireability4098125668319675632.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/CTLFireability5137594977412159523.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4098125668319675632.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.85084e+06,0.255473,9212,2,2279,5,22286,6,0,464,24079,0


Converting to forward existential form...Done !
original formula: EX((!(A((p19==1) U ((p75==1)||(p80==1)))) * AX(((AF((p101==1)) + (p56==1)) + (((p46==1)&&(p93==1))&&(p108==1))))))
=> equivalent forward existential formula: [((EY(Init) * !(!((E(!(((p75==1)||(p80==1))) U (!((p19==1)) * !(((p75==1)||(p80==1))))) + EG(!(((p75==1)||(p80==...258
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t10, t14, t22, t23, t26, t31, t39, t45, t52, t59, t66, t72, t79, t84, Inters...246
(forward)formula 0,0,9.9409,259504,1,0,1096,1.71376e+06,223,513,2588,1.54679e+06,1230
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 116/116 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 116
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 100 transition count 106
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 100 transition count 106
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 95 transition count 101
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 95 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 34 place count 95 transition count 98
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 94 transition count 97
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 94 transition count 97
Applied a total of 36 rules in 3 ms. Remains 94 /111 variables (removed 17) and now considering 97/116 (removed 19) transitions.
// Phase 1: matrix 97 rows 94 cols
[2025-06-03 13:28:48] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:28:48] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-03 13:28:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:28:48] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2025-06-03 13:28:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 97/190 variables, 93/98 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 1/191 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 0/191 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 99 constraints, problems are : Problem set: 0 solved, 96 unsolved in 6497 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 97/190 variables, 93/98 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 96/194 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (OVERLAPS) 1/191 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 195 constraints, problems are : Problem set: 0 solved, 96 unsolved in 7317 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13826ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 13826ms
Starting structural reductions in LTL mode, iteration 1 : 94/111 places, 97/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13960 ms. Remains : 94/111 places, 97/116 transitions.
[2025-06-03 13:29:02] [INFO ] Flatten gal took : 10 ms
[2025-06-03 13:29:02] [INFO ] Flatten gal took : 4 ms
[2025-06-03 13:29:02] [INFO ] Input system was already deterministic with 97 transitions.
[2025-06-03 13:29:02] [INFO ] Flatten gal took : 3 ms
[2025-06-03 13:29:02] [INFO ] Flatten gal took : 3 ms
[2025-06-03 13:29:02] [INFO ] Time to serialize gal into /tmp/CTLFireability11387952169637165533.gal : 1 ms
[2025-06-03 13:29:02] [INFO ] Time to serialize properties into /tmp/CTLFireability10079035313542119199.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/CTLFireability11387952169637165533.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10079035313542119199.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.57801e+06,0.143183,8976,2,2100,5,21944,6,0,475,23748,0


Converting to forward existential form...Done !
original formula: EF((AX(E((((p64==1)&&(p93==1))&&(p108==1)) U AX((p74==1)))) * ((EF((p103==1)) + EG((p97==1))) + (!(E(A((p89==1) U (p66==1)) U EF((((p64==...230
=> equivalent forward existential formula: (([(FwdU((FwdU(Init,TRUE) * !(EX(!(E((((p64==1)&&(p93==1))&&(p108==1)) U !(EX(!((p74==1))))))))),TRUE) * (p103==...672
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t10, t15, t25, t26, t31, t41, t48, t55, t62, t69, t75, t82, t87, Intersection with r...233
(forward)formula 0,1,1.07845,38316,1,0,322,186142,217,178,2699,166653,360
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 116/116 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 116
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 14 place count 97 transition count 103
Iterating global reduction 1 with 13 rules applied. Total rules applied 27 place count 97 transition count 103
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 90 transition count 96
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 90 transition count 96
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 45 place count 90 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 89 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 89 transition count 91
Applied a total of 47 rules in 7 ms. Remains 89 /111 variables (removed 22) and now considering 91/116 (removed 25) transitions.
// Phase 1: matrix 91 rows 89 cols
[2025-06-03 13:29:03] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:29:03] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-03 13:29:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:29:03] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2025-06-03 13:29:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 91/179 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 1/180 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 0/180 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 180/180 variables, and 94 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5332 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 91/179 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 90/183 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 1/180 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/180 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 180/180 variables, and 184 constraints, problems are : Problem set: 0 solved, 90 unsolved in 6550 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11890ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 11891ms
Starting structural reductions in LTL mode, iteration 1 : 89/111 places, 91/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12061 ms. Remains : 89/111 places, 91/116 transitions.
[2025-06-03 13:29:15] [INFO ] Flatten gal took : 5 ms
[2025-06-03 13:29:15] [INFO ] Flatten gal took : 5 ms
[2025-06-03 13:29:15] [INFO ] Input system was already deterministic with 91 transitions.
[2025-06-03 13:29:15] [INFO ] Flatten gal took : 4 ms
[2025-06-03 13:29:15] [INFO ] Flatten gal took : 4 ms
[2025-06-03 13:29:15] [INFO ] Time to serialize gal into /tmp/CTLFireability13614267871045116731.gal : 1 ms
[2025-06-03 13:29:15] [INFO ] Time to serialize properties into /tmp/CTLFireability2242389129202342209.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/CTLFireability13614267871045116731.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2242389129202342209.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.69483e+06,0.23628,9228,2,2216,5,22956,6,0,449,24440,0


Converting to forward existential form...Done !
original formula: AX(EX(AX((EX((p83==1)) + AF((p111==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(EX(!((EX((p83==1)) + !(EG(!((p111==1)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t10, t22, t24, t28, t35, t42, t49, t56, t63, t69, t76, t81, Intersection wit...236
(forward)formula 0,1,6.70992,180036,1,0,654,1.12453e+06,206,305,2484,1.05854e+06,728
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 116/116 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 116
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 99 transition count 105
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 99 transition count 105
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 95 transition count 101
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 95 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 33 place count 95 transition count 99
Applied a total of 33 rules in 5 ms. Remains 95 /111 variables (removed 16) and now considering 99/116 (removed 17) transitions.
// Phase 1: matrix 99 rows 95 cols
[2025-06-03 13:29:22] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:29:22] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-06-03 13:29:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 13:29:22] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2025-06-03 13:29: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/94 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 99/193 variables, 94/99 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 1/194 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 0/194 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 100 constraints, problems are : Problem set: 0 solved, 98 unsolved in 5589 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 99/193 variables, 94/99 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 98/197 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 1/194 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 198 constraints, problems are : Problem set: 0 solved, 98 unsolved in 6538 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12134ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 12134ms
Starting structural reductions in LTL mode, iteration 1 : 95/111 places, 99/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12293 ms. Remains : 95/111 places, 99/116 transitions.
[2025-06-03 13:29:34] [INFO ] Flatten gal took : 5 ms
[2025-06-03 13:29:34] [INFO ] Flatten gal took : 5 ms
[2025-06-03 13:29:34] [INFO ] Input system was already deterministic with 99 transitions.
[2025-06-03 13:29:34] [INFO ] Flatten gal took : 4 ms
[2025-06-03 13:29:34] [INFO ] Flatten gal took : 5 ms
[2025-06-03 13:29:34] [INFO ] Time to serialize gal into /tmp/CTLFireability4339742511145117368.gal : 1 ms
[2025-06-03 13:29:34] [INFO ] Time to serialize properties into /tmp/CTLFireability18075301433729036638.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/CTLFireability4339742511145117368.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18075301433729036638.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.58628e+06,0.292144,9876,2,2309,5,24428,6,0,481,26820,0


Converting to forward existential form...Done !
original formula: A(A((!(AG((p30!=1))) * (p33==1)) U !((((AG((p26==1)) + A((p17==1) U (p76==1))) + ((p13==1)&&(p53==1))) * AX(((p72==1)||(p88==1)))))) U (!...194
=> equivalent forward existential formula: [((Init * !(EG(!((!(((p23==1)&&(p42==1))) * E(TRUE U (p81==1))))))) * !(E(!((!(((p23==1)&&(p42==1))) * E(TRUE U ...791
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t6, t10, t14, t22, t24, t29, t36, t43, t53, t61, t69, t74, t84, t89, Intersectio...241
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,14.2981,376692,1,0,1185,2.57374e+06,250,661,2970,2.1509e+06,1280
FORMULA GPUForwardProgress-PT-04b-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-06-03 13:29:48] [INFO ] Flatten gal took : 4 ms
[2025-06-03 13:29:48] [INFO ] Flatten gal took : 3 ms
Total runtime 285077 ms.

BK_STOP 1748957388954

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-04b"
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 GPUForwardProgress-PT-04b, 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 r100-smll-174867007800386"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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