About the Execution of ITS-Tools for DBSingleClientW-PT-d1m05
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 923855.00 | 0.00 | 0.00 | FTFFFFFTFFFFTTTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063500066.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-d1m05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063500066
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 872K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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 107K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 432K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2023-12
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2023-13
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2023-14
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2023-15
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2025-00
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2025-01
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2025-02
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2025-03
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2025-04
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2025-05
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2025-06
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2025-07
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2025-08
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2025-09
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2025-10
FORMULA_NAME DBSingleClientW-PT-d1m05-CTLFireability-2025-11
=== Now, execution of the tool begins
BK_START 1748568828084
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-d1m05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202505121319
[2025-05-30 01:33:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 01:33:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 01:33:51] [INFO ] Load time of PNML (sax parser for PT used): 329 ms
[2025-05-30 01:33:51] [INFO ] Transformed 1440 places.
[2025-05-30 01:33:51] [INFO ] Transformed 672 transitions.
[2025-05-30 01:33:51] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 568 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
Deduced a syphon composed of 1093 places in 13 ms
Reduce places removed 1093 places and 0 transitions.
Support contains 91 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 161 place count 266 transition count 496
Iterating global reduction 1 with 60 rules applied. Total rules applied 221 place count 266 transition count 496
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 230 place count 266 transition count 487
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 268 place count 228 transition count 449
Iterating global reduction 2 with 38 rules applied. Total rules applied 306 place count 228 transition count 449
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 317 place count 217 transition count 435
Iterating global reduction 2 with 11 rules applied. Total rules applied 328 place count 217 transition count 435
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 340 place count 217 transition count 423
Applied a total of 340 rules in 191 ms. Remains 217 /347 variables (removed 130) and now considering 423/672 (removed 249) transitions.
// Phase 1: matrix 423 rows 217 cols
[2025-05-30 01:33:51] [INFO ] Computed 2 invariants in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:33:52] [INFO ] Implicit Places using invariants in 732 ms returned []
[2025-05-30 01:33:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:33:52] [INFO ] State equation strengthened by 229 read => feed constraints.
[2025-05-30 01:33:54] [INFO ] Implicit Places using invariants and state equation in 1579 ms returned []
Implicit Place search using SMT with State Equation took 2390 ms to find 0 implicit places.
Running 422 sub problems to find dead transitions.
[2025-05-30 01:33:54] [INFO ] Invariant cache hit.
[2025-05-30 01:33:54] [INFO ] State equation strengthened by 229 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (OVERLAPS) 423/640 variables, 217/219 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 229/448 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 640/640 variables, and 448 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 217/217 constraints, ReadFeed: 229/229 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/216 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (OVERLAPS) 1/217 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/217 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (OVERLAPS) 423/640 variables, 217/219 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 229/448 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/640 variables, 422/870 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 640/640 variables, and 870 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 217/217 constraints, ReadFeed: 229/229 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61500ms problems are : Problem set: 0 solved, 422 unsolved
Search for dead transitions found 0 dead transitions in 61536ms
Starting structural reductions in LTL mode, iteration 1 : 217/347 places, 423/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64172 ms. Remains : 217/347 places, 423/672 transitions.
Support contains 91 out of 217 places after structural reductions.
[2025-05-30 01:34:56] [INFO ] Flatten gal took : 130 ms
[2025-05-30 01:34:56] [INFO ] Flatten gal took : 69 ms
[2025-05-30 01:34:56] [INFO ] Input system was already deterministic with 423 transitions.
Support contains 90 out of 217 places (down from 91) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 65 to 64
RANDOM walk for 40000 steps (9067 resets) in 3249 ms. (12 steps per ms) remains 51/64 properties
BEST_FIRST walk for 4003 steps (183 resets) in 43 ms. (90 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (172 resets) in 44 ms. (88 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (194 resets) in 39 ms. (100 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (186 resets) in 98 ms. (40 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (201 resets) in 55 ms. (71 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (168 resets) in 28 ms. (138 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (191 resets) in 25 ms. (153 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (199 resets) in 30 ms. (129 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (173 resets) in 20 ms. (190 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (392 resets) in 26 ms. (148 steps per ms) remains 50/51 properties
BEST_FIRST walk for 4003 steps (188 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (210 resets) in 41 ms. (95 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (186 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (202 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (178 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (208 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (206 resets) in 53 ms. (74 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (383 resets) in 43 ms. (90 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (182 resets) in 54 ms. (72 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (166 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (404 resets) in 36 ms. (108 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (199 resets) in 18 ms. (210 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (183 resets) in 27 ms. (142 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (417 resets) in 42 ms. (93 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (187 resets) in 21 ms. (182 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (181 resets) in 27 ms. (142 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (181 resets) in 27 ms. (142 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (195 resets) in 25 ms. (153 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (183 resets) in 43 ms. (90 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (177 resets) in 26 ms. (148 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (167 resets) in 31 ms. (125 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (194 resets) in 22 ms. (174 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (189 resets) in 24 ms. (160 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (191 resets) in 22 ms. (174 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (203 resets) in 35 ms. (111 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (186 resets) in 24 ms. (160 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (196 resets) in 20 ms. (190 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (183 resets) in 25 ms. (154 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4000 steps (800 resets) in 74 ms. (53 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (184 resets) in 24 ms. (160 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (202 resets) in 22 ms. (174 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (165 resets) in 29 ms. (133 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (175 resets) in 25 ms. (153 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (179 resets) in 21 ms. (181 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4001 steps (427 resets) in 30 ms. (129 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (180 resets) in 40 ms. (97 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (608 resets) in 44 ms. (88 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (383 resets) in 44 ms. (88 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (186 resets) in 38 ms. (102 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (171 resets) in 41 ms. (95 steps per ms) remains 50/50 properties
[2025-05-30 01:34:58] [INFO ] Invariant cache hit.
[2025-05-30 01:34:58] [INFO ] State equation strengthened by 229 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
At refinement iteration 1 (OVERLAPS) 67/136 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 45 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 38/174 variables, 1/2 constraints. Problems are: Problem set: 5 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 394/568 variables, 174/176 constraints. Problems are: Problem set: 5 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/568 variables, 200/376 constraints. Problems are: Problem set: 5 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 0/376 constraints. Problems are: Problem set: 5 solved, 45 unsolved
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp49 is UNSAT
At refinement iteration 8 (OVERLAPS) 72/640 variables, 43/419 constraints. Problems are: Problem set: 8 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/640 variables, 29/448 constraints. Problems are: Problem set: 8 solved, 42 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 640/640 variables, and 448 constraints, problems are : Problem set: 8 solved, 42 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 217/217 constraints, ReadFeed: 229/229 constraints, PredecessorRefiner: 50/49 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 42 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 72/124 variables, 1/1 constraints. Problems are: Problem set: 8 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:35:03] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 1/2 constraints. Problems are: Problem set: 8 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:35:04] [INFO ] Deduced a trap composed of 36 places in 125 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/3 constraints. Problems are: Problem set: 8 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/3 constraints. Problems are: Problem set: 8 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 43/167 variables, 1/4 constraints. Problems are: Problem set: 8 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:35:05] [INFO ] Deduced a trap composed of 74 places in 177 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:35:05] [INFO ] Deduced a trap composed of 75 places in 190 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:35:05] [INFO ] Deduced a trap composed of 75 places in 169 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:35:05] [INFO ] Deduced a trap composed of 75 places in 168 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:35:05] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 5/9 constraints. Problems are: Problem set: 8 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/9 constraints. Problems are: Problem set: 8 solved, 42 unsolved
At refinement iteration 8 (OVERLAPS) 385/552 variables, 167/176 constraints. Problems are: Problem set: 8 solved, 42 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/552 variables, 191/367 constraints. Problems are: Problem set: 8 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 1/368 constraints. Problems are: Problem set: 8 solved, 42 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:35:07] [INFO ] Deduced a trap composed of 75 places in 118 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/640 variables, and 369 constraints, problems are : Problem set: 8 solved, 42 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 167/217 constraints, ReadFeed: 191/229 constraints, PredecessorRefiner: 1/49 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10251ms problems are : Problem set: 8 solved, 42 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 52 out of 217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 217/217 places, 423/423 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 202 transition count 394
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 202 transition count 394
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 202 transition count 390
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 45 place count 191 transition count 379
Iterating global reduction 1 with 11 rules applied. Total rules applied 56 place count 191 transition count 379
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 60 place count 191 transition count 375
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 64 place count 187 transition count 368
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 187 transition count 368
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 73 place count 187 transition count 363
Applied a total of 73 rules in 128 ms. Remains 187 /217 variables (removed 30) and now considering 363/423 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 187/217 places, 363/423 transitions.
RANDOM walk for 40000 steps (9090 resets) in 1745 ms. (22 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (183 resets) in 40 ms. (97 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (182 resets) in 38 ms. (102 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (202 resets) in 39 ms. (100 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (190 resets) in 30 ms. (129 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (182 resets) in 34 ms. (114 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (202 resets) in 30 ms. (129 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (172 resets) in 25 ms. (154 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (180 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (186 resets) in 25 ms. (154 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (414 resets) in 35 ms. (111 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (191 resets) in 27 ms. (142 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (182 resets) in 31 ms. (125 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (175 resets) in 21 ms. (182 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (192 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (403 resets) in 51 ms. (76 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (202 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (187 resets) in 35 ms. (111 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (387 resets) in 34 ms. (114 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (189 resets) in 27 ms. (143 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (185 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (391 resets) in 46 ms. (85 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (186 resets) in 21 ms. (181 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (170 resets) in 28 ms. (137 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (187 resets) in 26 ms. (148 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (195 resets) in 25 ms. (153 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (187 resets) in 26 ms. (148 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (205 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (200 resets) in 31 ms. (125 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (191 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (203 resets) in 28 ms. (138 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (183 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (168 resets) in 23 ms. (166 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4000 steps (800 resets) in 50 ms. (78 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (168 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (189 resets) in 31 ms. (125 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (199 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (422 resets) in 25 ms. (153 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (187 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (633 resets) in 30 ms. (129 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (395 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (207 resets) in 21 ms. (181 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (210 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
Interrupted probabilistic random walk after 782744 steps, run timeout after 3001 ms. (steps per millisecond=260 ) properties seen :41 out of 42
Probabilistic random walk after 782744 steps, saw 281651 distinct states, run finished after 3009 ms. (steps per millisecond=260 ) properties seen :41
// Phase 1: matrix 363 rows 187 cols
[2025-05-30 01:35:12] [INFO ] Computed 2 invariants in 7 ms
[2025-05-30 01:35:12] [INFO ] State equation strengthened by 199 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) 68/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/119 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 198/317 variables, 119/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 34/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 211/528 variables, 57/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 154/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/528 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/550 variables, 11/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/550 variables, 11/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/550 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/550 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 550/550 variables, and 388 constraints, problems are : Problem set: 0 solved, 1 unsolved in 570 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, ReadFeed: 199/199 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) 68/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/119 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 198/317 variables, 119/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 34/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 211/528 variables, 57/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 154/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/528 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/528 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 22/550 variables, 11/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/550 variables, 11/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/550 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/550 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 550/550 variables, and 389 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2982 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, ReadFeed: 199/199 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3575ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 3 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 363/363 transitions.
Graph (complete) has 661 edges and 187 vertex of which 186 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 186 transition count 356
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 41 place count 153 transition count 231
Iterating global reduction 1 with 33 rules applied. Total rules applied 74 place count 153 transition count 231
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 80 place count 153 transition count 225
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 105 place count 128 transition count 197
Iterating global reduction 2 with 25 rules applied. Total rules applied 130 place count 128 transition count 197
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 138 place count 128 transition count 189
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 155 place count 111 transition count 161
Iterating global reduction 3 with 17 rules applied. Total rules applied 172 place count 111 transition count 161
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 180 place count 111 transition count 153
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 187 place count 104 transition count 144
Iterating global reduction 4 with 7 rules applied. Total rules applied 194 place count 104 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 195 place count 104 transition count 143
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 201 place count 98 transition count 137
Iterating global reduction 5 with 6 rules applied. Total rules applied 207 place count 98 transition count 137
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 211 place count 94 transition count 133
Iterating global reduction 5 with 4 rules applied. Total rules applied 215 place count 94 transition count 133
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 218 place count 94 transition count 130
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 220 place count 92 transition count 122
Iterating global reduction 6 with 2 rules applied. Total rules applied 222 place count 92 transition count 122
Applied a total of 222 rules in 56 ms. Remains 92 /187 variables (removed 95) and now considering 122/363 (removed 241) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 92/187 places, 122/363 transitions.
RANDOM walk for 40000 steps (9210 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1921 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 30930 steps, run visited all 1 properties in 51 ms. (steps per millisecond=606 )
Probabilistic random walk after 30930 steps, saw 13628 distinct states, run finished after 56 ms. (steps per millisecond=552 ) properties seen :1
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
FORMULA DBSingleClientW-PT-d1m05-CTLFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-30 01:35:16] [INFO ] Flatten gal took : 31 ms
[2025-05-30 01:35:16] [INFO ] Flatten gal took : 33 ms
[2025-05-30 01:35:16] [INFO ] Input system was already deterministic with 423 transitions.
Support contains 70 out of 217 places (down from 73) after GAL structural reductions.
Computed a total of 5 stabilizing places and 33 stable transitions
Graph (complete) has 852 edges and 217 vertex of which 216 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 423/423 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 172 transition count 288
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 172 transition count 288
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 106 place count 172 transition count 272
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 140 place count 138 transition count 237
Iterating global reduction 1 with 34 rules applied. Total rules applied 174 place count 138 transition count 237
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 186 place count 138 transition count 225
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 207 place count 117 transition count 186
Iterating global reduction 2 with 21 rules applied. Total rules applied 228 place count 117 transition count 186
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 241 place count 117 transition count 173
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 249 place count 109 transition count 160
Iterating global reduction 3 with 8 rules applied. Total rules applied 257 place count 109 transition count 160
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 261 place count 109 transition count 156
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 267 place count 103 transition count 150
Iterating global reduction 4 with 6 rules applied. Total rules applied 273 place count 103 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 275 place count 103 transition count 148
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 279 place count 99 transition count 144
Iterating global reduction 5 with 4 rules applied. Total rules applied 283 place count 99 transition count 144
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 284 place count 98 transition count 142
Iterating global reduction 5 with 1 rules applied. Total rules applied 285 place count 98 transition count 142
Applied a total of 285 rules in 78 ms. Remains 98 /217 variables (removed 119) and now considering 142/423 (removed 281) transitions.
// Phase 1: matrix 142 rows 98 cols
[2025-05-30 01:35:16] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:35:16] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-05-30 01:35:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:35:16] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-05-30 01:35:17] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:35:17] [INFO ] Redundant transitions in 8 ms returned []
Running 141 sub problems to find dead transitions.
[2025-05-30 01:35:17] [INFO ] Invariant cache hit.
[2025-05-30 01:35:17] [INFO ] State equation strengthened by 61 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (OVERLAPS) 142/240 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 61/161 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:35:25] [INFO ] Deduced a trap composed of 36 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:35:25] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:35:25] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 10 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/240 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:35:27] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:35:27] [INFO ] Deduced a trap composed of 36 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:35:27] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:35:27] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:35:28] [INFO ] Deduced a trap composed of 36 places in 126 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:35:28] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:35:28] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:35:28] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 19 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:35:31] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 11 (OVERLAPS) 0/240 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 173 constraints, problems are : Problem set: 0 solved, 141 unsolved in 20664 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (OVERLAPS) 142/240 variables, 98/112 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 61/173 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 141/314 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 10 (OVERLAPS) 0/240 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 314 constraints, problems are : Problem set: 0 solved, 141 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50794ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 50796ms
Starting structural reductions in SI_CTL mode, iteration 1 : 98/217 places, 142/423 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51453 ms. Remains : 98/217 places, 142/423 transitions.
[2025-05-30 01:36:08] [INFO ] Flatten gal took : 26 ms
[2025-05-30 01:36:08] [INFO ] Flatten gal took : 19 ms
[2025-05-30 01:36:08] [INFO ] Input system was already deterministic with 142 transitions.
[2025-05-30 01:36:08] [INFO ] Flatten gal took : 14 ms
[2025-05-30 01:36:08] [INFO ] Flatten gal took : 14 ms
[2025-05-30 01:36:08] [INFO ] Time to serialize gal into /tmp/CTLFireability4887352001752233929.gal : 8 ms
[2025-05-30 01:36:08] [INFO ] Time to serialize properties into /tmp/CTLFireability11629293646109662940.ctl : 6 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/CTLFireability4887352001752233929.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11629293646109662940.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,128850,2.27205,54828,2,10140,5,158436,6,0,534,151102,0
Converting to forward existential form...Done !
original formula: EF(!(A((((s1>=1)&&(l1282>=1)) + !(E(((s4>=1)&&(l0>=1)) U ((s1>=1)&&(l610>=1))))) U (((s1>=1)&&(l605>=1)) + (!(E(((s1>=1)&&(l608>=1)) U ((...211
=> equivalent forward existential formula: (([(FwdU(((FwdU(FwdU(Init,TRUE),!((((s1>=1)&&(l605>=1)) + (!(E(((s1>=1)&&(l608>=1)) U ((s1>=1)&&(l606>=1)))) * !...780
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t40, t41, t42, t43, t44, t45, t47, t48, t49, t50, t51, t52, t53, t...591
Hit Full ! (commute/partial/dont) 2/132/140
(forward)formula 0,0,5.28577,112628,1,0,322,408165,338,135,3861,263067,369
FORMULA DBSingleClientW-PT-d1m05-CTLFireability-2025-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 423/423 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 171 transition count 275
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 171 transition count 275
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 105 place count 171 transition count 262
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 139 place count 137 transition count 227
Iterating global reduction 1 with 34 rules applied. Total rules applied 173 place count 137 transition count 227
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 183 place count 137 transition count 217
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 203 place count 117 transition count 180
Iterating global reduction 2 with 20 rules applied. Total rules applied 223 place count 117 transition count 180
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 232 place count 117 transition count 171
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 239 place count 110 transition count 159
Iterating global reduction 3 with 7 rules applied. Total rules applied 246 place count 110 transition count 159
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 253 place count 103 transition count 152
Iterating global reduction 3 with 7 rules applied. Total rules applied 260 place count 103 transition count 152
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 262 place count 103 transition count 150
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 268 place count 97 transition count 144
Iterating global reduction 4 with 6 rules applied. Total rules applied 274 place count 97 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 276 place count 97 transition count 142
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 278 place count 95 transition count 134
Iterating global reduction 5 with 2 rules applied. Total rules applied 280 place count 95 transition count 134
Applied a total of 280 rules in 15 ms. Remains 95 /217 variables (removed 122) and now considering 134/423 (removed 289) transitions.
// Phase 1: matrix 134 rows 95 cols
[2025-05-30 01:36:13] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:36:13] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-05-30 01:36:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:36:13] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-05-30 01:36:14] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2025-05-30 01:36:14] [INFO ] Invariant cache hit.
[2025-05-30 01:36:14] [INFO ] State equation strengthened by 54 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (OVERLAPS) 134/229 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 54/151 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:36:18] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:36:19] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:36:19] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:36:19] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 4/155 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (OVERLAPS) 0/229 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 229/229 variables, and 155 constraints, problems are : Problem set: 0 solved, 133 unsolved in 11176 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/95 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 134/229 variables, 95/101 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/229 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/229 variables, 133/288 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/229 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 0/229 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 229/229 variables, and 288 constraints, problems are : Problem set: 0 solved, 133 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41237ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 41237ms
Starting structural reductions in LTL mode, iteration 1 : 95/217 places, 134/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41875 ms. Remains : 95/217 places, 134/423 transitions.
[2025-05-30 01:36:55] [INFO ] Flatten gal took : 12 ms
[2025-05-30 01:36:55] [INFO ] Flatten gal took : 13 ms
[2025-05-30 01:36:55] [INFO ] Input system was already deterministic with 134 transitions.
[2025-05-30 01:36:55] [INFO ] Flatten gal took : 7 ms
[2025-05-30 01:36:55] [INFO ] Flatten gal took : 22 ms
[2025-05-30 01:36:55] [INFO ] Time to serialize gal into /tmp/CTLFireability17108386647069842257.gal : 4 ms
[2025-05-30 01:36:55] [INFO ] Time to serialize properties into /tmp/CTLFireability1918127211576829268.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/CTLFireability17108386647069842257.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1918127211576829268.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,94326,1.3391,41652,2,7657,5,119392,6,0,514,91524,0
Converting to forward existential form...Done !
original formula: AF((((AF(EX(EF(((s1>=1)&&(l1029>=1))))) * EG(((s1<1)||(l3<1)))) * (EF(!(A(((s1>=1)&&(l1217>=1)) U ((s1>=1)&&(l1025>=1))))) * (s1>=1))) * ...166
=> equivalent forward existential formula: [FwdG(Init,!((((!(EG(!(EX(E(TRUE U ((s1>=1)&&(l1029>=1))))))) * EG(((s1<1)||(l3<1)))) * (E(TRUE U !(!((E(!(((s1>...300
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t48, t49, t50, t51, t52, t53, t58, t59, t61, t72, t...492
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,12.3344,304916,1,0,674,1.39236e+06,318,372,3691,1.21718e+06,754
FORMULA DBSingleClientW-PT-d1m05-CTLFireability-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 423/423 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 174 transition count 290
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 174 transition count 290
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 100 place count 174 transition count 276
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 134 place count 140 transition count 241
Iterating global reduction 1 with 34 rules applied. Total rules applied 168 place count 140 transition count 241
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 178 place count 140 transition count 231
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 198 place count 120 transition count 196
Iterating global reduction 2 with 20 rules applied. Total rules applied 218 place count 120 transition count 196
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 230 place count 120 transition count 184
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 237 place count 113 transition count 171
Iterating global reduction 3 with 7 rules applied. Total rules applied 244 place count 113 transition count 171
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 246 place count 113 transition count 169
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 252 place count 107 transition count 163
Iterating global reduction 4 with 6 rules applied. Total rules applied 258 place count 107 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 260 place count 107 transition count 161
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 265 place count 102 transition count 156
Iterating global reduction 5 with 5 rules applied. Total rules applied 270 place count 102 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 271 place count 102 transition count 155
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 272 place count 101 transition count 153
Iterating global reduction 6 with 1 rules applied. Total rules applied 273 place count 101 transition count 153
Applied a total of 273 rules in 15 ms. Remains 101 /217 variables (removed 116) and now considering 153/423 (removed 270) transitions.
// Phase 1: matrix 153 rows 101 cols
[2025-05-30 01:37:08] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:37:08] [INFO ] Implicit Places using invariants in 182 ms returned []
[2025-05-30 01:37:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:37:08] [INFO ] State equation strengthened by 65 read => feed constraints.
[2025-05-30 01:37:08] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2025-05-30 01:37:08] [INFO ] Invariant cache hit.
[2025-05-30 01:37:08] [INFO ] State equation strengthened by 65 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 153/254 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 65/168 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:37:15] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:37:15] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:37:18] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:37:18] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:37:24] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:37:24] [INFO ] Deduced a trap composed of 39 places in 118 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:37:25] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:37:25] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 9 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/254 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:37:30] [INFO ] Deduced a trap composed of 36 places in 135 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:37:31] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:37:31] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:37:31] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 11 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/254 variables, 4/180 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 254/254 variables, and 180 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 153/254 variables, 101/115 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 65/180 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 152/332 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/254 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 254/254 variables, and 332 constraints, problems are : Problem set: 0 solved, 152 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60175ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 60175ms
Starting structural reductions in LTL mode, iteration 1 : 101/217 places, 153/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60853 ms. Remains : 101/217 places, 153/423 transitions.
[2025-05-30 01:38:08] [INFO ] Flatten gal took : 18 ms
[2025-05-30 01:38:08] [INFO ] Flatten gal took : 14 ms
[2025-05-30 01:38:08] [INFO ] Input system was already deterministic with 153 transitions.
[2025-05-30 01:38:08] [INFO ] Flatten gal took : 12 ms
[2025-05-30 01:38:08] [INFO ] Flatten gal took : 11 ms
[2025-05-30 01:38:08] [INFO ] Time to serialize gal into /tmp/CTLFireability17505903248246911717.gal : 6 ms
[2025-05-30 01:38:08] [INFO ] Time to serialize properties into /tmp/CTLFireability12027530807240077269.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/CTLFireability17505903248246911717.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12027530807240077269.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,124100,2.26397,50820,2,9733,5,133276,6,0,557,142933,0
Converting to forward existential form...Done !
original formula: (AF(!(A(((!((s1>=1)&&(l610>=1)))&&(!((p41>=1)&&(l617>=1)))) U AX(((s1>=1)&&(l1028>=1)))))) * !(A(!((!(((p61>=1)&&(l621>=1))) + E(((s1>=1)...257
=> equivalent forward existential formula: ([FwdG(Init,!(!(!((E(!(!(EX(!(((s1>=1)&&(l1028>=1)))))) U (!(((!((s1>=1)&&(l610>=1)))&&(!((p41>=1)&&(l617>=1))))...617
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t29, t30, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t...629
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,11.9504,241164,1,0,428,1.05546e+06,344,189,3991,774271,492
FORMULA DBSingleClientW-PT-d1m05-CTLFireability-2025-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 423/423 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 174 transition count 284
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 174 transition count 284
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 97 place count 174 transition count 273
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 131 place count 140 transition count 238
Iterating global reduction 1 with 34 rules applied. Total rules applied 165 place count 140 transition count 238
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 176 place count 140 transition count 227
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 193 place count 123 transition count 198
Iterating global reduction 2 with 17 rules applied. Total rules applied 210 place count 123 transition count 198
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 219 place count 123 transition count 189
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 226 place count 116 transition count 176
Iterating global reduction 3 with 7 rules applied. Total rules applied 233 place count 116 transition count 176
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 235 place count 116 transition count 174
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 239 place count 112 transition count 170
Iterating global reduction 4 with 4 rules applied. Total rules applied 243 place count 112 transition count 170
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 247 place count 108 transition count 166
Iterating global reduction 4 with 4 rules applied. Total rules applied 251 place count 108 transition count 166
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 252 place count 107 transition count 164
Iterating global reduction 4 with 1 rules applied. Total rules applied 253 place count 107 transition count 164
Applied a total of 253 rules in 11 ms. Remains 107 /217 variables (removed 110) and now considering 164/423 (removed 259) transitions.
// Phase 1: matrix 164 rows 107 cols
[2025-05-30 01:38:21] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:38:21] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-05-30 01:38:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:38:21] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-05-30 01:38:21] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2025-05-30 01:38:21] [INFO ] Invariant cache hit.
[2025-05-30 01:38:21] [INFO ] State equation strengthened by 68 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/271 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 68/177 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:38:28] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 10 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (OVERLAPS) 0/271 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 178 constraints, problems are : Problem set: 0 solved, 163 unsolved in 12976 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/107 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 164/271 variables, 107/110 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 68/178 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 163/341 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 271/271 variables, and 341 constraints, problems are : Problem set: 0 solved, 163 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43127ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 43128ms
Starting structural reductions in LTL mode, iteration 1 : 107/217 places, 164/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43746 ms. Remains : 107/217 places, 164/423 transitions.
[2025-05-30 01:39:04] [INFO ] Flatten gal took : 13 ms
[2025-05-30 01:39:04] [INFO ] Flatten gal took : 13 ms
[2025-05-30 01:39:04] [INFO ] Input system was already deterministic with 164 transitions.
[2025-05-30 01:39:04] [INFO ] Flatten gal took : 12 ms
[2025-05-30 01:39:04] [INFO ] Flatten gal took : 12 ms
[2025-05-30 01:39:04] [INFO ] Time to serialize gal into /tmp/CTLFireability6947206067081394912.gal : 4 ms
[2025-05-30 01:39:04] [INFO ] Time to serialize properties into /tmp/CTLFireability11731018293148098029.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/CTLFireability6947206067081394912.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11731018293148098029.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,191928,3.56696,79944,2,13585,5,214278,6,0,592,238645,0
Converting to forward existential form...Done !
original formula: EF(((AG(((((s1<1)||(l608<1))||((s1<1)||(l1308<1)))||((s1>=1)&&(l1289>=1)))) * AF(((((s1<1)||(l945<1))&&((s1<1)||(l312<1)))||((p16>=1)&&(l...247
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(E(TRUE U !(((((s1<1)||(l608<1))||((s1<1)||(l1308<1)))||((s1>=1)&&(l1289>=1))))))) * !(EG...428
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t20, t22, t42, t44, t45, t46, t47, t48, t49, t50, t51, t53, t54, t55, t...698
(forward)formula 0,1,12.4694,254692,1,0,433,1.05656e+06,358,163,4251,668253,464
FORMULA DBSingleClientW-PT-d1m05-CTLFireability-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 423/423 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 169 transition count 261
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 169 transition count 261
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 107 place count 169 transition count 250
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 142 place count 134 transition count 214
Iterating global reduction 1 with 35 rules applied. Total rules applied 177 place count 134 transition count 214
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 187 place count 134 transition count 204
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 209 place count 112 transition count 164
Iterating global reduction 2 with 22 rules applied. Total rules applied 231 place count 112 transition count 164
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 240 place count 112 transition count 155
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 249 place count 103 transition count 139
Iterating global reduction 3 with 9 rules applied. Total rules applied 258 place count 103 transition count 139
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 262 place count 103 transition count 135
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 269 place count 96 transition count 128
Iterating global reduction 4 with 7 rules applied. Total rules applied 276 place count 96 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 278 place count 96 transition count 126
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 284 place count 90 transition count 120
Iterating global reduction 5 with 6 rules applied. Total rules applied 290 place count 90 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 292 place count 90 transition count 118
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 294 place count 88 transition count 110
Iterating global reduction 6 with 2 rules applied. Total rules applied 296 place count 88 transition count 110
Applied a total of 296 rules in 10 ms. Remains 88 /217 variables (removed 129) and now considering 110/423 (removed 313) transitions.
// Phase 1: matrix 110 rows 88 cols
[2025-05-30 01:39:17] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:39:17] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-05-30 01:39:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:39:17] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-05-30 01:39:17] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 109 sub problems to find dead transitions.
[2025-05-30 01:39:17] [INFO ] Invariant cache hit.
[2025-05-30 01:39:17] [INFO ] State equation strengthened by 35 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 125 constraints, problems are : Problem set: 0 solved, 109 unsolved in 5584 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/198 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 35/125 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 109/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 234 constraints, problems are : Problem set: 0 solved, 109 unsolved in 25202 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 88/88 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30825ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 30825ms
Starting structural reductions in LTL mode, iteration 1 : 88/217 places, 110/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31251 ms. Remains : 88/217 places, 110/423 transitions.
[2025-05-30 01:39:48] [INFO ] Flatten gal took : 9 ms
[2025-05-30 01:39:48] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:39:48] [INFO ] Input system was already deterministic with 110 transitions.
[2025-05-30 01:39:48] [INFO ] Flatten gal took : 9 ms
[2025-05-30 01:39:48] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:39:48] [INFO ] Time to serialize gal into /tmp/CTLFireability11304628108900513058.gal : 2 ms
[2025-05-30 01:39:48] [INFO ] Time to serialize properties into /tmp/CTLFireability13565024387105371181.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/CTLFireability11304628108900513058.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13565024387105371181.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,77688,1.04429,25072,2,5950,5,66232,6,0,462,63419,0
Converting to forward existential form...Done !
original formula: AF(EX(AF(((s1>=1)&&(l1217>=1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EG(!(((s1>=1)&&(l1217>=1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t52, t53, t55, t70, t77, t78, t79, t80, t81, t82, t...398
(forward)formula 0,0,8.70448,180740,1,0,478,785187,247,252,3197,731774,480
FORMULA DBSingleClientW-PT-d1m05-CTLFireability-2025-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 423/423 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 172 transition count 274
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 172 transition count 274
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 101 place count 172 transition count 263
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 133 place count 140 transition count 230
Iterating global reduction 1 with 32 rules applied. Total rules applied 165 place count 140 transition count 230
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 175 place count 140 transition count 220
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 194 place count 121 transition count 183
Iterating global reduction 2 with 19 rules applied. Total rules applied 213 place count 121 transition count 183
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 223 place count 121 transition count 173
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 232 place count 112 transition count 158
Iterating global reduction 3 with 9 rules applied. Total rules applied 241 place count 112 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 243 place count 112 transition count 156
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 250 place count 105 transition count 149
Iterating global reduction 4 with 7 rules applied. Total rules applied 257 place count 105 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 259 place count 105 transition count 147
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 264 place count 100 transition count 142
Iterating global reduction 5 with 5 rules applied. Total rules applied 269 place count 100 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 270 place count 100 transition count 141
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 271 place count 99 transition count 139
Iterating global reduction 6 with 1 rules applied. Total rules applied 272 place count 99 transition count 139
Applied a total of 272 rules in 22 ms. Remains 99 /217 variables (removed 118) and now considering 139/423 (removed 284) transitions.
// Phase 1: matrix 139 rows 99 cols
[2025-05-30 01:39:57] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:39:57] [INFO ] Implicit Places using invariants in 167 ms returned []
[2025-05-30 01:39:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:39:57] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-05-30 01:39:58] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2025-05-30 01:39:58] [INFO ] Invariant cache hit.
[2025-05-30 01:39:58] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/238 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 57/158 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:40:06] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:40:06] [INFO ] Deduced a trap composed of 14 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-30 01:40:06] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 12 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/238 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:40:08] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:40:09] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:40:09] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:40:09] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:40:09] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 15 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 5/166 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:40:12] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:40:12] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 18 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 2/168 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 11 (OVERLAPS) 0/238 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 168 constraints, problems are : Problem set: 0 solved, 138 unsolved in 19950 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 139/238 variables, 99/111 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 57/168 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 138/306 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 0/238 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 306 constraints, problems are : Problem set: 0 solved, 138 unsolved in 28361 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48392ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 48392ms
Starting structural reductions in LTL mode, iteration 1 : 99/217 places, 139/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48998 ms. Remains : 99/217 places, 139/423 transitions.
[2025-05-30 01:40:46] [INFO ] Flatten gal took : 6 ms
[2025-05-30 01:40:46] [INFO ] Flatten gal took : 6 ms
[2025-05-30 01:40:46] [INFO ] Input system was already deterministic with 139 transitions.
[2025-05-30 01:40:46] [INFO ] Flatten gal took : 6 ms
[2025-05-30 01:40:46] [INFO ] Flatten gal took : 5 ms
[2025-05-30 01:40:46] [INFO ] Time to serialize gal into /tmp/CTLFireability2211541335669967485.gal : 2 ms
[2025-05-30 01:40:46] [INFO ] Time to serialize properties into /tmp/CTLFireability30224656753618969.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/CTLFireability2211541335669967485.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability30224656753618969.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,128097,2.41962,51756,2,10506,5,145176,6,0,535,151570,0
Converting to forward existential form...Done !
original formula: AG(((EF(((s1<1)||(l1289<1))) + ((s1>=1)&&(l957>=1))) * (AF(EX(A(((s1>=1)&&(l610>=1)) U ((s1>=1)&&(l519>=1))))) + ((p21>=1)&&(l0>=1)))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(((s1>=1)&&(l957>=1)))) * !(E(TRUE U ((s1<1)||(l1289<1)))))] = FALSE * [FwdG((FwdU(Init,T...319
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t40, t42, t43, t44, t45, t46, t47, t48, t49, t51, t52, t53, t54, t55, t...584
(forward)formula 0,0,11.5286,245160,1,0,384,1.14367e+06,311,155,3724,870378,411
FORMULA DBSingleClientW-PT-d1m05-CTLFireability-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 423/423 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 172 transition count 282
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 172 transition count 282
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 103 place count 172 transition count 269
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 138 place count 137 transition count 233
Iterating global reduction 1 with 35 rules applied. Total rules applied 173 place count 137 transition count 233
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 185 place count 137 transition count 221
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 207 place count 115 transition count 180
Iterating global reduction 2 with 22 rules applied. Total rules applied 229 place count 115 transition count 180
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 242 place count 115 transition count 167
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 250 place count 107 transition count 153
Iterating global reduction 3 with 8 rules applied. Total rules applied 258 place count 107 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 260 place count 107 transition count 151
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 266 place count 101 transition count 145
Iterating global reduction 4 with 6 rules applied. Total rules applied 272 place count 101 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 273 place count 101 transition count 144
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 277 place count 97 transition count 140
Iterating global reduction 5 with 4 rules applied. Total rules applied 281 place count 97 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 283 place count 97 transition count 138
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 284 place count 96 transition count 136
Iterating global reduction 6 with 1 rules applied. Total rules applied 285 place count 96 transition count 136
Applied a total of 285 rules in 12 ms. Remains 96 /217 variables (removed 121) and now considering 136/423 (removed 287) transitions.
// Phase 1: matrix 136 rows 96 cols
[2025-05-30 01:40:58] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:40:58] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-05-30 01:40:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:40:58] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-05-30 01:40:58] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Running 135 sub problems to find dead transitions.
[2025-05-30 01:40:58] [INFO ] Invariant cache hit.
[2025-05-30 01:40:58] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 136/232 variables, 96/98 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 57/155 constraints. Problems are: Problem set: 0 solved, 135 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:41:03] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:41:04] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:41:04] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 3/158 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (OVERLAPS) 0/232 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 158 constraints, problems are : Problem set: 0 solved, 135 unsolved in 13676 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 136/232 variables, 96/101 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/232 variables, 57/158 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 135/293 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 135 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 232/232 variables, and 293 constraints, problems are : Problem set: 0 solved, 135 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 96/96 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43743ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 43744ms
Starting structural reductions in LTL mode, iteration 1 : 96/217 places, 136/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44304 ms. Remains : 96/217 places, 136/423 transitions.
[2025-05-30 01:41:42] [INFO ] Flatten gal took : 9 ms
[2025-05-30 01:41:42] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:41:42] [INFO ] Input system was already deterministic with 136 transitions.
[2025-05-30 01:41:42] [INFO ] Flatten gal took : 5 ms
[2025-05-30 01:41:42] [INFO ] Flatten gal took : 6 ms
[2025-05-30 01:41:42] [INFO ] Time to serialize gal into /tmp/CTLFireability10115010190185513687.gal : 2 ms
[2025-05-30 01:41:42] [INFO ] Time to serialize properties into /tmp/CTLFireability8942450797229360256.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/CTLFireability10115010190185513687.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8942450797229360256.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,109436,1.47854,39276,2,9032,5,108094,6,0,520,107686,0
Converting to forward existential form...Done !
original formula: EX(AF(((AF(((s1>=1)&&(l454>=1))) * AF(((p97>=1)&&(l0>=1)))) * (AG(((s1>=1)&&(l606>=1))) + A(((s1>=1)&&(l1282>=1)) U ((s1>=1)&&(l608>=1)))...159
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(((!(EG(!(((s1>=1)&&(l454>=1))))) * !(EG(!(((p97>=1)&&(l0>=1)))))) * (!(E(TRUE U !(((s1>=1)&&...303
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t32, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t...573
(forward)formula 0,0,12.7412,269076,1,0,516,1.27814e+06,319,222,3674,1.05977e+06,666
FORMULA DBSingleClientW-PT-d1m05-CTLFireability-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 423/423 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 178 transition count 291
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 178 transition count 291
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 87 place count 178 transition count 282
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 115 place count 150 transition count 253
Iterating global reduction 1 with 28 rules applied. Total rules applied 143 place count 150 transition count 253
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 149 place count 150 transition count 247
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 164 place count 135 transition count 219
Iterating global reduction 2 with 15 rules applied. Total rules applied 179 place count 135 transition count 219
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 188 place count 135 transition count 210
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 192 place count 131 transition count 204
Iterating global reduction 3 with 4 rules applied. Total rules applied 196 place count 131 transition count 204
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 200 place count 127 transition count 200
Iterating global reduction 3 with 4 rules applied. Total rules applied 204 place count 127 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 206 place count 127 transition count 198
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 209 place count 124 transition count 195
Iterating global reduction 4 with 3 rules applied. Total rules applied 212 place count 124 transition count 195
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 214 place count 124 transition count 193
Applied a total of 214 rules in 43 ms. Remains 124 /217 variables (removed 93) and now considering 193/423 (removed 230) transitions.
// Phase 1: matrix 193 rows 124 cols
[2025-05-30 01:41:55] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:41:55] [INFO ] Implicit Places using invariants in 205 ms returned []
[2025-05-30 01:41:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:41:55] [INFO ] State equation strengthened by 84 read => feed constraints.
[2025-05-30 01:41:56] [INFO ] Implicit Places using invariants and state equation in 793 ms returned []
Implicit Place search using SMT with State Equation took 1000 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:41:56] [INFO ] Redundant transitions in 8 ms returned []
Running 192 sub problems to find dead transitions.
[2025-05-30 01:41:56] [INFO ] Invariant cache hit.
[2025-05-30 01:41:56] [INFO ] State equation strengthened by 84 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/317 variables, 124/126 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 84/210 constraints. Problems are: Problem set: 0 solved, 192 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (OVERLAPS) 0/317 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 210 constraints, problems are : Problem set: 0 solved, 192 unsolved in 14492 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/317 variables, 124/126 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 84/210 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 192/402 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/317 variables, and 402 constraints, problems are : Problem set: 0 solved, 192 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44618ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 44619ms
Starting structural reductions in SI_CTL mode, iteration 1 : 124/217 places, 193/423 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45677 ms. Remains : 124/217 places, 193/423 transitions.
[2025-05-30 01:42:41] [INFO ] Flatten gal took : 11 ms
[2025-05-30 01:42:41] [INFO ] Flatten gal took : 11 ms
[2025-05-30 01:42:41] [INFO ] Input system was already deterministic with 193 transitions.
[2025-05-30 01:42:41] [INFO ] Flatten gal took : 10 ms
[2025-05-30 01:42:41] [INFO ] Flatten gal took : 10 ms
[2025-05-30 01:42:41] [INFO ] Time to serialize gal into /tmp/CTLFireability16130101845399935135.gal : 3 ms
[2025-05-30 01:42:41] [INFO ] Time to serialize properties into /tmp/CTLFireability17626322453782043588.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/CTLFireability16130101845399935135.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17626322453782043588.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,262451,5.13012,112400,2,15328,5,306270,6,0,689,241419,0
Converting to forward existential form...Done !
original formula: !(A((((!((((AF(((s1>=1)&&(l301>=1))) * EG(((s1>=1)&&(l306>=1)))) * (EF(((s1>=1)&&(l445>=1))) * (p106>=1))) * ((l0>=1)&&(!((s1>=1)&&(l1217...330
=> equivalent forward existential formula: ([((FwdU(Init,!(E(!(E(TRUE U (((s1>=1)&&(l1025>=1))&&((s1>=1)&&(l1241>=1))))) U EG(!((((s1>=1)&&(l462>=1))||((s1...669
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t17, t20, t21, t31, t32, t33, t36, t41, t42, t43, t45, t53, t54, t56, t...788
(forward)formula 0,0,25.9131,550968,1,0,653,2.72696e+06,439,281,4803,1.71021e+06,753
FORMULA DBSingleClientW-PT-d1m05-CTLFireability-2025-07 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 : 217/217 places, 423/423 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 171 transition count 271
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 171 transition count 271
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 103 place count 171 transition count 260
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 136 place count 138 transition count 226
Iterating global reduction 1 with 33 rules applied. Total rules applied 169 place count 138 transition count 226
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 177 place count 138 transition count 218
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 198 place count 117 transition count 179
Iterating global reduction 2 with 21 rules applied. Total rules applied 219 place count 117 transition count 179
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 229 place count 117 transition count 169
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 237 place count 109 transition count 156
Iterating global reduction 3 with 8 rules applied. Total rules applied 245 place count 109 transition count 156
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 247 place count 109 transition count 154
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 254 place count 102 transition count 147
Iterating global reduction 4 with 7 rules applied. Total rules applied 261 place count 102 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 263 place count 102 transition count 145
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 268 place count 97 transition count 140
Iterating global reduction 5 with 5 rules applied. Total rules applied 273 place count 97 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 275 place count 97 transition count 138
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 277 place count 95 transition count 130
Iterating global reduction 6 with 2 rules applied. Total rules applied 279 place count 95 transition count 130
Applied a total of 279 rules in 13 ms. Remains 95 /217 variables (removed 122) and now considering 130/423 (removed 293) transitions.
// Phase 1: matrix 130 rows 95 cols
[2025-05-30 01:43:07] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:43:07] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-05-30 01:43:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:43:07] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-05-30 01:43:08] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
Running 129 sub problems to find dead transitions.
[2025-05-30 01:43:08] [INFO ] Invariant cache hit.
[2025-05-30 01:43:08] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/225 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 49/146 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/225 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 146 constraints, problems are : Problem set: 0 solved, 129 unsolved in 6549 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/225 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/225 variables, 49/146 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/225 variables, 129/275 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/225 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/225 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 275 constraints, problems are : Problem set: 0 solved, 129 unsolved in 29124 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35754ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 35755ms
Starting structural reductions in LTL mode, iteration 1 : 95/217 places, 130/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36417 ms. Remains : 95/217 places, 130/423 transitions.
[2025-05-30 01:43:43] [INFO ] Flatten gal took : 6 ms
[2025-05-30 01:43:43] [INFO ] Flatten gal took : 7 ms
[2025-05-30 01:43:43] [INFO ] Input system was already deterministic with 130 transitions.
[2025-05-30 01:43:43] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:43:43] [INFO ] Flatten gal took : 6 ms
[2025-05-30 01:43:43] [INFO ] Time to serialize gal into /tmp/CTLFireability18006004912384296559.gal : 3 ms
[2025-05-30 01:43:43] [INFO ] Time to serialize properties into /tmp/CTLFireability9538249681162055016.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/CTLFireability18006004912384296559.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9538249681162055016.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,111324,1.96236,46276,2,6800,5,143200,6,0,510,116676,0
Converting to forward existential form...Done !
original formula: AX((EG((((p40>=1)&&(l616>=1)) + EX(((s1<1)||(l1021<1))))) * (EF(AG(((s1<1)||(l1282<1)))) + ((s1>=1)&&(l1215>=1)))))
=> equivalent forward existential formula: ([(EY(Init) * !(EG((((p40>=1)&&(l616>=1)) + EX(((s1<1)||(l1021<1)))))))] = FALSE * [((EY(Init) * !(((s1>=1)&&(l1...227
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t55, t63, t64, t65, t66, t67, t80, t85, t86, t87, t...473
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,8.59266,177716,1,0,380,867745,292,171,3657,605716,437
FORMULA DBSingleClientW-PT-d1m05-CTLFireability-2025-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 423/423 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 169 transition count 267
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 169 transition count 267
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 107 place count 169 transition count 256
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 143 place count 133 transition count 219
Iterating global reduction 1 with 36 rules applied. Total rules applied 179 place count 133 transition count 219
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 190 place count 133 transition count 208
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 213 place count 110 transition count 166
Iterating global reduction 2 with 23 rules applied. Total rules applied 236 place count 110 transition count 166
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 249 place count 110 transition count 153
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 259 place count 100 transition count 136
Iterating global reduction 3 with 10 rules applied. Total rules applied 269 place count 100 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 271 place count 100 transition count 134
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 279 place count 92 transition count 126
Iterating global reduction 4 with 8 rules applied. Total rules applied 287 place count 92 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 289 place count 92 transition count 124
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 295 place count 86 transition count 118
Iterating global reduction 5 with 6 rules applied. Total rules applied 301 place count 86 transition count 118
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 304 place count 86 transition count 115
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 306 place count 84 transition count 107
Iterating global reduction 6 with 2 rules applied. Total rules applied 308 place count 84 transition count 107
Applied a total of 308 rules in 29 ms. Remains 84 /217 variables (removed 133) and now considering 107/423 (removed 316) transitions.
// Phase 1: matrix 107 rows 84 cols
[2025-05-30 01:43:52] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:43:52] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-05-30 01:43:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:43:52] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-05-30 01:43:52] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:43:52] [INFO ] Redundant transitions in 2 ms returned []
Running 106 sub problems to find dead transitions.
[2025-05-30 01:43:52] [INFO ] Invariant cache hit.
[2025-05-30 01:43:52] [INFO ] State equation strengthened by 37 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/191 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 37/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:43:56] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:43:56] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 125 constraints, problems are : Problem set: 0 solved, 106 unsolved in 8055 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/191 variables, 84/88 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 37/125 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 106/231 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/191 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 231 constraints, problems are : Problem set: 0 solved, 106 unsolved in 19318 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27420ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 27421ms
Starting structural reductions in SI_CTL mode, iteration 1 : 84/217 places, 107/423 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27843 ms. Remains : 84/217 places, 107/423 transitions.
[2025-05-30 01:44:20] [INFO ] Flatten gal took : 4 ms
[2025-05-30 01:44:20] [INFO ] Flatten gal took : 3 ms
[2025-05-30 01:44:20] [INFO ] Input system was already deterministic with 107 transitions.
[2025-05-30 01:44:20] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:44:20] [INFO ] Flatten gal took : 4 ms
[2025-05-30 01:44:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10388794526677191816.gal : 2 ms
[2025-05-30 01:44:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4821801113207454991.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10388794526677191816.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4821801113207454991.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (9169 resets) in 218 ms. (182 steps per ms) remains 1/1 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40003 steps (1872 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality4821801113207454991.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 20
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :20 after 46
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :46 after 96
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :96 after 182
Finished probabilistic random walk after 12957 steps, run visited all 1 properties in 33 ms. (steps per millisecond=392 )
Probabilistic random walk after 12957 steps, saw 6066 distinct states, run finished after 33 ms. (steps per millisecond=392 ) properties seen :1
FORMULA DBSingleClientW-PT-d1m05-CTLFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :182 after 382
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 217/217 places, 423/423 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 169 transition count 259
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 169 transition count 259
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 104 place count 169 transition count 251
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 139 place count 134 transition count 215
Iterating global reduction 1 with 35 rules applied. Total rules applied 174 place count 134 transition count 215
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 184 place count 134 transition count 205
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 205 place count 113 transition count 165
Iterating global reduction 2 with 21 rules applied. Total rules applied 226 place count 113 transition count 165
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 236 place count 113 transition count 155
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 245 place count 104 transition count 142
Iterating global reduction 3 with 9 rules applied. Total rules applied 254 place count 104 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 256 place count 104 transition count 140
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 263 place count 97 transition count 133
Iterating global reduction 4 with 7 rules applied. Total rules applied 270 place count 97 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 272 place count 97 transition count 131
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 277 place count 92 transition count 126
Iterating global reduction 5 with 5 rules applied. Total rules applied 282 place count 92 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 285 place count 92 transition count 123
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 287 place count 90 transition count 115
Iterating global reduction 6 with 2 rules applied. Total rules applied 289 place count 90 transition count 115
Applied a total of 289 rules in 37 ms. Remains 90 /217 variables (removed 127) and now considering 115/423 (removed 308) transitions.
// Phase 1: matrix 115 rows 90 cols
[2025-05-30 01:44:20] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:44:20] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-05-30 01:44:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:44:20] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-30 01:44:21] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:44:21] [INFO ] Redundant transitions in 2 ms returned []
Running 114 sub problems to find dead transitions.
[2025-05-30 01:44:21] [INFO ] Invariant cache hit.
[2025-05-30 01:44:21] [INFO ] State equation strengthened by 38 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 115/205 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 38/130 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 0/205 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 130 constraints, problems are : Problem set: 0 solved, 114 unsolved in 6310 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 115/205 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 38/130 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 114/244 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 0/205 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 244 constraints, problems are : Problem set: 0 solved, 114 unsolved in 28117 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 34490ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 34491ms
Starting structural reductions in SI_CTL mode, iteration 1 : 90/217 places, 115/423 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35100 ms. Remains : 90/217 places, 115/423 transitions.
[2025-05-30 01:44:55] [INFO ] Flatten gal took : 5 ms
[2025-05-30 01:44:55] [INFO ] Flatten gal took : 6 ms
[2025-05-30 01:44:55] [INFO ] Input system was already deterministic with 115 transitions.
[2025-05-30 01:44:55] [INFO ] Flatten gal took : 6 ms
[2025-05-30 01:44:55] [INFO ] Flatten gal took : 6 ms
[2025-05-30 01:44:55] [INFO ] Time to serialize gal into /tmp/CTLFireability14337418101586383430.gal : 1 ms
[2025-05-30 01:44:55] [INFO ] Time to serialize properties into /tmp/CTLFireability3150223160574054538.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/CTLFireability14337418101586383430.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3150223160574054538.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,92267,1.64849,36152,2,7241,5,103604,6,0,475,101164,0
Converting to forward existential form...Done !
original formula: EG(((s1<1)||(l1241<1)))
=> equivalent forward existential formula: [FwdG(Init,((s1<1)||(l1241<1)))] != FALSE
Hit Full ! (commute/partial/dont) 2/0/113
(forward)formula 0,1,5.94336,110152,1,0,20,411620,19,4,2510,294091,16
FORMULA DBSingleClientW-PT-d1m05-CTLFireability-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 423/423 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 175 transition count 304
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 175 transition count 304
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 102 place count 175 transition count 286
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 134 place count 143 transition count 253
Iterating global reduction 1 with 32 rules applied. Total rules applied 166 place count 143 transition count 253
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 178 place count 143 transition count 241
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 197 place count 124 transition count 206
Iterating global reduction 2 with 19 rules applied. Total rules applied 216 place count 124 transition count 206
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 226 place count 124 transition count 196
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 233 place count 117 transition count 186
Iterating global reduction 3 with 7 rules applied. Total rules applied 240 place count 117 transition count 186
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 248 place count 117 transition count 178
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 252 place count 113 transition count 174
Iterating global reduction 4 with 4 rules applied. Total rules applied 256 place count 113 transition count 174
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 258 place count 113 transition count 172
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 261 place count 110 transition count 169
Iterating global reduction 5 with 3 rules applied. Total rules applied 264 place count 110 transition count 169
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 266 place count 108 transition count 161
Iterating global reduction 5 with 2 rules applied. Total rules applied 268 place count 108 transition count 161
Applied a total of 268 rules in 27 ms. Remains 108 /217 variables (removed 109) and now considering 161/423 (removed 262) transitions.
// Phase 1: matrix 161 rows 108 cols
[2025-05-30 01:45:01] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:45:01] [INFO ] Implicit Places using invariants in 158 ms returned []
[2025-05-30 01:45:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:45:02] [INFO ] State equation strengthened by 68 read => feed constraints.
[2025-05-30 01:45:02] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 801 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2025-05-30 01:45:02] [INFO ] Invariant cache hit.
[2025-05-30 01:45:02] [INFO ] State equation strengthened by 68 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (OVERLAPS) 161/269 variables, 108/110 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 68/178 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:45:09] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:45:09] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:45:09] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 20 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:45:15] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:45:15] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:45:15] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 13 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/269 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:45:19] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 22 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:45:24] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:45:24] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:45:24] [INFO ] Deduced a trap composed of 41 places in 141 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/269 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:45:31] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 7 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/269 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 269/269 variables, and 189 constraints, problems are : Problem set: 0 solved, 160 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 161/269 variables, 108/121 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 68/189 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 160/349 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/269 variables, and 349 constraints, problems are : Problem set: 0 solved, 160 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 108/108 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60178ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 60179ms
Starting structural reductions in LTL mode, iteration 1 : 108/217 places, 161/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61009 ms. Remains : 108/217 places, 161/423 transitions.
[2025-05-30 01:46:02] [INFO ] Flatten gal took : 9 ms
[2025-05-30 01:46:02] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:46:02] [INFO ] Input system was already deterministic with 161 transitions.
[2025-05-30 01:46:02] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:46:02] [INFO ] Flatten gal took : 8 ms
[2025-05-30 01:46:02] [INFO ] Time to serialize gal into /tmp/CTLFireability14676575845294289548.gal : 3 ms
[2025-05-30 01:46:02] [INFO ] Time to serialize properties into /tmp/CTLFireability10891163353955766115.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/CTLFireability14676575845294289548.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10891163353955766115.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,189495,2.9422,71868,2,10713,5,185302,6,0,593,174013,0
Converting to forward existential form...Done !
original formula: A((EX(!(AF(E(((s1>=1)&&(l951>=1)) U ((s1>=1)&&(l610>=1)))))) * (EX(EX((((p68>=1)&&(l618>=1))||((s1>=1)&&(l1226>=1))))) + (!(((s1>=1)&&(l1...303
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(((s1>=1)&&(l608>=1))))))))) * !(E(!(!(EX(!(((s1>=1)&&(l608>=1)))))) U (!((EX(!(!(EG(!(E(...458
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t...640
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,23.2474,505640,1,0,930,2.57194e+06,370,526,4276,1.85774e+06,942
FORMULA DBSingleClientW-PT-d1m05-CTLFireability-2023-12 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 : 217/217 places, 423/423 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 175 transition count 293
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 175 transition count 293
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 96 place count 175 transition count 281
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 127 place count 144 transition count 249
Iterating global reduction 1 with 31 rules applied. Total rules applied 158 place count 144 transition count 249
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 169 place count 144 transition count 238
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 185 place count 128 transition count 210
Iterating global reduction 2 with 16 rules applied. Total rules applied 201 place count 128 transition count 210
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 211 place count 128 transition count 200
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 216 place count 123 transition count 192
Iterating global reduction 3 with 5 rules applied. Total rules applied 221 place count 123 transition count 192
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 227 place count 123 transition count 186
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 229 place count 121 transition count 184
Iterating global reduction 4 with 2 rules applied. Total rules applied 231 place count 121 transition count 184
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 233 place count 119 transition count 182
Iterating global reduction 4 with 2 rules applied. Total rules applied 235 place count 119 transition count 182
Applied a total of 235 rules in 14 ms. Remains 119 /217 variables (removed 98) and now considering 182/423 (removed 241) transitions.
// Phase 1: matrix 182 rows 119 cols
[2025-05-30 01:46:26] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:46:26] [INFO ] Implicit Places using invariants in 121 ms returned []
[2025-05-30 01:46:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:46:26] [INFO ] State equation strengthened by 71 read => feed constraints.
[2025-05-30 01:46:26] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2025-05-30 01:46:26] [INFO ] Invariant cache hit.
[2025-05-30 01:46:26] [INFO ] State equation strengthened by 71 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/301 variables, 119/121 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 71/192 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:46:40] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:46:40] [INFO ] Deduced a trap composed of 14 places in 160 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:46:40] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:46:40] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:46:40] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:46:41] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:46:41] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:46:41] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:46:41] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 14 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/301 variables, 9/201 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:46:46] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:46:52] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 301/301 variables, and 203 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 119/119 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/119 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 182/301 variables, 119/132 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 71/203 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 181/384 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 301/301 variables, and 384 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 119/119 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60175ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 60176ms
Starting structural reductions in LTL mode, iteration 1 : 119/217 places, 182/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60854 ms. Remains : 119/217 places, 182/423 transitions.
[2025-05-30 01:47:27] [INFO ] Flatten gal took : 5 ms
[2025-05-30 01:47:27] [INFO ] Flatten gal took : 5 ms
[2025-05-30 01:47:27] [INFO ] Input system was already deterministic with 182 transitions.
[2025-05-30 01:47:27] [INFO ] Flatten gal took : 6 ms
[2025-05-30 01:47:27] [INFO ] Flatten gal took : 6 ms
[2025-05-30 01:47:27] [INFO ] Time to serialize gal into /tmp/CTLFireability18028601025181177204.gal : 2 ms
[2025-05-30 01:47:27] [INFO ] Time to serialize properties into /tmp/CTLFireability14441386716829811099.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/CTLFireability18028601025181177204.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14441386716829811099.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,277788,3.73449,91168,2,12671,5,267127,6,0,658,241339,0
Converting to forward existential form...Done !
original formula: EF((EX(AF(((s1>=1)&&(l606>=1)))) * EX(((EX(((s1<1)||(l1305<1))) + E(((s1>=1)&&(l1307>=1)) U ((s1>=1)&&(l1255>=1)))) + (AG(((s1>=1)&&(l122...318
=> equivalent forward existential formula: (([(EY(EY((FwdU(Init,TRUE) * EX(!(EG(!(((s1>=1)&&(l606>=1))))))))) * ((s1<1)||(l1305<1)))] != FALSE + [(FwdU(EY(...961
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t17, t29, t31, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t...739
(forward)formula 0,1,17.4431,364828,1,0,441,1.813e+06,388,172,4685,1.04898e+06,491
FORMULA DBSingleClientW-PT-d1m05-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 : 217/217 places, 423/423 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 170 transition count 265
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 170 transition count 265
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 103 place count 170 transition count 256
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 139 place count 134 transition count 219
Iterating global reduction 1 with 36 rules applied. Total rules applied 175 place count 134 transition count 219
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 186 place count 134 transition count 208
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 209 place count 111 transition count 166
Iterating global reduction 2 with 23 rules applied. Total rules applied 232 place count 111 transition count 166
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 242 place count 111 transition count 156
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 252 place count 101 transition count 139
Iterating global reduction 3 with 10 rules applied. Total rules applied 262 place count 101 transition count 139
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 264 place count 101 transition count 137
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 272 place count 93 transition count 129
Iterating global reduction 4 with 8 rules applied. Total rules applied 280 place count 93 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 282 place count 93 transition count 127
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 288 place count 87 transition count 121
Iterating global reduction 5 with 6 rules applied. Total rules applied 294 place count 87 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 297 place count 87 transition count 118
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 299 place count 85 transition count 110
Iterating global reduction 6 with 2 rules applied. Total rules applied 301 place count 85 transition count 110
Applied a total of 301 rules in 24 ms. Remains 85 /217 variables (removed 132) and now considering 110/423 (removed 313) transitions.
// Phase 1: matrix 110 rows 85 cols
[2025-05-30 01:47:44] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:47:44] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-05-30 01:47:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:47:45] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-30 01:47:45] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 01:47:45] [INFO ] Redundant transitions in 2 ms returned []
Running 109 sub problems to find dead transitions.
[2025-05-30 01:47:45] [INFO ] Invariant cache hit.
[2025-05-30 01:47:45] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (OVERLAPS) 110/195 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 40/127 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:47:49] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:47:49] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:47:49] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:47:52] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 11 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/195 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 01:47:55] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 14 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/195 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 12 (OVERLAPS) 0/195 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 132 constraints, problems are : Problem set: 0 solved, 109 unsolved in 15791 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 110/195 variables, 85/92 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 40/132 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 109/241 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 241 constraints, problems are : Problem set: 0 solved, 109 unsolved in 16586 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32456ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 32456ms
Starting structural reductions in SI_CTL mode, iteration 1 : 85/217 places, 110/423 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33061 ms. Remains : 85/217 places, 110/423 transitions.
[2025-05-30 01:48:17] [INFO ] Flatten gal took : 5 ms
[2025-05-30 01:48:17] [INFO ] Flatten gal took : 5 ms
[2025-05-30 01:48:17] [INFO ] Input system was already deterministic with 110 transitions.
[2025-05-30 01:48:17] [INFO ] Flatten gal took : 4 ms
[2025-05-30 01:48:17] [INFO ] Flatten gal took : 5 ms
[2025-05-30 01:48:17] [INFO ] Time to serialize gal into /tmp/CTLFireability2820468279087686394.gal : 1 ms
[2025-05-30 01:48:17] [INFO ] Time to serialize properties into /tmp/CTLFireability7421050122178952053.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/CTLFireability2820468279087686394.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7421050122178952053.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,61816,0.658095,21424,2,5635,5,58873,6,0,450,50664,0
Converting to forward existential form...Done !
original formula: EF(AG((((s1>=1)&&(l608>=1))||((s2>=1)&&(l1258>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((s1>=1)&&(l608>=1))||((s2>=1)&&(l1258>=1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t39, t45, t46, t47, t48, t49, t50, t51, t52, t53, t70, t78, t79, t80, t...408
(forward)formula 0,0,2.24335,57020,1,0,206,205459,242,82,3080,119753,234
FORMULA DBSingleClientW-PT-d1m05-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 217/217 places, 423/423 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 171 transition count 261
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 171 transition count 261
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 100 place count 171 transition count 253
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 132 place count 139 transition count 221
Iterating global reduction 1 with 32 rules applied. Total rules applied 164 place count 139 transition count 221
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 173 place count 139 transition count 212
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 194 place count 118 transition count 174
Iterating global reduction 2 with 21 rules applied. Total rules applied 215 place count 118 transition count 174
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 224 place count 118 transition count 165
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 231 place count 111 transition count 152
Iterating global reduction 3 with 7 rules applied. Total rules applied 238 place count 111 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 239 place count 111 transition count 151
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 245 place count 105 transition count 145
Iterating global reduction 4 with 6 rules applied. Total rules applied 251 place count 105 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 253 place count 105 transition count 143
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 258 place count 100 transition count 138
Iterating global reduction 5 with 5 rules applied. Total rules applied 263 place count 100 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 264 place count 100 transition count 137
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 265 place count 99 transition count 131
Iterating global reduction 6 with 1 rules applied. Total rules applied 266 place count 99 transition count 131
Applied a total of 266 rules in 18 ms. Remains 99 /217 variables (removed 118) and now considering 131/423 (removed 292) transitions.
// Phase 1: matrix 131 rows 99 cols
[2025-05-30 01:48:20] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:48:20] [INFO ] Implicit Places using invariants in 199 ms returned []
[2025-05-30 01:48:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 01:48:20] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-30 01:48:20] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2025-05-30 01:48:20] [INFO ] Invariant cache hit.
[2025-05-30 01:48:20] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 131/230 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 45/146 constraints. Problems are: Problem set: 0 solved, 130 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 0/230 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 230/230 variables, and 146 constraints, problems are : Problem set: 0 solved, 130 unsolved in 12482 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 131/230 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 45/146 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 130/276 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 130 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 230/230 variables, and 276 constraints, problems are : Problem set: 0 solved, 130 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42545ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 42545ms
Starting structural reductions in LTL mode, iteration 1 : 99/217 places, 131/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43363 ms. Remains : 99/217 places, 131/423 transitions.
[2025-05-30 01:49:03] [INFO ] Flatten gal took : 5 ms
[2025-05-30 01:49:03] [INFO ] Flatten gal took : 4 ms
[2025-05-30 01:49:03] [INFO ] Input system was already deterministic with 131 transitions.
[2025-05-30 01:49:03] [INFO ] Flatten gal took : 4 ms
[2025-05-30 01:49:03] [INFO ] Flatten gal took : 4 ms
[2025-05-30 01:49:03] [INFO ] Time to serialize gal into /tmp/CTLFireability3993165777479091001.gal : 2 ms
[2025-05-30 01:49:03] [INFO ] Time to serialize properties into /tmp/CTLFireability9903040198194270838.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/CTLFireability3993165777479091001.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9903040198194270838.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,113160,2.11497,45288,2,9685,5,130120,6,0,527,126583,0
Converting to forward existential form...Done !
original formula: AF(((AG((((s1>=1)&&(l461>=1)) + AG(AX(((s1>=1)&&(l1019>=1)))))) * (p84>=1)) * (l447>=1)))
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !((((s1>=1)&&(l461>=1)) + !(E(TRUE U !(!(EX(!(((s1>=1)&&(l1019>=1)))))))))))) * (p84>=...182
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t28, t37, t45, t51, t53, t54, t55, t61, t62, t64, t66, t72, t73, t74, t...489
(forward)formula 0,0,8.16829,158312,1,0,278,556156,291,113,3740,421350,301
FORMULA DBSingleClientW-PT-d1m05-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 01:49:11] [INFO ] Flatten gal took : 11 ms
[2025-05-30 01:49:11] [INFO ] Flatten gal took : 10 ms
Total runtime 921168 ms.
BK_STOP 1748569751939
--------------------
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-d1m05"
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-d1m05, 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-174854063500066"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m05.tgz
mv DBSingleClientW-PT-d1m05 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 '
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 ;