About the Execution of ITS-Tools for DBSingleClientW-PT-d2m10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FFFFFFFFTF?FT??F | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063600164.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-d2m10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063600164
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 8.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K 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 4.0K 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 1.6M 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-d2m10-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748636505999
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 20:21:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 20:21:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 20:21:49] [INFO ] Load time of PNML (sax parser for PT used): 617 ms
[2025-05-30 20:21:49] [INFO ] Transformed 4763 places.
[2025-05-30 20:21:49] [INFO ] Transformed 2478 transitions.
[2025-05-30 20:21:49] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 815 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 3580 places in 32 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 374 places :
Symmetric choice reduction at 1 with 374 rule applications. Total rules 619 place count 763 transition count 1413
Iterating global reduction 1 with 374 rules applied. Total rules applied 993 place count 763 transition count 1413
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 1033 place count 763 transition count 1373
Discarding 300 places :
Symmetric choice reduction at 2 with 300 rule applications. Total rules 1333 place count 463 transition count 1073
Iterating global reduction 2 with 300 rules applied. Total rules applied 1633 place count 463 transition count 1073
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1643 place count 463 transition count 1063
Discarding 216 places :
Symmetric choice reduction at 3 with 216 rule applications. Total rules 1859 place count 247 transition count 765
Iterating global reduction 3 with 216 rules applied. Total rules applied 2075 place count 247 transition count 765
Ensure Unique test removed 246 transitions
Reduce isomorphic transitions removed 246 transitions.
Iterating post reduction 3 with 246 rules applied. Total rules applied 2321 place count 247 transition count 519
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 2337 place count 231 transition count 494
Iterating global reduction 4 with 16 rules applied. Total rules applied 2353 place count 231 transition count 494
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 2373 place count 231 transition count 474
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 2380 place count 224 transition count 467
Iterating global reduction 5 with 7 rules applied. Total rules applied 2387 place count 224 transition count 467
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2389 place count 224 transition count 465
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 2394 place count 219 transition count 460
Iterating global reduction 6 with 5 rules applied. Total rules applied 2399 place count 219 transition count 460
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2403 place count 219 transition count 456
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2404 place count 218 transition count 454
Iterating global reduction 7 with 1 rules applied. Total rules applied 2405 place count 218 transition count 454
Applied a total of 2405 rules in 417 ms. Remains 218 /1183 variables (removed 965) and now considering 454/2478 (removed 2024) transitions.
// Phase 1: matrix 454 rows 218 cols
[2025-05-30 20:21:51] [INFO ] Computed 2 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:21:51] [INFO ] Implicit Places using invariants in 834 ms returned []
[2025-05-30 20:21:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:21:52] [INFO ] State equation strengthened by 244 read => feed constraints.
[2025-05-30 20:21:55] [INFO ] Implicit Places using invariants and state equation in 3370 ms returned []
Implicit Place search using SMT with State Equation took 4404 ms to find 0 implicit places.
Running 453 sub problems to find dead transitions.
[2025-05-30 20:21:55] [INFO ] Invariant cache hit.
[2025-05-30 20:21:55] [INFO ] State equation strengthened by 244 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (OVERLAPS) 454/672 variables, 218/220 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/672 variables, 244/464 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 672/672 variables, and 464 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 218/218 constraints, ReadFeed: 244/244 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (OVERLAPS) 454/672 variables, 218/220 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/672 variables, 244/464 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/672 variables, 453/917 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 672/672 variables, and 917 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 218/218 constraints, ReadFeed: 244/244 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61370ms problems are : Problem set: 0 solved, 453 unsolved
Search for dead transitions found 0 dead transitions in 61397ms
Starting structural reductions in LTL mode, iteration 1 : 218/1183 places, 454/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66252 ms. Remains : 218/1183 places, 454/2478 transitions.
Support contains 41 out of 218 places after structural reductions.
[2025-05-30 20:22:57] [INFO ] Flatten gal took : 87 ms
[2025-05-30 20:22:57] [INFO ] Flatten gal took : 54 ms
[2025-05-30 20:22:57] [INFO ] Input system was already deterministic with 454 transitions.
Support contains 40 out of 218 places (down from 41) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 40 to 34
RANDOM walk for 40000 steps (9196 resets) in 4280 ms. (9 steps per ms) remains 30/34 properties
BEST_FIRST walk for 4004 steps (177 resets) in 37 ms. (105 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (158 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (175 resets) in 25 ms. (153 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (190 resets) in 59 ms. (66 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (179 resets) in 48 ms. (81 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4000 steps (800 resets) in 75 ms. (52 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (194 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (199 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (374 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (175 resets) in 21 ms. (181 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (165 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (173 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (191 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (154 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (178 resets) in 37 ms. (105 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (175 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (186 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (200 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (186 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (168 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (182 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (387 resets) in 40 ms. (97 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (152 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (196 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (187 resets) in 35 ms. (111 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (173 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (162 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (392 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (379 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (186 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
[2025-05-30 20:22:58] [INFO ] Invariant cache hit.
[2025-05-30 20:22:58] [INFO ] State equation strengthened by 244 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 74/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 51/161 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:22:59] [INFO ] Deduced a trap composed of 77 places in 133 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:23:00] [INFO ] Deduced a trap composed of 78 places in 147 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:23:00] [INFO ] Deduced a trap composed of 78 places in 202 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:23:00] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:23:00] [INFO ] Deduced a trap composed of 78 places in 155 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 367/528 variables, 161/168 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 157/325 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Problem AtomicPropp31 is UNSAT
At refinement iteration 9 (OVERLAPS) 144/672 variables, 57/382 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/672 variables, 87/469 constraints. Problems are: Problem set: 1 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 672/672 variables, and 469 constraints, problems are : Problem set: 1 solved, 29 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 218/218 constraints, ReadFeed: 244/244 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 29 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 74/108 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 51/159 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 365/524 variables, 159/166 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 155/321 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 1/322 constraints. Problems are: Problem set: 1 solved, 29 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:23:05] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/524 variables, 1/323 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/524 variables, 0/323 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 148/672 variables, 59/382 constraints. Problems are: Problem set: 1 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/672 variables, 89/471 constraints. Problems are: Problem set: 1 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 672/672 variables, and 499 constraints, problems are : Problem set: 1 solved, 29 unsolved in 5025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 218/218 constraints, ReadFeed: 244/244 constraints, PredecessorRefiner: 29/30 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10160ms problems are : Problem set: 1 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 218 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 218/218 places, 454/454 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 213 transition count 447
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 213 transition count 447
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 17 place count 213 transition count 440
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 210 transition count 437
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 210 transition count 437
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 208 transition count 435
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 208 transition count 435
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 208 transition count 433
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 207 transition count 431
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 207 transition count 431
Applied a total of 31 rules in 84 ms. Remains 207 /218 variables (removed 11) and now considering 431/454 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 207/218 places, 431/454 transitions.
RANDOM walk for 40000 steps (9223 resets) in 691 ms. (57 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (180 resets) in 51 ms. (76 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (194 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (167 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (182 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (193 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (800 resets) in 45 ms. (86 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (172 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (188 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (361 resets) in 38 ms. (102 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4002 steps (191 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (175 resets) in 32 ms. (121 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (151 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (178 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (185 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (179 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (180 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (172 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (182 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (178 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (186 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4001 steps (385 resets) in 31 ms. (125 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (179 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (172 resets) in 36 ms. (108 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (188 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (170 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (379 resets) in 43 ms. (91 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (383 resets) in 37 ms. (105 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (172 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
Finished probabilistic random walk after 115904 steps, run visited all 28 properties in 1073 ms. (steps per millisecond=108 )
Probabilistic random walk after 115904 steps, saw 45615 distinct states, run finished after 1078 ms. (steps per millisecond=107 ) properties seen :28
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 35 stable transitions
Graph (complete) has 889 edges and 218 vertex of which 217 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 218 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 218/218 places, 454/454 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 187 transition count 331
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 187 transition count 331
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 78 place count 187 transition count 315
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 97 place count 168 transition count 291
Iterating global reduction 1 with 19 rules applied. Total rules applied 116 place count 168 transition count 291
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 121 place count 168 transition count 286
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 136 place count 153 transition count 267
Iterating global reduction 2 with 15 rules applied. Total rules applied 151 place count 153 transition count 267
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 156 place count 153 transition count 262
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 166 place count 143 transition count 241
Iterating global reduction 3 with 10 rules applied. Total rules applied 176 place count 143 transition count 241
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 181 place count 143 transition count 236
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 190 place count 134 transition count 210
Iterating global reduction 4 with 9 rules applied. Total rules applied 199 place count 134 transition count 210
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 205 place count 134 transition count 204
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 210 place count 129 transition count 182
Iterating global reduction 5 with 5 rules applied. Total rules applied 215 place count 129 transition count 182
Applied a total of 215 rules in 57 ms. Remains 129 /218 variables (removed 89) and now considering 182/454 (removed 272) transitions.
// Phase 1: matrix 182 rows 129 cols
[2025-05-30 20:23:11] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:23:11] [INFO ] Implicit Places using invariants in 191 ms returned []
[2025-05-30 20:23:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:23:11] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-05-30 20:23:13] [INFO ] Implicit Places using invariants and state equation in 1390 ms returned []
Implicit Place search using SMT with State Equation took 1587 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 20:23:13] [INFO ] Redundant transitions in 8 ms returned []
Running 181 sub problems to find dead transitions.
[2025-05-30 20:23:13] [INFO ] Invariant cache hit.
[2025-05-30 20:23:13] [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/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (OVERLAPS) 182/311 variables, 129/131 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/311 variables, 54/185 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 20:23:20] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:23:20] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:23:20] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:23:20] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/311 variables, 4/189 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 20:23:24] [INFO ] Deduced a trap composed of 54 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:23:24] [INFO ] Deduced a trap composed of 54 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:23:25] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 3/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 20:23:27] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 1/193 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 20:23:31] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/311 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (OVERLAPS) 0/311 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 194 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 129/129 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 9/9 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/128 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/129 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 182/311 variables, 129/140 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 54/194 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 181/375 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/311 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 181 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 311/311 variables, and 375 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: 129/129 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60232ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 60234ms
Starting structural reductions in SI_LTL mode, iteration 1 : 129/218 places, 182/454 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61896 ms. Remains : 129/218 places, 182/454 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-00
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-00 finished in 62184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(X(p1)))||X(((p1 U p2)||X(X(G(p3)))))))'
Support contains 6 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 454/454 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 190 transition count 352
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 190 transition count 352
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 71 place count 190 transition count 337
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 88 place count 173 transition count 315
Iterating global reduction 1 with 17 rules applied. Total rules applied 105 place count 173 transition count 315
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 109 place count 173 transition count 311
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 122 place count 160 transition count 291
Iterating global reduction 2 with 13 rules applied. Total rules applied 135 place count 160 transition count 291
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 139 place count 160 transition count 287
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 147 place count 152 transition count 273
Iterating global reduction 3 with 8 rules applied. Total rules applied 155 place count 152 transition count 273
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 160 place count 152 transition count 268
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 168 place count 144 transition count 243
Iterating global reduction 4 with 8 rules applied. Total rules applied 176 place count 144 transition count 243
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 183 place count 144 transition count 236
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 187 place count 140 transition count 215
Iterating global reduction 5 with 4 rules applied. Total rules applied 191 place count 140 transition count 215
Applied a total of 191 rules in 25 ms. Remains 140 /218 variables (removed 78) and now considering 215/454 (removed 239) transitions.
// Phase 1: matrix 215 rows 140 cols
[2025-05-30 20:24:13] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:24:13] [INFO ] Implicit Places using invariants in 162 ms returned []
[2025-05-30 20:24:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:24:13] [INFO ] State equation strengthened by 81 read => feed constraints.
[2025-05-30 20:24:14] [INFO ] Implicit Places using invariants and state equation in 1092 ms returned []
Implicit Place search using SMT with State Equation took 1257 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2025-05-30 20:24:14] [INFO ] Invariant cache hit.
[2025-05-30 20:24:14] [INFO ] State equation strengthened by 81 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 215/355 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 81/223 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (OVERLAPS) 0/355 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 355/355 variables, and 223 constraints, problems are : Problem set: 0 solved, 214 unsolved in 20373 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/140 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 215/355 variables, 140/142 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/355 variables, 81/223 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/355 variables, 214/437 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 355/355 variables, and 437 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 140/140 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50586ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 50588ms
Starting structural reductions in LTL mode, iteration 1 : 140/218 places, 215/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51872 ms. Remains : 140/218 places, 215/454 transitions.
Stuttering acceptance computed with spot in 647 ms :[true, (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-01
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-01 finished in 52550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(F(((F(p1) U p2)&&F(p3))) U X(p1)))))'
Support contains 6 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 454/454 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 190 transition count 350
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 190 transition count 350
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 74 place count 190 transition count 332
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 92 place count 172 transition count 309
Iterating global reduction 1 with 18 rules applied. Total rules applied 110 place count 172 transition count 309
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 114 place count 172 transition count 305
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 129 place count 157 transition count 283
Iterating global reduction 2 with 15 rules applied. Total rules applied 144 place count 157 transition count 283
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 148 place count 157 transition count 279
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 158 place count 147 transition count 258
Iterating global reduction 3 with 10 rules applied. Total rules applied 168 place count 147 transition count 258
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 175 place count 147 transition count 251
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 183 place count 139 transition count 233
Iterating global reduction 4 with 8 rules applied. Total rules applied 191 place count 139 transition count 233
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 198 place count 139 transition count 226
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 202 place count 135 transition count 211
Iterating global reduction 5 with 4 rules applied. Total rules applied 206 place count 135 transition count 211
Applied a total of 206 rules in 24 ms. Remains 135 /218 variables (removed 83) and now considering 211/454 (removed 243) transitions.
// Phase 1: matrix 211 rows 135 cols
[2025-05-30 20:25:06] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:25:06] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-05-30 20:25:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:25:06] [INFO ] State equation strengthened by 83 read => feed constraints.
[2025-05-30 20:25:07] [INFO ] Implicit Places using invariants and state equation in 1403 ms returned []
Implicit Place search using SMT with State Equation took 1601 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2025-05-30 20:25:07] [INFO ] Invariant cache hit.
[2025-05-30 20:25:07] [INFO ] State equation strengthened by 83 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 211/346 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 83/220 constraints. Problems are: Problem set: 0 solved, 210 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 0/346 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 346/346 variables, and 220 constraints, problems are : Problem set: 0 solved, 210 unsolved in 17510 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 211/346 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 83/220 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 210/430 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 346/346 variables, and 430 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 135/135 constraints, ReadFeed: 83/83 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47723ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 47724ms
Starting structural reductions in LTL mode, iteration 1 : 135/218 places, 211/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49350 ms. Remains : 135/218 places, 211/454 transitions.
Stuttering acceptance computed with spot in 461 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p1) p2), (AND (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p1)), (NOT p1), (AND (NOT p3) (NOT p1)), (NOT p2), (NOT p3)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-02
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-02 finished in 49942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 218 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 218/218 places, 454/454 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 187 transition count 337
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 187 transition count 337
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 78 place count 187 transition count 321
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 97 place count 168 transition count 297
Iterating global reduction 1 with 19 rules applied. Total rules applied 116 place count 168 transition count 297
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 121 place count 168 transition count 292
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 136 place count 153 transition count 269
Iterating global reduction 2 with 15 rules applied. Total rules applied 151 place count 153 transition count 269
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 156 place count 153 transition count 264
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 166 place count 143 transition count 247
Iterating global reduction 3 with 10 rules applied. Total rules applied 176 place count 143 transition count 247
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 181 place count 143 transition count 242
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 190 place count 134 transition count 216
Iterating global reduction 4 with 9 rules applied. Total rules applied 199 place count 134 transition count 216
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 207 place count 134 transition count 208
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 211 place count 130 transition count 187
Iterating global reduction 5 with 4 rules applied. Total rules applied 215 place count 130 transition count 187
Applied a total of 215 rules in 64 ms. Remains 130 /218 variables (removed 88) and now considering 187/454 (removed 267) transitions.
// Phase 1: matrix 187 rows 130 cols
[2025-05-30 20:25:56] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:25:56] [INFO ] Implicit Places using invariants in 218 ms returned []
[2025-05-30 20:25:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:25:56] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-05-30 20:25:57] [INFO ] Implicit Places using invariants and state equation in 702 ms returned []
Implicit Place search using SMT with State Equation took 922 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 20:25:57] [INFO ] Redundant transitions in 11 ms returned []
Running 186 sub problems to find dead transitions.
[2025-05-30 20:25:57] [INFO ] Invariant cache hit.
[2025-05-30 20:25:57] [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/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/317 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 0/317 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 193 constraints, problems are : Problem set: 0 solved, 186 unsolved in 16367 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/317 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 186/379 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/317 variables, and 379 constraints, problems are : Problem set: 0 solved, 186 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46517ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 46518ms
Starting structural reductions in SI_LTL mode, iteration 1 : 130/218 places, 187/454 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47523 ms. Remains : 130/218 places, 187/454 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-03
Product exploration explored 100000 steps with 23065 reset in 460 ms.
Product exploration explored 100000 steps with 22803 reset in 328 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 472 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 40000 steps (9164 resets) in 386 ms. (103 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1802 resets) in 251 ms. (158 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17886 steps, run visited all 1 properties in 215 ms. (steps per millisecond=83 )
Probabilistic random walk after 17886 steps, saw 8359 distinct states, run finished after 215 ms. (steps per millisecond=83 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 187/187 transitions.
Applied a total of 0 rules in 6 ms. Remains 130 /130 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2025-05-30 20:26:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:26:45] [INFO ] Implicit Places using invariants in 195 ms returned []
[2025-05-30 20:26:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:26:45] [INFO ] State equation strengthened by 61 read => feed constraints.
[2025-05-30 20:26:46] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 20:26:46] [INFO ] Redundant transitions in 3 ms returned []
Running 186 sub problems to find dead transitions.
[2025-05-30 20:26:46] [INFO ] Invariant cache hit.
[2025-05-30 20:26:46] [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/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/317 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (OVERLAPS) 0/317 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 193 constraints, problems are : Problem set: 0 solved, 186 unsolved in 13525 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 1/130 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (OVERLAPS) 187/317 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 61/193 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 186/379 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/317 variables, and 379 constraints, problems are : Problem set: 0 solved, 186 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43670ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 43670ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44539 ms. Remains : 130/130 places, 187/187 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 472 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 40000 steps (9184 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1765 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17886 steps, run visited all 1 properties in 40 ms. (steps per millisecond=447 )
Probabilistic random walk after 17886 steps, saw 8359 distinct states, run finished after 41 ms. (steps per millisecond=436 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22940 reset in 469 ms.
Product exploration explored 100000 steps with 22988 reset in 409 ms.
Built C files in :
/tmp/ltsmin17978544735156196134
[2025-05-30 20:27:31] [INFO ] Computing symmetric may disable matrix : 187 transitions.
[2025-05-30 20:27:31] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:27:31] [INFO ] Computing symmetric may enable matrix : 187 transitions.
[2025-05-30 20:27:31] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:27:31] [INFO ] Computing Do-Not-Accords matrix : 187 transitions.
[2025-05-30 20:27:31] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:27:31] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17978544735156196134
Running compilation step : cd /tmp/ltsmin17978544735156196134;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 885 ms.
Running link step : cd /tmp/ltsmin17978544735156196134;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin17978544735156196134;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17994222218387092220.hoa' '--buchi-type=spotba'
LTSmin run took 437 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-03 finished in 96548 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p1)||X(X((!p2 U (G((!p2||G(!p3)))||(!p4&&(!p2||G(!p3))))))))&&p0)))'
Support contains 5 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 454/454 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 189 transition count 339
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 189 transition count 339
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 71 place count 189 transition count 326
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 89 place count 171 transition count 303
Iterating global reduction 1 with 18 rules applied. Total rules applied 107 place count 171 transition count 303
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 112 place count 171 transition count 298
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 126 place count 157 transition count 277
Iterating global reduction 2 with 14 rules applied. Total rules applied 140 place count 157 transition count 277
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 143 place count 157 transition count 274
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 153 place count 147 transition count 253
Iterating global reduction 3 with 10 rules applied. Total rules applied 163 place count 147 transition count 253
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 170 place count 147 transition count 246
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 178 place count 139 transition count 225
Iterating global reduction 4 with 8 rules applied. Total rules applied 186 place count 139 transition count 225
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 192 place count 139 transition count 219
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 194 place count 137 transition count 217
Iterating global reduction 5 with 2 rules applied. Total rules applied 196 place count 137 transition count 217
Applied a total of 196 rules in 28 ms. Remains 137 /218 variables (removed 81) and now considering 217/454 (removed 237) transitions.
// Phase 1: matrix 217 rows 137 cols
[2025-05-30 20:27:32] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:27:32] [INFO ] Implicit Places using invariants in 225 ms returned []
[2025-05-30 20:27:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:27:33] [INFO ] State equation strengthened by 87 read => feed constraints.
[2025-05-30 20:27:35] [INFO ] Implicit Places using invariants and state equation in 3002 ms returned []
Implicit Place search using SMT with State Equation took 3230 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-05-30 20:27:35] [INFO ] Invariant cache hit.
[2025-05-30 20:27:35] [INFO ] State equation strengthened by 87 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/354 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 87/226 constraints. Problems are: Problem set: 0 solved, 216 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/354 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 226 constraints, problems are : Problem set: 0 solved, 216 unsolved in 18442 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/354 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 87/226 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 216/442 constraints. Problems are: Problem set: 0 solved, 216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 354/354 variables, and 442 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48602ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 48603ms
Starting structural reductions in LTL mode, iteration 1 : 137/218 places, 217/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51861 ms. Remains : 137/218 places, 217/454 transitions.
Stuttering acceptance computed with spot in 408 ms :[true, (OR (NOT p0) (AND (NOT p1) p2 p3)), (AND p2 p3), (AND (NOT p1) p2 p3), (OR (NOT p0) (AND (NOT p1) p2 p3)), (AND p2 p3), (AND (NOT p1) p2 p3), p3, (AND p3 (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-05 finished in 52298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(F(p0))))&&(p1||X(F((F(p3)&&p2)))))))'
Support contains 4 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 454/454 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 189 transition count 346
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 189 transition count 346
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 74 place count 189 transition count 330
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 92 place count 171 transition count 307
Iterating global reduction 1 with 18 rules applied. Total rules applied 110 place count 171 transition count 307
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 113 place count 171 transition count 304
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 127 place count 157 transition count 282
Iterating global reduction 2 with 14 rules applied. Total rules applied 141 place count 157 transition count 282
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 146 place count 157 transition count 277
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 155 place count 148 transition count 259
Iterating global reduction 3 with 9 rules applied. Total rules applied 164 place count 148 transition count 259
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 167 place count 148 transition count 256
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 177 place count 138 transition count 229
Iterating global reduction 4 with 10 rules applied. Total rules applied 187 place count 138 transition count 229
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 195 place count 138 transition count 221
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 200 place count 133 transition count 199
Iterating global reduction 5 with 5 rules applied. Total rules applied 205 place count 133 transition count 199
Applied a total of 205 rules in 13 ms. Remains 133 /218 variables (removed 85) and now considering 199/454 (removed 255) transitions.
// Phase 1: matrix 199 rows 133 cols
[2025-05-30 20:28:24] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:28:25] [INFO ] Implicit Places using invariants in 178 ms returned []
[2025-05-30 20:28:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:28:25] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-05-30 20:28:26] [INFO ] Implicit Places using invariants and state equation in 1127 ms returned []
Implicit Place search using SMT with State Equation took 1307 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2025-05-30 20:28:26] [INFO ] Invariant cache hit.
[2025-05-30 20:28:26] [INFO ] State equation strengthened by 74 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/332 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 74/209 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (OVERLAPS) 0/332 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 209 constraints, problems are : Problem set: 0 solved, 198 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/332 variables, 133/135 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 74/209 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 198/407 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 332/332 variables, and 407 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50209ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 50210ms
Starting structural reductions in LTL mode, iteration 1 : 133/218 places, 199/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51532 ms. Remains : 133/218 places, 199/454 transitions.
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (NOT p3)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-07
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-07 finished in 51864 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(((!p0&&X(X(X(!p1))))||G(!p1)))))))'
Support contains 3 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 454/454 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 188 transition count 347
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 188 transition count 347
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 80 place count 188 transition count 327
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 99 place count 169 transition count 303
Iterating global reduction 1 with 19 rules applied. Total rules applied 118 place count 169 transition count 303
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 123 place count 169 transition count 298
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 138 place count 154 transition count 276
Iterating global reduction 2 with 15 rules applied. Total rules applied 153 place count 154 transition count 276
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 158 place count 154 transition count 271
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 168 place count 144 transition count 250
Iterating global reduction 3 with 10 rules applied. Total rules applied 178 place count 144 transition count 250
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 185 place count 144 transition count 243
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 194 place count 135 transition count 217
Iterating global reduction 4 with 9 rules applied. Total rules applied 203 place count 135 transition count 217
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 209 place count 135 transition count 211
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 214 place count 130 transition count 189
Iterating global reduction 5 with 5 rules applied. Total rules applied 219 place count 130 transition count 189
Applied a total of 219 rules in 16 ms. Remains 130 /218 variables (removed 88) and now considering 189/454 (removed 265) transitions.
// Phase 1: matrix 189 rows 130 cols
[2025-05-30 20:29:16] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:29:16] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-05-30 20:29:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:29:17] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-05-30 20:29:17] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
Running 188 sub problems to find dead transitions.
[2025-05-30 20:29:17] [INFO ] Invariant cache hit.
[2025-05-30 20:29:17] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/319 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 64/196 constraints. Problems are: Problem set: 0 solved, 188 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 0/319 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 196 constraints, problems are : Problem set: 0 solved, 188 unsolved in 14504 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/319 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 64/196 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 188/384 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 319/319 variables, and 384 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44615ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 44616ms
Starting structural reductions in LTL mode, iteration 1 : 130/218 places, 189/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45535 ms. Remains : 130/218 places, 189/454 transitions.
Stuttering acceptance computed with spot in 415 ms :[p1, p1, p1, p1, p1, p1, p1, p1, p1, p1, p1]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-08
Product exploration explored 100000 steps with 24091 reset in 409 ms.
Product exploration explored 100000 steps with 24028 reset in 328 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 472 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 11 states, 27 edges and 2 AP (stutter sensitive) to 11 states, 27 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 415 ms :[p1, p1, p1, p1, p1, p1, p1, p1, p1, p1, p1]
RANDOM walk for 40000 steps (9253 resets) in 327 ms. (121 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1751 resets) in 187 ms. (212 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1708 resets) in 240 ms. (165 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1829 resets) in 151 ms. (263 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1790 resets) in 163 ms. (243 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1768 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (1702 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 1205725 steps, run timeout after 3001 ms. (steps per millisecond=401 ) properties seen :5 out of 6
Probabilistic random walk after 1205725 steps, saw 499162 distinct states, run finished after 3006 ms. (steps per millisecond=401 ) properties seen :5
[2025-05-30 20:30:07] [INFO ] Invariant cache hit.
[2025-05-30 20:30:07] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.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) 53/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 145/234 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 319/319 variables, and 152 constraints, problems are : Problem set: 1 solved, 0 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 20/64 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 152ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 198 ms. Reduced automaton from 11 states, 27 edges and 2 AP (stutter sensitive) to 11 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 411 ms :[(AND (NOT p0) p1), p1, p1, p1, (AND (NOT p0) p1), p1, p1, p1, p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 408 ms :[(AND (NOT p0) p1), p1, p1, p1, (AND (NOT p0) p1), p1, p1, p1, p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 189/189 transitions.
Applied a total of 0 rules in 2 ms. Remains 130 /130 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2025-05-30 20:30:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:30:08] [INFO ] Implicit Places using invariants in 159 ms returned []
[2025-05-30 20:30:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:30:08] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-05-30 20:30:09] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 879 ms to find 0 implicit places.
Running 188 sub problems to find dead transitions.
[2025-05-30 20:30:09] [INFO ] Invariant cache hit.
[2025-05-30 20:30:09] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/319 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 64/196 constraints. Problems are: Problem set: 0 solved, 188 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 0/319 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 196 constraints, problems are : Problem set: 0 solved, 188 unsolved in 13813 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/319 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 64/196 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 188/384 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 319/319 variables, and 384 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43932ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 43932ms
Finished structural reductions in LTL mode , in 1 iterations and 44815 ms. Remains : 130/130 places, 189/189 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 472 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 11 states, 15 edges and 2 AP (stutter sensitive) to 11 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 385 ms :[(AND (NOT p0) p1), p1, p1, p1, (AND (NOT p0) p1), p1, p1, p1, p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (9154 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1843 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1776 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 21557 steps, run visited all 2 properties in 202 ms. (steps per millisecond=106 )
Probabilistic random walk after 21557 steps, saw 10650 distinct states, run finished after 203 ms. (steps per millisecond=106 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 1 factoid took 134 ms. Reduced automaton from 11 states, 15 edges and 2 AP (stutter sensitive) to 11 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 430 ms :[(AND (NOT p0) p1), p1, p1, p1, (AND (NOT p0) p1), p1, p1, p1, p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 419 ms :[(AND (NOT p0) p1), p1, p1, p1, (AND (NOT p0) p1), p1, p1, p1, p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 408 ms :[(AND (NOT p0) p1), p1, p1, p1, (AND (NOT p0) p1), p1, p1, p1, p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 23980 reset in 388 ms.
Product exploration explored 100000 steps with 23987 reset in 327 ms.
Applying partial POR strategy [false, false, false, false, false, false, false, true, false, false, false]
Stuttering acceptance computed with spot in 426 ms :[(AND (NOT p0) p1), p1, p1, p1, (AND (NOT p0) p1), p1, p1, p1, p1, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 189/189 transitions.
Applied a total of 0 rules in 11 ms. Remains 130 /130 variables (removed 0) and now considering 189/189 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 20:30:57] [INFO ] Redundant transitions in 6 ms returned []
Running 188 sub problems to find dead transitions.
[2025-05-30 20:30:57] [INFO ] Invariant cache hit.
[2025-05-30 20:30:57] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/319 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 64/196 constraints. Problems are: Problem set: 0 solved, 188 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 7 (OVERLAPS) 0/319 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 188 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 196 constraints, problems are : Problem set: 0 solved, 188 unsolved in 14211 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 188 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 2 (OVERLAPS) 1/130 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 4 (OVERLAPS) 189/319 variables, 130/132 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 64/196 constraints. Problems are: Problem set: 0 solved, 188 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 188/384 constraints. Problems are: Problem set: 0 solved, 188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 319/319 variables, and 384 constraints, problems are : Problem set: 0 solved, 188 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 130/130 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 188/188 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44326ms problems are : Problem set: 0 solved, 188 unsolved
Search for dead transitions found 0 dead transitions in 44328ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44354 ms. Remains : 130/130 places, 189/189 transitions.
Built C files in :
/tmp/ltsmin14056975773777102230
[2025-05-30 20:31:41] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14056975773777102230
Running compilation step : cd /tmp/ltsmin14056975773777102230;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 468 ms.
Running link step : cd /tmp/ltsmin14056975773777102230;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14056975773777102230;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17014588868956458357.hoa' '--buchi-type=spotba'
LTSmin run took 116 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-08 finished in 145497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p1||((F(p3) U p4)&&p2)))&&p0)))'
Support contains 5 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 454/454 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 189 transition count 354
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 189 transition count 354
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 78 place count 189 transition count 334
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 96 place count 171 transition count 311
Iterating global reduction 1 with 18 rules applied. Total rules applied 114 place count 171 transition count 311
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 118 place count 171 transition count 307
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 132 place count 157 transition count 286
Iterating global reduction 2 with 14 rules applied. Total rules applied 146 place count 157 transition count 286
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 150 place count 157 transition count 282
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 159 place count 148 transition count 263
Iterating global reduction 3 with 9 rules applied. Total rules applied 168 place count 148 transition count 263
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 173 place count 148 transition count 258
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 182 place count 139 transition count 232
Iterating global reduction 4 with 9 rules applied. Total rules applied 191 place count 139 transition count 232
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 197 place count 139 transition count 226
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 202 place count 134 transition count 204
Iterating global reduction 5 with 5 rules applied. Total rules applied 207 place count 134 transition count 204
Applied a total of 207 rules in 22 ms. Remains 134 /218 variables (removed 84) and now considering 204/454 (removed 250) transitions.
// Phase 1: matrix 204 rows 134 cols
[2025-05-30 20:31:42] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:31:42] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-05-30 20:31:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:31:42] [INFO ] State equation strengthened by 76 read => feed constraints.
[2025-05-30 20:31:43] [INFO ] Implicit Places using invariants and state equation in 1095 ms returned []
Implicit Place search using SMT with State Equation took 1271 ms to find 0 implicit places.
Running 203 sub problems to find dead transitions.
[2025-05-30 20:31:43] [INFO ] Invariant cache hit.
[2025-05-30 20:31:43] [INFO ] State equation strengthened by 76 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/338 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 76/212 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 0/338 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 212 constraints, problems are : Problem set: 0 solved, 203 unsolved in 16288 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 204/338 variables, 134/136 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 76/212 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 203/415 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 338/338 variables, and 415 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 134/134 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46422ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 46422ms
Starting structural reductions in LTL mode, iteration 1 : 134/218 places, 204/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47716 ms. Remains : 134/218 places, 204/454 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p4)) (AND (NOT p1) (NOT p2))), true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3) (NOT p4))), (AND (NOT p1) (NOT p4))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-09 finished in 47998 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p1)||p0))&&F(p2))))'
Support contains 5 out of 218 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 218/218 places, 454/454 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 189 transition count 342
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 189 transition count 342
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 74 place count 189 transition count 326
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 91 place count 172 transition count 305
Iterating global reduction 1 with 17 rules applied. Total rules applied 108 place count 172 transition count 305
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 112 place count 172 transition count 301
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 125 place count 159 transition count 280
Iterating global reduction 2 with 13 rules applied. Total rules applied 138 place count 159 transition count 280
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 143 place count 159 transition count 275
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 152 place count 150 transition count 259
Iterating global reduction 3 with 9 rules applied. Total rules applied 161 place count 150 transition count 259
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 163 place count 150 transition count 257
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 169 place count 144 transition count 251
Iterating global reduction 4 with 6 rules applied. Total rules applied 175 place count 144 transition count 251
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 183 place count 144 transition count 243
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 186 place count 141 transition count 229
Iterating global reduction 5 with 3 rules applied. Total rules applied 189 place count 141 transition count 229
Applied a total of 189 rules in 37 ms. Remains 141 /218 variables (removed 77) and now considering 229/454 (removed 225) transitions.
// Phase 1: matrix 229 rows 141 cols
[2025-05-30 20:32:30] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:32:30] [INFO ] Implicit Places using invariants in 154 ms returned []
[2025-05-30 20:32:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:32:30] [INFO ] State equation strengthened by 93 read => feed constraints.
[2025-05-30 20:32:31] [INFO ] Implicit Places using invariants and state equation in 791 ms returned []
Implicit Place search using SMT with State Equation took 952 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 20:32:31] [INFO ] Redundant transitions in 2 ms returned []
Running 228 sub problems to find dead transitions.
[2025-05-30 20:32:31] [INFO ] Invariant cache hit.
[2025-05-30 20:32:31] [INFO ] State equation strengthened by 93 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 229/370 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 93/236 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:32:42] [INFO ] Deduced a trap composed of 55 places in 182 ms of which 26 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 0/370 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 237 constraints, problems are : Problem set: 0 solved, 228 unsolved in 25666 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (OVERLAPS) 229/370 variables, 141/144 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 93/237 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 228/465 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 465 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55821ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 55822ms
Starting structural reductions in SI_LTL mode, iteration 1 : 141/218 places, 229/454 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56823 ms. Remains : 141/218 places, 229/454 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-10
Product exploration explored 100000 steps with 23044 reset in 289 ms.
Product exploration explored 100000 steps with 22974 reset in 329 ms.
Computed a total of 5 stabilizing places and 20 stable transitions
Graph (complete) has 530 edges and 141 vertex of which 140 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 139 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (9128 resets) in 313 ms. (127 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1808 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1822 resets) in 73 ms. (540 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (3876 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1753 resets) in 73 ms. (540 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (3790 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 1118054 steps, run timeout after 3011 ms. (steps per millisecond=371 ) properties seen :4 out of 5
Probabilistic random walk after 1118054 steps, saw 430094 distinct states, run finished after 3011 ms. (steps per millisecond=371 ) properties seen :4
[2025-05-30 20:33:31] [INFO ] Invariant cache hit.
[2025-05-30 20:33:31] [INFO ] State equation strengthened by 93 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 59/370 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/141 constraints, ReadFeed: 0/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 12 factoid took 359 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p2), (NOT p2)]
Support contains 2 out of 141 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 229/229 transitions.
Applied a total of 0 rules in 8 ms. Remains 141 /141 variables (removed 0) and now considering 229/229 (removed 0) transitions.
[2025-05-30 20:33:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:33:32] [INFO ] Implicit Places using invariants in 191 ms returned []
[2025-05-30 20:33:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:33:32] [INFO ] State equation strengthened by 93 read => feed constraints.
[2025-05-30 20:33:32] [INFO ] Implicit Places using invariants and state equation in 786 ms returned []
Implicit Place search using SMT with State Equation took 980 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 20:33:32] [INFO ] Redundant transitions in 1 ms returned []
Running 228 sub problems to find dead transitions.
[2025-05-30 20:33:32] [INFO ] Invariant cache hit.
[2025-05-30 20:33:32] [INFO ] State equation strengthened by 93 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 229/370 variables, 141/143 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 93/236 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:33:42] [INFO ] Deduced a trap composed of 55 places in 180 ms of which 24 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 0/370 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 237 constraints, problems are : Problem set: 0 solved, 228 unsolved in 25987 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/141 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (OVERLAPS) 229/370 variables, 141/144 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/370 variables, 93/237 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 228/465 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 465 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 141/141 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56198ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 56199ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57198 ms. Remains : 141/141 places, 229/229 transitions.
Computed a total of 5 stabilizing places and 20 stable transitions
Graph (complete) has 530 edges and 141 vertex of which 140 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 20 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (9258 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1726 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 14993 steps, run visited all 1 properties in 49 ms. (steps per millisecond=305 )
Probabilistic random walk after 14993 steps, saw 7028 distinct states, run finished after 49 ms. (steps per millisecond=305 ) properties seen :1
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 22987 reset in 265 ms.
Product exploration explored 100000 steps with 23031 reset in 271 ms.
Built C files in :
/tmp/ltsmin17152512486836369054
[2025-05-30 20:34:30] [INFO ] Computing symmetric may disable matrix : 229 transitions.
[2025-05-30 20:34:30] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:34:30] [INFO ] Computing symmetric may enable matrix : 229 transitions.
[2025-05-30 20:34:30] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:34:30] [INFO ] Computing Do-Not-Accords matrix : 229 transitions.
[2025-05-30 20:34:30] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:34:30] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17152512486836369054
Running compilation step : cd /tmp/ltsmin17152512486836369054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 742 ms.
Running link step : cd /tmp/ltsmin17152512486836369054;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin17152512486836369054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15606318590262115494.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 229/229 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 139 transition count 221
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 139 transition count 221
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 137 transition count 218
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 137 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 137 transition count 217
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 134 transition count 208
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 134 transition count 208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 133 transition count 203
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 133 transition count 203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 132 transition count 202
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 132 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 131 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 131 transition count 201
Applied a total of 21 rules in 26 ms. Remains 131 /141 variables (removed 10) and now considering 201/229 (removed 28) transitions.
// Phase 1: matrix 201 rows 131 cols
[2025-05-30 20:34:45] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:34:45] [INFO ] Implicit Places using invariants in 202 ms returned []
[2025-05-30 20:34:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:34:45] [INFO ] State equation strengthened by 76 read => feed constraints.
[2025-05-30 20:34:47] [INFO ] Implicit Places using invariants and state equation in 1559 ms returned []
Implicit Place search using SMT with State Equation took 1765 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 20:34:47] [INFO ] Redundant transitions in 1 ms returned []
Running 200 sub problems to find dead transitions.
[2025-05-30 20:34:47] [INFO ] Invariant cache hit.
[2025-05-30 20:34:47] [INFO ] State equation strengthened by 76 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 201/332 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 76/209 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (OVERLAPS) 0/332 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 200 unsolved
No progress, stopping.
After SMT solving in domain Real declared 332/332 variables, and 209 constraints, problems are : Problem set: 0 solved, 200 unsolved in 14610 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 201/332 variables, 131/133 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 76/209 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 200/409 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 332/332 variables, and 409 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 131/131 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44822ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 44824ms
Starting structural reductions in SI_LTL mode, iteration 1 : 131/141 places, 201/229 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46625 ms. Remains : 131/141 places, 201/229 transitions.
Built C files in :
/tmp/ltsmin6800290085742106344
[2025-05-30 20:35:32] [INFO ] Computing symmetric may disable matrix : 201 transitions.
[2025-05-30 20:35:32] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:35:32] [INFO ] Computing symmetric may enable matrix : 201 transitions.
[2025-05-30 20:35:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:35:32] [INFO ] Computing Do-Not-Accords matrix : 201 transitions.
[2025-05-30 20:35:32] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:35:32] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6800290085742106344
Running compilation step : cd /tmp/ltsmin6800290085742106344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 652 ms.
Running link step : cd /tmp/ltsmin6800290085742106344;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin6800290085742106344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6215393498807964678.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 20:35:47] [INFO ] Flatten gal took : 19 ms
[2025-05-30 20:35:47] [INFO ] Flatten gal took : 17 ms
[2025-05-30 20:35:47] [INFO ] Time to serialize gal into /tmp/LTL4446900347957657800.gal : 4 ms
[2025-05-30 20:35:47] [INFO ] Time to serialize properties into /tmp/LTL15319756357227981880.prop : 4 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4446900347957657800.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12855139445159149653.hoa' '-atoms' '/tmp/LTL15319756357227981880.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15319756357227981880.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12855139445159149653.hoa
Detected timeout of ITS tools.
[2025-05-30 20:36:02] [INFO ] Flatten gal took : 18 ms
[2025-05-30 20:36:02] [INFO ] Flatten gal took : 18 ms
[2025-05-30 20:36:02] [INFO ] Time to serialize gal into /tmp/LTL1143091164647008225.gal : 4 ms
[2025-05-30 20:36:02] [INFO ] Time to serialize properties into /tmp/LTL13880589001106640380.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1143091164647008225.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13880589001106640380.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F(("((p34<1)||(l0<1))")||(G("((s1<1)||(l4138<1))"))))&&(F("((s1<1)||(l2287<1))")))))
Formula 0 simplified : F(G(!"((p34<1)||(l0<1))" & F!"((s1<1)||(l4138<1))") | G!"((s1<1)||(l2287<1))")
Detected timeout of ITS tools.
[2025-05-30 20:36:17] [INFO ] Flatten gal took : 16 ms
[2025-05-30 20:36:17] [INFO ] Applying decomposition
[2025-05-30 20:36:17] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph9579084548406612946.txt' '-o' '/tmp/graph9579084548406612946.bin' '-w' '/tmp/graph9579084548406612946.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9579084548406612946.bin' '-l' '-1' '-v' '-w' '/tmp/graph9579084548406612946.weights' '-q' '0' '-e' '0.001'
[2025-05-30 20:36:17] [INFO ] Decomposing Gal with order
[2025-05-30 20:36:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 20:36:17] [INFO ] Removed a total of 272 redundant transitions.
[2025-05-30 20:36:17] [INFO ] Flatten gal took : 91 ms
[2025-05-30 20:36:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 150 labels/synchronizations in 24 ms.
[2025-05-30 20:36:17] [INFO ] Time to serialize gal into /tmp/LTL8891779684554152389.gal : 7 ms
[2025-05-30 20:36:17] [INFO ] Time to serialize properties into /tmp/LTL138292006263878064.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8891779684554152389.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL138292006263878064.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((G((F(("((i1.i0.u18.p34<1)||(i1.i0.u2.l0<1))")||(G("((i1.i0.u2.s1<1)||(i6.u25.l4138<1))"))))&&(F("((i1.i0.u2.s1<1)||(i4.u15.l2287<1)...162
Formula 0 simplified : F(G(!"((i1.i0.u18.p34<1)||(i1.i0.u2.l0<1))" & F!"((i1.i0.u2.s1<1)||(i6.u25.l4138<1))") | G!"((i1.i0.u2.s1<1)||(i4.u15.l2287<1))")
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-10 finished in 242660 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(p1)&&F((F(p3)&&p2))))||p0)))'
Support contains 5 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 454/454 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 189 transition count 334
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 189 transition count 334
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 70 place count 189 transition count 322
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 89 place count 170 transition count 301
Iterating global reduction 1 with 19 rules applied. Total rules applied 108 place count 170 transition count 301
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 113 place count 170 transition count 296
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 128 place count 155 transition count 273
Iterating global reduction 2 with 15 rules applied. Total rules applied 143 place count 155 transition count 273
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 148 place count 155 transition count 268
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 158 place count 145 transition count 247
Iterating global reduction 3 with 10 rules applied. Total rules applied 168 place count 145 transition count 247
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 173 place count 145 transition count 242
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 179 place count 139 transition count 236
Iterating global reduction 4 with 6 rules applied. Total rules applied 185 place count 139 transition count 236
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 190 place count 139 transition count 231
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 192 place count 137 transition count 229
Iterating global reduction 5 with 2 rules applied. Total rules applied 194 place count 137 transition count 229
Applied a total of 194 rules in 13 ms. Remains 137 /218 variables (removed 81) and now considering 229/454 (removed 225) transitions.
// Phase 1: matrix 229 rows 137 cols
[2025-05-30 20:36:32] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:36:33] [INFO ] Implicit Places using invariants in 279 ms returned []
[2025-05-30 20:36:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:36:33] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-05-30 20:36:35] [INFO ] Implicit Places using invariants and state equation in 2061 ms returned []
Implicit Place search using SMT with State Equation took 2343 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2025-05-30 20:36:35] [INFO ] Invariant cache hit.
[2025-05-30 20:36:35] [INFO ] State equation strengthened by 100 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 229/366 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 100/239 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:36:47] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:36:47] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 0/366 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 241 constraints, problems are : Problem set: 0 solved, 228 unsolved in 27150 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (OVERLAPS) 1/137 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (OVERLAPS) 229/366 variables, 137/141 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 100/241 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 228/469 constraints. Problems are: Problem set: 0 solved, 228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/366 variables, and 469 constraints, problems are : Problem set: 0 solved, 228 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 137/137 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57356ms problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 57357ms
Starting structural reductions in LTL mode, iteration 1 : 137/218 places, 229/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59715 ms. Remains : 137/218 places, 229/454 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 546 ms.
Product exploration explored 100000 steps with 50000 reset in 798 ms.
Computed a total of 5 stabilizing places and 21 stable transitions
Graph (complete) has 517 edges and 137 vertex of which 136 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p2)), (X (NOT p3)), (X p0), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 26 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m10-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-12 finished in 61339 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((!p0 U (X((p0||G(!p1)))||G(!p0))))))))'
Support contains 4 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 454/454 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 187 transition count 331
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 187 transition count 331
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 78 place count 187 transition count 315
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 97 place count 168 transition count 292
Iterating global reduction 1 with 19 rules applied. Total rules applied 116 place count 168 transition count 292
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 120 place count 168 transition count 288
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 136 place count 152 transition count 264
Iterating global reduction 2 with 16 rules applied. Total rules applied 152 place count 152 transition count 264
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 157 place count 152 transition count 259
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 167 place count 142 transition count 238
Iterating global reduction 3 with 10 rules applied. Total rules applied 177 place count 142 transition count 238
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 182 place count 142 transition count 233
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 191 place count 133 transition count 207
Iterating global reduction 4 with 9 rules applied. Total rules applied 200 place count 133 transition count 207
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 207 place count 133 transition count 200
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 212 place count 128 transition count 178
Iterating global reduction 5 with 5 rules applied. Total rules applied 217 place count 128 transition count 178
Applied a total of 217 rules in 23 ms. Remains 128 /218 variables (removed 90) and now considering 178/454 (removed 276) transitions.
// Phase 1: matrix 178 rows 128 cols
[2025-05-30 20:37:34] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:37:34] [INFO ] Implicit Places using invariants in 227 ms returned []
[2025-05-30 20:37:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:37:34] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-05-30 20:37:35] [INFO ] Implicit Places using invariants and state equation in 811 ms returned []
Implicit Place search using SMT with State Equation took 1055 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2025-05-30 20:37:35] [INFO ] Invariant cache hit.
[2025-05-30 20:37:35] [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/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/306 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 54/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:37:44] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:37:44] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 186 constraints, problems are : Problem set: 0 solved, 177 unsolved in 21550 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/306 variables, 128/132 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 54/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 177/363 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/306 variables, and 363 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51728ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 51729ms
Starting structural reductions in LTL mode, iteration 1 : 128/218 places, 178/454 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52809 ms. Remains : 128/218 places, 178/454 transitions.
Stuttering acceptance computed with spot in 200 ms :[p0, p0, false, false, false]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-13
Product exploration explored 100000 steps with 37304 reset in 343 ms.
Product exploration explored 100000 steps with 37333 reset in 339 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 460 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 111 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[p0, p0, false, false, false]
RANDOM walk for 40000 steps (9278 resets) in 259 ms. (153 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (3774 resets) in 128 ms. (310 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1825 resets) in 71 ms. (555 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (3789 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
[2025-05-30 20:38:28] [INFO ] Invariant cache hit.
[2025-05-30 20:38:28] [INFO ] State equation strengthened by 54 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 52/56 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 31/87 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 134/221 variables, 87/89 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 10/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 79/300 variables, 38/137 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 41/178 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/306 variables, 3/181 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 3/184 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 0/184 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/306 variables, 0/184 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 184 constraints, problems are : Problem set: 1 solved, 2 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/56 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 31/87 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 134/221 variables, 87/89 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 10/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 79/300 variables, 38/137 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 41/178 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 2/180 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/306 variables, 3/183 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 3/186 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/306 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/306 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 186 constraints, problems are : Problem set: 1 solved, 2 unsolved in 803 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1074ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 467 steps, including 45 resets, run visited all 2 properties in 15 ms. (steps per millisecond=31 )
Parikh walk visited 2 properties in 23 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 7 factoid took 253 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 181 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2025-05-30 20:38:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:38:30] [INFO ] Implicit Places using invariants in 160 ms returned []
[2025-05-30 20:38:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:38:30] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-05-30 20:38:30] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2025-05-30 20:38:30] [INFO ] Invariant cache hit.
[2025-05-30 20:38:30] [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/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/306 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 54/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:38:37] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:38:37] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 186 constraints, problems are : Problem set: 0 solved, 177 unsolved in 16039 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/306 variables, 128/132 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 54/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 177/363 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/306 variables, and 363 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46245ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 46245ms
Finished structural reductions in LTL mode , in 1 iterations and 46934 ms. Remains : 128/128 places, 178/178 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 460 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 115 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (9179 resets) in 143 ms. (277 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (3908 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
[2025-05-30 20:39:17] [INFO ] Invariant cache hit.
[2025-05-30 20:39:17] [INFO ] State equation strengthened by 54 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/221 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 10/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 79/300 variables, 38/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 41/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/306 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/306 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 184 constraints, problems are : Problem set: 0 solved, 1 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 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 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/221 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 10/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 79/300 variables, 38/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 41/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/306 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/306 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/306 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 185 constraints, problems are : Problem set: 0 solved, 1 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 538ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Graph (complete) has 432 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 127 transition count 175
Applied a total of 4 rules in 13 ms. Remains 127 /128 variables (removed 1) and now considering 175/178 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 127/128 places, 175/178 transitions.
RANDOM walk for 40000 steps (9133 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (3733 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 21097 steps, run visited all 1 properties in 62 ms. (steps per millisecond=340 )
Probabilistic random walk after 21097 steps, saw 10427 distinct states, run finished after 62 ms. (steps per millisecond=340 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 206 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 192 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 173 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 37398 reset in 365 ms.
Product exploration explored 100000 steps with 37300 reset in 256 ms.
Built C files in :
/tmp/ltsmin4783077220743941031
[2025-05-30 20:39:19] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4783077220743941031
Running compilation step : cd /tmp/ltsmin4783077220743941031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 706 ms.
Running link step : cd /tmp/ltsmin4783077220743941031;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4783077220743941031;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased825144760373423230.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2025-05-30 20:39:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:39:35] [INFO ] Implicit Places using invariants in 161 ms returned []
[2025-05-30 20:39:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:39:35] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-05-30 20:39:35] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2025-05-30 20:39:35] [INFO ] Invariant cache hit.
[2025-05-30 20:39:35] [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/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/306 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 54/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:39:43] [INFO ] Deduced a trap composed of 54 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:39:43] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 186 constraints, problems are : Problem set: 0 solved, 177 unsolved in 16755 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/306 variables, 128/132 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 54/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 177/363 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/306 variables, and 363 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46950ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 46951ms
Finished structural reductions in LTL mode , in 1 iterations and 47630 ms. Remains : 128/128 places, 178/178 transitions.
Built C files in :
/tmp/ltsmin3172459667102328701
[2025-05-30 20:40:22] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3172459667102328701
Running compilation step : cd /tmp/ltsmin3172459667102328701;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 449 ms.
Running link step : cd /tmp/ltsmin3172459667102328701;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3172459667102328701;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12050459833618462160.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 20:40:37] [INFO ] Flatten gal took : 13 ms
[2025-05-30 20:40:37] [INFO ] Flatten gal took : 12 ms
[2025-05-30 20:40:37] [INFO ] Time to serialize gal into /tmp/LTL15425331211979471596.gal : 3 ms
[2025-05-30 20:40:37] [INFO ] Time to serialize properties into /tmp/LTL1913624488590966363.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15425331211979471596.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2798698451327972976.hoa' '-atoms' '/tmp/LTL1913624488590966363.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1913624488590966363.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2798698451327972976.hoa
Detected timeout of ITS tools.
[2025-05-30 20:40:52] [INFO ] Flatten gal took : 11 ms
[2025-05-30 20:40:52] [INFO ] Flatten gal took : 10 ms
[2025-05-30 20:40:52] [INFO ] Time to serialize gal into /tmp/LTL15753265312922013756.gal : 2 ms
[2025-05-30 20:40:52] [INFO ] Time to serialize properties into /tmp/LTL9052854199869963669.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15753265312922013756.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9052854199869963669.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((X((!("((s1>=1)&&(l3659>=1))"))U((X(("((s1>=1)&&(l3659>=1))")||(G(!("((p362>=1)&&(l2273>=1))")))))||(G(!("((s1>=1)&&(l3659>=1))...191
Formula 0 simplified : FG(!"((s1<1)||(l3659<1))" | X("((s1>=1)&&(l3659>=1))" M X(!"((s1>=1)&&(l3659>=1))" & F"((p362>=1)&&(l2273>=1))")))
Detected timeout of ITS tools.
[2025-05-30 20:41:07] [INFO ] Flatten gal took : 10 ms
[2025-05-30 20:41:07] [INFO ] Applying decomposition
[2025-05-30 20:41:07] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17585873142858908673.txt' '-o' '/tmp/graph17585873142858908673.bin' '-w' '/tmp/graph17585873142858908673.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17585873142858908673.bin' '-l' '-1' '-v' '-w' '/tmp/graph17585873142858908673.weights' '-q' '0' '-e' '0.001'
[2025-05-30 20:41:08] [INFO ] Decomposing Gal with order
[2025-05-30 20:41:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 20:41:08] [INFO ] Removed a total of 201 redundant transitions.
[2025-05-30 20:41:08] [INFO ] Flatten gal took : 27 ms
[2025-05-30 20:41:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 114 labels/synchronizations in 10 ms.
[2025-05-30 20:41:08] [INFO ] Time to serialize gal into /tmp/LTL5771389708975888386.gal : 4 ms
[2025-05-30 20:41:08] [INFO ] Time to serialize properties into /tmp/LTL6865737589667375527.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5771389708975888386.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6865737589667375527.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F((X((!("((i1.u3.s1>=1)&&(i6.u17.l3659>=1))"))U((X(("((i1.u3.s1>=1)&&(i6.u17.l3659>=1))")||(G(!("((i6.u17.p362>=1)&&(i8.u23.l2273...257
Formula 0 simplified : FG(!"((i1.u3.s1<1)||(i6.u17.l3659<1))" | X("((i1.u3.s1>=1)&&(i6.u17.l3659>=1))" M X(!"((i1.u3.s1>=1)&&(i6.u17.l3659>=1))" & F"((i6.u...190
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-13 finished in 228824 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(F(p1)))))'
Support contains 3 out of 218 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 218/218 places, 454/454 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 188 transition count 338
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 188 transition count 338
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 76 place count 188 transition count 322
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 94 place count 170 transition count 299
Iterating global reduction 1 with 18 rules applied. Total rules applied 112 place count 170 transition count 299
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 117 place count 170 transition count 294
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 132 place count 155 transition count 271
Iterating global reduction 2 with 15 rules applied. Total rules applied 147 place count 155 transition count 271
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 152 place count 155 transition count 266
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 162 place count 145 transition count 249
Iterating global reduction 3 with 10 rules applied. Total rules applied 172 place count 145 transition count 249
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 177 place count 145 transition count 244
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 186 place count 136 transition count 218
Iterating global reduction 4 with 9 rules applied. Total rules applied 195 place count 136 transition count 218
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 202 place count 136 transition count 211
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 206 place count 132 transition count 190
Iterating global reduction 5 with 4 rules applied. Total rules applied 210 place count 132 transition count 190
Applied a total of 210 rules in 37 ms. Remains 132 /218 variables (removed 86) and now considering 190/454 (removed 264) transitions.
// Phase 1: matrix 190 rows 132 cols
[2025-05-30 20:41:23] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:41:23] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-05-30 20:41:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:41:23] [INFO ] State equation strengthened by 62 read => feed constraints.
[2025-05-30 20:41:23] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 827 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 20:41:23] [INFO ] Redundant transitions in 1 ms returned []
Running 189 sub problems to find dead transitions.
[2025-05-30 20:41:23] [INFO ] Invariant cache hit.
[2025-05-30 20:41:24] [INFO ] State equation strengthened by 62 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 190/322 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 62/196 constraints. Problems are: Problem set: 0 solved, 189 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (OVERLAPS) 0/322 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 196 constraints, problems are : Problem set: 0 solved, 189 unsolved in 19541 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 190/322 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 62/196 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 189/385 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/322 variables, and 385 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49679ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 49680ms
Starting structural reductions in SI_LTL mode, iteration 1 : 132/218 places, 190/454 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50550 ms. Remains : 132/218 places, 190/454 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-14
Product exploration explored 100000 steps with 22866 reset in 304 ms.
Product exploration explored 100000 steps with 23007 reset in 391 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 479 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 157 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9213 resets) in 296 ms. (134 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (1833 resets) in 95 ms. (416 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1811 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
[2025-05-30 20:42:14] [INFO ] Invariant cache hit.
[2025-05-30 20:42:14] [INFO ] State equation strengthened by 62 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/236 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 18/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 80/316 variables, 39/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 41/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/322 variables, 3/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/322 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 196 constraints, problems are : Problem set: 0 solved, 2 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/236 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 18/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 80/316 variables, 39/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 41/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/322 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/322 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 198 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1639 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1919ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 211 ms.
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 190/190 transitions.
Graph (complete) has 448 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 131 transition count 187
Applied a total of 4 rules in 9 ms. Remains 131 /132 variables (removed 1) and now considering 187/190 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 131/132 places, 187/190 transitions.
RANDOM walk for 40000 steps (9122 resets) in 245 ms. (162 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1812 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (1785 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1698 steps, run visited all 2 properties in 30 ms. (steps per millisecond=56 )
Probabilistic random walk after 1698 steps, saw 899 distinct states, run finished after 31 ms. (steps per millisecond=54 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 204 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 190/190 transitions.
Applied a total of 0 rules in 6 ms. Remains 132 /132 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2025-05-30 20:42:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:42:17] [INFO ] Implicit Places using invariants in 177 ms returned []
[2025-05-30 20:42:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:42:17] [INFO ] State equation strengthened by 62 read => feed constraints.
[2025-05-30 20:42:18] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 20:42:18] [INFO ] Redundant transitions in 0 ms returned []
Running 189 sub problems to find dead transitions.
[2025-05-30 20:42:18] [INFO ] Invariant cache hit.
[2025-05-30 20:42:18] [INFO ] State equation strengthened by 62 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 190/322 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 62/196 constraints. Problems are: Problem set: 0 solved, 189 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (OVERLAPS) 0/322 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 196 constraints, problems are : Problem set: 0 solved, 189 unsolved in 18479 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 190/322 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 62/196 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 189/385 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/322 variables, and 385 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48617ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 48617ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49475 ms. Remains : 132/132 places, 190/190 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 479 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (9117 resets) in 169 ms. (235 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (1818 resets) in 66 ms. (597 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (1795 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
[2025-05-30 20:43:07] [INFO ] Invariant cache hit.
[2025-05-30 20:43:07] [INFO ] State equation strengthened by 62 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/236 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 18/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 80/316 variables, 39/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 41/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/322 variables, 3/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/322 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/322 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 196 constraints, problems are : Problem set: 0 solved, 2 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 54/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/236 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 18/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 80/316 variables, 39/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 41/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/322 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/322 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/322 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/322 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 198 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1602 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1902ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 179 ms.
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 190/190 transitions.
Graph (complete) has 448 edges and 132 vertex of which 131 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 131 transition count 187
Applied a total of 4 rules in 10 ms. Remains 131 /132 variables (removed 1) and now considering 187/190 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 131/132 places, 187/190 transitions.
RANDOM walk for 40000 steps (9262 resets) in 204 ms. (195 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1799 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1732 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1698 steps, run visited all 2 properties in 21 ms. (steps per millisecond=80 )
Probabilistic random walk after 1698 steps, saw 899 distinct states, run finished after 21 ms. (steps per millisecond=80 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 233 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22960 reset in 383 ms.
Product exploration explored 100000 steps with 22965 reset in 418 ms.
Built C files in :
/tmp/ltsmin4541834554657104287
[2025-05-30 20:43:11] [INFO ] Computing symmetric may disable matrix : 190 transitions.
[2025-05-30 20:43:11] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:43:11] [INFO ] Computing symmetric may enable matrix : 190 transitions.
[2025-05-30 20:43:11] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:43:11] [INFO ] Computing Do-Not-Accords matrix : 190 transitions.
[2025-05-30 20:43:11] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:43:11] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4541834554657104287
Running compilation step : cd /tmp/ltsmin4541834554657104287;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 685 ms.
Running link step : cd /tmp/ltsmin4541834554657104287;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin4541834554657104287;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6861538937981339789.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 190/190 transitions.
Applied a total of 0 rules in 8 ms. Remains 132 /132 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2025-05-30 20:43:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:43:26] [INFO ] Implicit Places using invariants in 184 ms returned []
[2025-05-30 20:43:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:43:26] [INFO ] State equation strengthened by 62 read => feed constraints.
[2025-05-30 20:43:27] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []
Implicit Place search using SMT with State Equation took 1036 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 20:43:27] [INFO ] Redundant transitions in 1 ms returned []
Running 189 sub problems to find dead transitions.
[2025-05-30 20:43:27] [INFO ] Invariant cache hit.
[2025-05-30 20:43:27] [INFO ] State equation strengthened by 62 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 190/322 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 62/196 constraints. Problems are: Problem set: 0 solved, 189 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 7 (OVERLAPS) 0/322 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 189 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 196 constraints, problems are : Problem set: 0 solved, 189 unsolved in 18327 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 190/322 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 62/196 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 189/385 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/322 variables, and 385 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 132/132 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48552ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 48553ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49605 ms. Remains : 132/132 places, 190/190 transitions.
Built C files in :
/tmp/ltsmin15020397308318094944
[2025-05-30 20:44:15] [INFO ] Computing symmetric may disable matrix : 190 transitions.
[2025-05-30 20:44:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:44:15] [INFO ] Computing symmetric may enable matrix : 190 transitions.
[2025-05-30 20:44:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:44:15] [INFO ] Computing Do-Not-Accords matrix : 190 transitions.
[2025-05-30 20:44:15] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:44:15] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15020397308318094944
Running compilation step : cd /tmp/ltsmin15020397308318094944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 828 ms.
Running link step : cd /tmp/ltsmin15020397308318094944;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin15020397308318094944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12264162902198875536.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 20:44:30] [INFO ] Flatten gal took : 9 ms
[2025-05-30 20:44:30] [INFO ] Flatten gal took : 9 ms
[2025-05-30 20:44:30] [INFO ] Time to serialize gal into /tmp/LTL7531222589234029769.gal : 2 ms
[2025-05-30 20:44:30] [INFO ] Time to serialize properties into /tmp/LTL2923532207457280350.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7531222589234029769.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12712352395480092251.hoa' '-atoms' '/tmp/LTL2923532207457280350.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2923532207457280350.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12712352395480092251.hoa
Detected timeout of ITS tools.
[2025-05-30 20:44:46] [INFO ] Flatten gal took : 9 ms
[2025-05-30 20:44:46] [INFO ] Flatten gal took : 8 ms
[2025-05-30 20:44:46] [INFO ] Time to serialize gal into /tmp/LTL6249397689096921922.gal : 2 ms
[2025-05-30 20:44:46] [INFO ] Time to serialize properties into /tmp/LTL14966773532030613560.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6249397689096921922.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14966773532030613560.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("((s1<1)||(l4129<1))"))||(X(F("((s1>=1)&&(l3657>=1))"))))))
Formula 0 simplified : F(G!"((s1<1)||(l4129<1))" & XG!"((s1>=1)&&(l3657>=1))")
Detected timeout of ITS tools.
[2025-05-30 20:45:01] [INFO ] Flatten gal took : 10 ms
[2025-05-30 20:45:01] [INFO ] Applying decomposition
[2025-05-30 20:45:01] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8760487797413105517.txt' '-o' '/tmp/graph8760487797413105517.bin' '-w' '/tmp/graph8760487797413105517.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8760487797413105517.bin' '-l' '-1' '-v' '-w' '/tmp/graph8760487797413105517.weights' '-q' '0' '-e' '0.001'
[2025-05-30 20:45:01] [INFO ] Decomposing Gal with order
[2025-05-30 20:45:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 20:45:01] [INFO ] Removed a total of 236 redundant transitions.
[2025-05-30 20:45:01] [INFO ] Flatten gal took : 24 ms
[2025-05-30 20:45:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 160 labels/synchronizations in 13 ms.
[2025-05-30 20:45:01] [INFO ] Time to serialize gal into /tmp/LTL4012769161403493524.gal : 3 ms
[2025-05-30 20:45:01] [INFO ] Time to serialize properties into /tmp/LTL7652383294290411513.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4012769161403493524.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7652383294290411513.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((F("((i2.i0.u0.s1<1)||(i5.u22.l4129<1))"))||(X(F("((i2.i0.u0.s1>=1)&&(i2.i0.u19.l3657>=1))"))))))
Formula 0 simplified : F(G!"((i2.i0.u0.s1<1)||(i5.u22.l4129<1))" & XG!"((i2.i0.u0.s1>=1)&&(i2.i0.u19.l3657>=1))")
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-14 finished in 233129 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((G(p1)||p0))&&F(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0&&X((!p0 U (X((p0||G(!p1)))||G(!p0))))))))'
Found a Shortening insensitive property : DBSingleClientW-PT-d2m10-LTLFireability-13
Stuttering acceptance computed with spot in 224 ms :[p0, p0, false, false, false]
Support contains 4 out of 218 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 218/218 places, 454/454 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 187 transition count 331
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 187 transition count 331
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 78 place count 187 transition count 315
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 97 place count 168 transition count 292
Iterating global reduction 1 with 19 rules applied. Total rules applied 116 place count 168 transition count 292
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 120 place count 168 transition count 288
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 136 place count 152 transition count 264
Iterating global reduction 2 with 16 rules applied. Total rules applied 152 place count 152 transition count 264
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 157 place count 152 transition count 259
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 167 place count 142 transition count 238
Iterating global reduction 3 with 10 rules applied. Total rules applied 177 place count 142 transition count 238
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 182 place count 142 transition count 233
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 191 place count 133 transition count 207
Iterating global reduction 4 with 9 rules applied. Total rules applied 200 place count 133 transition count 207
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 207 place count 133 transition count 200
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 212 place count 128 transition count 178
Iterating global reduction 5 with 5 rules applied. Total rules applied 217 place count 128 transition count 178
Applied a total of 217 rules in 41 ms. Remains 128 /218 variables (removed 90) and now considering 178/454 (removed 276) transitions.
// Phase 1: matrix 178 rows 128 cols
[2025-05-30 20:45:16] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:45:17] [INFO ] Implicit Places using invariants in 239 ms returned []
[2025-05-30 20:45:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:45:17] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-05-30 20:45:17] [INFO ] Implicit Places using invariants and state equation in 831 ms returned []
Implicit Place search using SMT with State Equation took 1073 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2025-05-30 20:45:17] [INFO ] Invariant cache hit.
[2025-05-30 20:45:17] [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/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/306 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 54/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:45:27] [INFO ] Deduced a trap composed of 54 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:45:27] [INFO ] Deduced a trap composed of 57 places in 124 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 186 constraints, problems are : Problem set: 0 solved, 177 unsolved in 21385 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/306 variables, 128/132 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 54/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 177/363 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/306 variables, and 363 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51568ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 51569ms
Starting structural reductions in LI_LTL mode, iteration 1 : 128/218 places, 178/454 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 52683 ms. Remains : 128/218 places, 178/454 transitions.
Running random walk in product with property : DBSingleClientW-PT-d2m10-LTLFireability-13
Product exploration explored 100000 steps with 37439 reset in 406 ms.
Product exploration explored 100000 steps with 37341 reset in 379 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 460 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 99 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[p0, p0, false, false, false]
RANDOM walk for 40000 steps (9243 resets) in 189 ms. (210 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (3843 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1732 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (3851 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
[2025-05-30 20:46:10] [INFO ] Invariant cache hit.
[2025-05-30 20:46:10] [INFO ] State equation strengthened by 54 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 52/56 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 31/87 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 134/221 variables, 87/89 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 10/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 79/300 variables, 38/137 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 41/178 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/306 variables, 3/181 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 3/184 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 0/184 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/306 variables, 0/184 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 184 constraints, problems are : Problem set: 1 solved, 2 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 52/56 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 31/87 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 134/221 variables, 87/89 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 10/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/99 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 79/300 variables, 38/137 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 41/178 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 2/180 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 6/306 variables, 3/183 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 3/186 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/306 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/306 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 186 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1121 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1473ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 154 ms.
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Graph (complete) has 432 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 127 transition count 175
Applied a total of 4 rules in 8 ms. Remains 127 /128 variables (removed 1) and now considering 175/178 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 127/128 places, 175/178 transitions.
RANDOM walk for 40000 steps (9156 resets) in 304 ms. (131 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3894 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3805 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 21097 steps, run visited all 2 properties in 173 ms. (steps per millisecond=121 )
Probabilistic random walk after 21097 steps, saw 10427 distinct states, run finished after 173 ms. (steps per millisecond=121 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (G (OR (NOT p1) (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 7 factoid took 376 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 234 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2025-05-30 20:46:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:46:13] [INFO ] Implicit Places using invariants in 237 ms returned []
[2025-05-30 20:46:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:46:14] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-05-30 20:46:14] [INFO ] Implicit Places using invariants and state equation in 790 ms returned []
Implicit Place search using SMT with State Equation took 1029 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2025-05-30 20:46:14] [INFO ] Invariant cache hit.
[2025-05-30 20:46: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/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/306 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 54/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:46:24] [INFO ] Deduced a trap composed of 54 places in 129 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:46:24] [INFO ] Deduced a trap composed of 57 places in 129 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 186 constraints, problems are : Problem set: 0 solved, 177 unsolved in 22133 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/306 variables, 128/132 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 54/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 177/363 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/306 variables, and 363 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52257ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 52258ms
Finished structural reductions in LTL mode , in 1 iterations and 53291 ms. Remains : 128/128 places, 178/178 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 460 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (9211 resets) in 196 ms. (203 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (3857 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
[2025-05-30 20:47:07] [INFO ] Invariant cache hit.
[2025-05-30 20:47:07] [INFO ] State equation strengthened by 54 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/221 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 10/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 79/300 variables, 38/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 41/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/306 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/306 variables, 3/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/306 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 184 constraints, problems are : Problem set: 0 solved, 1 unsolved in 220 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 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 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 134/221 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 10/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 79/300 variables, 38/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 41/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/306 variables, 3/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/306 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/306 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 185 constraints, problems are : Problem set: 0 solved, 1 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 524ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Graph (complete) has 432 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 127 transition count 175
Applied a total of 4 rules in 6 ms. Remains 127 /128 variables (removed 1) and now considering 175/178 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 127/128 places, 175/178 transitions.
RANDOM walk for 40000 steps (9228 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3770 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 21097 steps, run visited all 1 properties in 75 ms. (steps per millisecond=281 )
Probabilistic random walk after 21097 steps, saw 10427 distinct states, run finished after 75 ms. (steps per millisecond=281 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 220 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 201 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 181 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 37370 reset in 260 ms.
Product exploration explored 100000 steps with 37301 reset in 269 ms.
Built C files in :
/tmp/ltsmin7573360581552368189
[2025-05-30 20:47:09] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7573360581552368189
Running compilation step : cd /tmp/ltsmin7573360581552368189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 641 ms.
Running link step : cd /tmp/ltsmin7573360581552368189;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7573360581552368189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13579644890641054331.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2025-05-30 20:47:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:47:24] [INFO ] Implicit Places using invariants in 161 ms returned []
[2025-05-30 20:47:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 20:47:24] [INFO ] State equation strengthened by 54 read => feed constraints.
[2025-05-30 20:47:25] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2025-05-30 20:47:25] [INFO ] Invariant cache hit.
[2025-05-30 20:47:25] [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/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/306 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 54/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:47:34] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 20:47:34] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 186 constraints, problems are : Problem set: 0 solved, 177 unsolved in 22456 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/306 variables, 128/132 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 54/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 177/363 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/306 variables, and 363 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 128/128 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 52581ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 52582ms
Finished structural reductions in LTL mode , in 1 iterations and 53334 ms. Remains : 128/128 places, 178/178 transitions.
Built C files in :
/tmp/ltsmin17839053756496494611
[2025-05-30 20:48:18] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17839053756496494611
Running compilation step : cd /tmp/ltsmin17839053756496494611;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 608 ms.
Running link step : cd /tmp/ltsmin17839053756496494611;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17839053756496494611;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17069746760294202243.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-30 20:48:33] [INFO ] Flatten gal took : 12 ms
[2025-05-30 20:48:33] [INFO ] Flatten gal took : 10 ms
[2025-05-30 20:48:33] [INFO ] Time to serialize gal into /tmp/LTL120790583504985842.gal : 3 ms
[2025-05-30 20:48:33] [INFO ] Time to serialize properties into /tmp/LTL5677493212350464986.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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL120790583504985842.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5209556012240371163.hoa' '-atoms' '/tmp/LTL5677493212350464986.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL5677493212350464986.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5209556012240371163.hoa
Detected timeout of ITS tools.
[2025-05-30 20:48:48] [INFO ] Flatten gal took : 11 ms
[2025-05-30 20:48:48] [INFO ] Flatten gal took : 11 ms
[2025-05-30 20:48:48] [INFO ] Time to serialize gal into /tmp/LTL9886099813213789697.gal : 3 ms
[2025-05-30 20:48:48] [INFO ] Time to serialize properties into /tmp/LTL9466856118080392947.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9886099813213789697.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9466856118080392947.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F((X((!("((s1>=1)&&(l3659>=1))"))U((X(("((s1>=1)&&(l3659>=1))")||(G(!("((p362>=1)&&(l2273>=1))")))))||(G(!("((s1>=1)&&(l3659>=1))...191
Formula 0 simplified : FG(!"((s1<1)||(l3659<1))" | X("((s1>=1)&&(l3659>=1))" M X(!"((s1>=1)&&(l3659>=1))" & F"((p362>=1)&&(l2273>=1))")))
Detected timeout of ITS tools.
[2025-05-30 20:49:03] [INFO ] Flatten gal took : 8 ms
[2025-05-30 20:49:03] [INFO ] Applying decomposition
[2025-05-30 20:49:03] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1278739923504267732.txt' '-o' '/tmp/graph1278739923504267732.bin' '-w' '/tmp/graph1278739923504267732.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1278739923504267732.bin' '-l' '-1' '-v' '-w' '/tmp/graph1278739923504267732.weights' '-q' '0' '-e' '0.001'
[2025-05-30 20:49:03] [INFO ] Decomposing Gal with order
[2025-05-30 20:49:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 20:49:03] [INFO ] Removed a total of 181 redundant transitions.
[2025-05-30 20:49:03] [INFO ] Flatten gal took : 19 ms
[2025-05-30 20:49:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 119 labels/synchronizations in 7 ms.
[2025-05-30 20:49:03] [INFO ] Time to serialize gal into /tmp/LTL1012080909383642984.gal : 2 ms
[2025-05-30 20:49:03] [INFO ] Time to serialize properties into /tmp/LTL6286212709362495838.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1012080909383642984.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6286212709362495838.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F((X((!("((i3.u0.s1>=1)&&(i4.u14.l3659>=1))"))U((X(("((i3.u0.s1>=1)&&(i4.u14.l3659>=1))")||(G(!("((i4.u14.p362>=1)&&(i6.u22.l2273...257
Formula 0 simplified : FG(!"((i3.u0.s1<1)||(i4.u14.l3659<1))" | X("((i3.u0.s1>=1)&&(i4.u14.l3659>=1))" M X(!"((i3.u0.s1>=1)&&(i4.u14.l3659>=1))" & F"((i4.u...190
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d2m10-LTLFireability-13 finished in 242110 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(F(p1)))))'
[2025-05-30 20:49:18] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11997902164314081714
[2025-05-30 20:49:18] [INFO ] Computing symmetric may disable matrix : 454 transitions.
[2025-05-30 20:49:18] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:49:18] [INFO ] Applying decomposition
[2025-05-30 20:49:18] [INFO ] Computing symmetric may enable matrix : 454 transitions.
[2025-05-30 20:49:18] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:49:18] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph7467295579401026911.txt' '-o' '/tmp/graph7467295579401026911.bin' '-w' '/tmp/graph7467295579401026911.weights'
[2025-05-30 20:49:18] [INFO ] Computing Do-Not-Accords matrix : 454 transitions.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph7467295579401026911.bin' '-l' '-1' '-v' '-w' '/tmp/graph7467295579401026911.weights' '-q' '0' '-e' '0.001'
[2025-05-30 20:49:18] [INFO ] Decomposing Gal with order
[2025-05-30 20:49:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 20:49:18] [INFO ] Computation of Completed DNA matrix. took 65 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-30 20:49:18] [INFO ] Built C files in 226ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11997902164314081714
Running compilation step : cd /tmp/ltsmin11997902164314081714;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-30 20:49:18] [INFO ] Removed a total of 415 redundant transitions.
[2025-05-30 20:49:18] [INFO ] Flatten gal took : 71 ms
[2025-05-30 20:49:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 345 labels/synchronizations in 17 ms.
[2025-05-30 20:49:19] [INFO ] Time to serialize gal into /tmp/LTLFireability17658571684738763409.gal : 7 ms
[2025-05-30 20:49:19] [INFO ] Time to serialize properties into /tmp/LTLFireability5017659926196474280.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17658571684738763409.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5017659926196474280.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((G((F(("((i1.u7.p34<1)||(i3.u0.l0<1))")||(G("((i3.u0.s1<1)||(u24.l4138<1))"))))&&(F("((i3.u0.s1<1)||(i4.u11.l2287<1))")))))
Formula 0 simplified : F(G(!"((i1.u7.p34<1)||(i3.u0.l0<1))" & F!"((i3.u0.s1<1)||(u24.l4138<1))") | G!"((i3.u0.s1<1)||(i4.u11.l2287<1))")
Compilation finished in 2131 ms.
Running link step : cd /tmp/ltsmin11997902164314081714;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin11997902164314081714;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>(([]((LTLAPp1==true))||(LTLAPp0==true)))&&<>((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin11997902164314081714;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>(([]((LTLAPp1==true))||(LTLAPp0==true)))&&<>((LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11997902164314081714;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((!(LTLAPp3==true)&&X((!(LTLAPp3==true) U (X(((LTLAPp3==true)||[](!(LTLAPp4==true))))||[](!(LTLAPp3==true))))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin11997902164314081714;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((!(LTLAPp3==true)&&X((!(LTLAPp3==true) U (X(((LTLAPp3==true)||[](!(LTLAPp4==true))))||[](!(LTLAPp3==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin11997902164314081714;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp5==true))||X(<>((LTLAPp6==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin11997902164314081714;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp5==true))||X(<>((LTLAPp6==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin11997902164314081714;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>(([]((LTLAPp1==true))||(LTLAPp0==true)))&&<>((LTLAPp2==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-05-30 21:18:30] [INFO ] Flatten gal took : 40 ms
[2025-05-30 21:18:30] [INFO ] Time to serialize gal into /tmp/LTLFireability3617218097103995804.gal : 11 ms
[2025-05-30 21:18:30] [INFO ] Time to serialize properties into /tmp/LTLFireability5899841843502937311.ltl : 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3617218097103995804.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5899841843502937311.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 3 LTL properties
Checking formula 0 : !((G((F(("((p34<1)||(l0<1))")||(G("((s1<1)||(l4138<1))"))))&&(F("((s1<1)||(l2287<1))")))))
Formula 0 simplified : F(G(!"((p34<1)||(l0<1))" & F!"((s1<1)||(l4138<1))") | G!"((s1<1)||(l2287<1))")
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-d2m10"
export BK_EXAMINATION="LTLFireability"
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-d2m10, examination is LTLFireability"
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-174854063600164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m10.tgz
mv DBSingleClientW-PT-d2m10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;