Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 792K
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 432K 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 DBSingleClientW-PT-d1m06-CTLFireability-2023-12
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2023-13
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2023-14
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2023-15
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2025-00
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2025-01
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2025-02
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2025-03
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2025-04
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2025-05
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2025-06
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2025-07
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2025-08
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2025-09
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2025-10
FORMULA_NAME DBSingleClientW-PT-d1m06-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748570098003

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-30 01:55:00] [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-05-30 01:55:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 01:55:01] [INFO ] Load time of PNML (sax parser for PT used): 329 ms
[2025-05-30 01:55:01] [INFO ] Transformed 1440 places.
[2025-05-30 01:55:01] [INFO ] Transformed 672 transitions.
[2025-05-30 01:55:01] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 562 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Deduced a syphon composed of 1093 places in 11 ms
Reduce places removed 1093 places and 0 transitions.
Support contains 109 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 156 place count 271 transition count 531
Iterating global reduction 1 with 55 rules applied. Total rules applied 211 place count 271 transition count 531
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 231 place count 271 transition count 511
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 257 place count 245 transition count 485
Iterating global reduction 2 with 26 rules applied. Total rules applied 283 place count 245 transition count 485
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 291 place count 237 transition count 476
Iterating global reduction 2 with 8 rules applied. Total rules applied 299 place count 237 transition count 476
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 306 place count 237 transition count 469
Applied a total of 306 rules in 124 ms. Remains 237 /347 variables (removed 110) and now considering 469/672 (removed 203) transitions.
// Phase 1: matrix 469 rows 237 cols
[2025-05-30 01:55:01] [INFO ] Computed 2 invariants in 58 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:55:02] [INFO ] Implicit Places using invariants in 811 ms returned []
[2025-05-30 01:55:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:55:02] [INFO ] State equation strengthened by 260 read => feed constraints.
[2025-05-30 01:55:05] [INFO ] Implicit Places using invariants and state equation in 2947 ms returned []
Implicit Place search using SMT with State Equation took 3812 ms to find 0 implicit places.
Running 468 sub problems to find dead transitions.
[2025-05-30 01:55:05] [INFO ] Invariant cache hit.
[2025-05-30 01:55:05] [INFO ] State equation strengthened by 260 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 4 (OVERLAPS) 469/706 variables, 237/239 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/706 variables, 260/499 constraints. Problems are: Problem set: 0 solved, 468 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 706/706 variables, and 499 constraints, problems are : Problem set: 0 solved, 468 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 468/468 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 468 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 4 (OVERLAPS) 469/706 variables, 237/239 constraints. Problems are: Problem set: 0 solved, 468 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/706 variables, 260/499 constraints. Problems are: Problem set: 0 solved, 468 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 706/706 variables, and 967 constraints, problems are : Problem set: 0 solved, 468 unsolved in 30357 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 468/468 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61950ms problems are : Problem set: 0 solved, 468 unsolved
Search for dead transitions found 0 dead transitions in 61985ms
Starting structural reductions in LTL mode, iteration 1 : 237/347 places, 469/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65957 ms. Remains : 237/347 places, 469/672 transitions.
Support contains 109 out of 237 places after structural reductions.
[2025-05-30 01:56:07] [INFO ] Flatten gal took : 84 ms
[2025-05-30 01:56:07] [INFO ] Flatten gal took : 50 ms
[2025-05-30 01:56:07] [INFO ] Input system was already deterministic with 469 transitions.
Support contains 108 out of 237 places (down from 109) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 87 to 85
RANDOM walk for 40000 steps (9118 resets) in 3383 ms. (11 steps per ms) remains 75/85 properties
BEST_FIRST walk for 4001 steps (206 resets) in 78 ms. (50 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (408 resets) in 49 ms. (80 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (194 resets) in 32 ms. (121 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (196 resets) in 96 ms. (41 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (191 resets) in 81 ms. (48 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (217 resets) in 50 ms. (78 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4000 steps (800 resets) in 54 ms. (72 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (378 resets) in 36 ms. (108 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (179 resets) in 21 ms. (182 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4002 steps (182 resets) in 23 ms. (166 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (395 resets) in 31 ms. (125 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (189 resets) in 24 ms. (160 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (172 resets) in 20 ms. (190 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (182 resets) in 20 ms. (190 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4004 steps (172 resets) in 20 ms. (190 steps per ms) remains 75/75 properties
BEST_FIRST walk for 4003 steps (164 resets) in 27 ms. (142 steps per ms) remains 73/75 properties
BEST_FIRST walk for 4002 steps (389 resets) in 60 ms. (65 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (184 resets) in 34 ms. (114 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (186 resets) in 35 ms. (111 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4001 steps (202 resets) in 32 ms. (121 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (197 resets) in 30 ms. (129 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (358 resets) in 40 ms. (97 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4001 steps (211 resets) in 31 ms. (125 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (194 resets) in 39 ms. (100 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (404 resets) in 41 ms. (95 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (200 resets) in 49 ms. (80 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (199 resets) in 41 ms. (95 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (404 resets) in 119 ms. (33 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4001 steps (424 resets) in 69 ms. (57 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (158 resets) in 36 ms. (108 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (190 resets) in 54 ms. (72 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (395 resets) in 60 ms. (65 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (194 resets) in 58 ms. (67 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (194 resets) in 49 ms. (80 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (194 resets) in 48 ms. (81 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (211 resets) in 50 ms. (78 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (179 resets) in 47 ms. (83 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (199 resets) in 35 ms. (111 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (360 resets) in 63 ms. (62 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4000 steps (800 resets) in 77 ms. (51 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (394 resets) in 70 ms. (56 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (188 resets) in 73 ms. (54 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (163 resets) in 38 ms. (102 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (373 resets) in 51 ms. (76 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (192 resets) in 52 ms. (75 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (391 resets) in 69 ms. (57 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (175 resets) in 44 ms. (88 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4001 steps (389 resets) in 63 ms. (62 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (361 resets) in 51 ms. (76 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (183 resets) in 28 ms. (138 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (390 resets) in 51 ms. (76 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (183 resets) in 33 ms. (117 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (211 resets) in 33 ms. (117 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4001 steps (389 resets) in 63 ms. (62 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (193 resets) in 72 ms. (54 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4004 steps (361 resets) in 66 ms. (59 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (184 resets) in 43 ms. (90 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (400 resets) in 62 ms. (63 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (216 resets) in 45 ms. (87 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (203 resets) in 43 ms. (90 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (188 resets) in 47 ms. (83 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (181 resets) in 44 ms. (88 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4002 steps (184 resets) in 48 ms. (81 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (195 resets) in 46 ms. (85 steps per ms) remains 73/73 properties
BEST_FIRST walk for 4003 steps (203 resets) in 47 ms. (83 steps per ms) remains 73/73 properties
[2025-05-30 01:56:10] [INFO ] Invariant cache hit.
[2025-05-30 01:56:10] [INFO ] State equation strengthened by 260 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp85 is UNSAT
At refinement iteration 1 (OVERLAPS) 64/159 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 70 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/192 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 436/628 variables, 192/194 constraints. Problems are: Problem set: 3 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/628 variables, 227/421 constraints. Problems are: Problem set: 3 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/628 variables, 0/421 constraints. Problems are: Problem set: 3 solved, 70 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 8 (OVERLAPS) 78/706 variables, 45/466 constraints. Problems are: Problem set: 4 solved, 69 unsolved
SMT process timed out in 5284ms, After SMT, problems are : Problem set: 4 solved, 69 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 86 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 469/469 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 228 transition count 446
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 228 transition count 446
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 27 place count 228 transition count 437
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 225 transition count 434
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 225 transition count 434
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 225 transition count 433
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 224 transition count 431
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 224 transition count 431
Applied a total of 36 rules in 78 ms. Remains 224 /237 variables (removed 13) and now considering 431/469 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 224/237 places, 431/469 transitions.
RANDOM walk for 40000 steps (9134 resets) in 785 ms. (50 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4001 steps (352 resets) in 41 ms. (95 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (195 resets) in 30 ms. (129 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (196 resets) in 29 ms. (133 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (169 resets) in 24 ms. (160 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (200 resets) in 33 ms. (117 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4001 steps (378 resets) in 45 ms. (86 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (213 resets) in 30 ms. (129 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (417 resets) in 45 ms. (87 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (184 resets) in 35 ms. (111 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (197 resets) in 50 ms. (78 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4001 steps (191 resets) in 56 ms. (70 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (197 resets) in 56 ms. (70 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (185 resets) in 47 ms. (83 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (387 resets) in 84 ms. (47 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (182 resets) in 68 ms. (58 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (172 resets) in 52 ms. (75 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (185 resets) in 50 ms. (78 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4001 steps (213 resets) in 48 ms. (81 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (397 resets) in 49 ms. (80 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4001 steps (200 resets) in 32 ms. (121 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (178 resets) in 60 ms. (65 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (387 resets) in 62 ms. (63 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (196 resets) in 44 ms. (88 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (189 resets) in 33 ms. (117 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4001 steps (374 resets) in 61 ms. (64 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (379 resets) in 61 ms. (64 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (189 resets) in 44 ms. (88 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4001 steps (189 resets) in 45 ms. (86 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (375 resets) in 63 ms. (62 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (166 resets) in 45 ms. (87 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (203 resets) in 45 ms. (87 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (196 resets) in 41 ms. (95 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (194 resets) in 40 ms. (97 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (180 resets) in 38 ms. (102 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (194 resets) in 44 ms. (88 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (338 resets) in 52 ms. (75 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4000 steps (800 resets) in 40 ms. (97 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (381 resets) in 31 ms. (125 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (208 resets) in 24 ms. (160 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4004 steps (167 resets) in 20 ms. (190 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (411 resets) in 32 ms. (121 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (207 resets) in 26 ms. (148 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (400 resets) in 31 ms. (125 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (202 resets) in 23 ms. (166 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (413 resets) in 31 ms. (125 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4001 steps (350 resets) in 32 ms. (121 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (178 resets) in 24 ms. (160 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (404 resets) in 31 ms. (125 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4003 steps (160 resets) in 23 ms. (166 steps per ms) remains 69/69 properties
BEST_FIRST walk for 4002 steps (206 resets) in 23 ms. (166 steps per ms) remains 69/69 properties
Interrupted probabilistic random walk after 316560 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :65 out of 69
Probabilistic random walk after 316560 steps, saw 129834 distinct states, run finished after 3007 ms. (steps per millisecond=105 ) properties seen :65
// Phase 1: matrix 431 rows 224 cols
[2025-05-30 01:56:19] [INFO ] Computed 2 invariants in 4 ms
[2025-05-30 01:56:19] [INFO ] State equation strengthened by 229 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 85/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 49/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 259/402 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 57/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp32 is UNSAT
At refinement iteration 8 (OVERLAPS) 239/641 variables, 74/276 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 165/441 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/641 variables, 0/441 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 14/655 variables, 7/448 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/655 variables, 7/455 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/655 variables, 0/455 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/655 variables, 0/455 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 655/655 variables, and 455 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1385 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 224/224 constraints, ReadFeed: 229/229 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 85/93 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 49/142 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 247/389 variables, 142/144 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 45/189 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 0/189 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 252/641 variables, 75/264 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 177/441 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/641 variables, 3/444 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/641 variables, 0/444 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 14/655 variables, 7/451 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/655 variables, 7/458 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/655 variables, 0/458 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/655 variables, 0/458 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 655/655 variables, and 458 constraints, problems are : Problem set: 1 solved, 3 unsolved in 7562 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 224/224 constraints, ReadFeed: 229/229 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8980ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 0 properties in 901 ms.
Support contains 8 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 431/431 transitions.
Graph (complete) has 792 edges and 224 vertex of which 223 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 223 transition count 426
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 54 place count 175 transition count 277
Iterating global reduction 1 with 48 rules applied. Total rules applied 102 place count 175 transition count 277
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 106 place count 175 transition count 273
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 142 place count 139 transition count 229
Iterating global reduction 2 with 36 rules applied. Total rules applied 178 place count 139 transition count 229
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 192 place count 139 transition count 215
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 210 place count 121 transition count 187
Iterating global reduction 3 with 18 rules applied. Total rules applied 228 place count 121 transition count 187
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 235 place count 121 transition count 180
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 243 place count 113 transition count 167
Iterating global reduction 4 with 8 rules applied. Total rules applied 251 place count 113 transition count 167
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 254 place count 113 transition count 164
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 258 place count 109 transition count 160
Iterating global reduction 5 with 4 rules applied. Total rules applied 262 place count 109 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 263 place count 109 transition count 159
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 266 place count 106 transition count 150
Iterating global reduction 6 with 3 rules applied. Total rules applied 269 place count 106 transition count 150
Applied a total of 269 rules in 56 ms. Remains 106 /224 variables (removed 118) and now considering 150/431 (removed 281) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 106/224 places, 150/431 transitions.
RANDOM walk for 40000 steps (9233 resets) in 190 ms. (209 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1861 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1886 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1899 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 69360 steps, run visited all 3 properties in 359 ms. (steps per millisecond=193 )
Probabilistic random walk after 69360 steps, saw 28676 distinct states, run finished after 367 ms. (steps per millisecond=188 ) properties seen :3
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2025-05-30 01:56:30] [INFO ] Flatten gal took : 56 ms
[2025-05-30 01:56:30] [INFO ] Flatten gal took : 58 ms
[2025-05-30 01:56:30] [INFO ] Input system was already deterministic with 469 transitions.
Computed a total of 5 stabilizing places and 38 stable transitions
Graph (complete) has 927 edges and 237 vertex of which 236 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 469/469 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 182 transition count 289
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 182 transition count 289
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 115 place count 182 transition count 284
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 154 place count 143 transition count 235
Iterating global reduction 1 with 39 rules applied. Total rules applied 193 place count 143 transition count 235
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 207 place count 143 transition count 221
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 224 place count 126 transition count 197
Iterating global reduction 2 with 17 rules applied. Total rules applied 241 place count 126 transition count 197
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 248 place count 126 transition count 190
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 254 place count 120 transition count 181
Iterating global reduction 3 with 6 rules applied. Total rules applied 260 place count 120 transition count 181
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 265 place count 115 transition count 176
Iterating global reduction 3 with 5 rules applied. Total rules applied 270 place count 115 transition count 176
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 274 place count 111 transition count 166
Iterating global reduction 3 with 4 rules applied. Total rules applied 278 place count 111 transition count 166
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 280 place count 111 transition count 164
Applied a total of 280 rules in 32 ms. Remains 111 /237 variables (removed 126) and now considering 164/469 (removed 305) transitions.
// Phase 1: matrix 164 rows 111 cols
[2025-05-30 01:56:30] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:56:30] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-05-30 01:56:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:56:30] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-05-30 01:56:30] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2025-05-30 01:56:30] [INFO ] Invariant cache hit.
[2025-05-30 01:56:30] [INFO ] State equation strengthened by 59 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/275 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 59/172 constraints. Problems are: Problem set: 0 solved, 163 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (OVERLAPS) 0/275 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 172 constraints, problems are : Problem set: 0 solved, 163 unsolved in 12105 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/275 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/275 variables, 59/172 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 163/335 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 275/275 variables, and 335 constraints, problems are : Problem set: 0 solved, 163 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42232ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 42233ms
Starting structural reductions in LTL mode, iteration 1 : 111/237 places, 164/469 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42853 ms. Remains : 111/237 places, 164/469 transitions.
[2025-05-30 01:57:13] [INFO ] Flatten gal took : 19 ms
[2025-05-30 01:57:13] [INFO ] Flatten gal took : 16 ms
[2025-05-30 01:57:13] [INFO ] Input system was already deterministic with 164 transitions.
[2025-05-30 01:57:13] [INFO ] Flatten gal took : 16 ms
[2025-05-30 01:57:13] [INFO ] Flatten gal took : 15 ms
[2025-05-30 01:57:13] [INFO ] Time to serialize gal into /tmp/CTLFireability1220338584869503890.gal : 10 ms
[2025-05-30 01:57:13] [INFO ] Time to serialize properties into /tmp/CTLFireability170124389704072513.ctl : 5 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/CTLFireability1220338584869503890.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability170124389704072513.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.99926e+06,14.2486,316492,2,19396,5,990673,6,0,608,712605,0


Converting to forward existential form...Done !
original formula: E(AG(!(((s1>=1)&&(l1019>=1)))) U (AF(EX(AG(((s1>=1)&&(l1225>=1))))) + (AF(AX(((s1>=1)&&(l1308>=1)))) * (((EX(((s1>=1)&&(l1217>=1))) * (p1...232
=> equivalent forward existential formula: ([(FwdU(Init,!(E(TRUE U !(!(((s1>=1)&&(l1019>=1))))))) * !(EG(!(EX(!(E(TRUE U !(((s1>=1)&&(l1225>=1))))))))))] !...506
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t52, t54, t57, t58, t72, t73, t74, t75, t76, t94, t...609
Detected timeout of ITS tools.
[2025-05-30 01:57:43] [INFO ] Flatten gal took : 9 ms
[2025-05-30 01:57:43] [INFO ] Applying decomposition
[2025-05-30 01:57:43] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2676737037462608666.txt' '-o' '/tmp/graph2676737037462608666.bin' '-w' '/tmp/graph2676737037462608666.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2676737037462608666.bin' '-l' '-1' '-v' '-w' '/tmp/graph2676737037462608666.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:57:43] [INFO ] Decomposing Gal with order
[2025-05-30 01:57:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:57:43] [INFO ] Removed a total of 164 redundant transitions.
[2025-05-30 01:57:43] [INFO ] Flatten gal took : 186 ms
[2025-05-30 01:57:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 108 labels/synchronizations in 18 ms.
[2025-05-30 01:57:43] [INFO ] Time to serialize gal into /tmp/CTLFireability5012020839785702575.gal : 10 ms
[2025-05-30 01:57:43] [INFO ] Time to serialize properties into /tmp/CTLFireability3102711452943299612.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/CTLFireability5012020839785702575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3102711452943299612.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.99926e+06,5.37984,123304,2270,3360,89303,69255,421,462031,184,752381,0


Converting to forward existential form...Done !
original formula: E(AG(!(((u0.s1>=1)&&(i6.u14.l1019>=1)))) U (AF(EX(AG(((u0.s1>=1)&&(i6.u18.l1225>=1))))) + (AF(AX(((u0.s1>=1)&&(u0.l1308>=1)))) * (((EX(((...302
=> equivalent forward existential formula: ([(FwdU(Init,!(E(TRUE U !(!(((u0.s1>=1)&&(i6.u14.l1019>=1))))))) * !(EG(!(EX(!(E(TRUE U !(((u0.s1>=1)&&(i6.u18.l...602
Reverse transition relation is NOT exact ! Due to transitions t6, t11, t39, t45, t52, t54, t55, t58, t72, t73, t74, t75, t76, t94, t95, t96, t97, t98, t100...623
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 237/237 places, 469/469 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 181 transition count 300
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 181 transition count 300
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 120 place count 181 transition count 292
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 159 place count 142 transition count 243
Iterating global reduction 1 with 39 rules applied. Total rules applied 198 place count 142 transition count 243
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 217 place count 142 transition count 224
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 236 place count 123 transition count 193
Iterating global reduction 2 with 19 rules applied. Total rules applied 255 place count 123 transition count 193
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 262 place count 123 transition count 186
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 270 place count 115 transition count 174
Iterating global reduction 3 with 8 rules applied. Total rules applied 278 place count 115 transition count 174
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 286 place count 115 transition count 166
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 290 place count 111 transition count 162
Iterating global reduction 4 with 4 rules applied. Total rules applied 294 place count 111 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 295 place count 111 transition count 161
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 296 place count 110 transition count 160
Iterating global reduction 5 with 1 rules applied. Total rules applied 297 place count 110 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 298 place count 110 transition count 159
Applied a total of 298 rules in 79 ms. Remains 110 /237 variables (removed 127) and now considering 159/469 (removed 310) transitions.
// Phase 1: matrix 159 rows 110 cols
[2025-05-30 01:58:13] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:58:14] [INFO ] Implicit Places using invariants in 180 ms returned []
[2025-05-30 01:58:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:58:14] [INFO ] State equation strengthened by 63 read => feed constraints.
[2025-05-30 01:58:14] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1032 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:58:15] [INFO ] Redundant transitions in 9 ms returned []
Running 158 sub problems to find dead transitions.
[2025-05-30 01:58:15] [INFO ] Invariant cache hit.
[2025-05-30 01:58:15] [INFO ] State equation strengthened by 63 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (OVERLAPS) 159/269 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 63/175 constraints. Problems are: Problem set: 0 solved, 158 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (OVERLAPS) 0/269 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 175 constraints, problems are : Problem set: 0 solved, 158 unsolved in 11247 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 110/110 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (OVERLAPS) 159/269 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 63/175 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 158/333 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 158 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/269 variables, and 333 constraints, problems are : Problem set: 0 solved, 158 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 110/110 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41386ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 41387ms
Starting structural reductions in SI_CTL mode, iteration 1 : 110/237 places, 159/469 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42522 ms. Remains : 110/237 places, 159/469 transitions.
[2025-05-30 01:58:56] [INFO ] Flatten gal took : 12 ms
[2025-05-30 01:58:56] [INFO ] Flatten gal took : 12 ms
[2025-05-30 01:58:56] [INFO ] Input system was already deterministic with 159 transitions.
[2025-05-30 01:58:56] [INFO ] Flatten gal took : 10 ms
[2025-05-30 01:58:56] [INFO ] Flatten gal took : 10 ms
[2025-05-30 01:58:56] [INFO ] Time to serialize gal into /tmp/CTLFireability13036772377334188709.gal : 3 ms
[2025-05-30 01:58:56] [INFO ] Time to serialize properties into /tmp/CTLFireability3874234053318042259.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/CTLFireability13036772377334188709.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3874234053318042259.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.09586e+06,18.3617,363900,2,35807,5,978240,6,0,599,1.15674e+06,0


Converting to forward existential form...Done !
original formula: AG(((!(E(((!((s1>=1)&&(l954>=1)))||(!((s1>=1)&&(l1220>=1)))) U ((s1>=1)&&(l1224>=1)))) + ((A(((s1>=1)&&(l452>=1)) U AF(((s1>=1)&&(l608>=1...262
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !((E(TRUE U ((s1<1)||(l608<1))) * E(TRUE U ((((s1>=1)&&(l404>=1))||(p34<1))||(l0<1)))...424
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t19, t28, t36, t37, t38, t47, t48, t49, t50, t52, t53, t54, t55, t56, t...670
Detected timeout of ITS tools.
[2025-05-30 01:59:26] [INFO ] Flatten gal took : 15 ms
[2025-05-30 01:59:26] [INFO ] Applying decomposition
[2025-05-30 01:59:26] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph14682197071883598548.txt' '-o' '/tmp/graph14682197071883598548.bin' '-w' '/tmp/graph14682197071883598548.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14682197071883598548.bin' '-l' '-1' '-v' '-w' '/tmp/graph14682197071883598548.weights' '-q' '0' '-e' '0.001'
[2025-05-30 01:59:26] [INFO ] Decomposing Gal with order
[2025-05-30 01:59:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 01:59:26] [INFO ] Removed a total of 148 redundant transitions.
[2025-05-30 01:59:26] [INFO ] Flatten gal took : 38 ms
[2025-05-30 01:59:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 13 ms.
[2025-05-30 01:59:26] [INFO ] Time to serialize gal into /tmp/CTLFireability2571735927069843777.gal : 8 ms
[2025-05-30 01:59:26] [INFO ] Time to serialize properties into /tmp/CTLFireability6846861533144534196.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/CTLFireability2571735927069843777.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6846861533144534196.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.09586e+06,4.55667,107204,2801,1345,115327,23516,421,517238,193,422607,0


Converting to forward existential form...Done !
original formula: AG(((!(E(((!((i3.u2.s1>=1)&&(i6.u15.l954>=1)))||(!((i3.u2.s1>=1)&&(i7.u17.l1220>=1)))) U ((i3.u2.s1>=1)&&(i7.u17.l1224>=1)))) + ((A(((i3....365
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,TRUE) * !((E(TRUE U ((i3.u2.s1<1)||(u0.l608<1))) * E(TRUE U ((((i3.u2.s1>=1)&&(u0.l404>=1))||...545
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t11, t12, t19, t28, t33, t36, t38, t64, t67, t73, t78, t80, t82, t97, t102, t104, t10...567
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,16.0186,332592,1,0,263307,64324,2014,2.286e+06,1093,1.21562e+06,494256
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 469/469 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 189 transition count 335
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 189 transition count 335
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 102 place count 189 transition count 329
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 134 place count 157 transition count 288
Iterating global reduction 1 with 32 rules applied. Total rules applied 166 place count 157 transition count 288
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 183 place count 157 transition count 271
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 199 place count 141 transition count 246
Iterating global reduction 2 with 16 rules applied. Total rules applied 215 place count 141 transition count 246
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 224 place count 141 transition count 237
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 230 place count 135 transition count 229
Iterating global reduction 3 with 6 rules applied. Total rules applied 236 place count 135 transition count 229
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 241 place count 130 transition count 224
Iterating global reduction 3 with 5 rules applied. Total rules applied 246 place count 130 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 247 place count 130 transition count 223
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 249 place count 128 transition count 220
Iterating global reduction 4 with 2 rules applied. Total rules applied 251 place count 128 transition count 220
Applied a total of 251 rules in 18 ms. Remains 128 /237 variables (removed 109) and now considering 220/469 (removed 249) transitions.
// Phase 1: matrix 220 rows 128 cols
[2025-05-30 01:59:42] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:59:43] [INFO ] Implicit Places using invariants in 212 ms returned []
[2025-05-30 01:59:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:59:43] [INFO ] State equation strengthened by 105 read => feed constraints.
[2025-05-30 01:59:44] [INFO ] Implicit Places using invariants and state equation in 968 ms returned []
Implicit Place search using SMT with State Equation took 1182 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2025-05-30 01:59:44] [INFO ] Invariant cache hit.
[2025-05-30 01:59:44] [INFO ] State equation strengthened by 105 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/348 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 105/235 constraints. Problems are: Problem set: 0 solved, 219 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 0/348 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 235 constraints, problems are : Problem set: 0 solved, 219 unsolved in 20577 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/348 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 105/235 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 219/454 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 348/348 variables, and 454 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50708ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 50709ms
Starting structural reductions in LTL mode, iteration 1 : 128/237 places, 220/469 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51911 ms. Remains : 128/237 places, 220/469 transitions.
[2025-05-30 02:00:34] [INFO ] Flatten gal took : 23 ms
[2025-05-30 02:00:34] [INFO ] Flatten gal took : 15 ms
[2025-05-30 02:00:34] [INFO ] Input system was already deterministic with 220 transitions.
[2025-05-30 02:00:34] [INFO ] Flatten gal took : 15 ms
[2025-05-30 02:00:34] [INFO ] Flatten gal took : 14 ms
[2025-05-30 02:00:34] [INFO ] Time to serialize gal into /tmp/CTLFireability2055955769633638837.gal : 4 ms
[2025-05-30 02:00:34] [INFO ] Time to serialize properties into /tmp/CTLFireability5609886702092948921.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/CTLFireability2055955769633638837.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5609886702092948921.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 02:01:04] [INFO ] Flatten gal took : 15 ms
[2025-05-30 02:01:04] [INFO ] Applying decomposition
[2025-05-30 02:01:05] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1838880554533213624.txt' '-o' '/tmp/graph1838880554533213624.bin' '-w' '/tmp/graph1838880554533213624.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1838880554533213624.bin' '-l' '-1' '-v' '-w' '/tmp/graph1838880554533213624.weights' '-q' '0' '-e' '0.001'
[2025-05-30 02:01:05] [INFO ] Decomposing Gal with order
[2025-05-30 02:01:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 02:01:05] [INFO ] Removed a total of 212 redundant transitions.
[2025-05-30 02:01:05] [INFO ] Flatten gal took : 50 ms
[2025-05-30 02:01:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 217 labels/synchronizations in 12 ms.
[2025-05-30 02:01:05] [INFO ] Time to serialize gal into /tmp/CTLFireability17991663359052705539.gal : 4 ms
[2025-05-30 02:01:05] [INFO ] Time to serialize properties into /tmp/CTLFireability4849672381591727325.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/CTLFireability17991663359052705539.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4849672381591727325.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 469/469 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 179 transition count 301
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 179 transition count 301
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 122 place count 179 transition count 295
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 164 place count 137 transition count 240
Iterating global reduction 1 with 42 rules applied. Total rules applied 206 place count 137 transition count 240
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 231 place count 137 transition count 215
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 252 place count 116 transition count 185
Iterating global reduction 2 with 21 rules applied. Total rules applied 273 place count 116 transition count 185
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 284 place count 116 transition count 174
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 292 place count 108 transition count 159
Iterating global reduction 3 with 8 rules applied. Total rules applied 300 place count 108 transition count 159
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 306 place count 108 transition count 153
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 310 place count 104 transition count 149
Iterating global reduction 4 with 4 rules applied. Total rules applied 314 place count 104 transition count 149
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 317 place count 101 transition count 145
Iterating global reduction 4 with 3 rules applied. Total rules applied 320 place count 101 transition count 145
Applied a total of 320 rules in 10 ms. Remains 101 /237 variables (removed 136) and now considering 145/469 (removed 324) transitions.
// Phase 1: matrix 145 rows 101 cols
[2025-05-30 02:01:35] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:01:35] [INFO ] Implicit Places using invariants in 112 ms returned []
[2025-05-30 02:01:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:01:35] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-05-30 02:01:35] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2025-05-30 02:01:35] [INFO ] Invariant cache hit.
[2025-05-30 02:01:35] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/246 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 56/159 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 0/246 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 159 constraints, problems are : Problem set: 0 solved, 144 unsolved in 9309 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/246 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 56/159 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 144/303 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 246/246 variables, and 303 constraints, problems are : Problem set: 0 solved, 144 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39386ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 39387ms
Starting structural reductions in LTL mode, iteration 1 : 101/237 places, 145/469 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39980 ms. Remains : 101/237 places, 145/469 transitions.
[2025-05-30 02:02:15] [INFO ] Flatten gal took : 6 ms
[2025-05-30 02:02:15] [INFO ] Flatten gal took : 6 ms
[2025-05-30 02:02:15] [INFO ] Input system was already deterministic with 145 transitions.
[2025-05-30 02:02:15] [INFO ] Flatten gal took : 6 ms
[2025-05-30 02:02:15] [INFO ] Flatten gal took : 5 ms
[2025-05-30 02:02:15] [INFO ] Time to serialize gal into /tmp/CTLFireability2549481304274716692.gal : 2 ms
[2025-05-30 02:02:15] [INFO ] Time to serialize properties into /tmp/CTLFireability6879036001640684581.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/CTLFireability2549481304274716692.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6879036001640684581.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.7883e+06,15.3033,318864,2,26947,5,866280,6,0,549,1.16922e+06,0


Converting to forward existential form...Done !
original formula: (AX(EF(((p54<1)||(l0<1)))) * EF((((AX((((s1<1)||(l1217<1))&&((s1<1)||(l1288<1)))) * ((s1<1)||(l1306<1))) * ((s1>=1)&&(l608>=1))) * ((s1<1...170
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U ((p54<1)||(l0<1)))))] = FALSE * [(Init * !(E(TRUE U (((!(EX(!((((s1<1)||(l1217<1))&&((s...257
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t...609
Detected timeout of ITS tools.
[2025-05-30 02:02:45] [INFO ] Flatten gal took : 6 ms
[2025-05-30 02:02:45] [INFO ] Applying decomposition
[2025-05-30 02:02:45] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4038390996155168779.txt' '-o' '/tmp/graph4038390996155168779.bin' '-w' '/tmp/graph4038390996155168779.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4038390996155168779.bin' '-l' '-1' '-v' '-w' '/tmp/graph4038390996155168779.weights' '-q' '0' '-e' '0.001'
[2025-05-30 02:02:45] [INFO ] Decomposing Gal with order
[2025-05-30 02:02:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 02:02:45] [INFO ] Removed a total of 157 redundant transitions.
[2025-05-30 02:02:45] [INFO ] Flatten gal took : 18 ms
[2025-05-30 02:02:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 103 labels/synchronizations in 6 ms.
[2025-05-30 02:02:45] [INFO ] Time to serialize gal into /tmp/CTLFireability18312363324826477035.gal : 3 ms
[2025-05-30 02:02:45] [INFO ] Time to serialize properties into /tmp/CTLFireability1172350006707002716.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/CTLFireability18312363324826477035.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1172350006707002716.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.7883e+06,6.60602,160800,4330,490,254586,5933,416,571420,105,32361,0


Converting to forward existential form...Done !
original formula: (AX(EF(((i5.u6.p54<1)||(i0.u0.l0<1)))) * EF((((AX((((i0.u0.s1<1)||(i5.u19.l1217<1))&&((i0.u0.s1<1)||(i6.u21.l1288<1)))) * ((i0.u0.s1<1)||...238
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U ((i5.u6.p54<1)||(i0.u0.l0<1)))))] = FALSE * [(Init * !(E(TRUE U (((!(EX(!((((i0.u0.s1<1...325
Reverse transition relation is NOT exact ! Due to transitions t0, t11, t12, t51, t52, t54, t60, t71, t72, t74, t85, t96, t99, t108, t109, t110, t112, t113,...496
(forward)formula 0,1,13.1371,246644,1,0,364901,15578,1601,1.33804e+06,489,77469,883613
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 469/469 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 177 transition count 283
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 177 transition count 283
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 123 place count 177 transition count 280
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 167 place count 133 transition count 223
Iterating global reduction 1 with 44 rules applied. Total rules applied 211 place count 133 transition count 223
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 231 place count 133 transition count 203
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 255 place count 109 transition count 166
Iterating global reduction 2 with 24 rules applied. Total rules applied 279 place count 109 transition count 166
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 291 place count 109 transition count 154
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 302 place count 98 transition count 135
Iterating global reduction 3 with 11 rules applied. Total rules applied 313 place count 98 transition count 135
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 317 place count 98 transition count 131
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 325 place count 90 transition count 123
Iterating global reduction 4 with 8 rules applied. Total rules applied 333 place count 90 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 334 place count 90 transition count 122
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 340 place count 84 transition count 110
Iterating global reduction 5 with 6 rules applied. Total rules applied 346 place count 84 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 349 place count 84 transition count 107
Applied a total of 349 rules in 9 ms. Remains 84 /237 variables (removed 153) and now considering 107/469 (removed 362) transitions.
// Phase 1: matrix 107 rows 84 cols
[2025-05-30 02:02:58] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:02:58] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-05-30 02:02:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:02:58] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-05-30 02:02:58] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2025-05-30 02:02:59] [INFO ] Invariant cache hit.
[2025-05-30 02:02:59] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 37/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 123 constraints, problems are : Problem set: 0 solved, 106 unsolved in 5098 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 37/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 106/229 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 229 constraints, problems are : Problem set: 0 solved, 106 unsolved in 25299 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30442ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 30444ms
Starting structural reductions in LTL mode, iteration 1 : 84/237 places, 107/469 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30870 ms. Remains : 84/237 places, 107/469 transitions.
[2025-05-30 02:03:29] [INFO ] Flatten gal took : 4 ms
[2025-05-30 02:03:29] [INFO ] Flatten gal took : 3 ms
[2025-05-30 02:03:29] [INFO ] Input system was already deterministic with 107 transitions.
[2025-05-30 02:03:29] [INFO ] Flatten gal took : 4 ms
[2025-05-30 02:03:29] [INFO ] Flatten gal took : 3 ms
[2025-05-30 02:03:29] [INFO ] Time to serialize gal into /tmp/CTLFireability18211246643231206513.gal : 1 ms
[2025-05-30 02:03:29] [INFO ] Time to serialize properties into /tmp/CTLFireability10649538674628412103.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/CTLFireability18211246643231206513.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10649538674628412103.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,455982,2.2227,51732,2,10727,5,156828,6,0,443,161857,0


Converting to forward existential form...Done !
original formula: EF(EX(((s1>=1)&&(l606>=1))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * ((s1>=1)&&(l606>=1)))] != FALSE
(forward)formula 0,1,2.39431,51732,1,0,8,156828,8,1,824,161857,2
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 469/469 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 184 transition count 311
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 184 transition count 311
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 110 place count 184 transition count 307
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 149 place count 145 transition count 258
Iterating global reduction 1 with 39 rules applied. Total rules applied 188 place count 145 transition count 258
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 209 place count 145 transition count 237
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 229 place count 125 transition count 205
Iterating global reduction 2 with 20 rules applied. Total rules applied 249 place count 125 transition count 205
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 260 place count 125 transition count 194
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 267 place count 118 transition count 181
Iterating global reduction 3 with 7 rules applied. Total rules applied 274 place count 118 transition count 181
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 280 place count 118 transition count 175
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 284 place count 114 transition count 171
Iterating global reduction 4 with 4 rules applied. Total rules applied 288 place count 114 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 289 place count 114 transition count 170
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 290 place count 113 transition count 169
Iterating global reduction 5 with 1 rules applied. Total rules applied 291 place count 113 transition count 169
Applied a total of 291 rules in 14 ms. Remains 113 /237 variables (removed 124) and now considering 169/469 (removed 300) transitions.
// Phase 1: matrix 169 rows 113 cols
[2025-05-30 02:03:31] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:03:32] [INFO ] Implicit Places using invariants in 164 ms returned []
[2025-05-30 02:03:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:03:32] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-05-30 02:03:32] [INFO ] Implicit Places using invariants and state equation in 875 ms returned []
Implicit Place search using SMT with State Equation took 1041 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2025-05-30 02:03:32] [INFO ] Invariant cache hit.
[2025-05-30 02:03:32] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 169/282 variables, 113/115 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 72/187 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:41] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:41] [INFO ] Deduced a trap composed of 41 places in 89 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:47] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:47] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 14 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/282 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:03:52] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 17 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 282/282 variables, and 192 constraints, problems are : Problem set: 0 solved, 168 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 1/113 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 169/282 variables, 113/120 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 72/192 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 168/360 constraints. Problems are: Problem set: 0 solved, 168 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 282/282 variables, and 360 constraints, problems are : Problem set: 0 solved, 168 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 113/113 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Starting structural reductions in LTL mode, iteration 1 : 113/237 places, 169/469 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61154 ms. Remains : 113/237 places, 169/469 transitions.
[2025-05-30 02:04:33] [INFO ] Flatten gal took : 7 ms
[2025-05-30 02:04:33] [INFO ] Flatten gal took : 7 ms
[2025-05-30 02:04:33] [INFO ] Input system was already deterministic with 169 transitions.
[2025-05-30 02:04:33] [INFO ] Flatten gal took : 7 ms
[2025-05-30 02:04:33] [INFO ] Flatten gal took : 10 ms
[2025-05-30 02:04:33] [INFO ] Time to serialize gal into /tmp/CTLFireability12609059759281444129.gal : 2 ms
[2025-05-30 02:04:33] [INFO ] Time to serialize properties into /tmp/CTLFireability11006369946584600413.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/CTLFireability12609059759281444129.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11006369946584600413.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.26866e+06,19.5936,337500,2,37214,5,987392,6,0,621,1.03766e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 02:05:03] [INFO ] Flatten gal took : 15 ms
[2025-05-30 02:05:03] [INFO ] Applying decomposition
[2025-05-30 02:05:03] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10520163609224117914.txt' '-o' '/tmp/graph10520163609224117914.bin' '-w' '/tmp/graph10520163609224117914.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10520163609224117914.bin' '-l' '-1' '-v' '-w' '/tmp/graph10520163609224117914.weights' '-q' '0' '-e' '0.001'
[2025-05-30 02:05:03] [INFO ] Decomposing Gal with order
[2025-05-30 02:05:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 02:05:03] [INFO ] Removed a total of 171 redundant transitions.
[2025-05-30 02:05:03] [INFO ] Flatten gal took : 28 ms
[2025-05-30 02:05:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 150 labels/synchronizations in 5 ms.
[2025-05-30 02:05:03] [INFO ] Time to serialize gal into /tmp/CTLFireability77413762368503303.gal : 2 ms
[2025-05-30 02:05:03] [INFO ] Time to serialize properties into /tmp/CTLFireability11571113638366863169.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/CTLFireability77413762368503303.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11571113638366863169.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.26866e+06,15.8225,396324,4440,1596,306799,74798,432,3.24034e+06,177,616310,0


Converting to forward existential form...Done !
original formula: A(E((AG(AF(((i1.u1.s1>=1)&&(i6.u19.l1291>=1)))) + AX(((EF(((i1.u1.s1>=1)&&(i0.u18.l1215>=1))) * (i1.u13.p80>=1)) * (i1.u1.l0>=1)))) U ((!...607
=> equivalent forward existential formula: [((Init * !(EG(!(E((((!(E(TRUE U !((((i1.u1.p51>=1)&&(i1.u5.l619>=1))||((i1.u14.p85>=1)&&(i6.u19.l405>=1)))))) *...1274
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t11, t13, t17, t71, t72, t80, t81, t111, t113, t117, t118, t119, t121, t122, t127, t1...602
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 469/469 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 180 transition count 287
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 180 transition count 287
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 119 place count 180 transition count 282
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 160 place count 139 transition count 228
Iterating global reduction 1 with 41 rules applied. Total rules applied 201 place count 139 transition count 228
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 216 place count 139 transition count 213
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 236 place count 119 transition count 184
Iterating global reduction 2 with 20 rules applied. Total rules applied 256 place count 119 transition count 184
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 264 place count 119 transition count 176
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 272 place count 111 transition count 162
Iterating global reduction 3 with 8 rules applied. Total rules applied 280 place count 111 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 284 place count 111 transition count 158
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 289 place count 106 transition count 153
Iterating global reduction 4 with 5 rules applied. Total rules applied 294 place count 106 transition count 153
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 298 place count 102 transition count 143
Iterating global reduction 4 with 4 rules applied. Total rules applied 302 place count 102 transition count 143
Applied a total of 302 rules in 10 ms. Remains 102 /237 variables (removed 135) and now considering 143/469 (removed 326) transitions.
// Phase 1: matrix 143 rows 102 cols
[2025-05-30 02:05:33] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:05:33] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-05-30 02:05:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:05:33] [INFO ] State equation strengthened by 52 read => feed constraints.
[2025-05-30 02:05:33] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Running 142 sub problems to find dead transitions.
[2025-05-30 02:05:33] [INFO ] Invariant cache hit.
[2025-05-30 02:05:33] [INFO ] State equation strengthened by 52 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 143/245 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 52/156 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 0/245 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/245 variables, and 156 constraints, problems are : Problem set: 0 solved, 142 unsolved in 9762 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 143/245 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 52/156 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 142/298 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 245/245 variables, and 298 constraints, problems are : Problem set: 0 solved, 142 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39877ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 39878ms
Starting structural reductions in LTL mode, iteration 1 : 102/237 places, 143/469 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40385 ms. Remains : 102/237 places, 143/469 transitions.
[2025-05-30 02:06:13] [INFO ] Flatten gal took : 4 ms
[2025-05-30 02:06:13] [INFO ] Flatten gal took : 5 ms
[2025-05-30 02:06:13] [INFO ] Input system was already deterministic with 143 transitions.
[2025-05-30 02:06:13] [INFO ] Flatten gal took : 4 ms
[2025-05-30 02:06:13] [INFO ] Flatten gal took : 18 ms
[2025-05-30 02:06:13] [INFO ] Time to serialize gal into /tmp/CTLFireability3441312971055661996.gal : 2 ms
[2025-05-30 02:06:13] [INFO ] Time to serialize properties into /tmp/CTLFireability9523492039380865485.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/CTLFireability3441312971055661996.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9523492039380865485.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.88149e+06,13.3124,245224,2,19331,5,816935,6,0,551,721704,0


Converting to forward existential form...Done !
original formula: AF(E(EX(AF(((p120>=1)&&(l532>=1)))) U AF(E(((s1>=1)&&(l1291>=1)) U (((s1>=1)&&(l1024>=1))&&(l1218>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(EX(!(EG(!(((p120>=1)&&(l532>=1)))))) U !(EG(!(E(((s1>=1)&&(l1291>=1)) U (((s1>=1)&&(l1024>=1))&&(...181
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t52, t53, t55, t59, t60, t62, t73, t74, t75, t76, t...540
Detected timeout of ITS tools.
[2025-05-30 02:06:43] [INFO ] Flatten gal took : 5 ms
[2025-05-30 02:06:43] [INFO ] Applying decomposition
[2025-05-30 02:06:43] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph15546761594936524024.txt' '-o' '/tmp/graph15546761594936524024.bin' '-w' '/tmp/graph15546761594936524024.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15546761594936524024.bin' '-l' '-1' '-v' '-w' '/tmp/graph15546761594936524024.weights' '-q' '0' '-e' '0.001'
[2025-05-30 02:06:43] [INFO ] Decomposing Gal with order
[2025-05-30 02:06:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 02:06:43] [INFO ] Removed a total of 167 redundant transitions.
[2025-05-30 02:06:43] [INFO ] Flatten gal took : 19 ms
[2025-05-30 02:06:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 4 ms.
[2025-05-30 02:06:43] [INFO ] Time to serialize gal into /tmp/CTLFireability411907110173221698.gal : 2 ms
[2025-05-30 02:06:43] [INFO ] Time to serialize properties into /tmp/CTLFireability13296280233311460714.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/CTLFireability411907110173221698.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13296280233311460714.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.88149e+06,4.48076,91444,2803,574,93959,6167,449,580457,105,34288,0


Converting to forward existential form...Done !
original formula: AF(E(EX(AF(((i7.u16.p120>=1)&&(i7.u19.l532>=1)))) U AF(E(((i3.u1.s1>=1)&&(i4.u22.l1291>=1)) U (((i3.u1.s1>=1)&&(i4.u13.l1024>=1))&&(i6.u2...171
=> equivalent forward existential formula: [FwdG(Init,!(E(EX(!(EG(!(((i7.u16.p120>=1)&&(i7.u19.l532>=1)))))) U !(EG(!(E(((i3.u1.s1>=1)&&(i4.u22.l1291>=1)) ...228
Reverse transition relation is NOT exact ! Due to transitions t5, t11, t40, t45, t52, t53, t55, t60, t73, t74, t75, t76, t77, t86, t91, t92, t93, t94, t95,...530
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 469/469 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 184 transition count 294
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 184 transition count 294
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 109 place count 184 transition count 291
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 145 place count 148 transition count 242
Iterating global reduction 1 with 36 rules applied. Total rules applied 181 place count 148 transition count 242
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 190 place count 148 transition count 233
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 209 place count 129 transition count 206
Iterating global reduction 2 with 19 rules applied. Total rules applied 228 place count 129 transition count 206
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 236 place count 129 transition count 198
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 243 place count 122 transition count 186
Iterating global reduction 3 with 7 rules applied. Total rules applied 250 place count 122 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 252 place count 122 transition count 184
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 257 place count 117 transition count 179
Iterating global reduction 4 with 5 rules applied. Total rules applied 262 place count 117 transition count 179
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 265 place count 114 transition count 175
Iterating global reduction 4 with 3 rules applied. Total rules applied 268 place count 114 transition count 175
Applied a total of 268 rules in 18 ms. Remains 114 /237 variables (removed 123) and now considering 175/469 (removed 294) transitions.
// Phase 1: matrix 175 rows 114 cols
[2025-05-30 02:07:14] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:07:14] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-05-30 02:07:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:07:14] [INFO ] State equation strengthened by 72 read => feed constraints.
[2025-05-30 02:07:14] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2025-05-30 02:07:14] [INFO ] Invariant cache hit.
[2025-05-30 02:07:14] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/114 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 175/289 variables, 114/116 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 72/188 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:22] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:22] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/289 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 190 constraints, problems are : Problem set: 0 solved, 174 unsolved in 13229 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/114 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/289 variables, 114/118 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 72/190 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 174/364 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/289 variables, and 364 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43343ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 43346ms
Starting structural reductions in LTL mode, iteration 1 : 114/237 places, 175/469 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43961 ms. Remains : 114/237 places, 175/469 transitions.
[2025-05-30 02:07:57] [INFO ] Flatten gal took : 4 ms
[2025-05-30 02:07:57] [INFO ] Flatten gal took : 5 ms
[2025-05-30 02:07:57] [INFO ] Input system was already deterministic with 175 transitions.
[2025-05-30 02:07:57] [INFO ] Flatten gal took : 5 ms
[2025-05-30 02:07:57] [INFO ] Flatten gal took : 5 ms
[2025-05-30 02:07:57] [INFO ] Time to serialize gal into /tmp/CTLFireability13726549248528605324.gal : 2 ms
[2025-05-30 02:07:57] [INFO ] Time to serialize properties into /tmp/CTLFireability16780825374532461278.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/CTLFireability13726549248528605324.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16780825374532461278.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.03114e+06,28.4633,596612,2,32474,5,2.00672e+06,6,0,631,1.59248e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 02:08:28] [INFO ] Flatten gal took : 5 ms
[2025-05-30 02:08:28] [INFO ] Applying decomposition
[2025-05-30 02:08:28] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13114128307675924805.txt' '-o' '/tmp/graph13114128307675924805.bin' '-w' '/tmp/graph13114128307675924805.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13114128307675924805.bin' '-l' '-1' '-v' '-w' '/tmp/graph13114128307675924805.weights' '-q' '0' '-e' '0.001'
[2025-05-30 02:08:28] [INFO ] Decomposing Gal with order
[2025-05-30 02:08:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 02:08:28] [INFO ] Removed a total of 210 redundant transitions.
[2025-05-30 02:08:28] [INFO ] Flatten gal took : 14 ms
[2025-05-30 02:08:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 137 labels/synchronizations in 7 ms.
[2025-05-30 02:08:28] [INFO ] Time to serialize gal into /tmp/CTLFireability13300993289784287598.gal : 3 ms
[2025-05-30 02:08:28] [INFO ] Time to serialize properties into /tmp/CTLFireability1035615360290934585.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/CTLFireability13300993289784287598.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1035615360290934585.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.03114e+06,10.102,238228,3398,979,186770,24341,585,1.95525e+06,144,403377,0


Converting to forward existential form...Done !
original formula: (E((((!(AF(((i3.i1.u10.p27>=1)&&(i3.i0.u0.l0>=1)))) * !((!(((i3.i0.u0.s1>=1)&&(i0.u16.l1021>=1))) * AG(((i3.i0.u0.p63>=1)&&(i0.u16.l613>=...529
=> equivalent forward existential formula: ([(EY(FwdU(Init,(((!(!(EG(!(((i3.i1.u10.p27>=1)&&(i3.i0.u0.l0>=1)))))) * !((!(((i3.i0.u0.s1>=1)&&(i0.u16.l1021>=...772
Reverse transition relation is NOT exact ! Due to transitions t0, t11, t12, t41, t46, t47, t48, t49, t50, t53, t54, t56, t57, t67, t72, t79, t82, t83, t84,...633
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 469/469 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 181 transition count 306
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 181 transition count 306
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 116 place count 181 transition count 302
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 157 place count 140 transition count 248
Iterating global reduction 1 with 41 rules applied. Total rules applied 198 place count 140 transition count 248
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 221 place count 140 transition count 225
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 242 place count 119 transition count 191
Iterating global reduction 2 with 21 rules applied. Total rules applied 263 place count 119 transition count 191
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 275 place count 119 transition count 179
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 285 place count 109 transition count 164
Iterating global reduction 3 with 10 rules applied. Total rules applied 295 place count 109 transition count 164
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 299 place count 109 transition count 160
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 306 place count 102 transition count 153
Iterating global reduction 4 with 7 rules applied. Total rules applied 313 place count 102 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 314 place count 102 transition count 152
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 318 place count 98 transition count 147
Iterating global reduction 5 with 4 rules applied. Total rules applied 322 place count 98 transition count 147
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 325 place count 98 transition count 144
Applied a total of 325 rules in 12 ms. Remains 98 /237 variables (removed 139) and now considering 144/469 (removed 325) transitions.
// Phase 1: matrix 144 rows 98 cols
[2025-05-30 02:08:58] [INFO ] Computed 2 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:08:58] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-05-30 02:08:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:08:58] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-05-30 02:08:58] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2025-05-30 02:08:58] [INFO ] Invariant cache hit.
[2025-05-30 02:08:58] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 144/242 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 64/164 constraints. Problems are: Problem set: 0 solved, 143 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 164 constraints, problems are : Problem set: 0 solved, 143 unsolved in 8192 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 144/242 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 64/164 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 143/307 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 143 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 242/242 variables, and 307 constraints, problems are : Problem set: 0 solved, 143 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38272ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 38275ms
Starting structural reductions in LTL mode, iteration 1 : 98/237 places, 144/469 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38785 ms. Remains : 98/237 places, 144/469 transitions.
[2025-05-30 02:09:36] [INFO ] Flatten gal took : 7 ms
[2025-05-30 02:09:36] [INFO ] Flatten gal took : 6 ms
[2025-05-30 02:09:36] [INFO ] Input system was already deterministic with 144 transitions.
[2025-05-30 02:09:37] [INFO ] Flatten gal took : 7 ms
[2025-05-30 02:09:37] [INFO ] Flatten gal took : 6 ms
[2025-05-30 02:09:37] [INFO ] Time to serialize gal into /tmp/CTLFireability15962170337564284330.gal : 2 ms
[2025-05-30 02:09:37] [INFO ] Time to serialize properties into /tmp/CTLFireability11451302601228213229.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/CTLFireability15962170337564284330.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11451302601228213229.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,1.31043e+06,7.3711,164980,2,18477,5,456421,6,0,536,557090,0


Converting to forward existential form...Done !
original formula: E(((s1>=1)&&(l606>=1)) U AF((((!(E(((s1>=1)&&(l400>=1)) U ((s1>=1)&&(l606>=1)))) * AG(((s1>=1)&&(l400>=1)))) * (EX(((s1>=1)&&(l612>=1))) ...268
=> equivalent forward existential formula: [(FwdU(Init,((s1>=1)&&(l606>=1))) * !(EG(!((((!(E(((s1>=1)&&(l400>=1)) U ((s1>=1)&&(l606>=1)))) * !(E(TRUE U !((...409
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t...611
(forward)formula 0,0,27.3674,536792,1,0,396,2.6625e+06,323,156,3810,2.02912e+06,434
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 469/469 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 186 transition count 309
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 186 transition count 309
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 107 place count 186 transition count 304
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 145 place count 148 transition count 253
Iterating global reduction 1 with 38 rules applied. Total rules applied 183 place count 148 transition count 253
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 199 place count 148 transition count 237
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 213 place count 134 transition count 218
Iterating global reduction 2 with 14 rules applied. Total rules applied 227 place count 134 transition count 218
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 233 place count 134 transition count 212
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 240 place count 127 transition count 202
Iterating global reduction 3 with 7 rules applied. Total rules applied 247 place count 127 transition count 202
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 251 place count 127 transition count 198
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 254 place count 124 transition count 195
Iterating global reduction 4 with 3 rules applied. Total rules applied 257 place count 124 transition count 195
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 258 place count 123 transition count 193
Iterating global reduction 4 with 1 rules applied. Total rules applied 259 place count 123 transition count 193
Applied a total of 259 rules in 10 ms. Remains 123 /237 variables (removed 114) and now considering 193/469 (removed 276) transitions.
// Phase 1: matrix 193 rows 123 cols
[2025-05-30 02:10:04] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:10:04] [INFO ] Implicit Places using invariants in 191 ms returned []
[2025-05-30 02:10:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:10:04] [INFO ] State equation strengthened by 80 read => feed constraints.
[2025-05-30 02:10:05] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
Running 192 sub problems to find dead transitions.
[2025-05-30 02:10:05] [INFO ] Invariant cache hit.
[2025-05-30 02:10:05] [INFO ] State equation strengthened by 80 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/316 variables, 123/125 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 80/205 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:10:14] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:10:15] [INFO ] Deduced a trap composed of 45 places in 137 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:10:15] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:10:15] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:10:15] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:10:16] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:10:16] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:10:16] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:10:16] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 9/214 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:10:21] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:10:21] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 2/216 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:10:25] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:10:26] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 25 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:10:31] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:10:32] [INFO ] Deduced a trap composed of 46 places in 170 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:10:32] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 12 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 316/316 variables, and 221 constraints, problems are : Problem set: 0 solved, 192 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (OVERLAPS) 193/316 variables, 123/141 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 80/221 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 192/413 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/316 variables, and 413 constraints, problems are : Problem set: 0 solved, 192 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 123/123 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60231ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 60232ms
Starting structural reductions in LTL mode, iteration 1 : 123/237 places, 193/469 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60912 ms. Remains : 123/237 places, 193/469 transitions.
[2025-05-30 02:11:05] [INFO ] Flatten gal took : 5 ms
[2025-05-30 02:11:05] [INFO ] Flatten gal took : 6 ms
[2025-05-30 02:11:05] [INFO ] Input system was already deterministic with 193 transitions.
[2025-05-30 02:11:05] [INFO ] Flatten gal took : 5 ms
[2025-05-30 02:11:05] [INFO ] Flatten gal took : 5 ms
[2025-05-30 02:11:05] [INFO ] Time to serialize gal into /tmp/CTLFireability12072509968743653663.gal : 1 ms
[2025-05-30 02:11:05] [INFO ] Time to serialize properties into /tmp/CTLFireability2839328750268046076.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/CTLFireability12072509968743653663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2839328750268046076.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2025-05-30 02:11:35] [INFO ] Flatten gal took : 9 ms
[2025-05-30 02:11:35] [INFO ] Applying decomposition
[2025-05-30 02:11:35] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph844866219864538639.txt' '-o' '/tmp/graph844866219864538639.bin' '-w' '/tmp/graph844866219864538639.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph844866219864538639.bin' '-l' '-1' '-v' '-w' '/tmp/graph844866219864538639.weights' '-q' '0' '-e' '0.001'
[2025-05-30 02:11:35] [INFO ] Decomposing Gal with order
[2025-05-30 02:11:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 02:11:35] [INFO ] Removed a total of 201 redundant transitions.
[2025-05-30 02:11:35] [INFO ] Flatten gal took : 15 ms
[2025-05-30 02:11:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 107 labels/synchronizations in 4 ms.
[2025-05-30 02:11:35] [INFO ] Time to serialize gal into /tmp/CTLFireability7113769881069721860.gal : 3 ms
[2025-05-30 02:11:35] [INFO ] Time to serialize properties into /tmp/CTLFireability16351641234955957153.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/CTLFireability7113769881069721860.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16351641234955957153.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 237/237 places, 469/469 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 177 transition count 276
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 177 transition count 276
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 125 place count 177 transition count 271
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 168 place count 134 transition count 215
Iterating global reduction 1 with 43 rules applied. Total rules applied 211 place count 134 transition count 215
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 227 place count 134 transition count 199
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 250 place count 111 transition count 164
Iterating global reduction 2 with 23 rules applied. Total rules applied 273 place count 111 transition count 164
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 281 place count 111 transition count 156
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 292 place count 100 transition count 137
Iterating global reduction 3 with 11 rules applied. Total rules applied 303 place count 100 transition count 137
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 309 place count 100 transition count 131
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 316 place count 93 transition count 124
Iterating global reduction 4 with 7 rules applied. Total rules applied 323 place count 93 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 324 place count 93 transition count 123
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 329 place count 88 transition count 112
Iterating global reduction 5 with 5 rules applied. Total rules applied 334 place count 88 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 336 place count 88 transition count 110
Applied a total of 336 rules in 32 ms. Remains 88 /237 variables (removed 149) and now considering 110/469 (removed 359) transitions.
// Phase 1: matrix 110 rows 88 cols
[2025-05-30 02:12:05] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:12:05] [INFO ] Implicit Places using invariants in 173 ms returned []
[2025-05-30 02:12:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:12:06] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-05-30 02:12:06] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:12:06] [INFO ] Redundant transitions in 5 ms returned []
Running 109 sub problems to find dead transitions.
[2025-05-30 02:12:06] [INFO ] Invariant cache hit.
[2025-05-30 02:12:06] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 125 constraints, problems are : Problem set: 0 solved, 109 unsolved in 5424 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 109/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 234 constraints, problems are : Problem set: 0 solved, 109 unsolved in 19204 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24685ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 24686ms
Starting structural reductions in SI_CTL mode, iteration 1 : 88/237 places, 110/469 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25282 ms. Remains : 88/237 places, 110/469 transitions.
[2025-05-30 02:12:31] [INFO ] Flatten gal took : 3 ms
[2025-05-30 02:12:31] [INFO ] Flatten gal took : 3 ms
[2025-05-30 02:12:31] [INFO ] Input system was already deterministic with 110 transitions.
[2025-05-30 02:12:31] [INFO ] Flatten gal took : 3 ms
[2025-05-30 02:12:31] [INFO ] Flatten gal took : 3 ms
[2025-05-30 02:12:31] [INFO ] Time to serialize gal into /tmp/CTLFireability9084027910947494436.gal : 0 ms
[2025-05-30 02:12:31] [INFO ] Time to serialize properties into /tmp/CTLFireability2353433216949154166.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/CTLFireability9084027910947494436.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2353433216949154166.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,688349,2.72937,65700,2,12006,5,193774,6,0,462,215854,0


Converting to forward existential form...Done !
original formula: AG(AF(((s1>=1)&&(l1217>=1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((s1>=1)&&(l1217>=1))))] = FALSE
Hit Full ! (commute/partial/dont) 2/0/108
(forward)formula 0,0,5.22556,95340,1,0,18,380948,20,3,2450,239787,16
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 469/469 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 179 transition count 277
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 179 transition count 277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 118 place count 179 transition count 275
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 160 place count 137 transition count 220
Iterating global reduction 1 with 42 rules applied. Total rules applied 202 place count 137 transition count 220
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 218 place count 137 transition count 204
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 240 place count 115 transition count 170
Iterating global reduction 2 with 22 rules applied. Total rules applied 262 place count 115 transition count 170
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 270 place count 115 transition count 162
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 280 place count 105 transition count 147
Iterating global reduction 3 with 10 rules applied. Total rules applied 290 place count 105 transition count 147
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 294 place count 105 transition count 143
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 301 place count 98 transition count 136
Iterating global reduction 4 with 7 rules applied. Total rules applied 308 place count 98 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 309 place count 98 transition count 135
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 313 place count 94 transition count 130
Iterating global reduction 5 with 4 rules applied. Total rules applied 317 place count 94 transition count 130
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 320 place count 94 transition count 127
Applied a total of 320 rules in 10 ms. Remains 94 /237 variables (removed 143) and now considering 127/469 (removed 342) transitions.
// Phase 1: matrix 127 rows 94 cols
[2025-05-30 02:12:36] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:12:36] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-05-30 02:12:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:12:36] [INFO ] State equation strengthened by 47 read => feed constraints.
[2025-05-30 02:12:36] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2025-05-30 02:12:36] [INFO ] Invariant cache hit.
[2025-05-30 02:12:36] [INFO ] State equation strengthened by 47 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 127/221 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 47/143 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:12:43] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:12:43] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:12:43] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:12:43] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 9 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/221 variables, 4/147 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:12:45] [INFO ] Deduced a trap composed of 37 places in 77 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:12:47] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:12:52] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:12:52] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 12 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/221 variables, 2/151 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 13 (OVERLAPS) 0/221 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/221 variables, and 151 constraints, problems are : Problem set: 0 solved, 126 unsolved in 21017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 127/221 variables, 94/104 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 47/151 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 126/277 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/221 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 221/221 variables, and 277 constraints, problems are : Problem set: 0 solved, 126 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51097ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 51098ms
Starting structural reductions in LTL mode, iteration 1 : 94/237 places, 127/469 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51583 ms. Remains : 94/237 places, 127/469 transitions.
[2025-05-30 02:13:27] [INFO ] Flatten gal took : 4 ms
[2025-05-30 02:13:27] [INFO ] Flatten gal took : 4 ms
[2025-05-30 02:13:27] [INFO ] Input system was already deterministic with 127 transitions.
[2025-05-30 02:13:27] [INFO ] Flatten gal took : 4 ms
[2025-05-30 02:13:27] [INFO ] Flatten gal took : 4 ms
[2025-05-30 02:13:27] [INFO ] Time to serialize gal into /tmp/CTLFireability12621397200409965348.gal : 1 ms
[2025-05-30 02:13:27] [INFO ] Time to serialize properties into /tmp/CTLFireability18278277519308334559.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/CTLFireability12621397200409965348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18278277519308334559.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,1.04418e+06,8.47767,172924,2,20405,5,494940,6,0,503,583900,0


Converting to forward existential form...Done !
original formula: EF(((AF(((AX(((s1>=1)&&(l545>=1))) * (s1>=1)) * (l1229>=1))) * (s1>=1)) * (l315>=1)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (l315>=1)) * (s1>=1)) * !(EG(!(((!(EX(!(((s1>=1)&&(l545>=1))))) * (s1>=1)) * (l1229>=1))))...167
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t21, t41, t43, t44, t45, t46, t48, t49, t50, t51, t53, t54, t55, t56, t...525
Detected timeout of ITS tools.
[2025-05-30 02:13:58] [INFO ] Flatten gal took : 4 ms
[2025-05-30 02:13:58] [INFO ] Applying decomposition
[2025-05-30 02:13:58] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph18200640635772871207.txt' '-o' '/tmp/graph18200640635772871207.bin' '-w' '/tmp/graph18200640635772871207.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph18200640635772871207.bin' '-l' '-1' '-v' '-w' '/tmp/graph18200640635772871207.weights' '-q' '0' '-e' '0.001'
[2025-05-30 02:13:58] [INFO ] Decomposing Gal with order
[2025-05-30 02:13:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 02:13:58] [INFO ] Removed a total of 117 redundant transitions.
[2025-05-30 02:13:58] [INFO ] Flatten gal took : 13 ms
[2025-05-30 02:13:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 3 ms.
[2025-05-30 02:13:58] [INFO ] Time to serialize gal into /tmp/CTLFireability2970124273971132430.gal : 3 ms
[2025-05-30 02:13:58] [INFO ] Time to serialize properties into /tmp/CTLFireability4544519943194734978.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/CTLFireability2970124273971132430.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4544519943194734978.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.04418e+06,4.50521,104988,2798,2457,100275,47934,355,486108,189,547189,0


Converting to forward existential form...Done !
original formula: EF(((AF(((AX(((i0.u0.s1>=1)&&(i1.u3.l545>=1))) * (i0.u0.s1>=1)) * (u13.l1229>=1))) * (i0.u0.s1>=1)) * (i0.u0.l315>=1)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (i0.u0.l315>=1)) * (i0.u0.s1>=1)) * !(EG(!(((!(EX(!(((i0.u0.s1>=1)&&(i1.u3.l545>=1))))) * ...201
Reverse transition relation is NOT exact ! Due to transitions t1, t6, t30, t42, t76, t79, t88, t92, t93, t94, t95, t96, t97, t98, t99, t103, t104, t105, t1...531
(forward)formula 0,0,11.7136,253180,1,0,244851,127732,1500,1.32379e+06,999,1.25702e+06,543380
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2025-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 469/469 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 184 transition count 311
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 184 transition count 311
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 110 place count 184 transition count 307
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 147 place count 147 transition count 260
Iterating global reduction 1 with 37 rules applied. Total rules applied 184 place count 147 transition count 260
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 200 place count 147 transition count 244
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 218 place count 129 transition count 215
Iterating global reduction 2 with 18 rules applied. Total rules applied 236 place count 129 transition count 215
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 244 place count 129 transition count 207
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 250 place count 123 transition count 197
Iterating global reduction 3 with 6 rules applied. Total rules applied 256 place count 123 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 258 place count 123 transition count 195
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 262 place count 119 transition count 191
Iterating global reduction 4 with 4 rules applied. Total rules applied 266 place count 119 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 267 place count 119 transition count 190
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 269 place count 117 transition count 187
Iterating global reduction 5 with 2 rules applied. Total rules applied 271 place count 117 transition count 187
Applied a total of 271 rules in 11 ms. Remains 117 /237 variables (removed 120) and now considering 187/469 (removed 282) transitions.
// Phase 1: matrix 187 rows 117 cols
[2025-05-30 02:14:09] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:14:10] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-05-30 02:14:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:14:10] [INFO ] State equation strengthened by 86 read => feed constraints.
[2025-05-30 02:14:10] [INFO ] Implicit Places using invariants and state equation in 587 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
Running 186 sub problems to find dead transitions.
[2025-05-30 02:14:10] [INFO ] Invariant cache hit.
[2025-05-30 02:14:10] [INFO ] State equation strengthened by 86 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/304 variables, 117/119 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 86/205 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:14:24] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 11 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/304 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:14:31] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:14:31] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 10 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/304 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/304 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/304 variables, and 208 constraints, problems are : Problem set: 0 solved, 186 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 117/117 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 1/117 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 187/304 variables, 117/122 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 86/208 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/304 variables, 186/394 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 394 constraints, problems are : Problem set: 0 solved, 186 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 117/117 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60187ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 60189ms
Starting structural reductions in LTL mode, iteration 1 : 117/237 places, 187/469 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60953 ms. Remains : 117/237 places, 187/469 transitions.
[2025-05-30 02:15:10] [INFO ] Flatten gal took : 7 ms
[2025-05-30 02:15:10] [INFO ] Flatten gal took : 5 ms
[2025-05-30 02:15:10] [INFO ] Input system was already deterministic with 187 transitions.
[2025-05-30 02:15:10] [INFO ] Flatten gal took : 5 ms
[2025-05-30 02:15:10] [INFO ] Flatten gal took : 5 ms
[2025-05-30 02:15:10] [INFO ] Time to serialize gal into /tmp/CTLFireability7796513468333107202.gal : 1 ms
[2025-05-30 02:15:10] [INFO ] Time to serialize properties into /tmp/CTLFireability42167160596446924.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/CTLFireability7796513468333107202.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability42167160596446924.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.46849e+06,18.5546,379828,2,27065,5,1.27013e+06,6,0,655,932518,0


Converting to forward existential form...Done !
original formula: EF((EX(EX(((s1>=1)&&(l1259>=1)))) * (((EX(((s1<1)||(l1024<1))) + EX(((p41<1)||(l617<1)))) + ((s1<1)||(l455<1))) + ((E(((s1>=1)&&(l1224>=1...290
=> equivalent forward existential formula: ((([(EY((FwdU(Init,TRUE) * EX(EX(((s1>=1)&&(l1259>=1)))))) * ((s1<1)||(l1024<1)))] != FALSE + [(EY((FwdU(Init,TR...726
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t20, t30, t31, t32, t35, t36, t37, t46, t47, t48, t49, t50, t51, t52, t...774
(forward)formula 0,1,25.667,379828,1,0,364,1.29971e+06,391,131,4624,932518,387
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 237/237 places, 469/469 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 179 transition count 293
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 179 transition count 293
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 119 place count 179 transition count 290
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 161 place count 137 transition count 235
Iterating global reduction 1 with 42 rules applied. Total rules applied 203 place count 137 transition count 235
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 222 place count 137 transition count 216
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 244 place count 115 transition count 181
Iterating global reduction 2 with 22 rules applied. Total rules applied 266 place count 115 transition count 181
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 278 place count 115 transition count 169
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 287 place count 106 transition count 154
Iterating global reduction 3 with 9 rules applied. Total rules applied 296 place count 106 transition count 154
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 299 place count 106 transition count 151
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 305 place count 100 transition count 145
Iterating global reduction 4 with 6 rules applied. Total rules applied 311 place count 100 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 312 place count 100 transition count 144
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 316 place count 96 transition count 134
Iterating global reduction 5 with 4 rules applied. Total rules applied 320 place count 96 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 321 place count 96 transition count 133
Applied a total of 321 rules in 43 ms. Remains 96 /237 variables (removed 141) and now considering 133/469 (removed 336) transitions.
// Phase 1: matrix 133 rows 96 cols
[2025-05-30 02:15:36] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:15:36] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-05-30 02:15:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:15:36] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-05-30 02:15:37] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 02:15:37] [INFO ] Redundant transitions in 4 ms returned []
Running 132 sub problems to find dead transitions.
[2025-05-30 02:15:37] [INFO ] Invariant cache hit.
[2025-05-30 02:15:37] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/229 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 53/151 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:15:44] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:15:44] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:15:44] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:15:44] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:15:44] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 18 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/229 variables, 5/156 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:15:46] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:15:46] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:15:46] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:15:46] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:15:46] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:15:47] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 19 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 6/162 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:15:49] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 14 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/229 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:15:52] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 11 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/229 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/229 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 13 (OVERLAPS) 0/229 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 164 constraints, problems are : Problem set: 0 solved, 132 unsolved in 20917 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/96 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/229 variables, 96/111 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 53/164 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 132/296 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (OVERLAPS) 0/229 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 296 constraints, problems are : Problem set: 0 solved, 132 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50987ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 50988ms
Starting structural reductions in SI_CTL mode, iteration 1 : 96/237 places, 133/469 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51452 ms. Remains : 96/237 places, 133/469 transitions.
[2025-05-30 02:16:28] [INFO ] Flatten gal took : 4 ms
[2025-05-30 02:16:28] [INFO ] Flatten gal took : 4 ms
[2025-05-30 02:16:28] [INFO ] Input system was already deterministic with 133 transitions.
[2025-05-30 02:16:28] [INFO ] Flatten gal took : 4 ms
[2025-05-30 02:16:28] [INFO ] Flatten gal took : 4 ms
[2025-05-30 02:16:28] [INFO ] Time to serialize gal into /tmp/CTLFireability14600595174527231909.gal : 1 ms
[2025-05-30 02:16:28] [INFO ] Time to serialize properties into /tmp/CTLFireability1728431988825298770.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/CTLFireability14600595174527231909.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1728431988825298770.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.20919e+06,4.11799,97972,2,12809,5,318077,6,0,517,291456,0


Converting to forward existential form...Done !
original formula: EF(((AF((EG(((s1>=1)&&(l1019>=1))) + EF(((s1>=1)&&(l606>=1))))) * (s1>=1)) * ((l1291>=1)&&(l947>=1))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * ((l1291>=1)&&(l947>=1))) * (s1>=1)) * !(EG(!((EG(((s1>=1)&&(l1019>=1))) + E(TRUE U ((s1>=1...184
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t40, t41, t42, t43, t44, t45, t51, t52, t53, t54, t58, t61, t70, t...516
Using saturation style SCC detection
(forward)formula 0,1,26.1489,588552,1,0,455,3.11288e+06,302,208,3704,2.35438e+06,515
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 469/469 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 185 transition count 319
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 185 transition count 319
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 108 place count 185 transition count 315
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 145 place count 148 transition count 268
Iterating global reduction 1 with 37 rules applied. Total rules applied 182 place count 148 transition count 268
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 202 place count 148 transition count 248
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 220 place count 130 transition count 218
Iterating global reduction 2 with 18 rules applied. Total rules applied 238 place count 130 transition count 218
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 249 place count 130 transition count 207
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 256 place count 123 transition count 197
Iterating global reduction 3 with 7 rules applied. Total rules applied 263 place count 123 transition count 197
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 265 place count 123 transition count 195
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 270 place count 118 transition count 190
Iterating global reduction 4 with 5 rules applied. Total rules applied 275 place count 118 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 276 place count 118 transition count 189
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 278 place count 116 transition count 186
Iterating global reduction 5 with 2 rules applied. Total rules applied 280 place count 116 transition count 186
Applied a total of 280 rules in 28 ms. Remains 116 /237 variables (removed 121) and now considering 186/469 (removed 283) transitions.
// Phase 1: matrix 186 rows 116 cols
[2025-05-30 02:16:54] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:16:54] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-05-30 02:16:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:16:54] [INFO ] State equation strengthened by 83 read => feed constraints.
[2025-05-30 02:16:55] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2025-05-30 02:16:55] [INFO ] Invariant cache hit.
[2025-05-30 02:16:55] [INFO ] State equation strengthened by 83 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/116 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (OVERLAPS) 186/302 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 83/201 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:17:04] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:17:04] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:17:05] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:17:05] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:17:05] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:17:05] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:17:05] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:17:06] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:17:06] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:17:06] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 10/211 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:17:17] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 19 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/302 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 302/302 variables, and 212 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (OVERLAPS) 1/116 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (OVERLAPS) 186/302 variables, 116/129 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 83/212 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 185/397 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 302/302 variables, and 397 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60239ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 60240ms
Starting structural reductions in LTL mode, iteration 1 : 116/237 places, 186/469 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61006 ms. Remains : 116/237 places, 186/469 transitions.
[2025-05-30 02:17:55] [INFO ] Flatten gal took : 5 ms
[2025-05-30 02:17:55] [INFO ] Flatten gal took : 5 ms
[2025-05-30 02:17:55] [INFO ] Input system was already deterministic with 186 transitions.
[2025-05-30 02:17:55] [INFO ] Flatten gal took : 5 ms
[2025-05-30 02:17:55] [INFO ] Flatten gal took : 5 ms
[2025-05-30 02:17:55] [INFO ] Time to serialize gal into /tmp/CTLFireability1997138755594617184.gal : 1 ms
[2025-05-30 02:17:55] [INFO ] Time to serialize properties into /tmp/CTLFireability15575763732267115324.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/CTLFireability1997138755594617184.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15575763732267115324.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.78384e+06,27.6782,551588,2,30578,5,1.59298e+06,6,0,650,1.26952e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2025-05-30 02:18:25] [INFO ] Flatten gal took : 5 ms
[2025-05-30 02:18:25] [INFO ] Applying decomposition
[2025-05-30 02:18:25] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6629881618592617354.txt' '-o' '/tmp/graph6629881618592617354.bin' '-w' '/tmp/graph6629881618592617354.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6629881618592617354.bin' '-l' '-1' '-v' '-w' '/tmp/graph6629881618592617354.weights' '-q' '0' '-e' '0.001'
[2025-05-30 02:18:25] [INFO ] Decomposing Gal with order
[2025-05-30 02:18:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 02:18:25] [INFO ] Removed a total of 196 redundant transitions.
[2025-05-30 02:18:25] [INFO ] Flatten gal took : 37 ms
[2025-05-30 02:18:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 124 labels/synchronizations in 9 ms.
[2025-05-30 02:18:25] [INFO ] Time to serialize gal into /tmp/CTLFireability15856808052089348296.gal : 11 ms
[2025-05-30 02:18:25] [INFO ] Time to serialize properties into /tmp/CTLFireability11269124911593730974.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/CTLFireability15856808052089348296.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11269124911593730974.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 469/469 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 180 transition count 297
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 180 transition count 297
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 118 place count 180 transition count 293
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 161 place count 137 transition count 239
Iterating global reduction 1 with 43 rules applied. Total rules applied 204 place count 137 transition count 239
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 229 place count 137 transition count 214
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 252 place count 114 transition count 178
Iterating global reduction 2 with 23 rules applied. Total rules applied 275 place count 114 transition count 178
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 287 place count 114 transition count 166
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 297 place count 104 transition count 148
Iterating global reduction 3 with 10 rules applied. Total rules applied 307 place count 104 transition count 148
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 311 place count 104 transition count 144
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 318 place count 97 transition count 137
Iterating global reduction 4 with 7 rules applied. Total rules applied 325 place count 97 transition count 137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 326 place count 97 transition count 136
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 331 place count 92 transition count 126
Iterating global reduction 5 with 5 rules applied. Total rules applied 336 place count 92 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 338 place count 92 transition count 124
Applied a total of 338 rules in 11 ms. Remains 92 /237 variables (removed 145) and now considering 124/469 (removed 345) transitions.
// Phase 1: matrix 124 rows 92 cols
[2025-05-30 02:18:55] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:18:56] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-05-30 02:18:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 02:18:56] [INFO ] State equation strengthened by 46 read => feed constraints.
[2025-05-30 02:18:56] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2025-05-30 02:18:56] [INFO ] Invariant cache hit.
[2025-05-30 02:18:56] [INFO ] State equation strengthened by 46 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 124/216 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 46/140 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:18:59] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:19:00] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:19:00] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:19:00] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:19:00] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 8 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 5/145 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (OVERLAPS) 0/216 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 145 constraints, problems are : Problem set: 0 solved, 123 unsolved in 9080 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 124/216 variables, 92/99 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 46/145 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 123/268 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 10 (OVERLAPS) 0/216 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 268 constraints, problems are : Problem set: 0 solved, 123 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39139ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 39140ms
Starting structural reductions in LTL mode, iteration 1 : 92/237 places, 124/469 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39590 ms. Remains : 92/237 places, 124/469 transitions.
[2025-05-30 02:19:35] [INFO ] Flatten gal took : 3 ms
[2025-05-30 02:19:35] [INFO ] Flatten gal took : 4 ms
[2025-05-30 02:19:35] [INFO ] Input system was already deterministic with 124 transitions.
[2025-05-30 02:19:35] [INFO ] Flatten gal took : 3 ms
[2025-05-30 02:19:35] [INFO ] Flatten gal took : 3 ms
[2025-05-30 02:19:35] [INFO ] Time to serialize gal into /tmp/CTLFireability5858282803580246071.gal : 1 ms
[2025-05-30 02:19:35] [INFO ] Time to serialize properties into /tmp/CTLFireability4374208979993286362.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/CTLFireability5858282803580246071.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4374208979993286362.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,555522,3.3726,83676,2,15453,5,250557,6,0,492,248828,0


Converting to forward existential form...Done !
original formula: E((!(((p91>=1)&&(l0>=1))) + AG(AX(!(((s1>=1)&&(l608>=1)))))) U (AG(((s1>=1)&&(l606>=1))) + ((p49>=1)&&(l621>=1))))
=> equivalent forward existential formula: ([(FwdU(Init,(!(((p91>=1)&&(l0>=1))) + !(E(TRUE U !(!(EX(!(!(((s1>=1)&&(l608>=1))))))))))) * !(E(TRUE U !(((s1>=...311
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t28, t29, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t...502
(forward)formula 0,1,26.9218,534924,1,0,509,2.14781e+06,278,272,3447,2.34416e+06,560
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2025-05-30 02:20:02] [INFO ] Flatten gal took : 21 ms
[2025-05-30 02:20:02] [INFO ] Flatten gal took : 19 ms
[2025-05-30 02:20:02] [INFO ] Applying decomposition
[2025-05-30 02:20:02] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12338726623822498167.txt' '-o' '/tmp/graph12338726623822498167.bin' '-w' '/tmp/graph12338726623822498167.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12338726623822498167.bin' '-l' '-1' '-v' '-w' '/tmp/graph12338726623822498167.weights' '-q' '0' '-e' '0.001'
[2025-05-30 02:20:02] [INFO ] Decomposing Gal with order
[2025-05-30 02:20:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 02:20:03] [INFO ] Removed a total of 590 redundant transitions.
[2025-05-30 02:20:03] [INFO ] Flatten gal took : 36 ms
[2025-05-30 02:20:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 406 labels/synchronizations in 15 ms.
[2025-05-30 02:20:03] [INFO ] Time to serialize gal into /tmp/CTLFireability3937678876239636658.gal : 5 ms
[2025-05-30 02:20:03] [INFO ] Time to serialize properties into /tmp/CTLFireability6532178000987261141.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/CTLFireability3937678876239636658.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6532178000987261141.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.33142e+07,326.788,6021008,13561,9780,1.52741e+06,382527,821,6.51812e+07,457,1.10892e+07,0


Converting to forward existential form...Done !
original formula: E(AG(!(((i6.u0.s1>=1)&&(i7.u18.l1019>=1)))) U (AF(EX(AG(((i6.u0.s1>=1)&&(i2.i1.u22.l1225>=1))))) + (AF(AX(((i6.u0.s1>=1)&&(i3.u31.l1308>=...328
=> equivalent forward existential formula: ([(FwdU(Init,!(E(TRUE U !(!(((i6.u0.s1>=1)&&(i7.u18.l1019>=1))))))) * !(EG(!(EX(!(E(TRUE U !(((i6.u0.s1>=1)&&(i2...641
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t10, t11, t12, t17, t21, t32, t34, t47, t56, t85, t89, t91, t92, t93, t94, t122, t124...1625
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
(forward)formula 0,0,497.984,6012320,1,0,2.63699e+06,782943,4125,6.51812e+07,2628,1.42092e+07,5015139
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EG(AF(((((i6.u0.s1>=1)&&(i7.u24.l1232>=1))||(i6.u0.s1<1))||(i6.u0.l1223<1)))) * ((!(E(((i6.u0.s1>=1)&&(i5.u12.l612>=1)) U !(AX(((i6.u0.s...719
=> equivalent forward existential formula: ([(Init * !(EG(!(EG(!(((((i6.u0.s1>=1)&&(i7.u24.l1232>=1))||(i6.u0.s1<1))||(i6.u0.l1223<1))))))))] = FALSE * ([(...1913
(forward)formula 1,1,541.015,6012320,1,0,3.06518e+06,949452,4283,6.51812e+07,2641,1.72881e+07,5581679
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A(E((AG(AF(((i6.u0.s1>=1)&&(i0.u7.l1291>=1)))) + AX(((EF(((i6.u0.s1>=1)&&(i6.u0.l1215>=1))) * (i6.u0.p80>=1)) * (i3.u2.l0>=1)))) U ((!(((...605
=> equivalent forward existential formula: [((Init * !(EG(!(E((((!(E(TRUE U !((((i3.u2.p51>=1)&&(i6.u0.l619>=1))||((i0.u17.p85>=1)&&(i0.u7.l405>=1)))))) * ...1274
(forward)formula 2,0,762.244,6625360,1,0,3.921e+06,1.08986e+06,2254,6.51812e+07,1407,2.18533e+07,2418448
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF(E(EX(AF(((i8.u25.p120>=1)&&(i5.u13.l532>=1)))) U AF(E(((i6.u0.s1>=1)&&(i0.u7.l1291>=1)) U (((i6.u0.s1>=1)&&(i7.u18.l1024>=1))&&(i6.u0....169
=> equivalent forward existential formula: [FwdG(Init,!(E(EX(!(EG(!(((i8.u25.p120>=1)&&(i5.u13.l532>=1)))))) U !(EG(!(E(((i6.u0.s1>=1)&&(i0.u7.l1291>=1)) U...226
(forward)formula 3,0,1079.43,7372704,1,0,3.921e+06,1.08986e+06,2087,6.85454e+07,1329,2.18533e+07,869968
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (E((((!(AF(((i5.u12.p27>=1)&&(i3.u2.l0>=1)))) * !((!(((i6.u0.s1>=1)&&(i7.u20.l1021>=1))) * AG(((i5.u11.p63>=1)&&(i6.u0.l613>=1)))))) * ((...487
=> equivalent forward existential formula: ([(EY(FwdU(Init,(((!(!(EG(!(((i5.u12.p27>=1)&&(i3.u2.l0>=1)))))) * !((!(((i6.u0.s1>=1)&&(i7.u20.l1021>=1))) * !(...724
(forward)formula 4,1,1321.94,7816608,1,0,3.921e+06,1.08986e+06,2710,7.09977e+07,1555,2.18533e+07,6979399
FORMULA DBSingleClientW-PT-d1m06-CTLFireability-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
Detected timeout of ITS tools.
[2025-05-30 02:48:23] [INFO ] Flatten gal took : 13 ms
[2025-05-30 02:48:23] [INFO ] Time to serialize gal into /tmp/CTLFireability6853294983323596221.gal : 3 ms
[2025-05-30 02:48:23] [INFO ] Time to serialize properties into /tmp/CTLFireability10856320146636108934.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/CTLFireability6853294983323596221.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10856320146636108934.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 2 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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="DBSingleClientW-PT-d1m06"
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 DBSingleClientW-PT-d1m06, 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 r058-smll-174854063500074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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