Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r092-tall-171624189500524.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is DBSingleClientW-PT-d1m08, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189500524
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 12 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716321969111

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-d1m08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 20:06:10] [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]
[2024-05-21 20:06:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:06:10] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2024-05-21 20:06:10] [INFO ] Transformed 1440 places.
[2024-05-21 20:06:10] [INFO ] Transformed 672 transitions.
[2024-05-21 20:06:10] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 179 place count 248 transition count 426
Iterating global reduction 1 with 78 rules applied. Total rules applied 257 place count 248 transition count 426
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 275 place count 248 transition count 408
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 331 place count 192 transition count 352
Iterating global reduction 2 with 56 rules applied. Total rules applied 387 place count 192 transition count 352
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 392 place count 192 transition count 347
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 413 place count 171 transition count 316
Iterating global reduction 3 with 21 rules applied. Total rules applied 434 place count 171 transition count 316
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 452 place count 171 transition count 298
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 456 place count 167 transition count 292
Iterating global reduction 4 with 4 rules applied. Total rules applied 460 place count 167 transition count 292
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 466 place count 167 transition count 286
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 468 place count 165 transition count 284
Iterating global reduction 5 with 2 rules applied. Total rules applied 470 place count 165 transition count 284
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 472 place count 163 transition count 282
Iterating global reduction 5 with 2 rules applied. Total rules applied 474 place count 163 transition count 282
Applied a total of 474 rules in 84 ms. Remains 163 /347 variables (removed 184) and now considering 282/672 (removed 390) transitions.
// Phase 1: matrix 282 rows 163 cols
[2024-05-21 20:06:10] [INFO ] Computed 2 invariants in 23 ms
[2024-05-21 20:06:11] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-21 20:06:11] [INFO ] Invariant cache hit.
[2024-05-21 20:06:11] [INFO ] State equation strengthened by 135 read => feed constraints.
[2024-05-21 20:06:11] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
Running 281 sub problems to find dead transitions.
[2024-05-21 20:06:11] [INFO ] Invariant cache hit.
[2024-05-21 20:06:11] [INFO ] State equation strengthened by 135 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 282/445 variables, 163/165 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 135/300 constraints. Problems are: Problem set: 0 solved, 281 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (OVERLAPS) 0/445 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 300 constraints, problems are : Problem set: 0 solved, 281 unsolved in 10854 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 282/445 variables, 163/165 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 135/300 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 281/581 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (OVERLAPS) 0/445 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Int declared 445/445 variables, and 581 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 0/0 constraints]
After SMT, in 41602ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 41616ms
Starting structural reductions in LTL mode, iteration 1 : 163/347 places, 282/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42356 ms. Remains : 163/347 places, 282/672 transitions.
Support contains 39 out of 163 places after structural reductions.
[2024-05-21 20:06:53] [INFO ] Flatten gal took : 76 ms
[2024-05-21 20:06:53] [INFO ] Flatten gal took : 65 ms
[2024-05-21 20:06:53] [INFO ] Input system was already deterministic with 282 transitions.
Support contains 37 out of 163 places (down from 39) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (9148 resets) in 2126 ms. (18 steps per ms) remains 19/28 properties
BEST_FIRST walk for 4003 steps (169 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (183 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (178 resets) in 37 ms. (105 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (188 resets) in 84 ms. (47 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (203 resets) in 52 ms. (75 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (201 resets) in 34 ms. (114 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (171 resets) in 33 ms. (117 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (189 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (201 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (189 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (363 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (177 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (189 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (173 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (176 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (388 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (181 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (188 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (391 resets) in 38 ms. (102 steps per ms) remains 19/19 properties
[2024-05-21 20:06:54] [INFO ] Invariant cache hit.
[2024-05-21 20:06:54] [INFO ] State equation strengthened by 135 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 1 (OVERLAPS) 53/81 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 42/123 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 18 unsolved
[2024-05-21 20:06:55] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 233/356 variables, 123/126 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 86/212 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 0/212 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 89/445 variables, 40/252 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 49/301 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 0/301 constraints. Problems are: Problem set: 1 solved, 18 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/445 variables, 0/301 constraints. Problems are: Problem set: 1 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 301 constraints, problems are : Problem set: 1 solved, 18 unsolved in 2426 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 54/78 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 44/122 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 227/349 variables, 122/125 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 80/205 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 1/206 constraints. Problems are: Problem set: 1 solved, 18 unsolved
[2024-05-21 20:06:57] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-05-21 20:06:57] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 1 ms to minimize.
[2024-05-21 20:06:57] [INFO ] Deduced a trap composed of 58 places in 188 ms of which 2 ms to minimize.
[2024-05-21 20:06:58] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 2 ms to minimize.
[2024-05-21 20:06:58] [INFO ] Deduced a trap composed of 59 places in 44 ms of which 5 ms to minimize.
[2024-05-21 20:06:58] [INFO ] Deduced a trap composed of 59 places in 58 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 6/212 constraints. Problems are: Problem set: 1 solved, 18 unsolved
[2024-05-21 20:06:58] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 2 ms to minimize.
[2024-05-21 20:06:58] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 1 ms to minimize.
[2024-05-21 20:06:58] [INFO ] Deduced a trap composed of 59 places in 41 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 3/215 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 0/215 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 94/443 variables, 40/255 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/443 variables, 54/309 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/443 variables, 17/326 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/443 variables, 0/326 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 16 (OVERLAPS) 2/445 variables, 1/327 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/445 variables, 1/328 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/445 variables, 0/328 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 19 (OVERLAPS) 0/445 variables, 0/328 constraints. Problems are: Problem set: 1 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 445/445 variables, and 328 constraints, problems are : Problem set: 1 solved, 18 unsolved in 4707 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 163/163 constraints, ReadFeed: 135/135 constraints, PredecessorRefiner: 18/19 constraints, Known Traps: 10/10 constraints]
After SMT, in 7216ms problems are : Problem set: 1 solved, 18 unsolved
Fused 18 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 475 ms.
Support contains 24 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 155 transition count 259
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 155 transition count 259
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 149 transition count 251
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 149 transition count 251
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 149 transition count 247
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 36 place count 145 transition count 243
Iterating global reduction 1 with 4 rules applied. Total rules applied 40 place count 145 transition count 243
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 43 place count 145 transition count 240
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 144 transition count 238
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 144 transition count 238
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 51 place count 144 transition count 232
Applied a total of 51 rules in 40 ms. Remains 144 /163 variables (removed 19) and now considering 232/282 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 144/163 places, 232/282 transitions.
RANDOM walk for 40000 steps (9139 resets) in 341 ms. (116 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (193 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (208 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (181 resets) in 36 ms. (108 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (185 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (190 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (180 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (194 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (195 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (179 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (395 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (206 resets) in 27 ms. (143 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (196 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (179 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (209 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (386 resets) in 34 ms. (114 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (180 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (170 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (403 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
Finished probabilistic random walk after 110337 steps, run visited all 18 properties in 469 ms. (steps per millisecond=235 )
Probabilistic random walk after 110337 steps, saw 44552 distinct states, run finished after 473 ms. (steps per millisecond=233 ) properties seen :18
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 6 stabilizing places and 25 stable transitions
Graph (complete) has 607 edges and 163 vertex of which 162 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)||(!p0&&F(!p1)))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 139 transition count 207
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 139 transition count 207
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 139 transition count 203
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 71 place count 120 transition count 180
Iterating global reduction 1 with 19 rules applied. Total rules applied 90 place count 120 transition count 180
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 94 place count 120 transition count 176
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 110 place count 104 transition count 152
Iterating global reduction 2 with 16 rules applied. Total rules applied 126 place count 104 transition count 152
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 134 place count 104 transition count 144
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 142 place count 96 transition count 124
Iterating global reduction 3 with 8 rules applied. Total rules applied 150 place count 96 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 151 place count 96 transition count 123
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 157 place count 90 transition count 117
Iterating global reduction 4 with 6 rules applied. Total rules applied 163 place count 90 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 164 place count 90 transition count 116
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 169 place count 85 transition count 110
Iterating global reduction 5 with 5 rules applied. Total rules applied 174 place count 85 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 177 place count 85 transition count 107
Applied a total of 177 rules in 22 ms. Remains 85 /163 variables (removed 78) and now considering 107/282 (removed 175) transitions.
// Phase 1: matrix 107 rows 85 cols
[2024-05-21 20:07:03] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 20:07:03] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 20:07:03] [INFO ] Invariant cache hit.
[2024-05-21 20:07:03] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 20:07:03] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-05-21 20:07:03] [INFO ] Invariant cache hit.
[2024-05-21 20:07:03] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/192 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 37/124 constraints. Problems are: Problem set: 0 solved, 106 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 124 constraints, problems are : Problem set: 0 solved, 106 unsolved in 1750 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/192 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 37/124 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 106/230 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 230 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4207 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 6052ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 6054ms
Starting structural reductions in LTL mode, iteration 1 : 85/163 places, 107/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6273 ms. Remains : 85/163 places, 107/282 transitions.
Stuttering acceptance computed with spot in 299 ms :[true, p1, p0, p0, (AND p1 p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 268 ms.
Product exploration explored 100000 steps with 50000 reset in 176 ms.
Computed a total of 6 stabilizing places and 14 stable transitions
Graph (complete) has 287 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 6 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (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 8 factoid took 27 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-00 finished in 7128 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U !p1)) U X(G((p0 U p1)))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 139 transition count 209
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 139 transition count 209
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 139 transition count 203
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 71 place count 122 transition count 182
Iterating global reduction 1 with 17 rules applied. Total rules applied 88 place count 122 transition count 182
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 92 place count 122 transition count 178
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 106 place count 108 transition count 158
Iterating global reduction 2 with 14 rules applied. Total rules applied 120 place count 108 transition count 158
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 126 place count 108 transition count 152
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 134 place count 100 transition count 132
Iterating global reduction 3 with 8 rules applied. Total rules applied 142 place count 100 transition count 132
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 145 place count 100 transition count 129
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 150 place count 95 transition count 124
Iterating global reduction 4 with 5 rules applied. Total rules applied 155 place count 95 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 156 place count 95 transition count 123
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 160 place count 91 transition count 118
Iterating global reduction 5 with 4 rules applied. Total rules applied 164 place count 91 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 166 place count 91 transition count 116
Applied a total of 166 rules in 17 ms. Remains 91 /163 variables (removed 72) and now considering 116/282 (removed 166) transitions.
// Phase 1: matrix 116 rows 91 cols
[2024-05-21 20:07:10] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:07:10] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 20:07:10] [INFO ] Invariant cache hit.
[2024-05-21 20:07:10] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-21 20:07:11] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2024-05-21 20:07:11] [INFO ] Invariant cache hit.
[2024-05-21 20:07:11] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/207 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 38/131 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/207 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 131 constraints, problems are : Problem set: 0 solved, 115 unsolved in 2569 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/207 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 38/131 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 115/246 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/207 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 246 constraints, problems are : Problem set: 0 solved, 115 unsolved in 5004 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
After SMT, in 7680ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 7683ms
Starting structural reductions in LTL mode, iteration 1 : 91/163 places, 116/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7896 ms. Remains : 91/163 places, 116/282 transitions.
Stuttering acceptance computed with spot in 336 ms :[(NOT p1), false, (NOT p1), true, (NOT p1), p1, p1, (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-01
Stuttering criterion allowed to conclude after 6 steps with 1 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-01 finished in 8259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(G(p1))) U X(G((F(!p1)||X(X(!p0)))))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 137 transition count 201
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 137 transition count 201
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 56 place count 137 transition count 197
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 75 place count 118 transition count 174
Iterating global reduction 1 with 19 rules applied. Total rules applied 94 place count 118 transition count 174
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 98 place count 118 transition count 170
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 114 place count 102 transition count 146
Iterating global reduction 2 with 16 rules applied. Total rules applied 130 place count 102 transition count 146
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 138 place count 102 transition count 138
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 145 place count 95 transition count 119
Iterating global reduction 3 with 7 rules applied. Total rules applied 152 place count 95 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 153 place count 95 transition count 118
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 158 place count 90 transition count 113
Iterating global reduction 4 with 5 rules applied. Total rules applied 163 place count 90 transition count 113
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 168 place count 85 transition count 107
Iterating global reduction 4 with 5 rules applied. Total rules applied 173 place count 85 transition count 107
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 176 place count 85 transition count 104
Applied a total of 176 rules in 19 ms. Remains 85 /163 variables (removed 78) and now considering 104/282 (removed 178) transitions.
// Phase 1: matrix 104 rows 85 cols
[2024-05-21 20:07:19] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:07:19] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 20:07:19] [INFO ] Invariant cache hit.
[2024-05-21 20:07:19] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 20:07:19] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-05-21 20:07:19] [INFO ] Invariant cache hit.
[2024-05-21 20:07:19] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/189 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 119 constraints, problems are : Problem set: 0 solved, 103 unsolved in 1773 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/189 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 103/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/189 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 222 constraints, problems are : Problem set: 0 solved, 103 unsolved in 3741 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
After SMT, in 5623ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 5625ms
Starting structural reductions in LTL mode, iteration 1 : 85/163 places, 104/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5812 ms. Remains : 85/163 places, 104/282 transitions.
Stuttering acceptance computed with spot in 368 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-02
Product exploration explored 100000 steps with 22944 reset in 193 ms.
Product exploration explored 100000 steps with 23073 reset in 158 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 286 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 126 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 397 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
RANDOM walk for 40000 steps (9162 resets) in 532 ms. (75 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40001 steps (1876 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
[2024-05-21 20:07:26] [INFO ] Invariant cache hit.
[2024-05-21 20:07:26] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 80/139 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 46/185 variables, 24/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 22/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/189 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 119 constraints, problems are : Problem set: 0 solved, 1 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 80/139 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 46/185 variables, 24/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 22/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/189 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 120 constraints, problems are : Problem set: 0 solved, 1 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 198ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 104/104 transitions.
Graph (complete) has 264 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 84 transition count 102
Applied a total of 3 rules in 15 ms. Remains 84 /85 variables (removed 1) and now considering 102/104 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 84/85 places, 102/104 transitions.
RANDOM walk for 40000 steps (9208 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1970 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4296 steps, run visited all 1 properties in 8 ms. (steps per millisecond=537 )
Probabilistic random walk after 4296 steps, saw 1997 distinct states, run finished after 8 ms. (steps per millisecond=537 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 290 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 366 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Stuttering acceptance computed with spot in 371 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 104/104 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2024-05-21 20:07:27] [INFO ] Invariant cache hit.
[2024-05-21 20:07:27] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 20:07:27] [INFO ] Invariant cache hit.
[2024-05-21 20:07:27] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 20:07:27] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-05-21 20:07:27] [INFO ] Invariant cache hit.
[2024-05-21 20:07:27] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/189 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 119 constraints, problems are : Problem set: 0 solved, 103 unsolved in 1783 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/189 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 103/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/189 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 222 constraints, problems are : Problem set: 0 solved, 103 unsolved in 3638 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
After SMT, in 5513ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 5514ms
Finished structural reductions in LTL mode , in 1 iterations and 5692 ms. Remains : 85/85 places, 104/104 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 286 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 105 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 407 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
RANDOM walk for 40000 steps (9137 resets) in 73 ms. (540 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (1903 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
[2024-05-21 20:07:33] [INFO ] Invariant cache hit.
[2024-05-21 20:07:33] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 80/139 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 46/185 variables, 24/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 22/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/189 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 119 constraints, problems are : Problem set: 0 solved, 1 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 80/139 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 46/185 variables, 24/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 22/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/189 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 120 constraints, problems are : Problem set: 0 solved, 1 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 181ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 104/104 transitions.
Graph (complete) has 264 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 84 transition count 102
Applied a total of 3 rules in 8 ms. Remains 84 /85 variables (removed 1) and now considering 102/104 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 84/85 places, 102/104 transitions.
RANDOM walk for 40000 steps (9174 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1949 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4296 steps, run visited all 1 properties in 10 ms. (steps per millisecond=429 )
Probabilistic random walk after 4296 steps, saw 1997 distinct states, run finished after 11 ms. (steps per millisecond=390 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 286 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 417 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Stuttering acceptance computed with spot in 380 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Stuttering acceptance computed with spot in 406 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Product exploration explored 100000 steps with 23017 reset in 99 ms.
Product exploration explored 100000 steps with 22984 reset in 106 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 418 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 104/104 transitions.
Applied a total of 0 rules in 8 ms. Remains 85 /85 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2024-05-21 20:07:36] [INFO ] Redundant transitions in 2 ms returned []
Running 103 sub problems to find dead transitions.
[2024-05-21 20:07:36] [INFO ] Invariant cache hit.
[2024-05-21 20:07:36] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/189 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 119 constraints, problems are : Problem set: 0 solved, 103 unsolved in 1734 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/189 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 103/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/189 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 222 constraints, problems are : Problem set: 0 solved, 103 unsolved in 3693 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
After SMT, in 5505ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 5507ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5524 ms. Remains : 85/85 places, 104/104 transitions.
Built C files in :
/tmp/ltsmin16722907442000899644
[2024-05-21 20:07:42] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16722907442000899644
Running compilation step : cd /tmp/ltsmin16722907442000899644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 375 ms.
Running link step : cd /tmp/ltsmin16722907442000899644;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin16722907442000899644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8772994765856204746.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 104/104 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2024-05-21 20:07:57] [INFO ] Invariant cache hit.
[2024-05-21 20:07:57] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 20:07:57] [INFO ] Invariant cache hit.
[2024-05-21 20:07:57] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 20:07:57] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-05-21 20:07:57] [INFO ] Invariant cache hit.
[2024-05-21 20:07:57] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/189 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 119 constraints, problems are : Problem set: 0 solved, 103 unsolved in 1757 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/189 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 103/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/189 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 222 constraints, problems are : Problem set: 0 solved, 103 unsolved in 3602 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
After SMT, in 5450ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 5451ms
Finished structural reductions in LTL mode , in 1 iterations and 5641 ms. Remains : 85/85 places, 104/104 transitions.
Built C files in :
/tmp/ltsmin16310796141549292603
[2024-05-21 20:08:02] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16310796141549292603
Running compilation step : cd /tmp/ltsmin16310796141549292603;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 227 ms.
Running link step : cd /tmp/ltsmin16310796141549292603;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin16310796141549292603;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17025140194605134969.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 20:08:18] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:08:18] [INFO ] Flatten gal took : 7 ms
[2024-05-21 20:08:18] [INFO ] Time to serialize gal into /tmp/LTL2940824343103409311.gal : 2 ms
[2024-05-21 20:08:18] [INFO ] Time to serialize properties into /tmp/LTL2516195450432653018.prop : 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2940824343103409311.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9001861545191152253.hoa' '-atoms' '/tmp/LTL2516195450432653018.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2516195450432653018.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9001861545191152253.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t54, t64, t73, t74, t121, t170, t222, t223, t226, t227, t228, t229, t23...407
Computing Next relation with stutter on 1.02145e+07 deadlock states
Detected timeout of ITS tools.
[2024-05-21 20:08:33] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:08:33] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:08:33] [INFO ] Time to serialize gal into /tmp/LTL8718119879935888173.gal : 2 ms
[2024-05-21 20:08:33] [INFO ] Time to serialize properties into /tmp/LTL12161881156000118704.ltl : 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8718119879935888173.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12161881156000118704.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((("((s1>=1)&&(l954>=1))")U(X(G("((s1>=1)&&(l955>=1))"))))U(X(G((F(!("((s1>=1)&&(l955>=1))")))||(X(X(!("((s1>=1)&&(l954>=1))")))))))...157
Formula 0 simplified : (!"((s1>=1)&&(l954>=1))" R XF!"((s1>=1)&&(l955>=1))") R XF(G"((s1>=1)&&(l955>=1))" & XX"((s1>=1)&&(l954>=1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t54, t64, t73, t74, t121, t170, t222, t223, t226, t227, t228, t229, t23...407
Computing Next relation with stutter on 1.02145e+07 deadlock states
Detected timeout of ITS tools.
[2024-05-21 20:08:48] [INFO ] Flatten gal took : 8 ms
[2024-05-21 20:08:48] [INFO ] Applying decomposition
[2024-05-21 20:08:48] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8557882808832473778.txt' '-o' '/tmp/graph8557882808832473778.bin' '-w' '/tmp/graph8557882808832473778.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8557882808832473778.bin' '-l' '-1' '-v' '-w' '/tmp/graph8557882808832473778.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:08:48] [INFO ] Decomposing Gal with order
[2024-05-21 20:08:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:08:48] [INFO ] Removed a total of 97 redundant transitions.
[2024-05-21 20:08:48] [INFO ] Flatten gal took : 37 ms
[2024-05-21 20:08:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 8 ms.
[2024-05-21 20:08:48] [INFO ] Time to serialize gal into /tmp/LTL11532041037670129077.gal : 3 ms
[2024-05-21 20:08:48] [INFO ] Time to serialize properties into /tmp/LTL125105278036703258.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11532041037670129077.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL125105278036703258.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((("((u0.s1>=1)&&(i3.u1.l954>=1))")U(X(G("((u0.s1>=1)&&(u0.l955>=1))"))))U(X(G((F(!("((u0.s1>=1)&&(u0.l955>=1))")))||(X(X(!("((u0.s1...187
Formula 0 simplified : (!"((u0.s1>=1)&&(i3.u1.l954>=1))" R XF!"((u0.s1>=1)&&(u0.l955>=1))") R XF(G"((u0.s1>=1)&&(u0.l955>=1))" & XX"((u0.s1>=1)&&(i3.u1.l95...163
Reverse transition relation is NOT exact ! Due to transitions t0, t11, t12, t13, t64, t74, t170, t222, t223, t226, t228, t229, t232, t233, t234, t235, t236...400
Computing Next relation with stutter on 1.02145e+07 deadlock states
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-02 finished in 104367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 138 transition count 205
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 138 transition count 205
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 138 transition count 201
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 72 place count 120 transition count 179
Iterating global reduction 1 with 18 rules applied. Total rules applied 90 place count 120 transition count 179
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 94 place count 120 transition count 175
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 109 place count 105 transition count 152
Iterating global reduction 2 with 15 rules applied. Total rules applied 124 place count 105 transition count 152
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 130 place count 105 transition count 146
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 138 place count 97 transition count 126
Iterating global reduction 3 with 8 rules applied. Total rules applied 146 place count 97 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 147 place count 97 transition count 125
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 153 place count 91 transition count 119
Iterating global reduction 4 with 6 rules applied. Total rules applied 159 place count 91 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 160 place count 91 transition count 118
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 165 place count 86 transition count 112
Iterating global reduction 5 with 5 rules applied. Total rules applied 170 place count 86 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 173 place count 86 transition count 109
Applied a total of 173 rules in 29 ms. Remains 86 /163 variables (removed 77) and now considering 109/282 (removed 173) transitions.
// Phase 1: matrix 109 rows 86 cols
[2024-05-21 20:09:03] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:09:03] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 20:09:03] [INFO ] Invariant cache hit.
[2024-05-21 20:09:03] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 20:09:03] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-21 20:09:03] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-21 20:09:03] [INFO ] Invariant cache hit.
[2024-05-21 20:09:03] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/195 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 32/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 120 constraints, problems are : Problem set: 0 solved, 108 unsolved in 1862 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/195 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 32/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 108/228 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 228 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3608 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 5570ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 5573ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/163 places, 109/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5819 ms. Remains : 86/163 places, 109/282 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-03
Product exploration explored 100000 steps with 22958 reset in 100 ms.
Product exploration explored 100000 steps with 23031 reset in 171 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 292 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 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 96 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 19656 steps (4465 resets) in 41 ms. (468 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 83 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 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 109/109 transitions.
Applied a total of 0 rules in 6 ms. Remains 86 /86 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-21 20:09:10] [INFO ] Invariant cache hit.
[2024-05-21 20:09:10] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 20:09:10] [INFO ] Invariant cache hit.
[2024-05-21 20:09:10] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 20:09:10] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-05-21 20:09:10] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-21 20:09:10] [INFO ] Invariant cache hit.
[2024-05-21 20:09:10] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/195 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 32/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 120 constraints, problems are : Problem set: 0 solved, 108 unsolved in 1853 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/195 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 32/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 108/228 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 228 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3638 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 5594ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 5596ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5788 ms. Remains : 86/86 places, 109/109 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 292 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 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 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 22848 steps (5301 resets) in 61 ms. (368 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 180 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 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22915 reset in 110 ms.
Product exploration explored 100000 steps with 23046 reset in 115 ms.
Built C files in :
/tmp/ltsmin9081059826536495234
[2024-05-21 20:09:16] [INFO ] Computing symmetric may disable matrix : 109 transitions.
[2024-05-21 20:09:16] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:09:16] [INFO ] Computing symmetric may enable matrix : 109 transitions.
[2024-05-21 20:09:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:09:16] [INFO ] Computing Do-Not-Accords matrix : 109 transitions.
[2024-05-21 20:09:16] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:09:16] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9081059826536495234
Running compilation step : cd /tmp/ltsmin9081059826536495234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 268 ms.
Running link step : cd /tmp/ltsmin9081059826536495234;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9081059826536495234;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3806846225247988189.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 109/109 transitions.
Applied a total of 0 rules in 9 ms. Remains 86 /86 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-21 20:09:31] [INFO ] Invariant cache hit.
[2024-05-21 20:09:31] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 20:09:31] [INFO ] Invariant cache hit.
[2024-05-21 20:09:32] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 20:09:32] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-05-21 20:09:32] [INFO ] Redundant transitions in 3 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-21 20:09:32] [INFO ] Invariant cache hit.
[2024-05-21 20:09:32] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/195 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 32/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 120 constraints, problems are : Problem set: 0 solved, 108 unsolved in 1830 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/195 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 32/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 108/228 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 228 constraints, problems are : Problem set: 0 solved, 108 unsolved in 3552 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 5473ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 5475ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5671 ms. Remains : 86/86 places, 109/109 transitions.
Built C files in :
/tmp/ltsmin4365480301281887949
[2024-05-21 20:09:37] [INFO ] Computing symmetric may disable matrix : 109 transitions.
[2024-05-21 20:09:37] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:09:37] [INFO ] Computing symmetric may enable matrix : 109 transitions.
[2024-05-21 20:09:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:09:37] [INFO ] Computing Do-Not-Accords matrix : 109 transitions.
[2024-05-21 20:09:37] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:09:37] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4365480301281887949
Running compilation step : cd /tmp/ltsmin4365480301281887949;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 283 ms.
Running link step : cd /tmp/ltsmin4365480301281887949;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4365480301281887949;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12846745006647428082.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 20:09:52] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:09:52] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:09:52] [INFO ] Time to serialize gal into /tmp/LTL12203605913785563144.gal : 1 ms
[2024-05-21 20:09:52] [INFO ] Time to serialize properties into /tmp/LTL4473029604973711946.prop : 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12203605913785563144.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2307790410162735149.hoa' '-atoms' '/tmp/LTL4473029604973711946.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4473029604973711946.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2307790410162735149.hoa
Detected timeout of ITS tools.
[2024-05-21 20:10:07] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:10:07] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:10:07] [INFO ] Time to serialize gal into /tmp/LTL5927789717888313056.gal : 5 ms
[2024-05-21 20:10:07] [INFO ] Time to serialize properties into /tmp/LTL17502063492269426193.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5927789717888313056.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17502063492269426193.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((s1<1)||(l1307<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l1307<1))"
Detected timeout of ITS tools.
[2024-05-21 20:10:22] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:10:22] [INFO ] Applying decomposition
[2024-05-21 20:10:22] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3896610638754981234.txt' '-o' '/tmp/graph3896610638754981234.bin' '-w' '/tmp/graph3896610638754981234.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3896610638754981234.bin' '-l' '-1' '-v' '-w' '/tmp/graph3896610638754981234.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:10:22] [INFO ] Decomposing Gal with order
[2024-05-21 20:10:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:10:22] [INFO ] Removed a total of 123 redundant transitions.
[2024-05-21 20:10:22] [INFO ] Flatten gal took : 15 ms
[2024-05-21 20:10:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 4 ms.
[2024-05-21 20:10:22] [INFO ] Time to serialize gal into /tmp/LTL5244820784709765162.gal : 6 ms
[2024-05-21 20:10:22] [INFO ] Time to serialize properties into /tmp/LTL6410559131364513357.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5244820784709765162.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6410559131364513357.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i0.u0.s1<1)||(i0.u1.l1307<1))"))))
Formula 0 simplified : FG!"((i0.u0.s1<1)||(i0.u1.l1307<1))"
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-03 finished in 94500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(!X(X(p0))))||X(!F(p1))) U p2))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 140 transition count 212
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 140 transition count 212
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 140 transition count 208
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 67 place count 123 transition count 187
Iterating global reduction 1 with 17 rules applied. Total rules applied 84 place count 123 transition count 187
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 88 place count 123 transition count 183
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 102 place count 109 transition count 162
Iterating global reduction 2 with 14 rules applied. Total rules applied 116 place count 109 transition count 162
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 123 place count 109 transition count 155
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 129 place count 103 transition count 143
Iterating global reduction 3 with 6 rules applied. Total rules applied 135 place count 103 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 137 place count 103 transition count 141
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 142 place count 98 transition count 136
Iterating global reduction 4 with 5 rules applied. Total rules applied 147 place count 98 transition count 136
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 148 place count 98 transition count 135
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 152 place count 94 transition count 130
Iterating global reduction 5 with 4 rules applied. Total rules applied 156 place count 94 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 157 place count 94 transition count 129
Applied a total of 157 rules in 6 ms. Remains 94 /163 variables (removed 69) and now considering 129/282 (removed 153) transitions.
// Phase 1: matrix 129 rows 94 cols
[2024-05-21 20:10:37] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:10:38] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 20:10:38] [INFO ] Invariant cache hit.
[2024-05-21 20:10:38] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-21 20:10:38] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-05-21 20:10:38] [INFO ] Invariant cache hit.
[2024-05-21 20:10:38] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 129/223 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 48/144 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/223 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 144 constraints, problems are : Problem set: 0 solved, 128 unsolved in 2360 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 129/223 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 48/144 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 128/272 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/223 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 272 constraints, problems are : Problem set: 0 solved, 128 unsolved in 4777 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 7266ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 7267ms
Starting structural reductions in LTL mode, iteration 1 : 94/163 places, 129/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7480 ms. Remains : 94/163 places, 129/282 transitions.
Stuttering acceptance computed with spot in 372 ms :[(NOT p2), (OR (NOT p2) (AND p0 p1)), p0, (AND p0 p1), p0, p0, true, (AND p0 p1), (AND p1 p0), p1]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-04
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-04 finished in 7882 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||G(p1))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 138 transition count 205
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 138 transition count 205
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 55 place count 138 transition count 200
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 73 place count 120 transition count 178
Iterating global reduction 1 with 18 rules applied. Total rules applied 91 place count 120 transition count 178
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 95 place count 120 transition count 174
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 110 place count 105 transition count 152
Iterating global reduction 2 with 15 rules applied. Total rules applied 125 place count 105 transition count 152
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 132 place count 105 transition count 145
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 139 place count 98 transition count 127
Iterating global reduction 3 with 7 rules applied. Total rules applied 146 place count 98 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 148 place count 98 transition count 125
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 152 place count 94 transition count 121
Iterating global reduction 4 with 4 rules applied. Total rules applied 156 place count 94 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 157 place count 94 transition count 120
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 160 place count 91 transition count 116
Iterating global reduction 5 with 3 rules applied. Total rules applied 163 place count 91 transition count 116
Applied a total of 163 rules in 9 ms. Remains 91 /163 variables (removed 72) and now considering 116/282 (removed 166) transitions.
// Phase 1: matrix 116 rows 91 cols
[2024-05-21 20:10:45] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:10:45] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 20:10:45] [INFO ] Invariant cache hit.
[2024-05-21 20:10:45] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 20:10:45] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 115 sub problems to find dead transitions.
[2024-05-21 20:10:45] [INFO ] Invariant cache hit.
[2024-05-21 20:10:45] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/207 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 36/129 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/207 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 129 constraints, problems are : Problem set: 0 solved, 115 unsolved in 2036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/207 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 36/129 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 115/244 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/207 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 244 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4489 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
After SMT, in 6637ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 6639ms
Starting structural reductions in LTL mode, iteration 1 : 91/163 places, 116/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6821 ms. Remains : 91/163 places, 116/282 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-05
Product exploration explored 100000 steps with 23118 reset in 113 ms.
Product exploration explored 100000 steps with 23094 reset in 116 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 309 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (9239 resets) in 186 ms. (213 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (1884 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1866 resets) in 256 ms. (155 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (1827 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
[2024-05-21 20:10:53] [INFO ] Invariant cache hit.
[2024-05-21 20:10:53] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 34/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 27/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 92/157 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 12/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 50/207 variables, 26/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 24/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/207 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 129 constraints, problems are : Problem set: 0 solved, 3 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 34/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 27/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 92/157 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 12/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 50/207 variables, 26/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 24/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/207 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 132 constraints, problems are : Problem set: 0 solved, 3 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 300ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 124 ms.
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 116/116 transitions.
Graph (complete) has 285 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 90 transition count 114
Applied a total of 3 rules in 4 ms. Remains 90 /91 variables (removed 1) and now considering 114/116 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 90/91 places, 114/116 transitions.
RANDOM walk for 40000 steps (9148 resets) in 168 ms. (236 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1927 resets) in 54 ms. (727 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1935 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1810 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 299281 steps, run visited all 3 properties in 591 ms. (steps per millisecond=506 )
Probabilistic random walk after 299281 steps, saw 122854 distinct states, run finished after 591 ms. (steps per millisecond=506 ) properties seen :3
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 308 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 116/116 transitions.
Applied a total of 0 rules in 6 ms. Remains 91 /91 variables (removed 0) and now considering 116/116 (removed 0) transitions.
[2024-05-21 20:10:55] [INFO ] Invariant cache hit.
[2024-05-21 20:10:55] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 20:10:55] [INFO ] Invariant cache hit.
[2024-05-21 20:10:55] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 20:10:55] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-21 20:10:55] [INFO ] Redundant transitions in 2 ms returned []
Running 115 sub problems to find dead transitions.
[2024-05-21 20:10:55] [INFO ] Invariant cache hit.
[2024-05-21 20:10:55] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/207 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 36/129 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/207 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 129 constraints, problems are : Problem set: 0 solved, 115 unsolved in 2073 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 116/207 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 36/129 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 115/244 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/207 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 244 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4393 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
After SMT, in 6587ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 6590ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6790 ms. Remains : 91/91 places, 116/116 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 309 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 209 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (9164 resets) in 219 ms. (181 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (1951 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1866 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1897 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
[2024-05-21 20:11:02] [INFO ] Invariant cache hit.
[2024-05-21 20:11:02] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 34/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 27/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 92/157 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 12/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 50/207 variables, 26/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 24/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/207 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 129 constraints, problems are : Problem set: 0 solved, 3 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 34/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 27/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 92/157 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 12/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 50/207 variables, 26/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 24/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/207 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 132 constraints, problems are : Problem set: 0 solved, 3 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 296ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 225 ms.
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 116/116 transitions.
Graph (complete) has 285 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 90 transition count 114
Applied a total of 3 rules in 3 ms. Remains 90 /91 variables (removed 1) and now considering 114/116 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 90/91 places, 114/116 transitions.
RANDOM walk for 40000 steps (9165 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (1948 resets) in 47 ms. (833 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1945 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (1871 resets) in 35 ms. (1111 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 299281 steps, run visited all 3 properties in 517 ms. (steps per millisecond=578 )
Probabilistic random walk after 299281 steps, saw 122854 distinct states, run finished after 517 ms. (steps per millisecond=578 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 13 factoid took 376 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 23022 reset in 120 ms.
Product exploration explored 100000 steps with 23059 reset in 130 ms.
Built C files in :
/tmp/ltsmin5824842420621788435
[2024-05-21 20:11:05] [INFO ] Computing symmetric may disable matrix : 116 transitions.
[2024-05-21 20:11:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:11:05] [INFO ] Computing symmetric may enable matrix : 116 transitions.
[2024-05-21 20:11:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:11:05] [INFO ] Computing Do-Not-Accords matrix : 116 transitions.
[2024-05-21 20:11:05] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:11:05] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5824842420621788435
Running compilation step : cd /tmp/ltsmin5824842420621788435;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 303 ms.
Running link step : cd /tmp/ltsmin5824842420621788435;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5824842420621788435;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12049250692022345698.hoa' '--buchi-type=spotba'
LTSmin run took 529 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-05 finished in 20119 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((p1&&X((p1 U (X(!p2)||G(p1))))))||p0))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 139 transition count 214
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 139 transition count 214
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 139 transition count 209
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 71 place count 121 transition count 187
Iterating global reduction 1 with 18 rules applied. Total rules applied 89 place count 121 transition count 187
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 94 place count 121 transition count 182
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 109 place count 106 transition count 159
Iterating global reduction 2 with 15 rules applied. Total rules applied 124 place count 106 transition count 159
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 132 place count 106 transition count 151
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 139 place count 99 transition count 133
Iterating global reduction 3 with 7 rules applied. Total rules applied 146 place count 99 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 147 place count 99 transition count 132
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 152 place count 94 transition count 127
Iterating global reduction 4 with 5 rules applied. Total rules applied 157 place count 94 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 158 place count 94 transition count 126
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 162 place count 90 transition count 121
Iterating global reduction 5 with 4 rules applied. Total rules applied 166 place count 90 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 168 place count 90 transition count 119
Applied a total of 168 rules in 16 ms. Remains 90 /163 variables (removed 73) and now considering 119/282 (removed 163) transitions.
// Phase 1: matrix 119 rows 90 cols
[2024-05-21 20:11:05] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:11:06] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 20:11:06] [INFO ] Invariant cache hit.
[2024-05-21 20:11:06] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-21 20:11:06] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Running 118 sub problems to find dead transitions.
[2024-05-21 20:11:06] [INFO ] Invariant cache hit.
[2024-05-21 20:11:06] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (OVERLAPS) 119/209 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 44/136 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-21 20:11:08] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 2 ms to minimize.
[2024-05-21 20:11:08] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/209 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-21 20:11:09] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (OVERLAPS) 0/209 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 209/209 variables, and 139 constraints, problems are : Problem set: 0 solved, 118 unsolved in 4866 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 119/209 variables, 90/95 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 44/139 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 118/257 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (OVERLAPS) 0/209 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 209/209 variables, and 257 constraints, problems are : Problem set: 0 solved, 118 unsolved in 5393 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 3/3 constraints]
After SMT, in 10360ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 10362ms
Starting structural reductions in LTL mode, iteration 1 : 90/163 places, 119/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10565 ms. Remains : 90/163 places, 119/282 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 134 ms.
Product exploration explored 100000 steps with 50000 reset in 139 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 308 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 18 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-07 finished in 10952 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(G(p1)&&F(p2))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 139 transition count 210
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 139 transition count 210
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 139 transition count 205
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 70 place count 122 transition count 184
Iterating global reduction 1 with 17 rules applied. Total rules applied 87 place count 122 transition count 184
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 91 place count 122 transition count 180
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 104 place count 109 transition count 163
Iterating global reduction 2 with 13 rules applied. Total rules applied 117 place count 109 transition count 163
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 124 place count 109 transition count 156
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 130 place count 103 transition count 141
Iterating global reduction 3 with 6 rules applied. Total rules applied 136 place count 103 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 138 place count 103 transition count 139
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 141 place count 100 transition count 136
Iterating global reduction 4 with 3 rules applied. Total rules applied 144 place count 100 transition count 136
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 147 place count 97 transition count 132
Iterating global reduction 4 with 3 rules applied. Total rules applied 150 place count 97 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 151 place count 97 transition count 131
Applied a total of 151 rules in 21 ms. Remains 97 /163 variables (removed 66) and now considering 131/282 (removed 151) transitions.
// Phase 1: matrix 131 rows 97 cols
[2024-05-21 20:11:16] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 20:11:16] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 20:11:16] [INFO ] Invariant cache hit.
[2024-05-21 20:11:17] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-21 20:11:17] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2024-05-21 20:11:17] [INFO ] Redundant transitions in 1 ms returned []
Running 130 sub problems to find dead transitions.
[2024-05-21 20:11:17] [INFO ] Invariant cache hit.
[2024-05-21 20:11:17] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 131/228 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 43/142 constraints. Problems are: Problem set: 0 solved, 130 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (OVERLAPS) 0/228 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 142 constraints, problems are : Problem set: 0 solved, 130 unsolved in 2891 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (OVERLAPS) 131/228 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 43/142 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 130/272 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 272 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5418 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 0/0 constraints]
After SMT, in 8469ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 8470ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/163 places, 131/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8729 ms. Remains : 97/163 places, 131/282 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-08
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-08 finished in 8874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(p0) U X(p1))&&F((p2||G(p3))))))'
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 141 transition count 216
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 141 transition count 216
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 141 transition count 213
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 66 place count 122 transition count 190
Iterating global reduction 1 with 19 rules applied. Total rules applied 85 place count 122 transition count 190
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 90 place count 122 transition count 185
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 105 place count 107 transition count 165
Iterating global reduction 2 with 15 rules applied. Total rules applied 120 place count 107 transition count 165
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 128 place count 107 transition count 157
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 134 place count 101 transition count 144
Iterating global reduction 3 with 6 rules applied. Total rules applied 140 place count 101 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 141 place count 101 transition count 143
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 146 place count 96 transition count 138
Iterating global reduction 4 with 5 rules applied. Total rules applied 151 place count 96 transition count 138
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 156 place count 91 transition count 132
Iterating global reduction 4 with 5 rules applied. Total rules applied 161 place count 91 transition count 132
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 164 place count 91 transition count 129
Applied a total of 164 rules in 15 ms. Remains 91 /163 variables (removed 72) and now considering 129/282 (removed 153) transitions.
// Phase 1: matrix 129 rows 91 cols
[2024-05-21 20:11:25] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 20:11:25] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 20:11:25] [INFO ] Invariant cache hit.
[2024-05-21 20:11:25] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-21 20:11:26] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-05-21 20:11:26] [INFO ] Invariant cache hit.
[2024-05-21 20:11:26] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 129/220 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 51/144 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 144 constraints, problems are : Problem set: 0 solved, 128 unsolved in 2470 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/91 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 129/220 variables, 91/93 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 51/144 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 128/272 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/220 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 272 constraints, problems are : Problem set: 0 solved, 128 unsolved in 4892 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 91/91 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints]
After SMT, in 7515ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 7517ms
Starting structural reductions in LTL mode, iteration 1 : 91/163 places, 129/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7764 ms. Remains : 91/163 places, 129/282 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-10
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-10 finished in 8024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 139 transition count 207
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 139 transition count 207
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 139 transition count 204
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 69 place count 121 transition count 182
Iterating global reduction 1 with 18 rules applied. Total rules applied 87 place count 121 transition count 182
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 91 place count 121 transition count 178
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 106 place count 106 transition count 156
Iterating global reduction 2 with 15 rules applied. Total rules applied 121 place count 106 transition count 156
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 128 place count 106 transition count 149
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 136 place count 98 transition count 129
Iterating global reduction 3 with 8 rules applied. Total rules applied 144 place count 98 transition count 129
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 146 place count 98 transition count 127
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 151 place count 93 transition count 122
Iterating global reduction 4 with 5 rules applied. Total rules applied 156 place count 93 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 157 place count 93 transition count 121
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 161 place count 89 transition count 116
Iterating global reduction 5 with 4 rules applied. Total rules applied 165 place count 89 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 167 place count 89 transition count 114
Applied a total of 167 rules in 8 ms. Remains 89 /163 variables (removed 74) and now considering 114/282 (removed 168) transitions.
// Phase 1: matrix 114 rows 89 cols
[2024-05-21 20:11:33] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:11:33] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-21 20:11:33] [INFO ] Invariant cache hit.
[2024-05-21 20:11:33] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-21 20:11:34] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-21 20:11:34] [INFO ] Invariant cache hit.
[2024-05-21 20:11:34] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 114/203 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 39/130 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-21 20:11:35] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-21 20:11:35] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-21 20:11:35] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-21 20:11:35] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-21 20:11:35] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 20:11:35] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 6/136 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/203 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 136 constraints, problems are : Problem set: 0 solved, 113 unsolved in 3059 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 114/203 variables, 89/97 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 39/136 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 113/249 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 249 constraints, problems are : Problem set: 0 solved, 113 unsolved in 4259 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 6/6 constraints]
After SMT, in 7443ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 7444ms
Starting structural reductions in LTL mode, iteration 1 : 89/163 places, 114/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7691 ms. Remains : 89/163 places, 114/282 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-11
Product exploration explored 100000 steps with 22829 reset in 107 ms.
Product exploration explored 100000 steps with 22886 reset in 110 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 304 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (9185 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1886 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 17490 steps, run visited all 1 properties in 26 ms. (steps per millisecond=672 )
Probabilistic random walk after 17490 steps, saw 8345 distinct states, run finished after 26 ms. (steps per millisecond=672 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-11 finished in 8327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 138 transition count 202
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 138 transition count 202
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 138 transition count 198
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 71 place count 121 transition count 177
Iterating global reduction 1 with 17 rules applied. Total rules applied 88 place count 121 transition count 177
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 92 place count 121 transition count 173
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 107 place count 106 transition count 153
Iterating global reduction 2 with 15 rules applied. Total rules applied 122 place count 106 transition count 153
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 130 place count 106 transition count 145
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 137 place count 99 transition count 126
Iterating global reduction 3 with 7 rules applied. Total rules applied 144 place count 99 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 145 place count 99 transition count 125
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 150 place count 94 transition count 120
Iterating global reduction 4 with 5 rules applied. Total rules applied 155 place count 94 transition count 120
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 160 place count 89 transition count 114
Iterating global reduction 4 with 5 rules applied. Total rules applied 165 place count 89 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 168 place count 89 transition count 111
Applied a total of 168 rules in 13 ms. Remains 89 /163 variables (removed 74) and now considering 111/282 (removed 171) transitions.
// Phase 1: matrix 111 rows 89 cols
[2024-05-21 20:11:42] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:11:42] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 20:11:42] [INFO ] Invariant cache hit.
[2024-05-21 20:11:42] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-21 20:11:42] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 110 sub problems to find dead transitions.
[2024-05-21 20:11:42] [INFO ] Invariant cache hit.
[2024-05-21 20:11:42] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/200 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 33/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 124 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1896 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 111/200 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 33/124 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 110/234 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 234 constraints, problems are : Problem set: 0 solved, 110 unsolved in 3749 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 5746ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 5748ms
Starting structural reductions in LTL mode, iteration 1 : 89/163 places, 111/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5976 ms. Remains : 89/163 places, 111/282 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-12
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-12 finished in 6104 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 139 transition count 203
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 139 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 139 transition count 200
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 69 place count 121 transition count 178
Iterating global reduction 1 with 18 rules applied. Total rules applied 87 place count 121 transition count 178
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 90 place count 121 transition count 175
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 106 place count 105 transition count 151
Iterating global reduction 2 with 16 rules applied. Total rules applied 122 place count 105 transition count 151
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 130 place count 105 transition count 143
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 137 place count 98 transition count 129
Iterating global reduction 3 with 7 rules applied. Total rules applied 144 place count 98 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 145 place count 98 transition count 128
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 151 place count 92 transition count 122
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 92 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 158 place count 92 transition count 121
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 163 place count 87 transition count 115
Iterating global reduction 5 with 5 rules applied. Total rules applied 168 place count 87 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 171 place count 87 transition count 112
Applied a total of 171 rules in 17 ms. Remains 87 /163 variables (removed 76) and now considering 112/282 (removed 170) transitions.
// Phase 1: matrix 112 rows 87 cols
[2024-05-21 20:11:48] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:11:48] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 20:11:48] [INFO ] Invariant cache hit.
[2024-05-21 20:11:48] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-21 20:11:48] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-21 20:11:48] [INFO ] Redundant transitions in 1 ms returned []
Running 111 sub problems to find dead transitions.
[2024-05-21 20:11:48] [INFO ] Invariant cache hit.
[2024-05-21 20:11:48] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/199 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 39/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 128 constraints, problems are : Problem set: 0 solved, 111 unsolved in 1894 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/199 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 39/128 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 111/239 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/199 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 239 constraints, problems are : Problem set: 0 solved, 111 unsolved in 4530 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 87/87 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
After SMT, in 6534ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 6536ms
Starting structural reductions in SI_LTL mode, iteration 1 : 87/163 places, 112/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6753 ms. Remains : 87/163 places, 112/282 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-13
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-13 finished in 6900 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&F((X((F(p1)&&G(p2)))&&F(!p2))))))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 140 transition count 211
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 140 transition count 211
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 51 place count 140 transition count 206
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 67 place count 124 transition count 188
Iterating global reduction 1 with 16 rules applied. Total rules applied 83 place count 124 transition count 188
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 87 place count 124 transition count 184
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 99 place count 112 transition count 165
Iterating global reduction 2 with 12 rules applied. Total rules applied 111 place count 112 transition count 165
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 118 place count 112 transition count 158
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 124 place count 106 transition count 143
Iterating global reduction 3 with 6 rules applied. Total rules applied 130 place count 106 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 132 place count 106 transition count 141
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 135 place count 103 transition count 138
Iterating global reduction 4 with 3 rules applied. Total rules applied 138 place count 103 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 139 place count 103 transition count 137
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 141 place count 101 transition count 135
Iterating global reduction 5 with 2 rules applied. Total rules applied 143 place count 101 transition count 135
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 145 place count 101 transition count 133
Applied a total of 145 rules in 29 ms. Remains 101 /163 variables (removed 62) and now considering 133/282 (removed 149) transitions.
// Phase 1: matrix 133 rows 101 cols
[2024-05-21 20:11:55] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:11:55] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-21 20:11:55] [INFO ] Invariant cache hit.
[2024-05-21 20:11:55] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 20:11:55] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2024-05-21 20:11:55] [INFO ] Redundant transitions in 0 ms returned []
Running 132 sub problems to find dead transitions.
[2024-05-21 20:11:55] [INFO ] Invariant cache hit.
[2024-05-21 20:11:55] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/234 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 45/148 constraints. Problems are: Problem set: 0 solved, 132 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/234 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 148 constraints, problems are : Problem set: 0 solved, 132 unsolved in 2783 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 133/234 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 45/148 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 132/280 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/234 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 280 constraints, problems are : Problem set: 0 solved, 132 unsolved in 6102 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 9020ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 9021ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/163 places, 133/282 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9303 ms. Remains : 101/163 places, 133/282 transitions.
Stuttering acceptance computed with spot in 278 ms :[true, (NOT p0), (OR (NOT p2) (NOT p1)), p2, (NOT p2), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-14
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-14 finished in 9602 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 137 transition count 201
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 137 transition count 201
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 56 place count 137 transition count 197
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 75 place count 118 transition count 174
Iterating global reduction 1 with 19 rules applied. Total rules applied 94 place count 118 transition count 174
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 98 place count 118 transition count 170
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 113 place count 103 transition count 148
Iterating global reduction 2 with 15 rules applied. Total rules applied 128 place count 103 transition count 148
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 135 place count 103 transition count 141
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 143 place count 95 transition count 121
Iterating global reduction 3 with 8 rules applied. Total rules applied 151 place count 95 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 152 place count 95 transition count 120
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 157 place count 90 transition count 115
Iterating global reduction 4 with 5 rules applied. Total rules applied 162 place count 90 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 163 place count 90 transition count 114
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 167 place count 86 transition count 109
Iterating global reduction 5 with 4 rules applied. Total rules applied 171 place count 86 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 173 place count 86 transition count 107
Applied a total of 173 rules in 10 ms. Remains 86 /163 variables (removed 77) and now considering 107/282 (removed 175) transitions.
// Phase 1: matrix 107 rows 86 cols
[2024-05-21 20:12:04] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:12:04] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-21 20:12:04] [INFO ] Invariant cache hit.
[2024-05-21 20:12:04] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-21 20:12:05] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2024-05-21 20:12:05] [INFO ] Invariant cache hit.
[2024-05-21 20:12:05] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/193 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 33/121 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/193 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 121 constraints, problems are : Problem set: 0 solved, 106 unsolved in 1811 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/193 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 33/121 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 106/227 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/193 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 227 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4699 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 6604ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 6606ms
Starting structural reductions in LTL mode, iteration 1 : 86/163 places, 107/282 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6909 ms. Remains : 86/163 places, 107/282 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 189 ms.
Product exploration explored 100000 steps with 50000 reset in 173 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 291 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 9 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m08-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-15 finished in 7379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(G(p1))) U X(G((F(!p1)||X(X(!p0)))))))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d1m08-LTLFireability-02
Stuttering acceptance computed with spot in 460 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 163/163 places, 282/282 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 137 transition count 201
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 137 transition count 201
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 56 place count 137 transition count 197
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 75 place count 118 transition count 174
Iterating global reduction 1 with 19 rules applied. Total rules applied 94 place count 118 transition count 174
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 98 place count 118 transition count 170
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 114 place count 102 transition count 146
Iterating global reduction 2 with 16 rules applied. Total rules applied 130 place count 102 transition count 146
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 138 place count 102 transition count 138
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 145 place count 95 transition count 119
Iterating global reduction 3 with 7 rules applied. Total rules applied 152 place count 95 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 153 place count 95 transition count 118
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 158 place count 90 transition count 113
Iterating global reduction 4 with 5 rules applied. Total rules applied 163 place count 90 transition count 113
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 168 place count 85 transition count 107
Iterating global reduction 4 with 5 rules applied. Total rules applied 173 place count 85 transition count 107
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 176 place count 85 transition count 104
Applied a total of 176 rules in 22 ms. Remains 85 /163 variables (removed 78) and now considering 104/282 (removed 178) transitions.
// Phase 1: matrix 104 rows 85 cols
[2024-05-21 20:12:12] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:12:12] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 20:12:12] [INFO ] Invariant cache hit.
[2024-05-21 20:12:12] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 20:12:12] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-05-21 20:12:12] [INFO ] Invariant cache hit.
[2024-05-21 20:12:12] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/189 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 119 constraints, problems are : Problem set: 0 solved, 103 unsolved in 1736 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/189 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 103/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/189 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 222 constraints, problems are : Problem set: 0 solved, 103 unsolved in 3704 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
After SMT, in 5531ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 5532ms
Starting structural reductions in LI_LTL mode, iteration 1 : 85/163 places, 104/282 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5721 ms. Remains : 85/163 places, 104/282 transitions.
Running random walk in product with property : DBSingleClientW-PT-d1m08-LTLFireability-02
Product exploration explored 100000 steps with 22899 reset in 112 ms.
Product exploration explored 100000 steps with 22991 reset in 107 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 286 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 109 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 410 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
RANDOM walk for 40000 steps (9183 resets) in 103 ms. (384 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (1960 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
[2024-05-21 20:12:19] [INFO ] Invariant cache hit.
[2024-05-21 20:12:19] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 80/139 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 46/185 variables, 24/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 22/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/189 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 119 constraints, problems are : Problem set: 0 solved, 1 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 80/139 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 46/185 variables, 24/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 22/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/189 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 120 constraints, problems are : Problem set: 0 solved, 1 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 189ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 104/104 transitions.
Graph (complete) has 264 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 84 transition count 102
Applied a total of 3 rules in 2 ms. Remains 84 /85 variables (removed 1) and now considering 102/104 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 84/85 places, 102/104 transitions.
RANDOM walk for 40000 steps (9175 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1910 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4296 steps, run visited all 1 properties in 9 ms. (steps per millisecond=477 )
Probabilistic random walk after 4296 steps, saw 1997 distinct states, run finished after 9 ms. (steps per millisecond=477 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 262 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 420 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Stuttering acceptance computed with spot in 427 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 104/104 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2024-05-21 20:12:20] [INFO ] Invariant cache hit.
[2024-05-21 20:12:20] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 20:12:20] [INFO ] Invariant cache hit.
[2024-05-21 20:12:20] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 20:12:20] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-05-21 20:12:20] [INFO ] Invariant cache hit.
[2024-05-21 20:12:20] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/189 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 119 constraints, problems are : Problem set: 0 solved, 103 unsolved in 1735 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/189 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 103/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/189 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 222 constraints, problems are : Problem set: 0 solved, 103 unsolved in 3706 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
After SMT, in 5523ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 5524ms
Finished structural reductions in LTL mode , in 1 iterations and 5704 ms. Remains : 85/85 places, 104/104 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 286 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 119 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 391 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
RANDOM walk for 40000 steps (9203 resets) in 250 ms. (159 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (1897 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
[2024-05-21 20:12:27] [INFO ] Invariant cache hit.
[2024-05-21 20:12:27] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 80/139 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 46/185 variables, 24/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 22/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/189 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 119 constraints, problems are : Problem set: 0 solved, 1 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 80/139 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 46/185 variables, 24/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/185 variables, 22/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/185 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/185 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/189 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 120 constraints, problems are : Problem set: 0 solved, 1 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 187ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 104/104 transitions.
Graph (complete) has 264 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 84 transition count 102
Applied a total of 3 rules in 2 ms. Remains 84 /85 variables (removed 1) and now considering 102/104 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 84/85 places, 102/104 transitions.
RANDOM walk for 38725 steps (8809 resets) in 59 ms. (645 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 249 ms. Reduced automaton from 10 states, 18 edges and 2 AP (stutter sensitive) to 10 states, 18 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 400 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Stuttering acceptance computed with spot in 425 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Stuttering acceptance computed with spot in 455 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Product exploration explored 100000 steps with 23191 reset in 103 ms.
Product exploration explored 100000 steps with 22934 reset in 106 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 421 ms :[false, (AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p1 p0), (AND p1 p0), (AND p0 p1), (AND p1 p0), p1, false]
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 104/104 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2024-05-21 20:12:29] [INFO ] Redundant transitions in 0 ms returned []
Running 103 sub problems to find dead transitions.
[2024-05-21 20:12:29] [INFO ] Invariant cache hit.
[2024-05-21 20:12:29] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/189 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 119 constraints, problems are : Problem set: 0 solved, 103 unsolved in 1692 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/189 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 103/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/189 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 222 constraints, problems are : Problem set: 0 solved, 103 unsolved in 3661 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
After SMT, in 5435ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 5436ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5450 ms. Remains : 85/85 places, 104/104 transitions.
Built C files in :
/tmp/ltsmin5107310727937265938
[2024-05-21 20:12:35] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5107310727937265938
Running compilation step : cd /tmp/ltsmin5107310727937265938;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 233 ms.
Running link step : cd /tmp/ltsmin5107310727937265938;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin5107310727937265938;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5222307853421512614.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 104/104 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2024-05-21 20:12:50] [INFO ] Invariant cache hit.
[2024-05-21 20:12:50] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 20:12:50] [INFO ] Invariant cache hit.
[2024-05-21 20:12:50] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 20:12:50] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-05-21 20:12:50] [INFO ] Invariant cache hit.
[2024-05-21 20:12:50] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/189 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 119 constraints, problems are : Problem set: 0 solved, 103 unsolved in 1707 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/189 variables, 85/87 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 32/119 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 103/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/189 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 222 constraints, problems are : Problem set: 0 solved, 103 unsolved in 3715 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 0/0 constraints]
After SMT, in 5525ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 5526ms
Finished structural reductions in LTL mode , in 1 iterations and 5703 ms. Remains : 85/85 places, 104/104 transitions.
Built C files in :
/tmp/ltsmin9313531213542475013
[2024-05-21 20:12:55] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9313531213542475013
Running compilation step : cd /tmp/ltsmin9313531213542475013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 233 ms.
Running link step : cd /tmp/ltsmin9313531213542475013;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9313531213542475013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12824228299718386544.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 20:13:11] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:13:11] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:13:11] [INFO ] Time to serialize gal into /tmp/LTL14265528688088071970.gal : 1 ms
[2024-05-21 20:13:11] [INFO ] Time to serialize properties into /tmp/LTL2371221378210648225.prop : 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14265528688088071970.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9559841995673521924.hoa' '-atoms' '/tmp/LTL2371221378210648225.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2371221378210648225.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9559841995673521924.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t54, t64, t73, t74, t121, t170, t222, t223, t226, t227, t228, t229, t23...407
Computing Next relation with stutter on 1.02145e+07 deadlock states
Detected timeout of ITS tools.
[2024-05-21 20:13:26] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:13:26] [INFO ] Flatten gal took : 5 ms
[2024-05-21 20:13:26] [INFO ] Time to serialize gal into /tmp/LTL108506074625839174.gal : 1 ms
[2024-05-21 20:13:26] [INFO ] Time to serialize properties into /tmp/LTL16834774801369946998.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL108506074625839174.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16834774801369946998.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((("((s1>=1)&&(l954>=1))")U(X(G("((s1>=1)&&(l955>=1))"))))U(X(G((F(!("((s1>=1)&&(l955>=1))")))||(X(X(!("((s1>=1)&&(l954>=1))")))))))...157
Formula 0 simplified : (!"((s1>=1)&&(l954>=1))" R XF!"((s1>=1)&&(l955>=1))") R XF(G"((s1>=1)&&(l955>=1))" & XX"((s1>=1)&&(l954>=1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t6, t11, t12, t54, t64, t73, t74, t121, t170, t222, t223, t226, t227, t228, t229, t23...407
Computing Next relation with stutter on 1.02145e+07 deadlock states
Detected timeout of ITS tools.
[2024-05-21 20:13:41] [INFO ] Flatten gal took : 6 ms
[2024-05-21 20:13:41] [INFO ] Applying decomposition
[2024-05-21 20:13:41] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17664132212335054347.txt' '-o' '/tmp/graph17664132212335054347.bin' '-w' '/tmp/graph17664132212335054347.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17664132212335054347.bin' '-l' '-1' '-v' '-w' '/tmp/graph17664132212335054347.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:13:41] [INFO ] Decomposing Gal with order
[2024-05-21 20:13:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:13:41] [INFO ] Removed a total of 80 redundant transitions.
[2024-05-21 20:13:41] [INFO ] Flatten gal took : 10 ms
[2024-05-21 20:13:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 2 ms.
[2024-05-21 20:13:41] [INFO ] Time to serialize gal into /tmp/LTL14906106363371799605.gal : 1 ms
[2024-05-21 20:13:41] [INFO ] Time to serialize properties into /tmp/LTL14256515103177630599.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14906106363371799605.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14256515103177630599.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((("((u1.s1>=1)&&(i4.u11.l954>=1))")U(X(G("((u1.s1>=1)&&(u1.l955>=1))"))))U(X(G((F(!("((u1.s1>=1)&&(u1.l955>=1))")))||(X(X(!("((u1.s...189
Formula 0 simplified : (!"((u1.s1>=1)&&(i4.u11.l954>=1))" R XF!"((u1.s1>=1)&&(u1.l955>=1))") R XF(G"((u1.s1>=1)&&(u1.l955>=1))" & XX"((u1.s1>=1)&&(i4.u11.l...165
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t11, t53, t64, t73, t170, t222, t223, t226, t229, t232, t233, t234, t235, t236, t237,...405
Computing Next relation with stutter on 1.02145e+07 deadlock states
Detected timeout of ITS tools.
Treatment of property DBSingleClientW-PT-d1m08-LTLFireability-02 finished in 104172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-05-21 20:13:56] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15337937046443333316
[2024-05-21 20:13:56] [INFO ] Applying decomposition
[2024-05-21 20:13:56] [INFO ] Computing symmetric may disable matrix : 282 transitions.
[2024-05-21 20:13:56] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:13:56] [INFO ] Computing symmetric may enable matrix : 282 transitions.
[2024-05-21 20:13:56] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:13:56] [INFO ] Flatten gal took : 11 ms
[2024-05-21 20:13:56] [INFO ] Computing Do-Not-Accords matrix : 282 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1801424367144743526.txt' '-o' '/tmp/graph1801424367144743526.bin' '-w' '/tmp/graph1801424367144743526.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1801424367144743526.bin' '-l' '-1' '-v' '-w' '/tmp/graph1801424367144743526.weights' '-q' '0' '-e' '0.001'
[2024-05-21 20:13:56] [INFO ] Decomposing Gal with order
[2024-05-21 20:13:56] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:13:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 20:13:56] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15337937046443333316
Running compilation step : cd /tmp/ltsmin15337937046443333316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 20:13:56] [INFO ] Removed a total of 337 redundant transitions.
[2024-05-21 20:13:56] [INFO ] Flatten gal took : 35 ms
[2024-05-21 20:13:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 210 labels/synchronizations in 7 ms.
[2024-05-21 20:13:56] [INFO ] Time to serialize gal into /tmp/LTLFireability12538896327645785351.gal : 2 ms
[2024-05-21 20:13:56] [INFO ] Time to serialize properties into /tmp/LTLFireability1812571222416337145.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12538896327645785351.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1812571222416337145.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !(((("((i0.u0.s1>=1)&&(i0.u13.l954>=1))")U(X(G("((i0.u0.s1>=1)&&(i8.u1.l955>=1))"))))U(X(G((F(!("((i0.u0.s1>=1)&&(i8.u1.l955>=1))")))|...207
Formula 0 simplified : (!"((i0.u0.s1>=1)&&(i0.u13.l954>=1))" R XF!"((i0.u0.s1>=1)&&(i8.u1.l955>=1))") R XF(G"((i0.u0.s1>=1)&&(i8.u1.l955>=1))" & XX"((i0.u0...183
Compilation finished in 746 ms.
Running link step : cd /tmp/ltsmin15337937046443333316;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin15337937046443333316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true) U X([]((LTLAPp1==true)))) U X([]((<>(!(LTLAPp1==true))||X(X(!(LTLAPp0==true)))))))' '--buchi-type=spotba'
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( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.012: LTL layer: formula: (((LTLAPp0==true) U X([]((LTLAPp1==true)))) U X([]((<>(!(LTLAPp1==true))||X(X(!(LTLAPp0==true)))))))
pins2lts-mc-linux64( 1/ 8), 0.012: "(((LTLAPp0==true) U X([]((LTLAPp1==true)))) U X([]((<>(!(LTLAPp1==true))||X(X(!(LTLAPp0==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.012: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.052: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.110: There are 286 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.110: State length is 164, there are 300 groups
pins2lts-mc-linux64( 0/ 8), 0.110: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.110: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.110: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.110: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.135: [Blue] ~36 levels ~960 states ~2544 transitions
pins2lts-mc-linux64( 0/ 8), 0.141: [Blue] ~36 levels ~1920 states ~4832 transitions
pins2lts-mc-linux64( 0/ 8), 0.167: [Blue] ~36 levels ~3840 states ~8688 transitions
pins2lts-mc-linux64( 5/ 8), 0.205: [Blue] ~36 levels ~7680 states ~16824 transitions
pins2lts-mc-linux64( 5/ 8), 0.277: [Blue] ~37 levels ~15360 states ~33160 transitions
pins2lts-mc-linux64( 5/ 8), 0.432: [Blue] ~37 levels ~30720 states ~63552 transitions
pins2lts-mc-linux64( 2/ 8), 0.764: [Blue] ~256 levels ~61440 states ~127768 transitions
pins2lts-mc-linux64( 5/ 8), 1.353: [Blue] ~37 levels ~122880 states ~261024 transitions
pins2lts-mc-linux64( 4/ 8), 2.341: [Blue] ~133 levels ~245760 states ~557344 transitions
pins2lts-mc-linux64( 5/ 8), 5.554: [Blue] ~37 levels ~491520 states ~1085216 transitions
pins2lts-mc-linux64( 5/ 8), 8.381: [Blue] ~38 levels ~983040 states ~2130032 transitions
pins2lts-mc-linux64( 0/ 8), 13.371: [Blue] ~1732 levels ~1966080 states ~4547800 transitions
pins2lts-mc-linux64( 4/ 8), 22.901: [Blue] ~1436 levels ~3932160 states ~10282432 transitions
pins2lts-mc-linux64( 4/ 8), 42.024: [Blue] ~4753 levels ~7864320 states ~21434216 transitions
pins2lts-mc-linux64( 4/ 8), 81.662: [Blue] ~11429 levels ~15728640 states ~46930720 transitions
pins2lts-mc-linux64( 4/ 8), 159.197: [Blue] ~11499 levels ~31457280 states ~90310216 transitions
pins2lts-mc-linux64( 4/ 8), 317.850: [Blue] ~31594 levels ~62914560 states ~182857352 transitions
pins2lts-mc-linux64( 4/ 8), 650.357: [Blue] ~76754 levels ~125829120 states ~407191624 transitions
pins2lts-mc-linux64( 7/ 8), 724.570: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 724.621:
pins2lts-mc-linux64( 0/ 8), 724.621: Explored 134664446 states 418334634 transitions, fanout: 3.106
pins2lts-mc-linux64( 0/ 8), 724.621: Total exploration time 724.500 sec (724.440 sec minimum, 724.469 sec on average)
pins2lts-mc-linux64( 0/ 8), 724.622: States per second: 185872, Transitions per second: 577412
pins2lts-mc-linux64( 0/ 8), 724.622:
pins2lts-mc-linux64( 0/ 8), 724.622: State space has 134217216 states, 1010623 are accepting
pins2lts-mc-linux64( 0/ 8), 724.622: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 724.622: blue states: 134664446 (100.33%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 724.622: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 724.622: all-red states: 16690438 (12.44%), bogus 514 (0.00%)
pins2lts-mc-linux64( 0/ 8), 724.622:
pins2lts-mc-linux64( 0/ 8), 724.622: Total memory used for local state coloring: 134.3MB
pins2lts-mc-linux64( 0/ 8), 724.622:
pins2lts-mc-linux64( 0/ 8), 724.622: Queue width: 8B, total height: 8800070, memory: 67.14MB
pins2lts-mc-linux64( 0/ 8), 724.622: Tree memory: 1213.8MB, 9.5 B/state, compr.: 1.4%
pins2lts-mc-linux64( 0/ 8), 724.622: Tree fill ratio (roots/leafs): 99.0%/74.0%
pins2lts-mc-linux64( 0/ 8), 724.622: Stored 284 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 724.622: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 724.622: Est. total memory use: 1281.0MB (~1091.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15337937046443333316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true) U X([]((LTLAPp1==true)))) U X([]((<>(!(LTLAPp1==true))||X(X(!(LTLAPp0==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15337937046443333316;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true) U X([]((LTLAPp1==true)))) U X([]((<>(!(LTLAPp1==true))||X(X(!(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:840)
ITS-tools command line returned an error code 137
[2024-05-21 20:29:29] [INFO ] Flatten gal took : 14 ms
[2024-05-21 20:29:29] [INFO ] Time to serialize gal into /tmp/LTLFireability16652558626617381266.gal : 2 ms
[2024-05-21 20:29:29] [INFO ] Time to serialize properties into /tmp/LTLFireability15032876672715934702.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16652558626617381266.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15032876672715934702.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 2 LTL properties
Checking formula 0 : !(((("((s1>=1)&&(l954>=1))")U(X(G("((s1>=1)&&(l955>=1))"))))U(X(G((F(!("((s1>=1)&&(l955>=1))")))||(X(X(!("((s1>=1)&&(l954>=1))")))))))...157
Formula 0 simplified : (!"((s1>=1)&&(l954>=1))" R XF!"((s1>=1)&&(l955>=1))") R XF(G"((s1>=1)&&(l955>=1))" & XX"((s1>=1)&&(l954>=1))")
ITS-tools command line returned an error code 137
[2024-05-21 20:43:35] [INFO ] Flatten gal took : 27 ms
[2024-05-21 20:43:35] [INFO ] Input system was already deterministic with 282 transitions.
[2024-05-21 20:43:35] [INFO ] Transformed 163 places.
[2024-05-21 20:43:35] [INFO ] Transformed 282 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 20:43:35] [INFO ] Time to serialize gal into /tmp/LTLFireability12953685721034907023.gal : 4 ms
[2024-05-21 20:43:35] [INFO ] Time to serialize properties into /tmp/LTLFireability10923566271344883315.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12953685721034907023.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10923566271344883315.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((("((s1>=1)&&(l954>=1))")U(X(G("((s1>=1)&&(l955>=1))"))))U(X(G((F(!("((s1>=1)&&(l955>=1))")))||(X(X(!("((s1>=1)&&(l954>=1))")))))))...157
Formula 0 simplified : (!"((s1>=1)&&(l954>=1))" R XF!"((s1>=1)&&(l955>=1))") R XF(G"((s1>=1)&&(l955>=1))" & XX"((s1>=1)&&(l954>=1))")

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-d1m08"
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-5568"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d1m08, 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 r092-tall-171624189500524"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m08.tgz
mv DBSingleClientW-PT-d1m08 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;