Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 12K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 171K 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 IBM5964-PT-none-CTLFireability-2023-12
FORMULA_NAME IBM5964-PT-none-CTLFireability-2023-13
FORMULA_NAME IBM5964-PT-none-CTLFireability-2023-14
FORMULA_NAME IBM5964-PT-none-CTLFireability-2023-15
FORMULA_NAME IBM5964-PT-none-CTLFireability-2025-00
FORMULA_NAME IBM5964-PT-none-CTLFireability-2025-01
FORMULA_NAME IBM5964-PT-none-CTLFireability-2025-02
FORMULA_NAME IBM5964-PT-none-CTLFireability-2025-03
FORMULA_NAME IBM5964-PT-none-CTLFireability-2025-04
FORMULA_NAME IBM5964-PT-none-CTLFireability-2025-05
FORMULA_NAME IBM5964-PT-none-CTLFireability-2025-06
FORMULA_NAME IBM5964-PT-none-CTLFireability-2025-07
FORMULA_NAME IBM5964-PT-none-CTLFireability-2025-08
FORMULA_NAME IBM5964-PT-none-CTLFireability-2025-09
FORMULA_NAME IBM5964-PT-none-CTLFireability-2025-10
FORMULA_NAME IBM5964-PT-none-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748835569483

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM5964-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-06-02 03:39:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 03:39:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 03:39:31] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2025-06-02 03:39:31] [INFO ] Transformed 263 places.
[2025-06-02 03:39:31] [INFO ] Transformed 139 transitions.
[2025-06-02 03:39:31] [INFO ] Parsed PT model containing 263 places and 139 transitions and 541 arcs in 224 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Support contains 142 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 139/139 transitions.
Ensure Unique test removed 53 places
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 201 transition count 139
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 199 transition count 137
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 199 transition count 137
Applied a total of 66 rules in 37 ms. Remains 199 /263 variables (removed 64) and now considering 137/139 (removed 2) transitions.
// Phase 1: matrix 137 rows 199 cols
[2025-06-02 03:39:31] [INFO ] Computed 69 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:31] [INFO ] Implicit Places using invariants in 288 ms returned [28, 162]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 326 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 197/263 places, 137/139 transitions.
Applied a total of 0 rules in 4 ms. Remains 197 /197 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 382 ms. Remains : 197/263 places, 137/139 transitions.
Support contains 142 out of 197 places after structural reductions.
[2025-06-02 03:39:31] [INFO ] Flatten gal took : 59 ms
[2025-06-02 03:39:31] [INFO ] Flatten gal took : 13 ms
[2025-06-02 03:39:31] [INFO ] Input system was already deterministic with 137 transitions.
Reduction of identical properties reduced properties to check from 76 to 75
RANDOM walk for 40002 steps (849 resets) in 1533 ms. (26 steps per ms) remains 61/75 properties
BEST_FIRST walk for 4003 steps (20 resets) in 58 ms. (67 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (20 resets) in 37 ms. (105 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (22 resets) in 58 ms. (67 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (22 resets) in 37 ms. (105 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (22 resets) in 37 ms. (105 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (20 resets) in 21 ms. (182 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (21 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (24 resets) in 34 ms. (114 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (21 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (20 resets) in 25 ms. (153 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (22 resets) in 25 ms. (153 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (24 resets) in 70 ms. (56 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (21 resets) in 21 ms. (181 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (23 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (22 resets) in 21 ms. (181 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (22 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (20 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (20 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (20 resets) in 13 ms. (285 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (22 resets) in 13 ms. (285 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (23 resets) in 13 ms. (285 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (23 resets) in 26 ms. (148 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (20 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (21 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (20 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (20 resets) in 13 ms. (285 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (20 resets) in 13 ms. (285 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (21 resets) in 59 ms. (66 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (20 resets) in 12 ms. (307 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (20 resets) in 13 ms. (285 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (21 resets) in 24 ms. (160 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (21 resets) in 12 ms. (307 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (21 resets) in 12 ms. (307 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (21 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (22 resets) in 12 ms. (307 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (21 resets) in 21 ms. (181 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4001 steps (21 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (20 resets) in 12 ms. (308 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (21 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (22 resets) in 15 ms. (250 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (21 resets) in 13 ms. (286 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (21 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (20 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (22 resets) in 29 ms. (133 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (21 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (20 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (22 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (22 resets) in 12 ms. (307 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (21 resets) in 12 ms. (307 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (20 resets) in 25 ms. (153 steps per ms) remains 61/61 properties
// Phase 1: matrix 137 rows 197 cols
[2025-06-02 03:39:35] [INFO ] Computed 67 invariants in 4 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 29/151 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 6/157 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 120/277 variables, 157/224 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Problem AtomicPropp31 is UNSAT
At refinement iteration 8 (OVERLAPS) 49/326 variables, 33/257 constraints. Problems are: Problem set: 1 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 0/257 constraints. Problems are: Problem set: 1 solved, 60 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp75 is UNSAT
After SMT solving in domain Real declared 334/334 variables, and 264 constraints, problems are : Problem set: 61 solved, 0 unsolved in 2033 ms.
Refiners :[Generalized P Invariants (flows): 67/67 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4137ms problems are : Problem set: 61 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 61 atomic propositions for a total of 16 simplifications.
FORMULA IBM5964-PT-none-CTLFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 03:39:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-02 03:39:37] [INFO ] Flatten gal took : 12 ms
[2025-06-02 03:39:37] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA IBM5964-PT-none-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 03:39:37] [INFO ] Flatten gal took : 9 ms
FORMULA IBM5964-PT-none-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 03:39:37] [INFO ] Input system was already deterministic with 137 transitions.
Support contains 21 out of 197 places (down from 25) after GAL structural reductions.
Computed a total of 197 stabilizing places and 137 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 197 transition count 137
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 137/137 transitions.
Ensure Unique test removed 64 places
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 133 transition count 137
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 72 place count 125 transition count 129
Iterating global reduction 1 with 8 rules applied. Total rules applied 80 place count 125 transition count 129
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 124 transition count 128
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 124 transition count 128
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 123 transition count 127
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 123 transition count 127
Applied a total of 84 rules in 27 ms. Remains 123 /197 variables (removed 74) and now considering 127/137 (removed 10) transitions.
// Phase 1: matrix 127 rows 123 cols
[2025-06-02 03:39:38] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:38] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-02 03:39:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:38] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2025-06-02 03:39:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
At refinement iteration 4 (OVERLAPS) 127/250 variables, 123/126 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/126 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 0/250 variables, 0/126 constraints. Problems are: Problem set: 104 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 126 constraints, problems are : Problem set: 104 solved, 22 unsolved in 2502 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 104 solved, 22 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 1/22 variables, 1/1 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 23/45 variables, 22/23 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 14/37 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/37 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 5/50 variables, 3/40 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 8/48 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/48 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 6/56 variables, 3/51 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 0/51 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 8/64 variables, 4/55 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/64 variables, 0/55 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 8/72 variables, 1/56 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/72 variables, 0/56 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 15 (OVERLAPS) 8/80 variables, 9/65 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/80 variables, 0/65 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 17 (OVERLAPS) 2/82 variables, 1/66 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/82 variables, 0/66 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 19 (OVERLAPS) 3/85 variables, 1/67 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/85 variables, 0/67 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 21 (OVERLAPS) 6/91 variables, 2/69 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/91 variables, 0/69 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 23 (OVERLAPS) 11/102 variables, 4/73 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/102 variables, 0/73 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 25 (OVERLAPS) 16/118 variables, 7/80 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/118 variables, 0/80 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 27 (OVERLAPS) 13/131 variables, 7/87 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/131 variables, 0/87 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 29 (OVERLAPS) 9/140 variables, 5/92 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/140 variables, 0/92 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 31 (OVERLAPS) 9/149 variables, 4/96 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/149 variables, 0/96 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 33 (OVERLAPS) 11/160 variables, 5/101 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/160 variables, 0/101 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 35 (OVERLAPS) 14/174 variables, 7/108 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/174 variables, 0/108 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 37 (OVERLAPS) 4/178 variables, 1/109 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/178 variables, 0/109 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 39 (OVERLAPS) 15/193 variables, 9/118 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/193 variables, 0/118 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 41 (OVERLAPS) 19/212 variables, 8/126 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/212 variables, 0/126 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 43 (OVERLAPS) 17/229 variables, 10/136 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/229 variables, 0/136 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 45 (OVERLAPS) 10/239 variables, 6/142 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/239 variables, 0/142 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 47 (OVERLAPS) 5/244 variables, 3/145 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/244 variables, 0/145 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 49 (OVERLAPS) 4/248 variables, 2/147 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/248 variables, 0/147 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 51 (OVERLAPS) 2/250 variables, 1/148 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/250 variables, 0/148 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 53 (OVERLAPS) 0/250 variables, 0/148 constraints. Problems are: Problem set: 104 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 148 constraints, problems are : Problem set: 104 solved, 22 unsolved in 6139 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 22/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8659ms problems are : Problem set: 104 solved, 22 unsolved
Search for dead transitions found 104 dead transitions in 8663ms
Found 104 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 104 transitions
Dead transitions reduction (with SMT) removed 104 transitions
Starting structural reductions in LTL mode, iteration 1 : 123/197 places, 23/137 transitions.
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 22 transition count 21
Applied a total of 103 rules in 1 ms. Remains 22 /123 variables (removed 101) and now considering 21/23 (removed 2) transitions.
// Phase 1: matrix 21 rows 22 cols
[2025-06-02 03:39:46] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:46] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-02 03:39:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:47] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 22/197 places, 21/137 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9007 ms. Remains : 22/197 places, 21/137 transitions.
[2025-06-02 03:39:47] [INFO ] Flatten gal took : 2 ms
[2025-06-02 03:39:47] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:39:47] [INFO ] Input system was already deterministic with 21 transitions.
[2025-06-02 03:39:47] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:39:47] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:39:47] [INFO ] Time to serialize gal into /tmp/CTLFireability1133243748844585044.gal : 1 ms
[2025-06-02 03:39:47] [INFO ] Time to serialize properties into /tmp/CTLFireability15473943016826004124.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/CTLFireability1133243748844585044.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15473943016826004124.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,10928,0.023281,4144,2,207,5,1986,6,0,110,2267,0


Converting to forward existential form...Done !
original formula: E(!(AX(FALSE)) U (E(((merge_s00001292_input_s00000935>=1) * AX(FALSE)) U (merge_s00001292_input_s00000935>=1)) * (EG(!(AX((merge_s0000129...197
=> equivalent forward existential formula: ([FwdG((FwdU(Init,!(!(EX(!(FALSE))))) * E(((merge_s00001292_input_s00000935>=1) * !(EX(!(FALSE)))) U (merge_s000...407
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t5, t7, t10, t11, Intersection with reachable at each step enabled. (destroyed/rever...185
dead was empty
(forward)formula 0,1,0.160885,10416,1,0,191,36927,69,120,609,46422,234
FORMULA IBM5964-PT-none-CTLFireability-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 137/137 transitions.
Ensure Unique test removed 64 places
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 133 transition count 137
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 74 place count 123 transition count 127
Iterating global reduction 1 with 10 rules applied. Total rules applied 84 place count 123 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 122 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 122 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 121 transition count 125
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 121 transition count 125
Applied a total of 88 rules in 26 ms. Remains 121 /197 variables (removed 76) and now considering 125/137 (removed 12) transitions.
// Phase 1: matrix 125 rows 121 cols
[2025-06-02 03:39:47] [INFO ] Computed 3 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:47] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-02 03:39:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:47] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2025-06-02 03:39:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 124 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
At refinement iteration 4 (OVERLAPS) 125/246 variables, 121/124 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/124 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/246 variables, 0/124 constraints. Problems are: Problem set: 104 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 124 constraints, problems are : Problem set: 104 solved, 20 unsolved in 2177 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 104 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/20 variables, 1/1 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 21/41 variables, 20/21 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 13/34 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/34 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/46 variables, 3/37 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 7/44 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/46 variables, 0/44 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 6/52 variables, 3/47 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/52 variables, 0/47 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 8/60 variables, 4/51 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/60 variables, 0/51 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 8/68 variables, 1/52 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/68 variables, 0/52 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 8/76 variables, 9/61 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/76 variables, 0/61 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 17 (OVERLAPS) 2/78 variables, 1/62 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/78 variables, 0/62 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 19 (OVERLAPS) 3/81 variables, 1/63 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/81 variables, 0/63 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 21 (OVERLAPS) 6/87 variables, 2/65 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/87 variables, 0/65 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 23 (OVERLAPS) 11/98 variables, 4/69 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/98 variables, 0/69 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 25 (OVERLAPS) 16/114 variables, 7/76 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/114 variables, 0/76 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 27 (OVERLAPS) 13/127 variables, 7/83 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/127 variables, 0/83 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 29 (OVERLAPS) 9/136 variables, 5/88 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/136 variables, 0/88 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 31 (OVERLAPS) 9/145 variables, 4/92 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/145 variables, 0/92 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 33 (OVERLAPS) 11/156 variables, 5/97 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/156 variables, 0/97 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 35 (OVERLAPS) 14/170 variables, 7/104 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/170 variables, 0/104 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 37 (OVERLAPS) 4/174 variables, 1/105 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/174 variables, 0/105 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 39 (OVERLAPS) 15/189 variables, 9/114 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/189 variables, 0/114 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 41 (OVERLAPS) 19/208 variables, 8/122 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/208 variables, 0/122 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 43 (OVERLAPS) 17/225 variables, 10/132 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/225 variables, 0/132 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 45 (OVERLAPS) 10/235 variables, 6/138 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/235 variables, 0/138 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 47 (OVERLAPS) 5/240 variables, 3/141 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/240 variables, 0/141 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 49 (OVERLAPS) 4/244 variables, 2/143 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/244 variables, 0/143 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 51 (OVERLAPS) 2/246 variables, 1/144 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/246 variables, 0/144 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 53 (OVERLAPS) 0/246 variables, 0/144 constraints. Problems are: Problem set: 104 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 144 constraints, problems are : Problem set: 104 solved, 20 unsolved in 5046 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 20/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7233ms problems are : Problem set: 104 solved, 20 unsolved
Search for dead transitions found 104 dead transitions in 7238ms
Found 104 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 104 transitions
Dead transitions reduction (with SMT) removed 104 transitions
Starting structural reductions in LTL mode, iteration 1 : 121/197 places, 21/137 transitions.
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 20 transition count 19
Applied a total of 103 rules in 2 ms. Remains 20 /121 variables (removed 101) and now considering 19/21 (removed 2) transitions.
// Phase 1: matrix 19 rows 20 cols
[2025-06-02 03:39:54] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:54] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-02 03:39:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:54] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 20/197 places, 19/137 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7519 ms. Remains : 20/197 places, 19/137 transitions.
[2025-06-02 03:39:54] [INFO ] Flatten gal took : 2 ms
[2025-06-02 03:39:54] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:39:54] [INFO ] Input system was already deterministic with 19 transitions.
[2025-06-02 03:39:54] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:39:54] [INFO ] Flatten gal took : 2 ms
[2025-06-02 03:39:54] [INFO ] Time to serialize gal into /tmp/CTLFireability3815204683197125160.gal : 1 ms
[2025-06-02 03:39:54] [INFO ] Time to serialize properties into /tmp/CTLFireability15848957948896961345.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/CTLFireability3815204683197125160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15848957948896961345.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,7035,0.009749,4040,2,208,5,1682,6,0,101,1761,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.009964,4040,1,0,6,1682,7,1,126,1761,1
FORMULA IBM5964-PT-none-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 137/137 transitions.
Ensure Unique test removed 61 places
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 136 transition count 137
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 71 place count 126 transition count 127
Iterating global reduction 1 with 10 rules applied. Total rules applied 81 place count 126 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 125 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 125 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 124 transition count 125
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 124 transition count 125
Applied a total of 85 rules in 15 ms. Remains 124 /197 variables (removed 73) and now considering 125/137 (removed 12) transitions.
// Phase 1: matrix 125 rows 124 cols
[2025-06-02 03:39:54] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:54] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-02 03:39:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:39:55] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2025-06-02 03:39:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 1/124 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 124 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
At refinement iteration 4 (OVERLAPS) 125/249 variables, 124/130 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/130 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/249 variables, 0/130 constraints. Problems are: Problem set: 104 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 130 constraints, problems are : Problem set: 104 solved, 20 unsolved in 2235 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 104 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 2/2 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 21/42 variables, 21/23 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 13/36 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/36 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/47 variables, 3/39 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 7/46 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 0/46 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 6/53 variables, 3/49 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 0/49 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 8/61 variables, 4/53 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/61 variables, 0/53 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 8/69 variables, 1/54 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/69 variables, 0/54 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 8/77 variables, 9/63 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/77 variables, 0/63 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 17 (OVERLAPS) 2/79 variables, 1/64 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/79 variables, 0/64 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 19 (OVERLAPS) 3/82 variables, 1/65 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/82 variables, 0/65 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 21 (OVERLAPS) 6/88 variables, 2/67 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/88 variables, 0/67 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 23 (OVERLAPS) 11/99 variables, 4/71 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/99 variables, 0/71 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 25 (OVERLAPS) 16/115 variables, 7/78 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/115 variables, 0/78 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 27 (OVERLAPS) 13/128 variables, 7/85 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/128 variables, 0/85 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 29 (OVERLAPS) 9/137 variables, 5/90 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/137 variables, 0/90 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 31 (OVERLAPS) 9/146 variables, 4/94 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/146 variables, 0/94 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 33 (OVERLAPS) 11/157 variables, 5/99 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/157 variables, 0/99 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 35 (OVERLAPS) 14/171 variables, 7/106 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/171 variables, 0/106 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 37 (OVERLAPS) 4/175 variables, 1/107 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/175 variables, 0/107 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 39 (OVERLAPS) 17/192 variables, 11/118 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/192 variables, 2/120 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/192 variables, 0/120 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 42 (OVERLAPS) 19/211 variables, 8/128 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/211 variables, 0/128 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 44 (OVERLAPS) 17/228 variables, 10/138 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/228 variables, 0/138 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 46 (OVERLAPS) 10/238 variables, 6/144 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/238 variables, 0/144 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 48 (OVERLAPS) 5/243 variables, 3/147 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/243 variables, 0/147 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 50 (OVERLAPS) 4/247 variables, 2/149 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/247 variables, 0/149 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 52 (OVERLAPS) 2/249 variables, 1/150 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/249 variables, 0/150 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 54 (OVERLAPS) 0/249 variables, 0/150 constraints. Problems are: Problem set: 104 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 150 constraints, problems are : Problem set: 104 solved, 20 unsolved in 4829 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 20/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7079ms problems are : Problem set: 104 solved, 20 unsolved
Search for dead transitions found 104 dead transitions in 7082ms
Found 104 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 104 transitions
Dead transitions reduction (with SMT) removed 104 transitions
Starting structural reductions in LTL mode, iteration 1 : 124/197 places, 21/137 transitions.
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 102 rules applied. Total rules applied 102 place count 24 transition count 19
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 102 rules in 1 ms. Remains 24 /124 variables (removed 100) and now considering 19/21 (removed 2) transitions.
// Phase 1: matrix 19 rows 24 cols
[2025-06-02 03:40:02] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:02] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-02 03:40:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:02] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 24/197 places, 19/137 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7496 ms. Remains : 24/197 places, 19/137 transitions.
[2025-06-02 03:40:02] [INFO ] Found a total of 3 fixed domain variables (out of 24 variables) in GAL type petri
[2025-06-02 03:40:02] [INFO ] Found a total of 3 constant array cells/variables (out of 24 variables) in type petri
[2025-06-02 03:40:02] [INFO ] callToTask_s00005966_output_s00000956,callToTask_s00005966_output_s00000979,callToTask_s00005966_output_s00000938,
[2025-06-02 03:40:02] [INFO ] Removed 3 constant variables :callToTask_s00005966_output_s00000956=0, callToTask_s00005966_output_s00000979=0, callToTask_s00005966_output_s00000938=0
[2025-06-02 03:40:02] [INFO ] Simplified 3 expressions due to constant valuations.
[2025-06-02 03:40:02] [INFO ] Flatten gal took : 4 ms
[2025-06-02 03:40:02] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:40:02] [INFO ] Input system was already deterministic with 19 transitions.
Support contains 5 out of 21 places (down from 8) after GAL structural reductions.
[2025-06-02 03:40:02] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:40:02] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:40:02] [INFO ] Time to serialize gal into /tmp/CTLFireability13158799834930688789.gal : 0 ms
[2025-06-02 03:40:02] [INFO ] Time to serialize properties into /tmp/CTLFireability10003847846337722342.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/CTLFireability13158799834930688789.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10003847846337722342.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,7035,0.008894,4044,2,226,5,1795,6,0,105,1876,0


Converting to forward existential form...Done !
original formula: AX((A((EG(((callToTask_s00005897_input_s00000950>=1)&&(callToTask_s00005897_input_s00000986>=1))) + (decision_s00000989_activated>=1)) U ...261
=> equivalent forward existential formula: (([((FwdU(EY(Init),!(EX((merge_s00001290_activated>=1)))) * !((EG(((callToTask_s00005897_input_s00000950>=1)&&(c...453
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t5, t7, Intersection with reachable at each step enabled. (destroyed/reverse/interse...175
(forward)formula 0,0,0.099265,8780,1,0,222,29843,63,97,581,34645,231
FORMULA IBM5964-PT-none-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 137/137 transitions.
Ensure Unique test removed 64 places
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 133 transition count 137
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 74 place count 123 transition count 127
Iterating global reduction 1 with 10 rules applied. Total rules applied 84 place count 123 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 122 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 122 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 121 transition count 125
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 121 transition count 125
Applied a total of 88 rules in 14 ms. Remains 121 /197 variables (removed 76) and now considering 125/137 (removed 12) transitions.
// Phase 1: matrix 125 rows 121 cols
[2025-06-02 03:40:02] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:02] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-02 03:40:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:02] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2025-06-02 03:40:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 124 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
At refinement iteration 4 (OVERLAPS) 125/246 variables, 121/124 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/124 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/246 variables, 0/124 constraints. Problems are: Problem set: 104 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 124 constraints, problems are : Problem set: 104 solved, 20 unsolved in 2180 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 104 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/20 variables, 1/1 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 21/41 variables, 20/21 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 13/34 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/34 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/46 variables, 3/37 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 7/44 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/46 variables, 0/44 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 6/52 variables, 3/47 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/52 variables, 0/47 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 8/60 variables, 4/51 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/60 variables, 0/51 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 8/68 variables, 1/52 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/68 variables, 0/52 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 8/76 variables, 9/61 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/76 variables, 0/61 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 17 (OVERLAPS) 2/78 variables, 1/62 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/78 variables, 0/62 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 19 (OVERLAPS) 3/81 variables, 1/63 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/81 variables, 0/63 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 21 (OVERLAPS) 6/87 variables, 2/65 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/87 variables, 0/65 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 23 (OVERLAPS) 11/98 variables, 4/69 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/98 variables, 0/69 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 25 (OVERLAPS) 16/114 variables, 7/76 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/114 variables, 0/76 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 27 (OVERLAPS) 13/127 variables, 7/83 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/127 variables, 0/83 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 29 (OVERLAPS) 9/136 variables, 5/88 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/136 variables, 0/88 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 31 (OVERLAPS) 9/145 variables, 4/92 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/145 variables, 0/92 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 33 (OVERLAPS) 11/156 variables, 5/97 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/156 variables, 0/97 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 35 (OVERLAPS) 14/170 variables, 7/104 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/170 variables, 0/104 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 37 (OVERLAPS) 4/174 variables, 1/105 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/174 variables, 0/105 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 39 (OVERLAPS) 15/189 variables, 9/114 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/189 variables, 0/114 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 41 (OVERLAPS) 19/208 variables, 8/122 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/208 variables, 0/122 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 43 (OVERLAPS) 17/225 variables, 10/132 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/225 variables, 0/132 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 45 (OVERLAPS) 10/235 variables, 6/138 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/235 variables, 0/138 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 47 (OVERLAPS) 5/240 variables, 3/141 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/240 variables, 0/141 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 49 (OVERLAPS) 4/244 variables, 2/143 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/244 variables, 0/143 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 51 (OVERLAPS) 2/246 variables, 1/144 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/246 variables, 0/144 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 53 (OVERLAPS) 0/246 variables, 0/144 constraints. Problems are: Problem set: 104 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 144 constraints, problems are : Problem set: 104 solved, 20 unsolved in 4725 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 20/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6915ms problems are : Problem set: 104 solved, 20 unsolved
Search for dead transitions found 104 dead transitions in 6915ms
Found 104 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 104 transitions
Dead transitions reduction (with SMT) removed 104 transitions
Starting structural reductions in LTL mode, iteration 1 : 121/197 places, 21/137 transitions.
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 20 transition count 19
Applied a total of 103 rules in 1 ms. Remains 20 /121 variables (removed 101) and now considering 19/21 (removed 2) transitions.
// Phase 1: matrix 19 rows 20 cols
[2025-06-02 03:40:09] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:09] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-02 03:40:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:09] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 20/197 places, 19/137 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7178 ms. Remains : 20/197 places, 19/137 transitions.
[2025-06-02 03:40:09] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-02 03:40:09] [INFO ] Flatten gal took : 1 ms
FORMULA IBM5964-PT-none-CTLFireability-2025-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 03:40:09] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:40:09] [INFO ] Input system was already deterministic with 19 transitions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 137/137 transitions.
Ensure Unique test removed 60 places
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 137 transition count 137
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 68 place count 129 transition count 129
Iterating global reduction 1 with 8 rules applied. Total rules applied 76 place count 129 transition count 129
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 128 transition count 128
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 128 transition count 128
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 127 transition count 127
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 127 transition count 127
Applied a total of 80 rules in 8 ms. Remains 127 /197 variables (removed 70) and now considering 127/137 (removed 10) transitions.
// Phase 1: matrix 127 rows 127 cols
[2025-06-02 03:40:09] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:09] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-02 03:40:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:09] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2025-06-02 03:40:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/127 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
At refinement iteration 4 (OVERLAPS) 127/254 variables, 127/134 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 0/134 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 0/254 variables, 0/134 constraints. Problems are: Problem set: 104 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/254 variables, and 134 constraints, problems are : Problem set: 104 solved, 22 unsolved in 2284 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 104 solved, 22 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: 104 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 1/26 variables, 3/5 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 23/49 variables, 26/31 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 14/45 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/45 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 5/54 variables, 3/48 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 8/56 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/54 variables, 0/56 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 6/60 variables, 3/59 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/59 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 8/68 variables, 4/63 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/68 variables, 0/63 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 8/76 variables, 1/64 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/76 variables, 0/64 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 16 (OVERLAPS) 8/84 variables, 9/73 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/84 variables, 0/73 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 18 (OVERLAPS) 2/86 variables, 1/74 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/86 variables, 0/74 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 20 (OVERLAPS) 3/89 variables, 1/75 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/89 variables, 0/75 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 22 (OVERLAPS) 6/95 variables, 2/77 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/95 variables, 0/77 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 24 (OVERLAPS) 11/106 variables, 4/81 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/106 variables, 0/81 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 26 (OVERLAPS) 16/122 variables, 7/88 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/122 variables, 0/88 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 28 (OVERLAPS) 13/135 variables, 7/95 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/135 variables, 0/95 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 30 (OVERLAPS) 9/144 variables, 5/100 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/144 variables, 0/100 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 32 (OVERLAPS) 9/153 variables, 4/104 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/153 variables, 0/104 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 34 (OVERLAPS) 11/164 variables, 5/109 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/164 variables, 0/109 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 36 (OVERLAPS) 14/178 variables, 7/116 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/178 variables, 0/116 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 38 (OVERLAPS) 4/182 variables, 1/117 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/182 variables, 0/117 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 40 (OVERLAPS) 15/197 variables, 9/126 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/197 variables, 0/126 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 42 (OVERLAPS) 19/216 variables, 8/134 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/216 variables, 0/134 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 44 (OVERLAPS) 17/233 variables, 10/144 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/233 variables, 0/144 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 46 (OVERLAPS) 10/243 variables, 6/150 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/243 variables, 0/150 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 48 (OVERLAPS) 5/248 variables, 3/153 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/248 variables, 0/153 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 50 (OVERLAPS) 4/252 variables, 2/155 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/252 variables, 0/155 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 52 (OVERLAPS) 2/254 variables, 1/156 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/254 variables, 0/156 constraints. Problems are: Problem set: 104 solved, 22 unsolved
At refinement iteration 54 (OVERLAPS) 0/254 variables, 0/156 constraints. Problems are: Problem set: 104 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/254 variables, and 156 constraints, problems are : Problem set: 104 solved, 22 unsolved in 4775 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 22/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7071ms problems are : Problem set: 104 solved, 22 unsolved
Search for dead transitions found 104 dead transitions in 7071ms
Found 104 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 104 transitions
Dead transitions reduction (with SMT) removed 104 transitions
Starting structural reductions in LTL mode, iteration 1 : 127/197 places, 23/137 transitions.
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 26 transition count 21
Applied a total of 103 rules in 2 ms. Remains 26 /127 variables (removed 101) and now considering 21/23 (removed 2) transitions.
// Phase 1: matrix 21 rows 26 cols
[2025-06-02 03:40:16] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:16] [INFO ] Implicit Places using invariants in 26 ms returned []
[2025-06-02 03:40:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:16] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 26/197 places, 21/137 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7312 ms. Remains : 26/197 places, 21/137 transitions.
[2025-06-02 03:40:16] [INFO ] Flatten gal took : 2 ms
[2025-06-02 03:40:16] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:40:16] [INFO ] Input system was already deterministic with 21 transitions.
[2025-06-02 03:40:16] [INFO ] Flatten gal took : 2 ms
[2025-06-02 03:40:16] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:40:16] [INFO ] Time to serialize gal into /tmp/CTLFireability15223531463457152489.gal : 0 ms
[2025-06-02 03:40:16] [INFO ] Time to serialize properties into /tmp/CTLFireability13034901050944913115.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/CTLFireability15223531463457152489.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13034901050944913115.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,9764,0.012423,4232,2,345,5,2776,6,0,126,2888,0


Converting to forward existential form...Done !
original formula: AG(A((AF((EF((merge_s00001290_input_s00000935>=1)) * AF(((((process_s00000383__s00005964_input_s00001609>=1)&&(callToProcess_s00002538_in...807
=> equivalent forward existential formula: (((([(EY((FwdU(FwdU(Init,TRUE),!((((!(EX(!((merge_s00001290_input_s00000952>=1)))) * (process_s00000383__s000059...4285
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t7, t9, Intersection with reachable at each step enabled. (destroyed/reverse/interse...175
(forward)formula 0,0,0.080511,7560,1,0,95,21191,65,29,752,23489,98
FORMULA IBM5964-PT-none-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 137/137 transitions.
Ensure Unique test removed 64 places
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 133 transition count 137
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 73 place count 124 transition count 128
Iterating global reduction 1 with 9 rules applied. Total rules applied 82 place count 124 transition count 128
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 123 transition count 127
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 123 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 122 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 122 transition count 126
Applied a total of 86 rules in 8 ms. Remains 122 /197 variables (removed 75) and now considering 126/137 (removed 11) transitions.
// Phase 1: matrix 126 rows 122 cols
[2025-06-02 03:40:17] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:17] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-02 03:40:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:17] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2025-06-02 03:40:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 1/122 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
At refinement iteration 4 (OVERLAPS) 126/248 variables, 122/125 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/125 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 0/248 variables, 0/125 constraints. Problems are: Problem set: 104 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 125 constraints, problems are : Problem set: 104 solved, 21 unsolved in 2414 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 104 solved, 21 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 22/43 variables, 21/22 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 14/36 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/36 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 5/48 variables, 3/39 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 7/46 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/46 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 6/54 variables, 3/49 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/54 variables, 0/49 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 8/62 variables, 4/53 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/62 variables, 0/53 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 8/70 variables, 1/54 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/70 variables, 0/54 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 15 (OVERLAPS) 8/78 variables, 9/63 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/78 variables, 0/63 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 17 (OVERLAPS) 2/80 variables, 1/64 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/80 variables, 0/64 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 19 (OVERLAPS) 3/83 variables, 1/65 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/83 variables, 0/65 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 21 (OVERLAPS) 6/89 variables, 2/67 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/89 variables, 0/67 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 23 (OVERLAPS) 11/100 variables, 4/71 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/100 variables, 0/71 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 25 (OVERLAPS) 16/116 variables, 7/78 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/116 variables, 0/78 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 27 (OVERLAPS) 13/129 variables, 7/85 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/129 variables, 0/85 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 29 (OVERLAPS) 9/138 variables, 5/90 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/138 variables, 0/90 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 31 (OVERLAPS) 9/147 variables, 4/94 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/147 variables, 0/94 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 33 (OVERLAPS) 11/158 variables, 5/99 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/158 variables, 0/99 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 35 (OVERLAPS) 14/172 variables, 7/106 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/172 variables, 0/106 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 37 (OVERLAPS) 4/176 variables, 1/107 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/176 variables, 0/107 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 39 (OVERLAPS) 15/191 variables, 9/116 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/191 variables, 0/116 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 41 (OVERLAPS) 19/210 variables, 8/124 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/210 variables, 0/124 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 43 (OVERLAPS) 17/227 variables, 10/134 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/227 variables, 0/134 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 45 (OVERLAPS) 10/237 variables, 6/140 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/237 variables, 0/140 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 47 (OVERLAPS) 5/242 variables, 3/143 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/242 variables, 0/143 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 49 (OVERLAPS) 4/246 variables, 2/145 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/246 variables, 0/145 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 51 (OVERLAPS) 2/248 variables, 1/146 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/248 variables, 0/146 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 53 (OVERLAPS) 0/248 variables, 0/146 constraints. Problems are: Problem set: 104 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 146 constraints, problems are : Problem set: 104 solved, 21 unsolved in 4905 ms.
Refiners :[Generalized P Invariants (flows): 3/3 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 21/125 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7333ms problems are : Problem set: 104 solved, 21 unsolved
Search for dead transitions found 104 dead transitions in 7334ms
Found 104 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 104 transitions
Dead transitions reduction (with SMT) removed 104 transitions
Starting structural reductions in LTL mode, iteration 1 : 122/197 places, 22/137 transitions.
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 21 transition count 20
Applied a total of 103 rules in 1 ms. Remains 21 /122 variables (removed 101) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 21 cols
[2025-06-02 03:40:24] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:24] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-02 03:40:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:24] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 21/197 places, 20/137 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7602 ms. Remains : 21/197 places, 20/137 transitions.
[2025-06-02 03:40:24] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:40:24] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:40:24] [INFO ] Input system was already deterministic with 20 transitions.
[2025-06-02 03:40:24] [INFO ] Flatten gal took : 0 ms
[2025-06-02 03:40:24] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:40:24] [INFO ] Time to serialize gal into /tmp/CTLFireability16290020125894283315.gal : 0 ms
[2025-06-02 03:40:24] [INFO ] Time to serialize properties into /tmp/CTLFireability4806388777224142271.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/CTLFireability16290020125894283315.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4806388777224142271.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,8596,0.009758,4172,2,230,5,1925,6,0,106,2048,0


Converting to forward existential form...Done !
original formula: AX((merge_s00001292_input_s00000952>=1))
=> equivalent forward existential formula: [(EY(Init) * !((merge_s00001292_input_s00000952>=1)))] = FALSE
(forward)formula 0,0,0.010411,4428,1,0,9,1925,9,2,137,2048,2
FORMULA IBM5964-PT-none-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 197/197 places, 137/137 transitions.
Graph (complete) has 283 edges and 197 vertex of which 20 are kept as prefixes of interest. Removing 177 places using SCC suffix rule.2 ms
Discarding 177 places :
Also discarding 119 output transitions
Drop transitions (Output transitions of discarded places.) removed 119 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 17 transition count 11
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 11 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 10 transition count 10
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 18 place count 7 transition count 7
Iterating global reduction 2 with 3 rules applied. Total rules applied 21 place count 7 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 21 place count 7 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 6 transition count 6
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 2 with 2 rules applied. Total rules applied 25 place count 5 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 4 transition count 4
Applied a total of 26 rules in 16 ms. Remains 4 /197 variables (removed 193) and now considering 4/137 (removed 133) transitions.
// Phase 1: matrix 4 rows 4 cols
[2025-06-02 03:40:24] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:24] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-02 03:40:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:24] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:40:24] [INFO ] Redundant transitions in 1 ms returned []
Running 1 sub problems to find dead transitions.
[2025-06-02 03:40:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2/6 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/8 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/8 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/8 variables, and 5 constraints, problems are : Problem set: 0 solved, 1 unsolved in 24 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/6 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/8 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/8 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 22 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 48ms
Starting structural reductions in SI_CTL mode, iteration 1 : 4/197 places, 4/137 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 104 ms. Remains : 4/197 places, 4/137 transitions.
[2025-06-02 03:40:24] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:40:24] [INFO ] Flatten gal took : 0 ms
[2025-06-02 03:40:24] [INFO ] Input system was already deterministic with 4 transitions.
[2025-06-02 03:40:24] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:40:24] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:40:24] [INFO ] Time to serialize gal into /tmp/CTLFireability14199059881526471125.gal : 0 ms
[2025-06-02 03:40:24] [INFO ] Time to serialize properties into /tmp/CTLFireability4423038914828288466.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/CTLFireability14199059881526471125.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4423038914828288466.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,52,0.001904,3660,2,18,5,122,6,0,21,105,0


Converting to forward existential form...Done !
original formula: EF(AG(((callToTask_s00005897_input_s00000950<1)||(callToTask_s00005897_input_s00000986<1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((callToTask_s00005897_input_s00000950<1)||(callToTask_s00005897_input_s0000098...174
Reverse transition relation is NOT exact ! Due to transitions t1, t2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total...165
(forward)formula 0,1,0.004645,3788,1,0,22,233,30,9,112,284,18
FORMULA IBM5964-PT-none-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 137/137 transitions.
Ensure Unique test removed 60 places
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 137 transition count 137
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 70 place count 127 transition count 127
Iterating global reduction 1 with 10 rules applied. Total rules applied 80 place count 127 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 126 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 126 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 125 transition count 125
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 125 transition count 125
Applied a total of 84 rules in 4 ms. Remains 125 /197 variables (removed 72) and now considering 125/137 (removed 12) transitions.
// Phase 1: matrix 125 rows 125 cols
[2025-06-02 03:40:24] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:24] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-02 03:40:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:24] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2025-06-02 03:40:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 124 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 124 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
At refinement iteration 4 (OVERLAPS) 125/250 variables, 125/132 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/132 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/250 variables, 0/132 constraints. Problems are: Problem set: 104 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 132 constraints, problems are : Problem set: 104 solved, 20 unsolved in 2157 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 104 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 2/2 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 3/5 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 21/45 variables, 24/29 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 13/42 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/42 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 5/50 variables, 3/45 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 7/52 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/50 variables, 0/52 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 6/56 variables, 3/55 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/56 variables, 0/55 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 8/64 variables, 4/59 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/64 variables, 0/59 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 14 (OVERLAPS) 8/72 variables, 1/60 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/72 variables, 0/60 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 16 (OVERLAPS) 8/80 variables, 9/69 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/80 variables, 0/69 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 18 (OVERLAPS) 2/82 variables, 1/70 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/82 variables, 0/70 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 20 (OVERLAPS) 3/85 variables, 1/71 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/85 variables, 0/71 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 22 (OVERLAPS) 6/91 variables, 2/73 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/91 variables, 0/73 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 24 (OVERLAPS) 11/102 variables, 4/77 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/102 variables, 0/77 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 26 (OVERLAPS) 16/118 variables, 7/84 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/118 variables, 0/84 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 28 (OVERLAPS) 13/131 variables, 7/91 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/131 variables, 0/91 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 30 (OVERLAPS) 9/140 variables, 5/96 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/140 variables, 0/96 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 32 (OVERLAPS) 9/149 variables, 4/100 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/149 variables, 0/100 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 34 (OVERLAPS) 11/160 variables, 5/105 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/160 variables, 0/105 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 36 (OVERLAPS) 14/174 variables, 7/112 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/174 variables, 0/112 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 38 (OVERLAPS) 4/178 variables, 1/113 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/178 variables, 0/113 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 40 (OVERLAPS) 15/193 variables, 9/122 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/193 variables, 0/122 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 42 (OVERLAPS) 19/212 variables, 8/130 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/212 variables, 0/130 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 44 (OVERLAPS) 17/229 variables, 10/140 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/229 variables, 0/140 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 46 (OVERLAPS) 10/239 variables, 6/146 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/239 variables, 0/146 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 48 (OVERLAPS) 5/244 variables, 3/149 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/244 variables, 0/149 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 50 (OVERLAPS) 4/248 variables, 2/151 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/248 variables, 0/151 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 52 (OVERLAPS) 2/250 variables, 1/152 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/250 variables, 0/152 constraints. Problems are: Problem set: 104 solved, 20 unsolved
At refinement iteration 54 (OVERLAPS) 0/250 variables, 0/152 constraints. Problems are: Problem set: 104 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 152 constraints, problems are : Problem set: 104 solved, 20 unsolved in 4417 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 20/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6590ms problems are : Problem set: 104 solved, 20 unsolved
Search for dead transitions found 104 dead transitions in 6590ms
Found 104 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 104 transitions
Dead transitions reduction (with SMT) removed 104 transitions
Starting structural reductions in LTL mode, iteration 1 : 125/197 places, 21/137 transitions.
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 24 transition count 19
Applied a total of 103 rules in 1 ms. Remains 24 /125 variables (removed 101) and now considering 19/21 (removed 2) transitions.
// Phase 1: matrix 19 rows 24 cols
[2025-06-02 03:40:31] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:31] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-02 03:40:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:31] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 24/197 places, 19/137 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6854 ms. Remains : 24/197 places, 19/137 transitions.
[2025-06-02 03:40:31] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:40:31] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:40:31] [INFO ] Input system was already deterministic with 19 transitions.
[2025-06-02 03:40:31] [INFO ] Flatten gal took : 2 ms
[2025-06-02 03:40:31] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:40:31] [INFO ] Time to serialize gal into /tmp/CTLFireability6019543174965158894.gal : 0 ms
[2025-06-02 03:40:31] [INFO ] Time to serialize properties into /tmp/CTLFireability12929656533853364322.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/CTLFireability6019543174965158894.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12929656533853364322.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,7035,0.012983,4196,2,346,5,2402,6,0,117,2467,0


Converting to forward existential form...Done !
original formula: EX(EF(EG(((((process_s00000383__s00005964_input_s00001609<1)||(callToProcess_s00002538_input_s00001011<1))||((callToTask_s00005897_output...354
=> equivalent forward existential formula: [FwdG(FwdU(EY(Init),TRUE),((((process_s00000383__s00005964_input_s00001609<1)||(callToProcess_s00002538_input_s0...404
Hit Full ! (commute/partial/dont) 15/0/4
(forward)formula 0,1,0.072058,7012,1,0,52,18688,19,4,623,19228,52
FORMULA IBM5964-PT-none-CTLFireability-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 197/197 places, 137/137 transitions.
Graph (complete) has 283 edges and 197 vertex of which 2 are kept as prefixes of interest. Removing 195 places using SCC suffix rule.3 ms
Discarding 195 places :
Also discarding 135 output transitions
Drop transitions (Output transitions of discarded places.) removed 135 transitions
Applied a total of 1 rules in 6 ms. Remains 2 /197 variables (removed 195) and now considering 2/137 (removed 135) transitions.
// Phase 1: matrix 2 rows 2 cols
[2025-06-02 03:40:31] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:31] [INFO ] Implicit Places using invariants in 17 ms returned []
[2025-06-02 03:40:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:31] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:40:31] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2025-06-02 03:40:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 30 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 59ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 60ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/197 places, 2/137 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 104 ms. Remains : 2/197 places, 2/137 transitions.
[2025-06-02 03:40:31] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:40:31] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:40:31] [INFO ] Input system was already deterministic with 2 transitions.
[2025-06-02 03:40:31] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:40:31] [INFO ] Flatten gal took : 0 ms
[2025-06-02 03:40:31] [INFO ] Time to serialize gal into /tmp/CTLFireability17626530533566845825.gal : 0 ms
[2025-06-02 03:40:31] [INFO ] Time to serialize properties into /tmp/CTLFireability7117521739480989917.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/CTLFireability17626530533566845825.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7117521739480989917.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,0.002753,3660,2,4,5,13,6,0,11,9,0


Converting to forward existential form...Done !
original formula: EF(AG((merge_s00001290_input_s00000952>=1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((merge_s00001290_input_s00000952>=1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...161
(forward)formula 0,0,0.004278,3916,1,0,12,25,22,6,42,32,16
FORMULA IBM5964-PT-none-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 197/197 places, 137/137 transitions.
Graph (complete) has 283 edges and 197 vertex of which 18 are kept as prefixes of interest. Removing 179 places using SCC suffix rule.1 ms
Discarding 179 places :
Also discarding 120 output transitions
Drop transitions (Output transitions of discarded places.) removed 120 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 15 transition count 12
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 11 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 9 place count 11 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 10 transition count 11
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 15 place count 6 transition count 7
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 6 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 6 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 5 transition count 6
Applied a total of 21 rules in 6 ms. Remains 5 /197 variables (removed 192) and now considering 6/137 (removed 131) transitions.
// Phase 1: matrix 6 rows 5 cols
[2025-06-02 03:40:31] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:31] [INFO ] Implicit Places using invariants in 12 ms returned []
[2025-06-02 03:40:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 03:40:31] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 03:40:31] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2025-06-02 03:40:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/11 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 31 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 5/11 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/11 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 7 constraints, problems are : Problem set: 0 solved, 2 unsolved in 35 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 67ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 67ms
Starting structural reductions in SI_CTL mode, iteration 1 : 5/197 places, 6/137 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 108 ms. Remains : 5/197 places, 6/137 transitions.
[2025-06-02 03:40:31] [INFO ] Flatten gal took : 0 ms
[2025-06-02 03:40:31] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:40:31] [INFO ] Input system was already deterministic with 6 transitions.
[2025-06-02 03:40:31] [INFO ] Flatten gal took : 0 ms
[2025-06-02 03:40:31] [INFO ] Flatten gal took : 1 ms
[2025-06-02 03:40:31] [INFO ] Time to serialize gal into /tmp/CTLFireability17525038327291988637.gal : 0 ms
[2025-06-02 03:40:31] [INFO ] Time to serialize properties into /tmp/CTLFireability17883677036405899792.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/CTLFireability17525038327291988637.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17883677036405899792.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,105,0.002231,3660,2,24,5,172,6,0,26,173,0


Converting to forward existential form...Done !
original formula: AF(EG(AG(((fork_s00001537_activated_s00000993>=1)&&(merge_s00001292_activated>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(E(TRUE U !(((fork_s00001537_activated_s00000993>=1)&&(merge_s00001292_activated>=1))))))))] = ...160
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t4, t5, Intersection with reachable at each step enabled. (destroyed/reverse/interse...173
(forward)formula 0,0,0.006009,4172,1,0,43,766,40,14,147,1001,44
FORMULA IBM5964-PT-none-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 03:40:31] [INFO ] Flatten gal took : 8 ms
[2025-06-02 03:40:31] [INFO ] Flatten gal took : 7 ms
Total runtime 61053 ms.

BK_STOP 1748835632041

--------------------
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="IBM5964-PT-none"
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 IBM5964-PT-none, 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 r114-tall-174876422500338"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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