Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 119K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748558772775

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-d0m09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-29 22:46:14] [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-29 22:46:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 22:46:15] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2025-05-29 22:46:15] [INFO ] Transformed 553 places.
[2025-05-29 22:46:15] [INFO ] Transformed 150 transitions.
[2025-05-29 22:46:15] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 614 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 444 places in 5 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 32 place count 88 transition count 120
Iterating global reduction 1 with 14 rules applied. Total rules applied 46 place count 88 transition count 120
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 85 transition count 117
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 85 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 84 transition count 116
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 84 transition count 116
Applied a total of 54 rules in 47 ms. Remains 84 /109 variables (removed 25) and now considering 116/150 (removed 34) transitions.
// Phase 1: matrix 116 rows 84 cols
[2025-05-29 22:46:16] [INFO ] Computed 2 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:46:16] [INFO ] Implicit Places using invariants in 398 ms returned []
[2025-05-29 22:46:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:46:16] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-05-29 22:46:16] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2025-05-29 22:46:16] [INFO ] Invariant cache hit.
[2025-05-29 22:46:16] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/200 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 48/134 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 134 constraints, problems are : Problem set: 0 solved, 115 unsolved in 6915 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/200 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 48/134 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 115/249 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 249 constraints, problems are : Problem set: 0 solved, 115 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37232ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 37249ms
Starting structural reductions in LTL mode, iteration 1 : 84/109 places, 116/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38155 ms. Remains : 84/109 places, 116/150 transitions.
Support contains 35 out of 84 places after structural reductions.
[2025-05-29 22:46:54] [INFO ] Flatten gal took : 58 ms
[2025-05-29 22:46:54] [INFO ] Flatten gal took : 24 ms
[2025-05-29 22:46:54] [INFO ] Input system was already deterministic with 116 transitions.
Support contains 34 out of 84 places (down from 35) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 29 to 27
RANDOM walk for 40000 steps (9172 resets) in 2550 ms. (15 steps per ms) remains 14/27 properties
BEST_FIRST walk for 40003 steps (1886 resets) in 267 ms. (149 steps per ms) remains 12/14 properties
BEST_FIRST walk for 40003 steps (2022 resets) in 121 ms. (327 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1923 resets) in 122 ms. (325 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (4138 resets) in 445 ms. (89 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (4122 resets) in 161 ms. (246 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40001 steps (1964 resets) in 224 ms. (177 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (4094 resets) in 161 ms. (246 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (4119 resets) in 145 ms. (273 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (1911 resets) in 122 ms. (325 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (4066 resets) in 171 ms. (232 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (1982 resets) in 113 ms. (350 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (1944 resets) in 89 ms. (444 steps per ms) remains 11/11 properties
[2025-05-29 22:46:56] [INFO ] Invariant cache hit.
[2025-05-29 22:46:56] [INFO ] State equation strengthened by 48 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 26/43 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 21/64 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 95/159 variables, 64/66 constraints. Problems are: Problem set: 1 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 27/93 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 39/198 variables, 19/112 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 20/132 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/132 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 2/200 variables, 1/133 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/200 variables, 1/134 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/200 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/200 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 134 constraints, problems are : Problem set: 1 solved, 10 unsolved in 707 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 26/42 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 21/63 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 90/153 variables, 63/65 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 22/87 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:46:57] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:46:57] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:46:57] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 3/90 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 45/198 variables, 20/110 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 25/135 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 10/145 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 2/200 variables, 1/146 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/200 variables, 1/147 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/200 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 0/200 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 147 constraints, problems are : Problem set: 1 solved, 10 unsolved in 4093 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 84/84 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 10/11 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4822ms problems are : Problem set: 1 solved, 10 unsolved
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 2 properties in 3019 ms.
Support contains 13 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 77 transition count 100
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 77 transition count 100
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 74 transition count 97
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 74 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 73 transition count 95
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 73 transition count 95
Applied a total of 22 rules in 23 ms. Remains 73 /84 variables (removed 11) and now considering 95/116 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 73/84 places, 95/116 transitions.
RANDOM walk for 40000 steps (9143 resets) in 197 ms. (202 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1972 resets) in 106 ms. (373 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (4108 resets) in 141 ms. (281 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (4012 resets) in 114 ms. (347 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (1988 resets) in 125 ms. (317 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (4126 resets) in 142 ms. (279 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (4106 resets) in 147 ms. (270 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1960 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1955 resets) in 103 ms. (384 steps per ms) remains 7/7 properties
// Phase 1: matrix 95 rows 73 cols
[2025-05-29 22:47:04] [INFO ] Computed 2 invariants in 3 ms
[2025-05-29 22:47:04] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 24/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 20/55 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 81/136 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 19/76 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 32/168 variables, 18/94 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/168 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 108 constraints, problems are : Problem set: 0 solved, 7 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 24/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 20/55 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 81/136 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 19/76 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 32/168 variables, 18/94 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 14/108 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 7/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/168 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/168 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 115 constraints, problems are : Problem set: 0 solved, 7 unsolved in 920 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 73/73 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1286ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 1665 ms.
Support contains 11 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 95/95 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 72 transition count 94
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 72 transition count 94
Applied a total of 2 rules in 10 ms. Remains 72 /73 variables (removed 1) and now considering 94/95 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 72/73 places, 94/95 transitions.
RANDOM walk for 40000 steps (9179 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1976 resets) in 51 ms. (769 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (4013 resets) in 72 ms. (547 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (2049 resets) in 50 ms. (784 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (4048 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3991 resets) in 62 ms. (634 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (2033 resets) in 58 ms. (678 steps per ms) remains 5/5 properties
// Phase 1: matrix 94 rows 72 cols
[2025-05-29 22:47:07] [INFO ] Computed 2 invariants in 3 ms
[2025-05-29 22:47:07] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 23/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 20/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 74/126 variables, 52/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 38/164 variables, 19/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 19/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 2/166 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/166 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/166 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/166 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 107 constraints, problems are : Problem set: 0 solved, 5 unsolved in 349 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 23/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 20/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 74/126 variables, 52/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 38/164 variables, 19/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 19/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 2/166 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/166 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/166 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/166 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 112 constraints, problems are : Problem set: 0 solved, 5 unsolved in 915 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 72/72 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1276ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 3 properties in 722 ms.
Support contains 4 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 94/94 transitions.
Graph (complete) has 215 edges and 72 vertex of which 71 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 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 71 transition count 92
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 7 place count 67 transition count 84
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 67 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 67 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 65 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 65 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 65 transition count 79
Applied a total of 18 rules in 23 ms. Remains 65 /72 variables (removed 7) and now considering 79/94 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 65/72 places, 79/94 transitions.
RANDOM walk for 40000 steps (9190 resets) in 110 ms. (360 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4029 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4045 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 17818 steps, run visited all 2 properties in 68 ms. (steps per millisecond=262 )
Probabilistic random walk after 17818 steps, saw 7985 distinct states, run finished after 74 ms. (steps per millisecond=240 ) properties seen :2
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 281 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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(!p0) U (!p1&&X(X(p2)))))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 71 transition count 93
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 71 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 71 transition count 92
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 64 transition count 82
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 64 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 64 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 62 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 62 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 62 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 50 place count 60 transition count 74
Iterating global reduction 3 with 2 rules applied. Total rules applied 52 place count 60 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 54 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 55 place count 59 transition count 71
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 59 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 58 place count 59 transition count 69
Applied a total of 58 rules in 25 ms. Remains 59 /84 variables (removed 25) and now considering 69/116 (removed 47) transitions.
// Phase 1: matrix 69 rows 59 cols
[2025-05-29 22:47:10] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:47:10] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-05-29 22:47:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:47:10] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-29 22:47:10] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 68 sub problems to find dead transitions.
[2025-05-29 22:47:10] [INFO ] Invariant cache hit.
[2025-05-29 22:47:10] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/128 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 25/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 86 constraints, problems are : Problem set: 0 solved, 68 unsolved in 2338 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/128 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 25/86 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 68/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 154 constraints, problems are : Problem set: 0 solved, 68 unsolved in 6785 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9161ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 9163ms
Starting structural reductions in LTL mode, iteration 1 : 59/84 places, 69/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9577 ms. Remains : 59/84 places, 69/116 transitions.
Stuttering acceptance computed with spot in 492 ms :[(NOT p2), (NOT p2), (NOT p2), true, (OR (NOT p2) p1), (OR (NOT p2) p1 p0), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-00 finished in 10174 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(F(p0))||(!p1&&F(p0)))))||(X(X(F(!p2)))&&F((G(F(p0))||(!p1&&F(p0)))))))'
Support contains 5 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 71 transition count 90
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 71 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 71 transition count 88
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 65 transition count 79
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 65 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 42 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 64 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 63 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 63 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 63 transition count 73
Applied a total of 48 rules in 12 ms. Remains 63 /84 variables (removed 21) and now considering 73/116 (removed 43) transitions.
// Phase 1: matrix 73 rows 63 cols
[2025-05-29 22:47:20] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:47:20] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-05-29 22:47:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:47:20] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-29 22:47:20] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2025-05-29 22:47:20] [INFO ] Invariant cache hit.
[2025-05-29 22:47:20] [INFO ] State equation strengthened by 23 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 23/88 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/136 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 136/136 variables, and 88 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2966 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/136 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 23/88 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 72/160 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/136 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 136/136 variables, and 160 constraints, problems are : Problem set: 0 solved, 72 unsolved in 11507 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14513ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 14513ms
Starting structural reductions in LTL mode, iteration 1 : 63/84 places, 73/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14789 ms. Remains : 63/84 places, 73/116 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-01
Stuttering criterion allowed to conclude after 18 steps with 5 reset in 2 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-01 finished in 15050 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)&&F(G(p1)))))'
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 72 transition count 94
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 72 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 72 transition count 93
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 66 transition count 84
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 66 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 66 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 64 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 64 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 64 transition count 78
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 46 place count 62 transition count 76
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 62 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 50 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 51 place count 61 transition count 73
Iterating global reduction 4 with 1 rules applied. Total rules applied 52 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 54 place count 61 transition count 71
Applied a total of 54 rules in 33 ms. Remains 61 /84 variables (removed 23) and now considering 71/116 (removed 45) transitions.
// Phase 1: matrix 71 rows 61 cols
[2025-05-29 22:47:35] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:47:35] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-05-29 22:47:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:47:35] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-05-29 22:47:35] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:47:35] [INFO ] Redundant transitions in 2 ms returned []
Running 70 sub problems to find dead transitions.
[2025-05-29 22:47:35] [INFO ] Invariant cache hit.
[2025-05-29 22:47:35] [INFO ] State equation strengthened by 27 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/132 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 27/90 constraints. Problems are: Problem set: 0 solved, 70 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 90 constraints, problems are : Problem set: 0 solved, 70 unsolved in 2125 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 1/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/132 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 27/90 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 70/160 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 160 constraints, problems are : Problem set: 0 solved, 70 unsolved in 7520 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9681ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 9682ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/84 places, 71/116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10096 ms. Remains : 61/84 places, 71/116 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-02
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-02 finished in 10228 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(!p1)))||(!p0&&F(!p1)&&F(!p2))) U X((X(!p1) U ((!p2&&X(!p1))||X(G(!p1)))))))'
Support contains 6 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 73 transition count 91
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 73 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 73 transition count 90
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 68 transition count 84
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 68 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 35 place count 68 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 67 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 67 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 67 transition count 79
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 66 transition count 78
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 66 transition count 78
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 65 transition count 77
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 65 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 44 place count 65 transition count 75
Applied a total of 44 rules in 7 ms. Remains 65 /84 variables (removed 19) and now considering 75/116 (removed 41) transitions.
// Phase 1: matrix 75 rows 65 cols
[2025-05-29 22:47:45] [INFO ] Computed 2 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:47:45] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-05-29 22:47:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:47:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 22:47:45] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2025-05-29 22:47:45] [INFO ] Invariant cache hit.
[2025-05-29 22:47:45] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 75/140 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:47:47] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 90 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2404 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (OVERLAPS) 1/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 75/140 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 74/164 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 0/140 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 164 constraints, problems are : Problem set: 0 solved, 74 unsolved in 12442 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14887ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 14888ms
Starting structural reductions in LTL mode, iteration 1 : 65/84 places, 75/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15126 ms. Remains : 65/84 places, 75/116 transitions.
Stuttering acceptance computed with spot in 709 ms :[p1, p1, p1, p1, p1, (AND p1 p2), p1, p1, (AND p2 p0 p1), (AND p1 p2), (AND p2 p1), true, p2, (AND p2 p0 (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-03
Product exploration explored 100000 steps with 33333 reset in 527 ms.
Product exploration explored 100000 steps with 33333 reset in 332 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 211 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 29 factoid took 159 ms. Reduced automaton from 14 states, 37 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-03 finished in 16911 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(p1)&&p0))||X(F(p2))))'
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 71 transition count 93
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 71 transition count 93
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 71 transition count 92
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 34 place count 64 transition count 82
Iterating global reduction 1 with 7 rules applied. Total rules applied 41 place count 64 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 64 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 63 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 63 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 63 transition count 77
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 62 transition count 76
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 62 transition count 76
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 61 transition count 75
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 61 transition count 73
Applied a total of 52 rules in 8 ms. Remains 61 /84 variables (removed 23) and now considering 73/116 (removed 43) transitions.
// Phase 1: matrix 73 rows 61 cols
[2025-05-29 22:48:02] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:48:02] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-05-29 22:48:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:48:02] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-29 22:48:02] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2025-05-29 22:48:02] [INFO ] Invariant cache hit.
[2025-05-29 22:48:02] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/134 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 26/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 89 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1985 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 73/134 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 26/89 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 72/161 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 161 constraints, problems are : Problem set: 0 solved, 72 unsolved in 14457 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16480ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 16482ms
Starting structural reductions in LTL mode, iteration 1 : 61/84 places, 73/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16767 ms. Remains : 61/84 places, 73/116 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 273 ms.
Product exploration explored 100000 steps with 50000 reset in 292 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 198 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 22 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-05 finished in 17605 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(G((p0||X((F(G(!p1)) U p2))))))))'
Support contains 6 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 72 transition count 90
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 72 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 72 transition count 89
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 67 transition count 84
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 67 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 66 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 66 transition count 80
Applied a total of 39 rules in 8 ms. Remains 66 /84 variables (removed 18) and now considering 80/116 (removed 36) transitions.
// Phase 1: matrix 80 rows 66 cols
[2025-05-29 22:48:20] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:48:20] [INFO ] Implicit Places using invariants in 112 ms returned []
[2025-05-29 22:48:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:48:20] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-29 22:48:20] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2025-05-29 22:48:20] [INFO ] Invariant cache hit.
[2025-05-29 22:48:20] [INFO ] State equation strengthened by 23 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 80/146 variables, 66/68 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 23/91 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:48:22] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 92 constraints, problems are : Problem set: 0 solved, 79 unsolved in 3896 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 80/146 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 23/92 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 79/171 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/146 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 171 constraints, problems are : Problem set: 0 solved, 79 unsolved in 16907 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20882ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 20883ms
Starting structural reductions in LTL mode, iteration 1 : 66/84 places, 80/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21206 ms. Remains : 66/84 places, 80/116 transitions.
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), p1]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-06
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-06 finished in 21486 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)))'
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 70 transition count 88
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 70 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 70 transition count 87
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 64 transition count 78
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 64 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 64 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 63 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 62 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 62 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 62 transition count 72
Applied a total of 49 rules in 14 ms. Remains 62 /84 variables (removed 22) and now considering 72/116 (removed 44) transitions.
// Phase 1: matrix 72 rows 62 cols
[2025-05-29 22:48:41] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:48:41] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-05-29 22:48:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:48:41] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 22:48:41] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:48:41] [INFO ] Redundant transitions in 1 ms returned []
Running 71 sub problems to find dead transitions.
[2025-05-29 22:48:41] [INFO ] Invariant cache hit.
[2025-05-29 22:48:41] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/134 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 22/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:48:43] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:48:43] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 88 constraints, problems are : Problem set: 0 solved, 71 unsolved in 2340 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 72/134 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 22/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 71/159 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 159 constraints, problems are : Problem set: 0 solved, 71 unsolved in 10512 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12886ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 12886ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/84 places, 72/116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13133 ms. Remains : 62/84 places, 72/116 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-07
Product exploration explored 100000 steps with 22883 reset in 197 ms.
Product exploration explored 100000 steps with 22926 reset in 231 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 201 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 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 81 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9181 resets) in 250 ms. (159 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4108 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4360 steps, run visited all 1 properties in 11 ms. (steps per millisecond=396 )
Probabilistic random walk after 4360 steps, saw 1997 distinct states, run finished after 12 ms. (steps per millisecond=363 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 144 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 103 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-05-29 22:48:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:48:56] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-05-29 22:48:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:48:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 22:48:56] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:48:56] [INFO ] Redundant transitions in 2 ms returned []
Running 71 sub problems to find dead transitions.
[2025-05-29 22:48:56] [INFO ] Invariant cache hit.
[2025-05-29 22:48:56] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/134 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 22/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:48:58] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:48:58] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 88 constraints, problems are : Problem set: 0 solved, 71 unsolved in 3183 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 72/134 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 22/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 71/159 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 159 constraints, problems are : Problem set: 0 solved, 71 unsolved in 10850 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14069ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 14069ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14390 ms. Remains : 62/62 places, 72/72 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 201 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 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 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9116 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (4087 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4360 steps, run visited all 1 properties in 12 ms. (steps per millisecond=363 )
Probabilistic random walk after 4360 steps, saw 1997 distinct states, run finished after 12 ms. (steps per millisecond=363 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 108 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 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22944 reset in 126 ms.
Product exploration explored 100000 steps with 22943 reset in 139 ms.
Built C files in :
/tmp/ltsmin1588522643078068657
[2025-05-29 22:49:11] [INFO ] Computing symmetric may disable matrix : 72 transitions.
[2025-05-29 22:49:11] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 22:49:11] [INFO ] Computing symmetric may enable matrix : 72 transitions.
[2025-05-29 22:49:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 22:49:11] [INFO ] Computing Do-Not-Accords matrix : 72 transitions.
[2025-05-29 22:49:11] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 22:49:11] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1588522643078068657
Running compilation step : cd /tmp/ltsmin1588522643078068657;'/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 481 ms.
Running link step : cd /tmp/ltsmin1588522643078068657;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin1588522643078068657;'/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/stateBased11921326862539526069.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-05-29 22:49:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:49:26] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-05-29 22:49:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:49:26] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 22:49:26] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:49:26] [INFO ] Redundant transitions in 1 ms returned []
Running 71 sub problems to find dead transitions.
[2025-05-29 22:49:26] [INFO ] Invariant cache hit.
[2025-05-29 22:49:26] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/134 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 22/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:49:28] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:49:28] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 88 constraints, problems are : Problem set: 0 solved, 71 unsolved in 3306 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 72/134 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 22/88 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 71/159 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 159 constraints, problems are : Problem set: 0 solved, 71 unsolved in 10854 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14181ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 14181ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14431 ms. Remains : 62/62 places, 72/72 transitions.
Built C files in :
/tmp/ltsmin18181627936337302284
[2025-05-29 22:49:40] [INFO ] Computing symmetric may disable matrix : 72 transitions.
[2025-05-29 22:49:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 22:49:40] [INFO ] Computing symmetric may enable matrix : 72 transitions.
[2025-05-29 22:49:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 22:49:40] [INFO ] Computing Do-Not-Accords matrix : 72 transitions.
[2025-05-29 22:49:40] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 22:49:40] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18181627936337302284
Running compilation step : cd /tmp/ltsmin18181627936337302284;'/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 393 ms.
Running link step : cd /tmp/ltsmin18181627936337302284;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin18181627936337302284;'/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/stateBased14442776612370881173.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-29 22:49:56] [INFO ] Flatten gal took : 10 ms
[2025-05-29 22:49:56] [INFO ] Flatten gal took : 8 ms
[2025-05-29 22:49:56] [INFO ] Time to serialize gal into /tmp/LTL2305681725886063387.gal : 3 ms
[2025-05-29 22:49:56] [INFO ] Time to serialize properties into /tmp/LTL5300059112557290414.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2305681725886063387.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6716143425664598880.hoa' '-atoms' '/tmp/LTL5300059112557290414.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...317
Loading property file /tmp/LTL5300059112557290414.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6716143425664598880.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t29, t68, t85, t87, t88, t89, t92, t93, t94, t95, t96, t97, t98, t99, t1...305
Computing Next relation with stutter on 1.20935e+07 deadlock states
Detected timeout of ITS tools.
[2025-05-29 22:50:11] [INFO ] Flatten gal took : 12 ms
[2025-05-29 22:50:11] [INFO ] Flatten gal took : 11 ms
[2025-05-29 22:50:11] [INFO ] Time to serialize gal into /tmp/LTL12188406274766476909.gal : 4 ms
[2025-05-29 22:50:11] [INFO ] Time to serialize properties into /tmp/LTL12638888764306943305.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12188406274766476909.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12638888764306943305.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...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((p21<1)||(l126<1))"))))
Formula 0 simplified : FG!"((p21<1)||(l126<1))"
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t9, t10, t29, t68, t85, t87, t88, t89, t92, t93, t94, t95, t96, t97, t98, t99, t1...305
Computing Next relation with stutter on 1.20935e+07 deadlock states
Detected timeout of ITS tools.
[2025-05-29 22:50:26] [INFO ] Flatten gal took : 7 ms
[2025-05-29 22:50:26] [INFO ] Applying decomposition
[2025-05-29 22:50:26] [INFO ] Flatten gal took : 6 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/graph15024659258246721283.txt' '-o' '/tmp/graph15024659258246721283.bin' '-w' '/tmp/graph15024659258246721283.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15024659258246721283.bin' '-l' '-1' '-v' '-w' '/tmp/graph15024659258246721283.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:50:26] [INFO ] Decomposing Gal with order
[2025-05-29 22:50:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:50:26] [INFO ] Removed a total of 69 redundant transitions.
[2025-05-29 22:50:26] [INFO ] Flatten gal took : 59 ms
[2025-05-29 22:50:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 10 ms.
[2025-05-29 22:50:26] [INFO ] Time to serialize gal into /tmp/LTL12195765419275591241.gal : 4 ms
[2025-05-29 22:50:26] [INFO ] Time to serialize properties into /tmp/LTL5638867131813462123.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/LTL12195765419275591241.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5638867131813462123.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...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i0.u10.p21<1)||(i1.u8.l126<1))"))))
Formula 0 simplified : FG!"((i0.u10.p21<1)||(i1.u8.l126<1))"
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-07 finished in 119874 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) U (F((F(p0)&&p1))&&X(p2))))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 72 transition count 94
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 72 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 72 transition count 93
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 66 transition count 86
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 66 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 66 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 65 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 65 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 65 transition count 81
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 64 transition count 80
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 64 transition count 80
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 63 transition count 79
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 63 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 48 place count 63 transition count 77
Applied a total of 48 rules in 5 ms. Remains 63 /84 variables (removed 21) and now considering 77/116 (removed 39) transitions.
// Phase 1: matrix 77 rows 63 cols
[2025-05-29 22:50:41] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:50:41] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-05-29 22:50:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:50:41] [INFO ] State equation strengthened by 26 read => feed constraints.
[2025-05-29 22:50:41] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2025-05-29 22:50:41] [INFO ] Invariant cache hit.
[2025-05-29 22:50:41] [INFO ] State equation strengthened by 26 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 91 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2661 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/140 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 26/91 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 76/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/140 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 167 constraints, problems are : Problem set: 0 solved, 76 unsolved in 10795 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13479ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 13479ms
Starting structural reductions in LTL mode, iteration 1 : 63/84 places, 77/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13765 ms. Remains : 63/84 places, 77/116 transitions.
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p0), true, (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-08 finished in 14102 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(G(p0))))&&(G(p1)||G(p2))))'
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 72 transition count 93
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 72 transition count 93
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 66 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 66 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 66 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 64 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 64 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 64 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 62 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 62 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 61 transition count 73
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 61 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 53 place count 61 transition count 71
Applied a total of 53 rules in 7 ms. Remains 61 /84 variables (removed 23) and now considering 71/116 (removed 45) transitions.
// Phase 1: matrix 71 rows 61 cols
[2025-05-29 22:50:55] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:50:55] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-05-29 22:50:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:50:55] [INFO ] State equation strengthened by 27 read => feed constraints.
[2025-05-29 22:50:55] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2025-05-29 22:50:55] [INFO ] Invariant cache hit.
[2025-05-29 22:50:55] [INFO ] State equation strengthened by 27 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/132 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 27/90 constraints. Problems are: Problem set: 0 solved, 70 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 0/132 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 90 constraints, problems are : Problem set: 0 solved, 70 unsolved in 3001 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 71/132 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 27/90 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 70/160 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 160 constraints, problems are : Problem set: 0 solved, 70 unsolved in 6370 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9396ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 9397ms
Starting structural reductions in LTL mode, iteration 1 : 61/84 places, 71/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9653 ms. Remains : 61/84 places, 71/116 transitions.
Stuttering acceptance computed with spot in 344 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-10
Product exploration explored 100000 steps with 22715 reset in 250 ms.
Product exploration explored 100000 steps with 22880 reset in 276 ms.
Computed a total of 5 stabilizing places and 11 stable transitions
Graph (complete) has 197 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p1), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 p2)), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 205 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[true, (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (9214 resets) in 462 ms. (86 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (2010 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1939 resets) in 220 ms. (181 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (2069 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 2082 steps, run visited all 3 properties in 23 ms. (steps per millisecond=90 )
Probabilistic random walk after 2082 steps, saw 1034 distinct states, run finished after 24 ms. (steps per millisecond=86 ) properties seen :3
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p1), (X (NOT (AND p1 (NOT p2)))), (X (AND p1 p2)), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (NOT (AND p2 p0))), (F (NOT (AND p2 p0)))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 13 factoid took 245 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-10 finished in 11558 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((p0&&(!p0 U !p1)))||G(p2))))'
Support contains 5 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 70 transition count 88
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 70 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 70 transition count 87
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 63 transition count 77
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 63 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 63 transition count 75
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 61 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 61 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 52 place count 59 transition count 69
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 56 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 57 place count 58 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 58 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 60 place count 58 transition count 64
Applied a total of 60 rules in 5 ms. Remains 58 /84 variables (removed 26) and now considering 64/116 (removed 52) transitions.
// Phase 1: matrix 64 rows 58 cols
[2025-05-29 22:51:07] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:51:07] [INFO ] Implicit Places using invariants in 99 ms returned []
[2025-05-29 22:51:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:51:07] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-05-29 22:51:07] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2025-05-29 22:51:07] [INFO ] Invariant cache hit.
[2025-05-29 22:51:07] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 80 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2367 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 63/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 143 constraints, problems are : Problem set: 0 solved, 63 unsolved in 9651 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12041ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 12041ms
Starting structural reductions in LTL mode, iteration 1 : 58/84 places, 64/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12328 ms. Remains : 58/84 places, 64/116 transitions.
Stuttering acceptance computed with spot in 219 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (NOT p0) p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-11
Entered a terminal (fully accepting) state of product in 78481 steps with 17979 reset in 322 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-11 finished in 12889 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) U G(p1)))'
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 72 transition count 96
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 72 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 72 transition count 95
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 32 place count 65 transition count 85
Iterating global reduction 1 with 7 rules applied. Total rules applied 39 place count 65 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 65 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 43 place count 63 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 63 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 63 transition count 79
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 48 place count 61 transition count 77
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 61 transition count 77
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 61 transition count 75
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 53 place count 60 transition count 74
Iterating global reduction 4 with 1 rules applied. Total rules applied 54 place count 60 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 56 place count 60 transition count 72
Applied a total of 56 rules in 14 ms. Remains 60 /84 variables (removed 24) and now considering 72/116 (removed 44) transitions.
// Phase 1: matrix 72 rows 60 cols
[2025-05-29 22:51:20] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:51:20] [INFO ] Implicit Places using invariants in 102 ms returned []
[2025-05-29 22:51:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:51:20] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-05-29 22:51:20] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:51:20] [INFO ] Redundant transitions in 1 ms returned []
Running 71 sub problems to find dead transitions.
[2025-05-29 22:51:20] [INFO ] Invariant cache hit.
[2025-05-29 22:51:20] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/132 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 28/90 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:51:21] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 91 constraints, problems are : Problem set: 0 solved, 71 unsolved in 2652 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 72/132 variables, 60/63 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 28/91 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 71/162 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 162 constraints, problems are : Problem set: 0 solved, 71 unsolved in 8449 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11121ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 11121ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/84 places, 72/116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11406 ms. Remains : 60/84 places, 72/116 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-12
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-12 finished in 11493 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 (G((G(!p1) U p2))||X(G(p3)))))'
Support contains 6 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 72 transition count 92
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 72 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 72 transition count 91
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 66 transition count 82
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 66 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 39 place count 66 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 64 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 64 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 64 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 46 place count 62 transition count 74
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 62 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 62 transition count 73
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 50 place count 61 transition count 72
Iterating global reduction 4 with 1 rules applied. Total rules applied 51 place count 61 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 53 place count 61 transition count 70
Applied a total of 53 rules in 5 ms. Remains 61 /84 variables (removed 23) and now considering 70/116 (removed 46) transitions.
// Phase 1: matrix 70 rows 61 cols
[2025-05-29 22:51:31] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:51:31] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-05-29 22:51:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:51:31] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-05-29 22:51:31] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 69 sub problems to find dead transitions.
[2025-05-29 22:51:31] [INFO ] Invariant cache hit.
[2025-05-29 22:51:31] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/131 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 24/87 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/131 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 87 constraints, problems are : Problem set: 0 solved, 69 unsolved in 2705 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/131 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 24/87 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 69/156 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/131 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 156 constraints, problems are : Problem set: 0 solved, 69 unsolved in 8877 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11609ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 11610ms
Starting structural reductions in LTL mode, iteration 1 : 61/84 places, 70/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11858 ms. Remains : 61/84 places, 70/116 transitions.
Stuttering acceptance computed with spot in 542 ms :[(NOT p3), (AND (NOT p3) p1), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, p1, (NOT p2), (NOT p2), (AND (NOT p3) p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-13 finished in 12428 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((!p0||X(p1))) U X(X(X(!p0))))))'
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 116/116 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 71 transition count 91
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 71 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 71 transition count 90
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 65 transition count 81
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 65 transition count 81
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 63 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 63 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 61 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 60 transition count 72
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 54 place count 60 transition count 70
Applied a total of 54 rules in 4 ms. Remains 60 /84 variables (removed 24) and now considering 70/116 (removed 46) transitions.
// Phase 1: matrix 70 rows 60 cols
[2025-05-29 22:51:44] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:51:44] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-05-29 22:51:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:51:44] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-29 22:51:44] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 69 sub problems to find dead transitions.
[2025-05-29 22:51:44] [INFO ] Invariant cache hit.
[2025-05-29 22:51:44] [INFO ] State equation strengthened by 23 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:51:45] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:51:45] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:51:46] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:51:47] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:51:47] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:51:47] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 7 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/130 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 91 constraints, problems are : Problem set: 0 solved, 69 unsolved in 3954 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (OVERLAPS) 70/130 variables, 60/68 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 23/91 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 69/160 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 160 constraints, problems are : Problem set: 0 solved, 69 unsolved in 8763 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12755ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 12756ms
Starting structural reductions in LTL mode, iteration 1 : 60/84 places, 70/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12993 ms. Remains : 60/84 places, 70/116 transitions.
Stuttering acceptance computed with spot in 498 ms :[p0, p0, p0, (AND (NOT p1) p0), p0, (AND (NOT p1) p0), p0, p0, true, p0, (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m09-LTLFireability-15
Product exploration explored 100000 steps with 26694 reset in 488 ms.
Product exploration explored 100000 steps with 26629 reset in 406 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 13 states, 19 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[p0, p0, p0, p0, true, p0]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[p0, p0, p0, p0, true, p0]
Stuttering acceptance computed with spot in 254 ms :[p0, p0, p0, p0, true, p0]
Support contains 2 out of 60 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2025-05-29 22:51:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:51:59] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-05-29 22:51:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:51:59] [INFO ] State equation strengthened by 23 read => feed constraints.
[2025-05-29 22:51:59] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 69 sub problems to find dead transitions.
[2025-05-29 22:51:59] [INFO ] Invariant cache hit.
[2025-05-29 22:51:59] [INFO ] State equation strengthened by 23 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:52:01] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:52:01] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:52:02] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:52:02] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:52:02] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:52:02] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 5 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/130 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 91 constraints, problems are : Problem set: 0 solved, 69 unsolved in 4428 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (OVERLAPS) 70/130 variables, 60/68 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 23/91 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 69/160 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 0/130 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 160 constraints, problems are : Problem set: 0 solved, 69 unsolved in 9737 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14191ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 14191ms
Finished structural reductions in LTL mode , in 1 iterations and 14517 ms. Remains : 60/60 places, 70/70 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 194 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[p0, p0, p0, p0, true, p0]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 120 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[p0, p0, p0, p0, true, p0]
Stuttering acceptance computed with spot in 256 ms :[p0, p0, p0, p0, true, p0]
Stuttering acceptance computed with spot in 249 ms :[p0, p0, p0, p0, true, p0]
Product exploration explored 100000 steps with 26667 reset in 406 ms.
Product exploration explored 100000 steps with 26608 reset in 467 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 232 ms :[p0, p0, p0, p0, true, p0]
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 70/70 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 58 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 58 transition count 64
Applied a total of 6 rules in 7 ms. Remains 58 /60 variables (removed 2) and now considering 64/70 (removed 6) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:52:16] [INFO ] Redundant transitions in 1 ms returned []
Running 63 sub problems to find dead transitions.
// Phase 1: matrix 64 rows 58 cols
[2025-05-29 22:52:16] [INFO ] Computed 2 invariants in 0 ms
[2025-05-29 22:52:16] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/122 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 80 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2174 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 64/122 variables, 58/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 63/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 143 constraints, problems are : Problem set: 0 solved, 63 unsolved in 10547 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12738ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 12739ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/60 places, 64/70 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12754 ms. Remains : 58/60 places, 64/70 transitions.
Built C files in :
/tmp/ltsmin6354082852606496786
[2025-05-29 22:52:29] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6354082852606496786
Running compilation step : cd /tmp/ltsmin6354082852606496786;'/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 236 ms.
Running link step : cd /tmp/ltsmin6354082852606496786;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin6354082852606496786;'/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/stateBased125492065347736254.hoa' '--buchi-type=spotba'
LTSmin run took 175 ms.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m09-LTLFireability-15 finished in 45887 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)))'
[2025-05-29 22:52:30] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14661302703908042436
[2025-05-29 22:52:30] [INFO ] Computing symmetric may disable matrix : 116 transitions.
[2025-05-29 22:52:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 22:52:30] [INFO ] Computing symmetric may enable matrix : 116 transitions.
[2025-05-29 22:52:30] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 22:52:30] [INFO ] Applying decomposition
[2025-05-29 22:52:30] [INFO ] Computing Do-Not-Accords matrix : 116 transitions.
[2025-05-29 22:52:30] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 22:52:30] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14661302703908042436
[2025-05-29 22:52:30] [INFO ] Flatten gal took : 15 ms
Running compilation step : cd /tmp/ltsmin14661302703908042436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' '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'
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/graph4690223578687965284.txt' '-o' '/tmp/graph4690223578687965284.bin' '-w' '/tmp/graph4690223578687965284.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4690223578687965284.bin' '-l' '-1' '-v' '-w' '/tmp/graph4690223578687965284.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:52:30] [INFO ] Decomposing Gal with order
[2025-05-29 22:52:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:52:30] [INFO ] Removed a total of 115 redundant transitions.
[2025-05-29 22:52:30] [INFO ] Flatten gal took : 37 ms
[2025-05-29 22:52:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 12 ms.
[2025-05-29 22:52:30] [INFO ] Time to serialize gal into /tmp/LTLFireability12401323185504586285.gal : 6 ms
[2025-05-29 22:52:30] [INFO ] Time to serialize properties into /tmp/LTLFireability14060380806939405379.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/LTLFireability12401323185504586285.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14060380806939405379.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...278
Read 1 LTL properties
Checking formula 0 : !((G(F("((i1.i0.u9.p21<1)||(i5.u15.l126<1))"))))
Formula 0 simplified : FG!"((i1.i0.u9.p21<1)||(i5.u15.l126<1))"
Compilation finished in 570 ms.
Running link step : cd /tmp/ltsmin14661302703908042436;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14661302703908042436;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-05-29 23:14:36] [INFO ] Flatten gal took : 32 ms
[2025-05-29 23:14:36] [INFO ] Time to serialize gal into /tmp/LTLFireability6292362960916002277.gal : 2 ms
[2025-05-29 23:14:36] [INFO ] Time to serialize properties into /tmp/LTLFireability2933543145172312784.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/LTLFireability6292362960916002277.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2933543145172312784.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 1 LTL properties
Checking formula 0 : !((G(F("((p21<1)||(l126<1))"))))
Formula 0 simplified : FG!"((p21<1)||(l126<1))"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Initializing POR dependencies: labels 117, guards 116
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.056: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 7/ 8), 0.056: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.056: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.107: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.108: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.122: There are 119 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.122: State length is 85, there are 119 groups
pins2lts-mc-linux64( 0/ 8), 0.122: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.122: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.122: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.122: Visible groups: 0 / 119, labels: 1 / 119
pins2lts-mc-linux64( 0/ 8), 0.122: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.122: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.152: [Blue] ~47 levels ~960 states ~2424 transitions
pins2lts-mc-linux64( 1/ 8), 0.174: [Blue] ~73 levels ~1920 states ~4488 transitions
pins2lts-mc-linux64( 2/ 8), 0.211: [Blue] ~42 levels ~3840 states ~8032 transitions
pins2lts-mc-linux64( 2/ 8), 0.275: [Blue] ~42 levels ~7680 states ~15760 transitions
pins2lts-mc-linux64( 2/ 8), 0.404: [Blue] ~42 levels ~15360 states ~31448 transitions
pins2lts-mc-linux64( 5/ 8), 0.709: [Blue] ~126 levels ~30720 states ~65976 transitions
pins2lts-mc-linux64( 1/ 8), 1.330: [Blue] ~93 levels ~61440 states ~128472 transitions
pins2lts-mc-linux64( 1/ 8), 2.315: [Blue] ~93 levels ~122880 states ~264096 transitions
pins2lts-mc-linux64( 1/ 8), 4.090: [Blue] ~101 levels ~245760 states ~535168 transitions
pins2lts-mc-linux64( 2/ 8), 7.018: [Blue] ~1357 levels ~491520 states ~1189568 transitions
pins2lts-mc-linux64( 1/ 8), 11.813: [Blue] ~1222 levels ~983040 states ~2444088 transitions
pins2lts-mc-linux64( 1/ 8), 19.096: [Blue] ~1649 levels ~1966080 states ~4859168 transitions
pins2lts-mc-linux64( 1/ 8), 36.283: [Blue] ~5448 levels ~3932160 states ~10641840 transitions
pins2lts-mc-linux64( 1/ 8), 64.990: [Blue] ~5448 levels ~7864320 states ~20338640 transitions
pins2lts-mc-linux64( 1/ 8), 128.004: [Blue] ~15387 levels ~15728640 states ~41939792 transitions
pins2lts-mc-linux64( 1/ 8), 252.080: [Blue] ~18329 levels ~31457280 states ~84083544 transitions
pins2lts-mc-linux64( 1/ 8), 508.602: [Blue] ~41482 levels ~62914560 states ~171751968 transitions
pins2lts-mc-linux64( 1/ 8), 1095.455: [Blue] ~50404 levels ~125829120 states ~367421736 transitions
pins2lts-mc-linux64( 5/ 8), 1395.220: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1395.416:
pins2lts-mc-linux64( 0/ 8), 1395.416: Explored 140547839 states 446213992 transitions, fanout: 3.175
pins2lts-mc-linux64( 0/ 8), 1395.416: Total exploration time 1395.290 sec (1395.100 sec minimum, 1395.168 sec on average)
pins2lts-mc-linux64( 0/ 8), 1395.416: States per second: 100730, Transitions per second: 319800
pins2lts-mc-linux64( 0/ 8), 1395.416:
pins2lts-mc-linux64( 0/ 8), 1395.416: State space has 134217408 states, 124846 are accepting
pins2lts-mc-linux64( 0/ 8), 1395.416: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1395.416: blue states: 140547839 (104.72%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1395.416: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1395.416: all-red states: 124846 (0.09%), bogus 45 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1395.416:
pins2lts-mc-linux64( 0/ 8), 1395.416: Total memory used for local state coloring: 65.7MB
pins2lts-mc-linux64( 0/ 8), 1395.416:
pins2lts-mc-linux64( 0/ 8), 1395.416: Queue width: 8B, total height: 4306114, memory: 32.85MB
pins2lts-mc-linux64( 0/ 8), 1395.416: Tree memory: 1190.3MB, 9.3 B/state, compr.: 2.7%
pins2lts-mc-linux64( 0/ 8), 1395.416: Tree fill ratio (roots/leafs): 99.0%/64.0%
pins2lts-mc-linux64( 0/ 8), 1395.416: Stored 117 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1395.416: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1395.416: Est. total memory use: 1223.1MB (~1056.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14661302703908042436;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14661302703908042436;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t7, t8, t9, t10, t11, t20, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t54,...486
Computing Next relation with stutter on 1.85458e+08 deadlock states
30 unique states visited
0 strongly connected components in search stack
58 transitions explored
30 items max in DFS search stack
13183 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,131.868,1473448,1,0,291,5.79863e+06,262,171,3275,4.92049e+06,479
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DBSingleClientW-PT-d0m09-LTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Total runtime 1880887 ms.

BK_STOP 1748560655896

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

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m09.tgz
mv DBSingleClientW-PT-d0m09 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;