Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K 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 119K 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-d0m08-CTLFireability-2023-12
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-2023-13
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-2023-14
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-2023-15
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-2025-00
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-2025-01
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-2025-02
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-2025-03
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-2025-04
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-2025-05
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-2025-06
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-2025-07
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-2025-08
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-2025-09
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-2025-10
FORMULA_NAME DBSingleClientW-PT-d0m08-CTLFireability-2025-11

=== Now, execution of the tool begins

BK_START 1748553517535

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-d0m08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-29 21:18:39] [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-29 21:18:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 21:18:40] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2025-05-29 21:18:40] [INFO ] Transformed 553 places.
[2025-05-29 21:18:40] [INFO ] Transformed 150 transitions.
[2025-05-29 21:18:40] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 385 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 30 ms.
Deduced a syphon composed of 444 places in 3 ms
Reduce places removed 444 places and 0 transitions.
Support contains 75 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 100 transition count 137
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 100 transition count 137
Applied a total of 22 rules in 52 ms. Remains 100 /109 variables (removed 9) and now considering 137/150 (removed 13) transitions.
// Phase 1: matrix 137 rows 100 cols
[2025-05-29 21:18:40] [INFO ] Computed 2 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:18:40] [INFO ] Implicit Places using invariants in 520 ms returned []
[2025-05-29 21:18:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:18:41] [INFO ] State equation strengthened by 62 read => feed constraints.
[2025-05-29 21:18:41] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 948 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2025-05-29 21:18:41] [INFO ] Invariant cache hit.
[2025-05-29 21:18:41] [INFO ] State equation strengthened by 62 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/237 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 62/164 constraints. Problems are: Problem set: 0 solved, 136 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/237 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 164 constraints, problems are : Problem set: 0 solved, 136 unsolved in 8075 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/237 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 62/164 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 136/300 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 237/237 variables, and 300 constraints, problems are : Problem set: 0 solved, 136 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38550ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 38574ms
Starting structural reductions in LTL mode, iteration 1 : 100/109 places, 137/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39612 ms. Remains : 100/109 places, 137/150 transitions.
Support contains 75 out of 100 places after structural reductions.
[2025-05-29 21:19:20] [INFO ] Flatten gal took : 71 ms
[2025-05-29 21:19:20] [INFO ] Flatten gal took : 35 ms
[2025-05-29 21:19:20] [INFO ] Input system was already deterministic with 137 transitions.
Reduction of identical properties reduced properties to check from 71 to 68
RANDOM walk for 40000 steps (9195 resets) in 3487 ms. (11 steps per ms) remains 31/68 properties
BEST_FIRST walk for 4001 steps (399 resets) in 42 ms. (93 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (421 resets) in 38 ms. (102 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (181 resets) in 42 ms. (93 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (204 resets) in 95 ms. (41 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (211 resets) in 69 ms. (57 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (200 resets) in 27 ms. (142 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (187 resets) in 30 ms. (129 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (169 resets) in 31 ms. (125 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (205 resets) in 34 ms. (114 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (398 resets) in 91 ms. (43 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (203 resets) in 31 ms. (125 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (410 resets) in 41 ms. (95 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (214 resets) in 33 ms. (117 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (182 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (197 resets) in 29 ms. (133 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (189 resets) in 30 ms. (129 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (198 resets) in 21 ms. (182 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (326 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (800 resets) in 39 ms. (100 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (425 resets) in 44 ms. (88 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (185 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (416 resets) in 28 ms. (138 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (252 resets) in 23 ms. (166 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (203 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (213 resets) in 23 ms. (166 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (202 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (386 resets) in 68 ms. (58 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (413 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (139 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (189 resets) in 21 ms. (181 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (196 resets) in 25 ms. (153 steps per ms) remains 30/31 properties
[2025-05-29 21:19:21] [INFO ] Invariant cache hit.
[2025-05-29 21:19:21] [INFO ] State equation strengthened by 62 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp57 is UNSAT
At refinement iteration 1 (OVERLAPS) 25/68 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 15/83 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 127/210 variables, 83/85 constraints. Problems are: Problem set: 3 solved, 27 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 52/137 constraints. Problems are: Problem set: 3 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/210 variables, 0/137 constraints. Problems are: Problem set: 3 solved, 27 unsolved
Problem AtomicPropp65 is UNSAT
At refinement iteration 8 (OVERLAPS) 27/237 variables, 17/154 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 10/164 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/164 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 0/237 variables, 0/164 constraints. Problems are: Problem set: 4 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 164 constraints, problems are : Problem set: 4 solved, 26 unsolved in 1998 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 26 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 27/63 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:19:24] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:19:24] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 2/3 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 19/82 variables, 1/4 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 122/204 variables, 82/86 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 47/133 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 1/134 constraints. Problems are: Problem set: 4 solved, 26 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:19:25] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:19:25] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/204 variables, 2/136 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/136 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 33/237 variables, 18/154 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 15/169 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 25/194 constraints. Problems are: Problem set: 4 solved, 26 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/237 variables, 0/194 constraints. Problems are: Problem set: 4 solved, 26 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 237/237 variables, and 194 constraints, problems are : Problem set: 4 solved, 26 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 26/30 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7060ms problems are : Problem set: 4 solved, 26 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 36 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 137/137 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 92 transition count 125
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 92 transition count 125
Applied a total of 16 rules in 18 ms. Remains 92 /100 variables (removed 8) and now considering 125/137 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 92/100 places, 125/137 transitions.
RANDOM walk for 40000 steps (9094 resets) in 544 ms. (73 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (411 resets) in 55 ms. (71 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (387 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (194 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (192 resets) in 17 ms. (222 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4004 steps (184 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (212 resets) in 22 ms. (173 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (214 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (198 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (413 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (210 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (199 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (179 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (193 resets) in 14 ms. (266 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4003 steps (226 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (365 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (800 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (429 resets) in 32 ms. (121 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (210 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (402 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (188 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (206 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (420 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (384 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (211 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
Probabilistic random walk after 1000001 steps, saw 386655 distinct states, run finished after 1695 ms. (steps per millisecond=589 ) properties seen :23
// Phase 1: matrix 125 rows 92 cols
[2025-05-29 21:19:31] [INFO ] Computed 2 invariants in 5 ms
[2025-05-29 21:19:31] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 87/148 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 17/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 65/213 variables, 29/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 36/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/217 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/217 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 149 constraints, problems are : Problem set: 0 solved, 1 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 87/148 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 17/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 65/213 variables, 29/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 36/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/217 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/217 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/217 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 661ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 125/125 transitions.
Graph (complete) has 269 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 91 transition count 123
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 20 place count 74 transition count 92
Iterating global reduction 1 with 17 rules applied. Total rules applied 37 place count 74 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 74 transition count 91
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 47 place count 65 transition count 82
Iterating global reduction 2 with 9 rules applied. Total rules applied 56 place count 65 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 65 transition count 80
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 61 place count 62 transition count 74
Iterating global reduction 3 with 3 rules applied. Total rules applied 64 place count 62 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 65 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 67 place count 60 transition count 70
Iterating global reduction 4 with 2 rules applied. Total rules applied 69 place count 60 transition count 70
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 71 place count 58 transition count 68
Iterating global reduction 4 with 2 rules applied. Total rules applied 73 place count 58 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 75 place count 58 transition count 66
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 76 place count 57 transition count 65
Iterating global reduction 5 with 1 rules applied. Total rules applied 77 place count 57 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 79 place count 57 transition count 63
Applied a total of 79 rules in 66 ms. Remains 57 /92 variables (removed 35) and now considering 63/125 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 57/92 places, 63/125 transitions.
RANDOM walk for 40000 steps (9124 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3184 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2606296 steps, run timeout after 3001 ms. (steps per millisecond=868 ) properties seen :0 out of 1
Probabilistic random walk after 2606296 steps, saw 1028858 distinct states, run finished after 3006 ms. (steps per millisecond=867 ) properties seen :0
// Phase 1: matrix 63 rows 57 cols
[2025-05-29 21:19:35] [INFO ] Computed 2 invariants in 2 ms
[2025-05-29 21:19:35] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/94 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/120 variables, 15/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 11/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/120 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 120 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/42 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/94 variables, 42/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/120 variables, 15/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 11/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/120 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/120 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 79 constraints, problems are : Problem set: 0 solved, 1 unsolved in 135 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 267ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 6 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 57/57 places, 63/63 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2025-05-29 21:19:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:19:35] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-05-29 21:19:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:19:35] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-05-29 21:19:35] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:19:35] [INFO ] Redundant transitions in 1 ms returned []
Running 62 sub problems to find dead transitions.
[2025-05-29 21:19:35] [INFO ] Invariant cache hit.
[2025-05-29 21:19:35] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 63/120 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 19/78 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 78 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1690 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 63/120 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 19/78 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 62/140 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 140 constraints, problems are : Problem set: 0 solved, 62 unsolved in 8205 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9944ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 9945ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10169 ms. Remains : 57/57 places, 63/63 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 57 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 56 transition count 59
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 5 place count 56 transition count 53
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 17 place count 50 transition count 53
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 49 transition count 52
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 49 transition count 52
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 48 transition count 51
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 48 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 47 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 46 transition count 58
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 46 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 45 transition count 57
Applied a total of 27 rules in 28 ms. Remains 45 /57 variables (removed 12) and now considering 57/63 (removed 6) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 57 rows 45 cols
[2025-05-29 21:19:45] [INFO ] Computed 5 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-29 21:19:45] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2025-05-29 21:19:45] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 21:19:45] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-05-29 21:19:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-05-29 21:19:45] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 4 ms returned sat
[2025-05-29 21:19:45] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-05-29 21:19:45] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-05-29 21:19:45] [INFO ] After 129ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 287 ms.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2025-05-29 21:19:45] [INFO ] Flatten gal took : 14 ms
[2025-05-29 21:19:45] [INFO ] Flatten gal took : 14 ms
[2025-05-29 21:19:45] [INFO ] Input system was already deterministic with 137 transitions.
Computed a total of 6 stabilizing places and 18 stable transitions
Graph (complete) has 334 edges and 100 vertex of which 99 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 137/137 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 77 transition count 95
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 77 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 77 transition count 94
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 67 transition count 84
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 67 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 65 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 64 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 64 transition count 76
Applied a total of 76 rules in 14 ms. Remains 64 /100 variables (removed 36) and now considering 76/137 (removed 61) transitions.
// Phase 1: matrix 76 rows 64 cols
[2025-05-29 21:19:45] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:19:45] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-05-29 21:19:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:19:46] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 21:19:46] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2025-05-29 21:19:46] [INFO ] Invariant cache hit.
[2025-05-29 21:19:46] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 76/140 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 22/88 constraints. Problems are: Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:19:47] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:19:47] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:19:49] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:19:49] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:19:49] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 5 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/140 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/140 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 93 constraints, problems are : Problem set: 0 solved, 75 unsolved in 5144 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 76/140 variables, 64/71 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 22/93 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 75/168 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/140 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 168 constraints, problems are : Problem set: 0 solved, 75 unsolved in 7755 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12938ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 12939ms
Starting structural reductions in LTL mode, iteration 1 : 64/100 places, 76/137 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13199 ms. Remains : 64/100 places, 76/137 transitions.
[2025-05-29 21:19:59] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:19:59] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:19:59] [INFO ] Input system was already deterministic with 76 transitions.
[2025-05-29 21:19:59] [INFO ] Flatten gal took : 7 ms
[2025-05-29 21:19:59] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:19:59] [INFO ] Time to serialize gal into /tmp/CTLFireability5386859360831979496.gal : 3 ms
[2025-05-29 21:19:59] [INFO ] Time to serialize properties into /tmp/CTLFireability790225015497203927.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5386859360831979496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability790225015497203927.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,6.90804e+06,5.91978,130000,2,14724,5,490222,6,0,332,491331,0


Converting to forward existential form...Done !
original formula: (EX(((s1>=1)&&(l342>=1))) + (EF(((s1>=1)&&(l336>=1))) * (EX(AF(((p38>=1)&&(l136>=1)))) + AF(EG(AG(((p35<1)||(l136<1))))))))
=> equivalent forward existential formula: ([((Init * !(EX(((s1>=1)&&(l342>=1))))) * !(E(TRUE U ((s1>=1)&&(l336>=1)))))] = FALSE * [FwdG(((Init * !(EX(((s1...270
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t46, t54, t55, t56, t57, t58, t59, t60, t61, t62, t63, t64, t65, t6...301
Detected timeout of ITS tools.
[2025-05-29 21:20:29] [INFO ] Flatten gal took : 12 ms
[2025-05-29 21:20:29] [INFO ] Applying decomposition
[2025-05-29 21:20:29] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4303826693647282511.txt' '-o' '/tmp/graph4303826693647282511.bin' '-w' '/tmp/graph4303826693647282511.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4303826693647282511.bin' '-l' '-1' '-v' '-w' '/tmp/graph4303826693647282511.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:20:29] [INFO ] Decomposing Gal with order
[2025-05-29 21:20:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:20:29] [INFO ] Removed a total of 66 redundant transitions.
[2025-05-29 21:20:29] [INFO ] Flatten gal took : 102 ms
[2025-05-29 21:20:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 16 ms.
[2025-05-29 21:20:29] [INFO ] Time to serialize gal into /tmp/CTLFireability13232685071560490230.gal : 8 ms
[2025-05-29 21:20:29] [INFO ] Time to serialize properties into /tmp/CTLFireability1975420589669037229.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/CTLFireability13232685071560490230.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1975420589669037229.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,6.90804e+06,2.32529,48488,1039,681,52945,11088,241,169969,94,122035,0


Converting to forward existential form...Done !
original formula: (EX(((i2.u0.s1>=1)&&(i2.u0.l342>=1))) + (EF(((i2.u0.s1>=1)&&(i5.u7.l336>=1))) * (EX(AF(((i2.u0.p38>=1)&&(i1.u11.l136>=1)))) + AF(EG(AG(((...191
=> equivalent forward existential formula: ([((Init * !(EX(((i2.u0.s1>=1)&&(i2.u0.l342>=1))))) * !(E(TRUE U ((i2.u0.s1>=1)&&(i5.u7.l336>=1)))))] = FALSE * ...332
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t9, t26, t28, t54, t55, t57, t58, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t...292
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 : 100/100 places, 137/137 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 78 transition count 98
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 78 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 78 transition count 97
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 55 place count 68 transition count 87
Iterating global reduction 1 with 10 rules applied. Total rules applied 65 place count 68 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 67 place count 68 transition count 85
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 70 place count 65 transition count 79
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 65 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 65 transition count 78
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 63 transition count 75
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 63 transition count 75
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 61 transition count 73
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 84 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 85 place count 60 transition count 70
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 88 place count 60 transition count 68
Applied a total of 88 rules in 18 ms. Remains 60 /100 variables (removed 40) and now considering 68/137 (removed 69) transitions.
// Phase 1: matrix 68 rows 60 cols
[2025-05-29 21:20:59] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:20:59] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-05-29 21:20:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:20:59] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-05-29 21:20:59] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 67 sub problems to find dead transitions.
[2025-05-29 21:20:59] [INFO ] Invariant cache hit.
[2025-05-29 21:20:59] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 68/128 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 24/86 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:21:01] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:21:01] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 88 constraints, problems are : Problem set: 0 solved, 67 unsolved in 3171 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (OVERLAPS) 68/128 variables, 60/64 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 24/88 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 67/155 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 10 (OVERLAPS) 0/128 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 155 constraints, problems are : Problem set: 0 solved, 67 unsolved in 5875 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9071ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 9072ms
Starting structural reductions in LTL mode, iteration 1 : 60/100 places, 68/137 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9350 ms. Remains : 60/100 places, 68/137 transitions.
[2025-05-29 21:21:09] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:21:09] [INFO ] Flatten gal took : 5 ms
[2025-05-29 21:21:09] [INFO ] Input system was already deterministic with 68 transitions.
[2025-05-29 21:21:09] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:21:09] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:21:09] [INFO ] Time to serialize gal into /tmp/CTLFireability15756363043515835669.gal : 1 ms
[2025-05-29 21:21:09] [INFO ] Time to serialize properties into /tmp/CTLFireability7487499422883957236.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/CTLFireability15756363043515835669.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7487499422883957236.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.94176e+06,3.68601,90824,2,15144,5,382624,6,0,308,294598,0


Converting to forward existential form...Done !
original formula: AX(EF(AG(AX(((s1>=1)&&(l491>=1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U !(!(EX(!(((s1>=1)&&(l491>=1)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t40, t42, t43, t44, t49, t50, t51, t52, t53, t54, t55, t56, t57, t5...301
(forward)formula 0,1,11.5742,190652,1,0,153,901746,158,63,2121,697048,164
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 137/137 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 85 transition count 116
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 85 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 85 transition count 114
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 79 transition count 108
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 79 transition count 108
Applied a total of 44 rules in 24 ms. Remains 79 /100 variables (removed 21) and now considering 108/137 (removed 29) transitions.
// Phase 1: matrix 108 rows 79 cols
[2025-05-29 21:21:20] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:21:20] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-05-29 21:21:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:21:20] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-05-29 21:21:21] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:21:21] [INFO ] Redundant transitions in 5 ms returned []
Running 107 sub problems to find dead transitions.
[2025-05-29 21:21:21] [INFO ] Invariant cache hit.
[2025-05-29 21:21:21] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/187 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 44/125 constraints. Problems are: Problem set: 0 solved, 107 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/187 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 125 constraints, problems are : Problem set: 0 solved, 107 unsolved in 5642 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 79/79 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/187 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 44/125 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 107/232 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/187 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 232 constraints, problems are : Problem set: 0 solved, 107 unsolved in 20270 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 79/79 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25986ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 25989ms
Starting structural reductions in SI_CTL mode, iteration 1 : 79/100 places, 108/137 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26461 ms. Remains : 79/100 places, 108/137 transitions.
[2025-05-29 21:21:47] [INFO ] Flatten gal took : 13 ms
[2025-05-29 21:21:47] [INFO ] Flatten gal took : 13 ms
[2025-05-29 21:21:47] [INFO ] Input system was already deterministic with 108 transitions.
[2025-05-29 21:21:47] [INFO ] Flatten gal took : 12 ms
[2025-05-29 21:21:47] [INFO ] Flatten gal took : 13 ms
[2025-05-29 21:21:47] [INFO ] Time to serialize gal into /tmp/CTLFireability14245967390056269399.gal : 4 ms
[2025-05-29 21:21:47] [INFO ] Time to serialize properties into /tmp/CTLFireability6588152260553555960.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/CTLFireability14245967390056269399.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6588152260553555960.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.1307e+07,19.8581,341824,2,14875,5,1.40898e+06,6,0,424,871756,0


Converting to forward existential form...Done !
original formula: E((EF(((AG(((s1>=1)&&(l110>=1))) * (s1>=1)) * (l501>=1))) + ((s1>=1)&&(l491>=1))) U ((EG(((!((s1>=1)&&(l33>=1)))||((s1>=1)&&(l503>=1)))) ...397
=> equivalent forward existential formula: (([FwdG(FwdU(Init,(E(TRUE U ((!(E(TRUE U !(((s1>=1)&&(l110>=1))))) * (s1>=1)) * (l501>=1))) + ((s1>=1)&&(l491>=1...1245
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t53, t54, t55,...448
Hit Full ! (commute/partial/dont) 1/0/107
(forward)formula 0,1,24.7474,341824,1,0,247,1.40898e+06,255,82,3069,871756,264
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 137/137 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 80 transition count 102
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 80 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 80 transition count 101
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 51 place count 70 transition count 91
Iterating global reduction 1 with 10 rules applied. Total rules applied 61 place count 70 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 70 transition count 89
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 68 transition count 86
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 68 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 68 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 67 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 67 transition count 83
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 66 transition count 82
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 66 transition count 82
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 65 transition count 81
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 65 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 65 transition count 80
Applied a total of 75 rules in 12 ms. Remains 65 /100 variables (removed 35) and now considering 80/137 (removed 57) transitions.
// Phase 1: matrix 80 rows 65 cols
[2025-05-29 21:22:12] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:22:12] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-05-29 21:22:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:22:12] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-05-29 21:22:12] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2025-05-29 21:22:12] [INFO ] Invariant cache hit.
[2025-05-29 21:22:12] [INFO ] State equation strengthened by 27 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 80/145 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 27/94 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 0/145 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 94 constraints, problems are : Problem set: 0 solved, 79 unsolved in 3118 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 80/145 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 27/94 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 79/173 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/145 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 173 constraints, problems are : Problem set: 0 solved, 79 unsolved in 10316 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13467ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 13468ms
Starting structural reductions in LTL mode, iteration 1 : 65/100 places, 80/137 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13813 ms. Remains : 65/100 places, 80/137 transitions.
[2025-05-29 21:22:26] [INFO ] Flatten gal took : 5 ms
[2025-05-29 21:22:26] [INFO ] Flatten gal took : 9 ms
[2025-05-29 21:22:26] [INFO ] Input system was already deterministic with 80 transitions.
[2025-05-29 21:22:26] [INFO ] Flatten gal took : 5 ms
[2025-05-29 21:22:26] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:22:26] [INFO ] Time to serialize gal into /tmp/CTLFireability11233866694066533196.gal : 2 ms
[2025-05-29 21:22:26] [INFO ] Time to serialize properties into /tmp/CTLFireability8742665285058484804.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/CTLFireability11233866694066533196.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8742665285058484804.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG((AX(((((p39<1)||(l137<1))&&(s1>=1))&&(l32>=1))) + (EF(!(E(((p23>=1)&&(l0>=1)) U ((p23>=1)&&(l0>=1))))) * E(AG(!(((s1>=1)&&(l124>=1))))...210
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !((E(TRUE U !(E(((p23>=1)&&(l0>=1)) U ((p23>=1)&&(l0>=1))))) * E(!(E(TRUE U !(!(((s1>=1)...291
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t19, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t50, t58, t5...356
Detected timeout of ITS tools.
[2025-05-29 21:22:56] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:22:56] [INFO ] Applying decomposition
[2025-05-29 21:22:56] [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/graph1110343487689875732.txt' '-o' '/tmp/graph1110343487689875732.bin' '-w' '/tmp/graph1110343487689875732.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1110343487689875732.bin' '-l' '-1' '-v' '-w' '/tmp/graph1110343487689875732.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:22:56] [INFO ] Decomposing Gal with order
[2025-05-29 21:22:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:22:56] [INFO ] Removed a total of 61 redundant transitions.
[2025-05-29 21:22:56] [INFO ] Flatten gal took : 13 ms
[2025-05-29 21:22:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 5 ms.
[2025-05-29 21:22:56] [INFO ] Time to serialize gal into /tmp/CTLFireability1683164778481322773.gal : 2 ms
[2025-05-29 21:22:56] [INFO ] Time to serialize properties into /tmp/CTLFireability5149511822727297998.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/CTLFireability1683164778481322773.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5149511822727297998.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,5.53335e+06,5.76965,105208,1628,1208,89307,24413,260,571948,114,305563,0


Converting to forward existential form...Done !
original formula: AG((AX(((((i0.u12.p39<1)||(i3.u7.l137<1))&&(i0.u2.s1>=1))&&(i1.u4.l32>=1))) + (EF(!(E(((i4.u8.p23>=1)&&(i0.u2.l0>=1)) U ((i4.u8.p23>=1)&&...295
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !((E(TRUE U !(E(((i4.u8.p23>=1)&&(i0.u2.l0>=1)) U ((i4.u8.p23>=1)&&(i0.u2.l0>=1))))) * E...376
Reverse transition relation is NOT exact ! Due to transitions t2, t9, t19, t29, t50, t58, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t69, t70, t71, ...314
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 SI_CTL mode, iteration 0 : 100/100 places, 137/137 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 78 transition count 96
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 78 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 78 transition count 95
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 56 place count 67 transition count 84
Iterating global reduction 1 with 11 rules applied. Total rules applied 67 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 69 place count 67 transition count 82
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 64 transition count 76
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 64 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 64 transition count 75
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 78 place count 62 transition count 72
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 62 transition count 72
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 82 place count 60 transition count 70
Iterating global reduction 3 with 2 rules applied. Total rules applied 84 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 86 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 87 place count 59 transition count 67
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 59 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 90 place count 59 transition count 65
Applied a total of 90 rules in 22 ms. Remains 59 /100 variables (removed 41) and now considering 65/137 (removed 72) transitions.
// Phase 1: matrix 65 rows 59 cols
[2025-05-29 21:23:26] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:23:26] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-05-29 21:23:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:23:26] [INFO ] State equation strengthened by 21 read => feed constraints.
[2025-05-29 21:23:26] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:23:26] [INFO ] Redundant transitions in 1 ms returned []
Running 64 sub problems to find dead transitions.
[2025-05-29 21:23:26] [INFO ] Invariant cache hit.
[2025-05-29 21:23:26] [INFO ] State equation strengthened by 21 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 65/124 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 21/82 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 0/124 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 82 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1711 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 65/124 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 21/82 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 64/146 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 146 constraints, problems are : Problem set: 0 solved, 64 unsolved in 5755 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7510ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 7510ms
Starting structural reductions in SI_CTL mode, iteration 1 : 59/100 places, 65/137 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7819 ms. Remains : 59/100 places, 65/137 transitions.
[2025-05-29 21:23:34] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:23:34] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:23:34] [INFO ] Input system was already deterministic with 65 transitions.
[2025-05-29 21:23:34] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:23:34] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:23:34] [INFO ] Time to serialize gal into /tmp/CTLFireability403881706041834793.gal : 2 ms
[2025-05-29 21:23:34] [INFO ] Time to serialize properties into /tmp/CTLFireability10662949300819773251.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/CTLFireability403881706041834793.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10662949300819773251.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG(((s1<1)||(l37<1)))
=> equivalent forward existential formula: [FwdG(Init,((s1<1)||(l37<1)))] != FALSE
Hit Full ! (commute/partial/dont) 1/0/64
(forward)formula 0,1,5.03772,89028,1,0,41,367307,19,3,1612,273845,39
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 137/137 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 78 transition count 96
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 78 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 78 transition count 95
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 55 place count 68 transition count 85
Iterating global reduction 1 with 10 rules applied. Total rules applied 65 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 67 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 69 place count 66 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 65 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 64 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 63 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 80 place count 63 transition count 73
Applied a total of 80 rules in 7 ms. Remains 63 /100 variables (removed 37) and now considering 73/137 (removed 64) transitions.
// Phase 1: matrix 73 rows 63 cols
[2025-05-29 21:23:39] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:23:39] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-05-29 21:23:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:23:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 21:23:39] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2025-05-29 21:23:39] [INFO ] Invariant cache hit.
[2025-05-29 21:23:39] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 22/87 constraints. Problems are: Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:23:41] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:23:41] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 89 constraints, problems are : Problem set: 0 solved, 72 unsolved in 3154 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 73/136 variables, 63/67 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 72/161 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/136 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 161 constraints, problems are : Problem set: 0 solved, 72 unsolved in 10683 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13875ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 13875ms
Starting structural reductions in LTL mode, iteration 1 : 63/100 places, 73/137 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14116 ms. Remains : 63/100 places, 73/137 transitions.
[2025-05-29 21:23:53] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:23:53] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:23:53] [INFO ] Input system was already deterministic with 73 transitions.
[2025-05-29 21:23:53] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:23:53] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:23:53] [INFO ] Time to serialize gal into /tmp/CTLFireability1944035231498047353.gal : 1 ms
[2025-05-29 21:23:53] [INFO ] Time to serialize properties into /tmp/CTLFireability4692044133020353524.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/CTLFireability1944035231498047353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4692044133020353524.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,6.28621e+06,3.78589,90664,2,13743,5,307747,6,0,325,371947,0


Converting to forward existential form...Done !
original formula: EX(AG(AX(((EG(((s1<1)||(l487<1))) + (s1<1)) + (l110<1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(EX(!(((EG(((s1<1)||(l487<1))) + (s1<1)) + (l110<1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t28, t43, t44, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t6...301
Detected timeout of ITS tools.
[2025-05-29 21:24:23] [INFO ] Flatten gal took : 10 ms
[2025-05-29 21:24:23] [INFO ] Applying decomposition
[2025-05-29 21:24:23] [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/graph4097253915861942977.txt' '-o' '/tmp/graph4097253915861942977.bin' '-w' '/tmp/graph4097253915861942977.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4097253915861942977.bin' '-l' '-1' '-v' '-w' '/tmp/graph4097253915861942977.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:24:23] [INFO ] Decomposing Gal with order
[2025-05-29 21:24:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:24:23] [INFO ] Removed a total of 62 redundant transitions.
[2025-05-29 21:24:23] [INFO ] Flatten gal took : 10 ms
[2025-05-29 21:24:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 3 ms.
[2025-05-29 21:24:23] [INFO ] Time to serialize gal into /tmp/CTLFireability14154076404575507355.gal : 2 ms
[2025-05-29 21:24:23] [INFO ] Time to serialize properties into /tmp/CTLFireability846144403109595878.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/CTLFireability14154076404575507355.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability846144403109595878.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,6.28621e+06,5.51409,135096,1388,1319,71502,52091,245,838665,93,935201,0


Converting to forward existential form...Done !
original formula: EX(AG(AX(((EG(((i4.u0.s1<1)||(i3.u12.l487<1))) + (i4.u0.s1<1)) + (i0.u2.l110<1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(EX(!(((EG(((i4.u0.s1<1)||(i3.u12.l487<1))) + (i4.u0.s1<1)) + (i0.u2.l110<1)))))))))]...164
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t9, t28, t43, t52, t53, t55, t56, t57, t58, t59, t60, t61, t62, t63, t64, t65, t68, t...298
Fast SCC detection found an SCC at level 5
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 137/137 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 81 transition count 105
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 81 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 81 transition count 104
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 73 transition count 96
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 73 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 73 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 72 transition count 92
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 72 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 71 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 71 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 70 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 70 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 70 transition count 88
Applied a total of 64 rules in 9 ms. Remains 70 /100 variables (removed 30) and now considering 88/137 (removed 49) transitions.
// Phase 1: matrix 88 rows 70 cols
[2025-05-29 21:24:53] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:24:53] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-05-29 21:24:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:24:53] [INFO ] State equation strengthened by 31 read => feed constraints.
[2025-05-29 21:24:53] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2025-05-29 21:24:53] [INFO ] Invariant cache hit.
[2025-05-29 21:24:53] [INFO ] State equation strengthened by 31 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 88/158 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 31/103 constraints. Problems are: Problem set: 0 solved, 87 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 0/158 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 103 constraints, problems are : Problem set: 0 solved, 87 unsolved in 2656 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 88/158 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 31/103 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 87/190 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 0/158 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 190 constraints, problems are : Problem set: 0 solved, 87 unsolved in 11853 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14548ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 14553ms
Starting structural reductions in LTL mode, iteration 1 : 70/100 places, 88/137 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14873 ms. Remains : 70/100 places, 88/137 transitions.
[2025-05-29 21:25:08] [INFO ] Flatten gal took : 5 ms
[2025-05-29 21:25:08] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:25:08] [INFO ] Input system was already deterministic with 88 transitions.
[2025-05-29 21:25:08] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:25:08] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:25:08] [INFO ] Time to serialize gal into /tmp/CTLFireability7183730907136721083.gal : 2 ms
[2025-05-29 21:25:08] [INFO ] Time to serialize properties into /tmp/CTLFireability14246474718645298019.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/CTLFireability7183730907136721083.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14246474718645298019.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.18833e+07,4.33096,96500,2,14859,5,319417,6,0,368,404778,0


Converting to forward existential form...Done !
original formula: (EX(AG(((EF(((s1<1)||(l504<1))) + (s1<1)) + (l150<1)))) + AF(((((!(E(AF(((s1>=1)&&(l149>=1))) U !(((s6>=1)&&(l0>=1))))) + (s1<1)) + (l355...232
=> equivalent forward existential formula: [FwdG((Init * !(EX(!(E(TRUE U !(((E(TRUE U ((s1<1)||(l504<1))) + (s1<1)) + (l150<1)))))))),!(((((!(E(!(EG(!(((s1...304
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t54, t57, t58, t59, t6...376
Detected timeout of ITS tools.
[2025-05-29 21:25:38] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:25:38] [INFO ] Applying decomposition
[2025-05-29 21:25:38] [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/graph10937277777871364154.txt' '-o' '/tmp/graph10937277777871364154.bin' '-w' '/tmp/graph10937277777871364154.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10937277777871364154.bin' '-l' '-1' '-v' '-w' '/tmp/graph10937277777871364154.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:25:38] [INFO ] Decomposing Gal with order
[2025-05-29 21:25:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:25:38] [INFO ] Removed a total of 78 redundant transitions.
[2025-05-29 21:25:38] [INFO ] Flatten gal took : 11 ms
[2025-05-29 21:25:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 4 ms.
[2025-05-29 21:25:38] [INFO ] Time to serialize gal into /tmp/CTLFireability2118023905071397241.gal : 3 ms
[2025-05-29 21:25:38] [INFO ] Time to serialize properties into /tmp/CTLFireability11700322861623153334.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/CTLFireability2118023905071397241.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11700322861623153334.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.18833e+07,4.9411,84244,2186,889,97672,12949,266,302590,108,113288,0


Converting to forward existential form...Done !
original formula: (EX(AG(((EF(((i3.u0.s1<1)||(i6.u13.l504<1))) + (i3.u0.s1<1)) + (u8.l150<1)))) + AF(((((!(E(AF(((i3.u0.s1>=1)&&(u8.l149>=1))) U !(((i3.u5....325
=> equivalent forward existential formula: [FwdG((Init * !(EX(!(E(TRUE U !(((E(TRUE U ((i3.u0.s1<1)||(i6.u13.l504<1))) + (i3.u0.s1<1)) + (u8.l150<1))))))))...397
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t29, t54, t57, t58, t59, t63, t64, t65, t66, t68, t69, t70, t71, t72, t75, t76, t77, ...332
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 : 100/100 places, 137/137 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 79 transition count 99
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 79 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 79 transition count 98
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 68 transition count 87
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 68 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 67 place count 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 69 place count 66 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 66 transition count 81
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 64 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 64 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 63 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 63 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 63 transition count 75
Applied a total of 79 rules in 4 ms. Remains 63 /100 variables (removed 37) and now considering 75/137 (removed 62) transitions.
// Phase 1: matrix 75 rows 63 cols
[2025-05-29 21:26:08] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:26:08] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-05-29 21:26:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:26:08] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-29 21:26:09] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-05-29 21:26:09] [INFO ] Invariant cache hit.
[2025-05-29 21:26:09] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/138 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 0/138 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 91 constraints, problems are : Problem set: 0 solved, 74 unsolved in 3136 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/138 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 74/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 165 constraints, problems are : Problem set: 0 solved, 74 unsolved in 8686 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11861ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 11862ms
Starting structural reductions in LTL mode, iteration 1 : 63/100 places, 75/137 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12180 ms. Remains : 63/100 places, 75/137 transitions.
[2025-05-29 21:26:20] [INFO ] Flatten gal took : 8 ms
[2025-05-29 21:26:20] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:26:20] [INFO ] Input system was already deterministic with 75 transitions.
[2025-05-29 21:26:20] [INFO ] Flatten gal took : 3 ms
[2025-05-29 21:26:20] [INFO ] Flatten gal took : 3 ms
[2025-05-29 21:26:20] [INFO ] Time to serialize gal into /tmp/CTLFireability11978005697501550423.gal : 1 ms
[2025-05-29 21:26:20] [INFO ] Time to serialize properties into /tmp/CTLFireability7147172629798774663.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/CTLFireability11978005697501550423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7147172629798774663.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,6.43873e+06,2.57632,64948,2,11669,5,246932,6,0,327,249895,0


Converting to forward existential form...Done !
original formula: AX(((AF(EX(E(((s1>=1)&&(l124>=1)) U ((s1>=1)&&(l127>=1))))) + AG(((s1>=1)&&(l33>=1)))) + ((s1>=1)&&(l337>=1))))
=> equivalent forward existential formula: [(FwdU(((EY(Init) * !(((s1>=1)&&(l337>=1)))) * !(!(EG(!(EX(E(((s1>=1)&&(l124>=1)) U ((s1>=1)&&(l127>=1))))))))),...195
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t24, t29, t44, t45, t46, t50, t55, t56, t57, t58, t59, t60, t61,...319
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-05-29 21:26:51] [INFO ] Flatten gal took : 10 ms
[2025-05-29 21:26:51] [INFO ] Applying decomposition
[2025-05-29 21:26:51] [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/graph14961001067062330292.txt' '-o' '/tmp/graph14961001067062330292.bin' '-w' '/tmp/graph14961001067062330292.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14961001067062330292.bin' '-l' '-1' '-v' '-w' '/tmp/graph14961001067062330292.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:26:51] [INFO ] Decomposing Gal with order
[2025-05-29 21:26:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:26:51] [INFO ] Removed a total of 69 redundant transitions.
[2025-05-29 21:26:51] [INFO ] Flatten gal took : 13 ms
[2025-05-29 21:26:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 7 ms.
[2025-05-29 21:26:51] [INFO ] Time to serialize gal into /tmp/CTLFireability9770561525721095770.gal : 3 ms
[2025-05-29 21:26:51] [INFO ] Time to serialize properties into /tmp/CTLFireability13599784816883210562.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/CTLFireability9770561525721095770.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13599784816883210562.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,6.43873e+06,5.38411,102336,1294,836,111237,12031,255,428453,75,169385,0


Converting to forward existential form...Done !
original formula: AX(((AF(EX(E(((i1.u0.s1>=1)&&(i3.i1.u6.l124>=1)) U ((i1.u0.s1>=1)&&(i3.i1.u7.l127>=1))))) + AG(((i1.u0.s1>=1)&&(u11.l33>=1)))) + ((i1.u0....181
=> equivalent forward existential formula: [(FwdU(((EY(Init) * !(((i1.u0.s1>=1)&&(i1.u0.l337>=1)))) * !(!(EG(!(EX(E(((i1.u0.s1>=1)&&(i3.i1.u6.l124>=1)) U (...247
Reverse transition relation is NOT exact ! Due to transitions t5, t7, t8, t9, t24, t29, t41, t44, t45, t46, t55, t56, t57, t58, t59, t60, t61, t62, t63, t6...316
Fast SCC detection found an SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 137/137 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 79 transition count 103
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 79 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 79 transition count 102
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 51 place count 71 transition count 94
Iterating global reduction 1 with 8 rules applied. Total rules applied 59 place count 71 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 69 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 69 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 69 transition count 90
Applied a total of 64 rules in 7 ms. Remains 69 /100 variables (removed 31) and now considering 90/137 (removed 47) transitions.
// Phase 1: matrix 90 rows 69 cols
[2025-05-29 21:27:21] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:27:21] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-05-29 21:27:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:27:21] [INFO ] State equation strengthened by 30 read => feed constraints.
[2025-05-29 21:27:21] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2025-05-29 21:27:21] [INFO ] Invariant cache hit.
[2025-05-29 21:27:21] [INFO ] State equation strengthened by 30 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (OVERLAPS) 1/69 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 90/159 variables, 69/71 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 30/101 constraints. Problems are: Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:27:23] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 7 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 0/159 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 102 constraints, problems are : Problem set: 0 solved, 89 unsolved in 3510 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (OVERLAPS) 1/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (OVERLAPS) 90/159 variables, 69/72 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 30/102 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 89/191 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (OVERLAPS) 0/159 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 191 constraints, problems are : Problem set: 0 solved, 89 unsolved in 8726 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 69/69 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12290ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 12293ms
Starting structural reductions in LTL mode, iteration 1 : 69/100 places, 90/137 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12550 ms. Remains : 69/100 places, 90/137 transitions.
[2025-05-29 21:27:33] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:27:33] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:27:33] [INFO ] Input system was already deterministic with 90 transitions.
[2025-05-29 21:27:33] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:27:33] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:27:33] [INFO ] Time to serialize gal into /tmp/CTLFireability11312373420527288449.gal : 1 ms
[2025-05-29 21:27:33] [INFO ] Time to serialize properties into /tmp/CTLFireability12264380951383808195.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/CTLFireability11312373420527288449.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12264380951383808195.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.24025e+07,8.99687,190440,2,15826,5,749936,6,0,366,665379,0


Converting to forward existential form...Done !
original formula: AF(EG((!(A(AX(((s1>=1)&&(l353>=1))) U !(((s1>=1)&&(l32>=1))))) * ((AG(((p35<1)||(l136<1))) + (((s1<1)||(l150<1))&&((p17<1)||(l126<1)))) +...200
=> equivalent forward existential formula: [FwdG(Init,!(EG((!(!((E(!(!(((s1>=1)&&(l32>=1)))) U (!(!(EX(!(((s1>=1)&&(l353>=1)))))) * !(!(((s1>=1)&&(l32>=1))...336
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t50, t51, t52, t58, t6...371
Detected timeout of ITS tools.
[2025-05-29 21:28:03] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:28:03] [INFO ] Applying decomposition
[2025-05-29 21:28: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/graph6897702226534576262.txt' '-o' '/tmp/graph6897702226534576262.bin' '-w' '/tmp/graph6897702226534576262.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6897702226534576262.bin' '-l' '-1' '-v' '-w' '/tmp/graph6897702226534576262.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:28:03] [INFO ] Decomposing Gal with order
[2025-05-29 21:28:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:28:03] [INFO ] Removed a total of 81 redundant transitions.
[2025-05-29 21:28:03] [INFO ] Flatten gal took : 10 ms
[2025-05-29 21:28:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 3 ms.
[2025-05-29 21:28:03] [INFO ] Time to serialize gal into /tmp/CTLFireability7746882014417094895.gal : 2 ms
[2025-05-29 21:28:03] [INFO ] Time to serialize properties into /tmp/CTLFireability3789787951878571540.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/CTLFireability7746882014417094895.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3789787951878571540.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.24025e+07,7.72505,137868,1572,964,132738,11780,236,793193,103,144516,0


Converting to forward existential form...Done !
original formula: AF(EG((!(A(AX(((i7.u0.s1>=1)&&(u10.l353>=1))) U !(((i7.u0.s1>=1)&&(i2.u2.l32>=1))))) * ((AG(((i7.u0.p35<1)||(u5.l136<1))) + (((i7.u0.s1<1...277
=> equivalent forward existential formula: [FwdG(Init,!(EG((!(!((E(!(!(((i7.u0.s1>=1)&&(i2.u2.l32>=1)))) U (!(!(EX(!(((i7.u0.s1>=1)&&(u10.l353>=1)))))) * !...437
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t9, t32, t50, t51, t52, t58, t66, t67, t69, t70, t71, t72, t73, t74, t75, t76, t77, t...312
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 137/137 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 85 transition count 116
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 85 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 85 transition count 114
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 79 transition count 108
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 79 transition count 108
Applied a total of 44 rules in 4 ms. Remains 79 /100 variables (removed 21) and now considering 108/137 (removed 29) transitions.
// Phase 1: matrix 108 rows 79 cols
[2025-05-29 21:28:33] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:28:33] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-05-29 21:28:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:28:34] [INFO ] State equation strengthened by 44 read => feed constraints.
[2025-05-29 21:28:34] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 107 sub problems to find dead transitions.
[2025-05-29 21:28:34] [INFO ] Invariant cache hit.
[2025-05-29 21:28:34] [INFO ] State equation strengthened by 44 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/187 variables, 79/81 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 44/125 constraints. Problems are: Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:28:37] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:28:37] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:28:37] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 3/128 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/187 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 128 constraints, problems are : Problem set: 0 solved, 107 unsolved in 7213 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 79/79 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/79 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 108/187 variables, 79/84 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 44/128 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 107/235 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 0/187 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 235 constraints, problems are : Problem set: 0 solved, 107 unsolved in 26504 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 79/79 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 33758ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 33759ms
Starting structural reductions in LTL mode, iteration 1 : 79/100 places, 108/137 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34096 ms. Remains : 79/100 places, 108/137 transitions.
[2025-05-29 21:29:08] [INFO ] Flatten gal took : 7 ms
[2025-05-29 21:29:08] [INFO ] Flatten gal took : 7 ms
[2025-05-29 21:29:08] [INFO ] Input system was already deterministic with 108 transitions.
[2025-05-29 21:29:08] [INFO ] Flatten gal took : 7 ms
[2025-05-29 21:29:08] [INFO ] Flatten gal took : 7 ms
[2025-05-29 21:29:08] [INFO ] Time to serialize gal into /tmp/CTLFireability8942174702778273411.gal : 2 ms
[2025-05-29 21:29:08] [INFO ] Time to serialize properties into /tmp/CTLFireability3497496386309959613.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/CTLFireability8942174702778273411.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3497496386309959613.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-29 21:29:38] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:29:38] [INFO ] Applying decomposition
[2025-05-29 21:29:38] [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/graph10953308477525395740.txt' '-o' '/tmp/graph10953308477525395740.bin' '-w' '/tmp/graph10953308477525395740.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10953308477525395740.bin' '-l' '-1' '-v' '-w' '/tmp/graph10953308477525395740.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:29:38] [INFO ] Decomposing Gal with order
[2025-05-29 21:29:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:29:38] [INFO ] Removed a total of 107 redundant transitions.
[2025-05-29 21:29:38] [INFO ] Flatten gal took : 12 ms
[2025-05-29 21:29:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 82 labels/synchronizations in 3 ms.
[2025-05-29 21:29:38] [INFO ] Time to serialize gal into /tmp/CTLFireability8474243107957801770.gal : 2 ms
[2025-05-29 21:29:38] [INFO ] Time to serialize properties into /tmp/CTLFireability18128214428300058537.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/CTLFireability8474243107957801770.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18128214428300058537.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 : 100/100 places, 137/137 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 86 transition count 120
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 86 transition count 120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 84 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 84 transition count 118
Applied a total of 32 rules in 2 ms. Remains 84 /100 variables (removed 16) and now considering 118/137 (removed 19) transitions.
// Phase 1: matrix 118 rows 84 cols
[2025-05-29 21:30:08] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:30:08] [INFO ] Implicit Places using invariants in 89 ms returned []
[2025-05-29 21:30:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:30:08] [INFO ] State equation strengthened by 52 read => feed constraints.
[2025-05-29 21:30:08] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2025-05-29 21:30:08] [INFO ] Invariant cache hit.
[2025-05-29 21:30:08] [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/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/202 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 52/138 constraints. Problems are: Problem set: 0 solved, 117 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/202 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 138 constraints, problems are : Problem set: 0 solved, 117 unsolved in 6043 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 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, 117 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 118/202 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 52/138 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 117/255 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/202 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 255 constraints, problems are : Problem set: 0 solved, 117 unsolved in 28646 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34756ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 34757ms
Starting structural reductions in LTL mode, iteration 1 : 84/100 places, 118/137 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35104 ms. Remains : 84/100 places, 118/137 transitions.
[2025-05-29 21:30:43] [INFO ] Flatten gal took : 6 ms
[2025-05-29 21:30:43] [INFO ] Flatten gal took : 5 ms
[2025-05-29 21:30:43] [INFO ] Input system was already deterministic with 118 transitions.
[2025-05-29 21:30:43] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:30:43] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:30:43] [INFO ] Time to serialize gal into /tmp/CTLFireability6457176897494487555.gal : 1 ms
[2025-05-29 21:30:43] [INFO ] Time to serialize properties into /tmp/CTLFireability4438862021191934348.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/CTLFireability6457176897494487555.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4438862021191934348.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,7.97265e+07,15.0608,312808,2,14193,5,1.43567e+06,6,0,454,753694,0


Converting to forward existential form...Done !
original formula: E(((E(EG(((s8>=1)&&(l151>=1))) U ((s1>=1)&&(l491>=1))) * AG((((EF(((s1>=1)&&(l491>=1))) + ((s1>=1)&&(l504>=1))) + ((s1>=1)&&(l91>=1))) * ...781
=> equivalent forward existential formula: [FwdG(FwdU(Init,((E(EG(((s8>=1)&&(l151>=1))) U ((s1>=1)&&(l491>=1))) * !(E(TRUE U !((((E(TRUE U ((s1>=1)&&(l491>...926
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t53, t54, t55,...483
Detected timeout of ITS tools.
[2025-05-29 21:31:13] [INFO ] Flatten gal took : 5 ms
[2025-05-29 21:31:13] [INFO ] Applying decomposition
[2025-05-29 21:31:13] [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/graph1414946342681741930.txt' '-o' '/tmp/graph1414946342681741930.bin' '-w' '/tmp/graph1414946342681741930.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1414946342681741930.bin' '-l' '-1' '-v' '-w' '/tmp/graph1414946342681741930.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:31:13] [INFO ] Decomposing Gal with order
[2025-05-29 21:31:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:31:13] [INFO ] Removed a total of 127 redundant transitions.
[2025-05-29 21:31:13] [INFO ] Flatten gal took : 11 ms
[2025-05-29 21:31:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 4 ms.
[2025-05-29 21:31:13] [INFO ] Time to serialize gal into /tmp/CTLFireability13792015744634819263.gal : 2 ms
[2025-05-29 21:31:13] [INFO ] Time to serialize properties into /tmp/CTLFireability14664300730578362320.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/CTLFireability13792015744634819263.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14664300730578362320.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.97265e+07,22.4594,342140,3920,1059,251831,14965,318,2.67218e+06,104,335683,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 137/137 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 83 transition count 108
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 83 transition count 108
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 43 place count 74 transition count 99
Iterating global reduction 0 with 9 rules applied. Total rules applied 52 place count 74 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 74 transition count 97
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 71 transition count 91
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 71 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 71 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 70 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 70 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 69 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 69 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 68 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 68 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 68 transition count 85
Applied a total of 68 rules in 20 ms. Remains 68 /100 variables (removed 32) and now considering 85/137 (removed 52) transitions.
// Phase 1: matrix 85 rows 68 cols
[2025-05-29 21:31:43] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:31:43] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-05-29 21:31:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:31:43] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-05-29 21:31:43] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:31:43] [INFO ] Redundant transitions in 1 ms returned []
Running 84 sub problems to find dead transitions.
[2025-05-29 21:31:43] [INFO ] Invariant cache hit.
[2025-05-29 21:31:43] [INFO ] State equation strengthened by 34 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/153 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 34/104 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/153 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 104 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2414 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 85/153 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 34/104 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 84/188 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/153 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 188 constraints, problems are : Problem set: 0 solved, 84 unsolved in 11678 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 68/68 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14117ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 14117ms
Starting structural reductions in SI_CTL mode, iteration 1 : 68/100 places, 85/137 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14458 ms. Remains : 68/100 places, 85/137 transitions.
[2025-05-29 21:31:57] [INFO ] Flatten gal took : 3 ms
[2025-05-29 21:31:57] [INFO ] Flatten gal took : 3 ms
[2025-05-29 21:31:58] [INFO ] Input system was already deterministic with 85 transitions.
[2025-05-29 21:31:58] [INFO ] Flatten gal took : 3 ms
[2025-05-29 21:31:58] [INFO ] Flatten gal took : 3 ms
[2025-05-29 21:31:58] [INFO ] Time to serialize gal into /tmp/CTLFireability9551139614905685509.gal : 1 ms
[2025-05-29 21:31:58] [INFO ] Time to serialize properties into /tmp/CTLFireability18324750500605582209.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/CTLFireability9551139614905685509.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18324750500605582209.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,7.3263e+06,3.65174,83048,2,18109,5,275568,6,0,357,332185,0


Converting to forward existential form...Done !
original formula: (AG(((s7<1)||(l0<1))) + (E(!(E(((s1>=1)&&(l496>=1)) U ((s1>=1)&&(l149>=1)))) U AF((!(EG(((s1>=1)&&(l112>=1)))) * ((!((s1>=1)&&(l340>=1)))...264
=> equivalent forward existential formula: [(FwdU((Init * !((E(!(E(((s1>=1)&&(l496>=1)) U ((s1>=1)&&(l149>=1)))) U !(EG(!((!(EG(((s1>=1)&&(l112>=1)))) * ((...351
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t11, t19, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t52, t53, t5...381
Using saturation style SCC detection
Detected timeout of ITS tools.
[2025-05-29 21:32:28] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:32:28] [INFO ] Applying decomposition
[2025-05-29 21:32:28] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7084194400011559757.txt' '-o' '/tmp/graph7084194400011559757.bin' '-w' '/tmp/graph7084194400011559757.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7084194400011559757.bin' '-l' '-1' '-v' '-w' '/tmp/graph7084194400011559757.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:32:28] [INFO ] Decomposing Gal with order
[2025-05-29 21:32:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:32:28] [INFO ] Removed a total of 65 redundant transitions.
[2025-05-29 21:32:28] [INFO ] Flatten gal took : 7 ms
[2025-05-29 21:32:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 2 ms.
[2025-05-29 21:32:28] [INFO ] Time to serialize gal into /tmp/CTLFireability5093806450138429423.gal : 2 ms
[2025-05-29 21:32:28] [INFO ] Time to serialize properties into /tmp/CTLFireability16165624770408323069.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/CTLFireability5093806450138429423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16165624770408323069.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 : 100/100 places, 137/137 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 79 transition count 97
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 79 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 79 transition count 96
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 53 place count 69 transition count 86
Iterating global reduction 1 with 10 rules applied. Total rules applied 63 place count 69 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 69 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 67 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 67 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 65 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 64 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 64 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 64 transition count 74
Applied a total of 77 rules in 5 ms. Remains 64 /100 variables (removed 36) and now considering 74/137 (removed 63) transitions.
// Phase 1: matrix 74 rows 64 cols
[2025-05-29 21:32:58] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:32:58] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-05-29 21:32:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:32:58] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-29 21:32:58] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2025-05-29 21:32:58] [INFO ] Invariant cache hit.
[2025-05-29 21:32:58] [INFO ] State equation strengthened by 23 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/138 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 23/89 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:32:59] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:33:00] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 3 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/138 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:33:01] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:33:01] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:33:01] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:33:01] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:33:01] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:33:02] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:33:03] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/138 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:33:04] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:33:04] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 6 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/138 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/138 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 16 (OVERLAPS) 0/138 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 100 constraints, problems are : Problem set: 0 solved, 73 unsolved in 7797 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 74/138 variables, 64/77 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 23/100 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 73/173 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 173 constraints, problems are : Problem set: 0 solved, 73 unsolved in 12660 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 64/64 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20480ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 20480ms
Starting structural reductions in LTL mode, iteration 1 : 64/100 places, 74/137 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20706 ms. Remains : 64/100 places, 74/137 transitions.
[2025-05-29 21:33:18] [INFO ] Flatten gal took : 3 ms
[2025-05-29 21:33:18] [INFO ] Flatten gal took : 2 ms
[2025-05-29 21:33:18] [INFO ] Input system was already deterministic with 74 transitions.
[2025-05-29 21:33:18] [INFO ] Flatten gal took : 2 ms
[2025-05-29 21:33:18] [INFO ] Flatten gal took : 2 ms
[2025-05-29 21:33:18] [INFO ] Time to serialize gal into /tmp/CTLFireability955687331917472629.gal : 1 ms
[2025-05-29 21:33:18] [INFO ] Time to serialize properties into /tmp/CTLFireability15273206452340542013.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/CTLFireability955687331917472629.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15273206452340542013.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,5.3123e+06,2.90486,65204,2,12164,5,208998,6,0,330,277897,0


Converting to forward existential form...Done !
original formula: (E(!(AX(AG(!(((s1>=1)&&(l127>=1)))))) U EX(((s7>=1)&&(l0>=1)))) + AF(((EX(EF(((s1>=1)&&(l110>=1)))) * (p20>=1)) * (l115>=1))))
=> equivalent forward existential formula: [FwdG((Init * !(E(!(!(EX(!(!(E(TRUE U !(!(((s1>=1)&&(l127>=1)))))))))) U EX(((s7>=1)&&(l0>=1)))))),!(((EX(E(TRUE...216
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t29, t47, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t6...306
(forward)formula 0,1,28.5851,589428,1,0,421,2.6822e+06,182,223,2324,3.2986e+06,441
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 137/137 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 79 transition count 101
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 79 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 79 transition count 100
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 68 transition count 89
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 68 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 67 place count 68 transition count 87
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 70 place count 65 transition count 81
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 65 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 63 transition count 77
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 61 transition count 75
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 61 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 83 place count 61 transition count 74
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 84 place count 60 transition count 73
Iterating global reduction 4 with 1 rules applied. Total rules applied 85 place count 60 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 87 place count 60 transition count 71
Applied a total of 87 rules in 11 ms. Remains 60 /100 variables (removed 40) and now considering 71/137 (removed 66) transitions.
// Phase 1: matrix 71 rows 60 cols
[2025-05-29 21:33:47] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:33:47] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-05-29 21:33:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:33:47] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-29 21:33:48] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2025-05-29 21:33:48] [INFO ] Invariant cache hit.
[2025-05-29 21:33:48] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/131 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 25/87 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:33:50] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:33:50] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:33:50] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:33:50] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:33:51] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:33:51] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:33:51] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:33:51] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:33:52] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 5 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/131 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/131 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 13 (OVERLAPS) 0/131 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 96 constraints, problems are : Problem set: 0 solved, 70 unsolved in 5741 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 71/131 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 25/96 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 70/166 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 0/131 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 166 constraints, problems are : Problem set: 0 solved, 70 unsolved in 7857 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13628ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 13629ms
Starting structural reductions in LTL mode, iteration 1 : 60/100 places, 71/137 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13967 ms. Remains : 60/100 places, 71/137 transitions.
[2025-05-29 21:34:01] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:34:01] [INFO ] Flatten gal took : 3 ms
[2025-05-29 21:34:01] [INFO ] Input system was already deterministic with 71 transitions.
[2025-05-29 21:34:01] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:34:01] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:34:01] [INFO ] Time to serialize gal into /tmp/CTLFireability16742835579776344413.gal : 1 ms
[2025-05-29 21:34:01] [INFO ] Time to serialize properties into /tmp/CTLFireability5945141478190712735.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/CTLFireability16742835579776344413.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5945141478190712735.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.55019e+06,2.80086,65836,2,11763,5,245879,6,0,311,237444,0


Converting to forward existential form...Done !
original formula: AG(!(A(EX(EF(((s1>=1)&&(l123>=1)))) U EG(E(((s1>=1)&&(l149>=1)) U ((p26>=1)&&(l0>=1)))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(EG(E(((s1>=1)&&(l149>=1)) U ((p26>=1)&&(l0>=1)))))))) * !(E(!(EG(E(((s1>=1)&&(l149>=...292
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t46, t51, t52, t53, t5...336
Using saturation style SCC detection
(forward)formula 0,1,13.3327,252248,1,0,271,1.22126e+06,176,128,2208,1.08584e+06,311
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 137/137 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 79 transition count 101
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 79 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 79 transition count 100
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 68 transition count 89
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 68 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 67 place count 68 transition count 87
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 70 place count 65 transition count 81
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 65 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 63 transition count 77
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 61 transition count 75
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 84 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 85 place count 60 transition count 72
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 60 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 87 place count 60 transition count 71
Applied a total of 87 rules in 14 ms. Remains 60 /100 variables (removed 40) and now considering 71/137 (removed 66) transitions.
// Phase 1: matrix 71 rows 60 cols
[2025-05-29 21:34:15] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:34:15] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-05-29 21:34:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:34:15] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-29 21:34:15] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:34:15] [INFO ] Redundant transitions in 2 ms returned []
Running 70 sub problems to find dead transitions.
[2025-05-29 21:34:15] [INFO ] Invariant cache hit.
[2025-05-29 21:34:15] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/131 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 25/87 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/131 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 87 constraints, problems are : Problem set: 0 solved, 70 unsolved in 2131 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/131 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 25/87 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 70/157 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/131 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 157 constraints, problems are : Problem set: 0 solved, 70 unsolved in 6958 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9128ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 9128ms
Starting structural reductions in SI_CTL mode, iteration 1 : 60/100 places, 71/137 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9472 ms. Remains : 60/100 places, 71/137 transitions.
[2025-05-29 21:34:24] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:34:24] [INFO ] Flatten gal took : 3 ms
[2025-05-29 21:34:24] [INFO ] Input system was already deterministic with 71 transitions.
[2025-05-29 21:34:24] [INFO ] Flatten gal took : 3 ms
[2025-05-29 21:34:24] [INFO ] Flatten gal took : 3 ms
[2025-05-29 21:34:24] [INFO ] Time to serialize gal into /tmp/CTLFireability8030003400265558788.gal : 2 ms
[2025-05-29 21:34:24] [INFO ] Time to serialize properties into /tmp/CTLFireability16071978215309317523.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/CTLFireability8030003400265558788.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16071978215309317523.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.55019e+06,2.54878,50492,2,11827,5,172522,6,0,311,197171,0


Converting to forward existential form...Done !
original formula: EF(AG((EF(((s1>=1)&&(l149>=1))) + ((p22>=1)&&(l0>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((E(TRUE U ((s1>=1)&&(l149>=1))) + ((p22>=1)&&(l0>=1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t46, t51, t52, t53, t5...336
(forward)formula 0,0,16.1207,295212,1,0,203,1.36774e+06,164,85,2136,1.36294e+06,222
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 137/137 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 78 transition count 97
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 78 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 78 transition count 95
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 56 place count 68 transition count 85
Iterating global reduction 1 with 10 rules applied. Total rules applied 66 place count 68 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 68 place count 68 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 66 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 64 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 63 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 80 place count 63 transition count 73
Applied a total of 80 rules in 4 ms. Remains 63 /100 variables (removed 37) and now considering 73/137 (removed 64) transitions.
// Phase 1: matrix 73 rows 63 cols
[2025-05-29 21:34:40] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:34:40] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-05-29 21:34:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:34:41] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-29 21:34:41] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2025-05-29 21:34:41] [INFO ] Invariant cache hit.
[2025-05-29 21:34:41] [INFO ] State equation strengthened by 23 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 23/88 constraints. Problems are: Problem set: 0 solved, 72 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 88 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2426 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 23/88 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 72/160 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 160 constraints, problems are : Problem set: 0 solved, 72 unsolved in 6654 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9117ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 9118ms
Starting structural reductions in LTL mode, iteration 1 : 63/100 places, 73/137 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9366 ms. Remains : 63/100 places, 73/137 transitions.
[2025-05-29 21:34:50] [INFO ] Flatten gal took : 4 ms
[2025-05-29 21:34:50] [INFO ] Flatten gal took : 3 ms
[2025-05-29 21:34:50] [INFO ] Input system was already deterministic with 73 transitions.
[2025-05-29 21:34:50] [INFO ] Flatten gal took : 3 ms
[2025-05-29 21:34:50] [INFO ] Flatten gal took : 3 ms
[2025-05-29 21:34:50] [INFO ] Time to serialize gal into /tmp/CTLFireability9783496278393767006.gal : 1 ms
[2025-05-29 21:34:50] [INFO ] Time to serialize properties into /tmp/CTLFireability9500417596276731840.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/CTLFireability9783496278393767006.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9500417596276731840.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,5.15219e+06,5.08728,104224,2,14784,5,421659,6,0,325,378376,0


Converting to forward existential form...Done !
original formula: EF(EX(EX((EF(((s1>=1)&&(l485>=1))) * ((s1<1)||(l114<1))))))
=> equivalent forward existential formula: [(FwdU((EY(EY(FwdU(Init,TRUE))) * ((s1<1)||(l114<1))),TRUE) * ((s1>=1)&&(l485>=1)))] != FALSE
(forward)formula 0,1,5.54584,104224,1,0,11,421659,10,2,708,378376,6
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-29 21:34:55] [INFO ] Flatten gal took : 7 ms
[2025-05-29 21:34:55] [INFO ] Flatten gal took : 8 ms
[2025-05-29 21:34:55] [INFO ] Applying decomposition
[2025-05-29 21:34:55] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph88066993549039905.txt' '-o' '/tmp/graph88066993549039905.bin' '-w' '/tmp/graph88066993549039905.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph88066993549039905.bin' '-l' '-1' '-v' '-w' '/tmp/graph88066993549039905.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:34:55] [INFO ] Decomposing Gal with order
[2025-05-29 21:34:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:34:56] [INFO ] Removed a total of 138 redundant transitions.
[2025-05-29 21:34:56] [INFO ] Flatten gal took : 27 ms
[2025-05-29 21:34:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 99 labels/synchronizations in 7 ms.
[2025-05-29 21:34:56] [INFO ] Time to serialize gal into /tmp/CTLFireability3901535109747463166.gal : 3 ms
[2025-05-29 21:34:56] [INFO ] Time to serialize properties into /tmp/CTLFireability11778436039927199669.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3901535109747463166.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11778436039927199669.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 9 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.5067e+08,393.132,3623016,15185,3641,1.35028e+06,97409,381,3.59833e+07,161,1.53067e+06,0


Converting to forward existential form...Done !
original formula: (EX(((i0.u0.s1>=1)&&(i0.u10.l342>=1))) + (EF(((i0.u0.s1>=1)&&(i3.u7.l336>=1))) * (EX(AF(((i0.u10.p38>=1)&&(i4.u13.l136>=1)))) + AF(EG(AG(...193
=> equivalent forward existential formula: ([((Init * !(EX(((i0.u0.s1>=1)&&(i0.u10.l342>=1))))) * !(E(TRUE U ((i0.u0.s1>=1)&&(i3.u7.l336>=1)))))] = FALSE *...335
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t7, t8, t9, t26, t28, t29, t31, t33, t36, t56, t58, t59, t60, t61, t73, t74, t75, t78...549
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
[2025-05-29 22:00:21] [INFO ] Flatten gal took : 5 ms
[2025-05-29 22:00:21] [INFO ] Time to serialize gal into /tmp/CTLFireability2756757992677900718.gal : 1 ms
[2025-05-29 22:00:21] [INFO ] Time to serialize properties into /tmp/CTLFireability16442757437602988612.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/CTLFireability2756757992677900718.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16442757437602988612.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 9 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.5067e+08,50.8409,937740,2,63488,5,3.43587e+06,6,0,537,2.26518e+06,0


Converting to forward existential form...Done !
original formula: (EX(((s1>=1)&&(l342>=1))) + (EF(((s1>=1)&&(l336>=1))) * (EX(AF(((p38>=1)&&(l136>=1)))) + AF(EG(AG(((p35<1)||(l136<1))))))))
=> equivalent forward existential formula: ([((Init * !(EX(((s1>=1)&&(l342>=1))))) * !(E(TRUE U ((s1>=1)&&(l336>=1)))))] = FALSE * [FwdG(((Init * !(EX(((s1...270
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t19, t21, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35,...577
Using saturation style SCC detection
(forward)formula 0,0,308.692,2439852,1,0,423,1.54893e+07,15,278,2023,1.00951e+07,307
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AG((AX(((((p39<1)||(l137<1))&&(s1>=1))&&(l32>=1))) + (EF(!(E(((p23>=1)&&(l0>=1)) U ((p23>=1)&&(l0>=1))))) * E(AG(!(((s1>=1)&&(l124>=1))))...210
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * !((E(TRUE U !(E(((p23>=1)&&(l0>=1)) U ((p23>=1)&&(l0>=1))))) * E(!(E(TRUE U !(!(((s1>=1)...291
(forward)formula 1,0,413.387,3059544,1,0,492,1.55235e+07,25,315,2108,1.35459e+07,186
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: EX(AG(AX(((EG(((s1<1)||(l487<1))) + (s1<1)) + (l110<1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(EX(!(((EG(((s1<1)||(l487<1))) + (s1<1)) + (l110<1)))))))))] != FALSE
(forward)formula 2,0,522.334,3400504,1,0,492,2.10002e+07,13,315,2044,1.35459e+07,46
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (EX(AG(((EF(((s1<1)||(l504<1))) + (s1<1)) + (l150<1)))) + AF(((((!(E(AF(((s1>=1)&&(l149>=1))) U !(((s6>=1)&&(l0>=1))))) + (s1<1)) + (l355...232
=> equivalent forward existential formula: [FwdG((Init * !(EX(!(E(TRUE U !(((E(TRUE U ((s1<1)||(l504<1))) + (s1<1)) + (l150<1)))))))),!(((((!(E(!(EG(!(((s1...304
(forward)formula 3,1,575.101,3400504,1,0,492,2.10002e+07,35,315,2096,1.35459e+07,258
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AX(((AF(EX(E(((s1>=1)&&(l124>=1)) U ((s1>=1)&&(l127>=1))))) + AG(((s1>=1)&&(l33>=1)))) + ((s1>=1)&&(l337>=1))))
=> equivalent forward existential formula: [(FwdU(((EY(Init) * !(((s1>=1)&&(l337>=1)))) * !(!(EG(!(EX(E(((s1>=1)&&(l124>=1)) U ((s1>=1)&&(l127>=1))))))))),...195
Using saturation style SCC detection
(forward)formula 4,0,688.344,4617992,1,0,492,2.62099e+07,13,315,1733,1.68455e+07,2
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AF(EG((!(A(AX(((s1>=1)&&(l353>=1))) U !(((s1>=1)&&(l32>=1))))) * ((AG(((p35<1)||(l136<1))) + (((s1<1)||(l150<1))&&((p17<1)||(l126<1)))) +...200
=> equivalent forward existential formula: [FwdG(Init,!(EG((!(!((E(!(!(((s1>=1)&&(l32>=1)))) U (!(!(EX(!(((s1>=1)&&(l353>=1)))))) * !(!(((s1>=1)&&(l32>=1))...336
Using saturation style SCC detection
(forward)formula 5,0,766.776,4617992,1,0,492,2.62099e+07,37,315,2262,1.68455e+07,248
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: E((A(EF(((s1>=1)&&(l110>=1))) U E(((s1>=1)&&(l1>=1)) U AF(((p11>=1)&&(l154>=1))))) + ((s1>=1)&&(l37>=1))) U A((((AG(!((((s1>=1)&&(l485>=1...395
=> equivalent forward existential formula: [((FwdU(Init,(!((E(!(E(((s1>=1)&&(l1>=1)) U !(EG(!(((p11>=1)&&(l154>=1))))))) U (!(E(TRUE U ((s1>=1)&&(l110>=1))...759
Using saturation style SCC detection
(forward)formula 6,0,988.267,5069776,1,0,636,2.86716e+07,56,341,1969,1.91219e+07,830
FORMULA DBSingleClientW-PT-d0m08-CTLFireability-2025-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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-d0m08"
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-d0m08, 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-174854063400034"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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