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.r536-tall-171690532800651.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 ltsminxred
Input is Sudoku-PT-AN11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532800651
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 44M
-rw-r--r-- 1 mcc users 603K Apr 12 12:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.9M Apr 12 12:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 12 11:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 6.3M Apr 12 11:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 354K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 616K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.3M Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.1M Apr 12 13:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.1M Apr 12 13:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6M Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18M Apr 12 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 82K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 203K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 746K May 18 16:43 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 Sudoku-PT-AN11-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717272807288

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:13:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 20:13:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:13:28] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2024-06-01 20:13:28] [INFO ] Transformed 1694 places.
[2024-06-01 20:13:28] [INFO ] Transformed 1331 transitions.
[2024-06-01 20:13:28] [INFO ] Found NUPN structural information;
[2024-06-01 20:13:28] [INFO ] Parsed PT model containing 1694 places and 1331 transitions and 5324 arcs in 290 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 71 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-AN11-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1694 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 27 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2024-06-01 20:13:29] [INFO ] Computed 363 invariants in 39 ms
[2024-06-01 20:13:29] [INFO ] Implicit Places using invariants in 626 ms returned []
[2024-06-01 20:13:29] [INFO ] Invariant cache hit.
[2024-06-01 20:13:31] [INFO ] Implicit Places using invariants and state equation in 1496 ms returned []
Implicit Place search using SMT with State Equation took 2163 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 4ms
Finished structural reductions in LTL mode , in 1 iterations and 2216 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Support contains 1694 out of 1694 places after structural reductions.
[2024-06-01 20:13:31] [INFO ] Flatten gal took : 209 ms
[2024-06-01 20:13:31] [INFO ] Flatten gal took : 101 ms
[2024-06-01 20:13:32] [INFO ] Input system was already deterministic with 1331 transitions.
RANDOM walk for 40000 steps (376 resets) in 8524 ms. (4 steps per ms) remains 9/23 properties
BEST_FIRST walk for 40004 steps (8 resets) in 511 ms. (78 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 413 ms. (96 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2721 ms. (14 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 825 ms. (48 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 337 ms. (118 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 908 ms. (44 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 422 ms. (94 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 364 ms. (109 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 9/9 properties
[2024-06-01 20:13:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1694 variables, 1694/1694 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/1694 variables, 363/2057 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1331/3025 variables, 1694/3751 constraints. Problems are: Problem set: 4 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 4 solved, 5 unsolved in 5025 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 363/363 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 0/363 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1331/1694 variables, 363/726 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1694 variables, 1331/2057 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1331/3025 variables, 1694/3751 constraints. Problems are: Problem set: 4 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 4 solved, 5 unsolved in 5029 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10932ms problems are : Problem set: 4 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 363 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.6 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 26 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 363/1694 places, 1331/1331 transitions.
RANDOM walk for 40000 steps (376 resets) in 4344 ms. (9 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 421 ms. (94 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 373 ms. (106 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 351 ms. (113 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 316 ms. (126 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 421 ms. (94 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 77592 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 5
Probabilistic random walk after 77592 steps, saw 62562 distinct states, run finished after 3010 ms. (steps per millisecond=25 ) properties seen :0
// Phase 1: matrix 1331 rows 363 cols
[2024-06-01 20:13:52] [INFO ] Computed 32 invariants in 60 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 363/363 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 32/395 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1331/1694 variables, 363/758 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1694/1694 variables, and 758 constraints, problems are : Problem set: 0 solved, 5 unsolved in 958 ms.
Refiners :[Domain max(s): 363/363 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 363/363 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/363 variables, 32/395 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/363 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1331/1694 variables, 363/758 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 758 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1169 ms.
Refiners :[Domain max(s): 363/363 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 5/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2361ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 5 properties in 11 ms. (steps per millisecond=11 )
Parikh walk visited 5 properties in 17 ms.
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-AN11-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA Sudoku-PT-AN11-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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))'
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 83 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2024-06-01 20:13:55] [INFO ] Computed 363 invariants in 9 ms
[2024-06-01 20:13:57] [INFO ] Implicit Places using invariants in 2054 ms returned []
[2024-06-01 20:13:57] [INFO ] Invariant cache hit.
[2024-06-01 20:13:59] [INFO ] Implicit Places using invariants and state equation in 2912 ms returned []
Implicit Place search using SMT with State Equation took 4969 ms to find 0 implicit places.
[2024-06-01 20:14:00] [INFO ] Redundant transitions in 80 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5146 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-00
Product exploration timeout after 63370 steps with 1022 reset in 10002 ms.
Product exploration timeout after 63690 steps with 1027 reset in 10002 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 244 steps (0 resets) in 59 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2024-06-01 20:15:17] [INFO ] Invariant cache hit.
[2024-06-01 20:15:28] [INFO ] [Real]Absence check using 363 positive place invariants in 1258 ms returned sat
[2024-06-01 20:15:32] [INFO ] [Real]Absence check using state equation in 4150 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 44 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-06-01 20:15:32] [INFO ] Invariant cache hit.
[2024-06-01 20:15:34] [INFO ] Implicit Places using invariants in 1994 ms returned []
[2024-06-01 20:15:34] [INFO ] Invariant cache hit.
[2024-06-01 20:15:36] [INFO ] Implicit Places using invariants and state equation in 2692 ms returned []
Implicit Place search using SMT with State Equation took 4690 ms to find 0 implicit places.
[2024-06-01 20:15:37] [INFO ] Redundant transitions in 46 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4788 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
RANDOM walk for 244 steps (0 resets) in 69 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-06-01 20:16:33] [INFO ] Invariant cache hit.
[2024-06-01 20:16:44] [INFO ] [Real]Absence check using 363 positive place invariants in 1262 ms returned sat
[2024-06-01 20:16:48] [INFO ] [Real]Absence check using state equation in 4302 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration timeout after 66470 steps with 1072 reset in 10002 ms.
Product exploration timeout after 66040 steps with 1065 reset in 10001 ms.
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 28 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-06-01 20:17:08] [INFO ] Invariant cache hit.
[2024-06-01 20:17:10] [INFO ] Implicit Places using invariants in 1787 ms returned []
[2024-06-01 20:17:10] [INFO ] Invariant cache hit.
[2024-06-01 20:17:13] [INFO ] Implicit Places using invariants and state equation in 2671 ms returned []
Implicit Place search using SMT with State Equation took 4461 ms to find 0 implicit places.
[2024-06-01 20:17:13] [INFO ] Redundant transitions in 16 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4515 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Treatment of property Sudoku-PT-AN11-LTLCardinality-00 finished in 198744 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(p1))))'
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 40 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-06-01 20:17:13] [INFO ] Invariant cache hit.
[2024-06-01 20:17:14] [INFO ] Implicit Places using invariants in 904 ms returned []
[2024-06-01 20:17:14] [INFO ] Invariant cache hit.
[2024-06-01 20:17:16] [INFO ] Implicit Places using invariants and state equation in 1827 ms returned []
Implicit Place search using SMT with State Equation took 2737 ms to find 0 implicit places.
[2024-06-01 20:17:16] [INFO ] Redundant transitions in 15 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2809 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-03
Product exploration timeout after 63510 steps with 1024 reset in 10002 ms.
Product exploration timeout after 62990 steps with 1015 reset in 10001 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 151 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (376 resets) in 3864 ms. (10 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 401 ms. (99 steps per ms) remains 1/1 properties
[2024-06-01 20:18:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1331/1452 variables, 121/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1452 variables, 1331/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 242/1694 variables, 242/1815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1694 variables, 242/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1500 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1331/1452 variables, 121/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1452 variables, 1331/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1694/3025 variables, and 1815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1359 ms.
Refiners :[Domain max(s): 1452/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 0/1694 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2894ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.3 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 56 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 363/1694 places, 1331/1331 transitions.
RANDOM walk for 40000 steps (376 resets) in 3438 ms. (11 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 264982 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 1
Probabilistic random walk after 264982 steps, saw 130030 distinct states, run finished after 3002 ms. (steps per millisecond=88 ) properties seen :0
// Phase 1: matrix 1331 rows 363 cols
[2024-06-01 20:18:51] [INFO ] Computed 32 invariants in 36 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 237/358 variables, 27/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 237/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/363 variables, 5/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 5/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1331/1694 variables, 363/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1694/1694 variables, and 758 constraints, problems are : Problem set: 0 solved, 1 unsolved in 749 ms.
Refiners :[Domain max(s): 363/363 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 237/358 variables, 27/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 237/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/363 variables, 5/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 5/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1331/1694 variables, 363/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 758 constraints, problems are : Problem set: 0 solved, 1 unsolved in 592 ms.
Refiners :[Domain max(s): 363/363 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1413ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 119 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 7 factoid took 227 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 1331 rows 1694 cols
[2024-06-01 20:18:53] [INFO ] Computed 363 invariants in 17 ms
[2024-06-01 20:19:06] [INFO ] [Real]Absence check using 363 positive place invariants in 1604 ms returned sat
[2024-06-01 20:19:08] [INFO ] [Real]Absence check using state equation in 1913 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 22 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-06-01 20:19:08] [INFO ] Invariant cache hit.
[2024-06-01 20:19:09] [INFO ] Implicit Places using invariants in 900 ms returned []
[2024-06-01 20:19:09] [INFO ] Invariant cache hit.
[2024-06-01 20:19:11] [INFO ] Implicit Places using invariants and state equation in 1918 ms returned []
Implicit Place search using SMT with State Equation took 2820 ms to find 0 implicit places.
[2024-06-01 20:19:11] [INFO ] Redundant transitions in 14 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2866 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 120 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (376 resets) in 3303 ms. (12 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 1/1 properties
[2024-06-01 20:20:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1331/1452 variables, 121/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1452 variables, 1331/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 242/1694 variables, 242/1815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1694 variables, 242/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1507 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1331/1452 variables, 121/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1452 variables, 1331/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1694/3025 variables, and 1815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1316 ms.
Refiners :[Domain max(s): 1452/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 0/1694 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2857ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.3 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 24 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 363/1694 places, 1331/1331 transitions.
RANDOM walk for 40000 steps (376 resets) in 3273 ms. (12 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 337 ms. (118 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 264496 steps, run timeout after 3002 ms. (steps per millisecond=88 ) properties seen :0 out of 1
Probabilistic random walk after 264496 steps, saw 129948 distinct states, run finished after 3002 ms. (steps per millisecond=88 ) properties seen :0
// Phase 1: matrix 1331 rows 363 cols
[2024-06-01 20:20:26] [INFO ] Computed 32 invariants in 25 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 237/358 variables, 27/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 237/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/363 variables, 5/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 5/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1331/1694 variables, 363/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1694/1694 variables, and 758 constraints, problems are : Problem set: 0 solved, 1 unsolved in 733 ms.
Refiners :[Domain max(s): 363/363 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 237/358 variables, 27/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 237/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/363 variables, 5/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 5/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1331/1694 variables, 363/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 758 constraints, problems are : Problem set: 0 solved, 1 unsolved in 620 ms.
Refiners :[Domain max(s): 363/363 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1415ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 119 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 7 factoid took 218 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 1331 rows 1694 cols
[2024-06-01 20:20:28] [INFO ] Computed 363 invariants in 10 ms
[2024-06-01 20:20:41] [INFO ] [Real]Absence check using 363 positive place invariants in 1600 ms returned sat
[2024-06-01 20:20:43] [INFO ] [Real]Absence check using state equation in 2108 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration timeout after 63570 steps with 1025 reset in 10001 ms.
Product exploration timeout after 63150 steps with 1018 reset in 10001 ms.
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 23 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-06-01 20:21:03] [INFO ] Invariant cache hit.
[2024-06-01 20:21:04] [INFO ] Implicit Places using invariants in 912 ms returned []
[2024-06-01 20:21:04] [INFO ] Invariant cache hit.
[2024-06-01 20:21:06] [INFO ] Implicit Places using invariants and state equation in 1947 ms returned []
Implicit Place search using SMT with State Equation took 2863 ms to find 0 implicit places.
[2024-06-01 20:21:06] [INFO ] Redundant transitions in 19 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2912 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Treatment of property Sudoku-PT-AN11-LTLCardinality-03 finished in 232775 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((G(!p0) U X((p1 U X(p2))))))'
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 7 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-06-01 20:21:06] [INFO ] Invariant cache hit.
[2024-06-01 20:21:07] [INFO ] Implicit Places using invariants in 1235 ms returned []
[2024-06-01 20:21:07] [INFO ] Invariant cache hit.
[2024-06-01 20:21:09] [INFO ] Implicit Places using invariants and state equation in 2027 ms returned []
Implicit Place search using SMT with State Equation took 3265 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 3274 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 346 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (AND p0 (NOT p2)), (NOT p2), p0]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-04
Product exploration timeout after 35540 steps with 8856 reset in 10001 ms.
Product exploration timeout after 35460 steps with 8915 reset in 10006 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 863 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (AND p0 (NOT p2)), (NOT p2), p0]
RANDOM walk for 40000 steps (376 resets) in 19353 ms. (2 steps per ms) remains 8/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2693 ms. (14 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 349 ms. (114 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2584 ms. (15 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2713 ms. (14 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1512 ms. (26 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1509 ms. (26 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1462 ms. (27 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1469 ms. (27 steps per ms) remains 8/8 properties
[2024-06-01 20:29:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1573 variables, 1573/1573 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem apf3 is UNSAT
Problem apf5 is UNSAT
Problem apf7 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/1573 variables, 242/1815 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1573 variables, 0/1815 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 121/1694 variables, 121/1936 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 121/2057 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 4 solved, 4 unsolved in 5016 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1573 variables, 1573/1573 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1573 variables, 242/1815 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1573 variables, 0/1815 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 121/1694 variables, 121/1936 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 121/2057 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1331/3025 variables, 1694/3751 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 4 solved, 4 unsolved in 2808 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 8998ms problems are : Problem set: 4 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 4 properties in 28 ms. (steps per millisecond=4 )
Parikh walk visited 4 properties in 27 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p1 p0)), (G (OR p1 p0 p2)), (G (OR (NOT p1) p2)), (G (OR p0 p2))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p0)))), (F (NOT (OR p1 p2))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 (NOT p0) p2))), (F (NOT (OR (NOT p0) p2))), (F p0)]
Knowledge based reduction with 21 factoid took 2042 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 8 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-06-01 20:29:47] [INFO ] Invariant cache hit.
[2024-06-01 20:29:48] [INFO ] Implicit Places using invariants in 1199 ms returned []
[2024-06-01 20:29:48] [INFO ] Invariant cache hit.
[2024-06-01 20:29:50] [INFO ] Implicit Places using invariants and state equation in 1974 ms returned []
Implicit Place search using SMT with State Equation took 3177 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 3187 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p1), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 143 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (376 resets) in 4443 ms. (9 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 432 ms. (92 steps per ms) remains 1/1 properties
[2024-06-01 20:30:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1331/1452 variables, 121/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1452 variables, 1331/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1694/3025 variables, and 1815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1309 ms.
Refiners :[Domain max(s): 1452/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 0/1694 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1331/1452 variables, 121/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1452 variables, 1331/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1694/3025 variables, and 1815 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1360 ms.
Refiners :[Domain max(s): 1452/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 0/1694 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2710ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.2 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 21 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 363/1694 places, 1331/1331 transitions.
RANDOM walk for 40000 steps (376 resets) in 4405 ms. (9 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 405 ms. (98 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 257139 steps, run timeout after 3018 ms. (steps per millisecond=85 ) properties seen :0 out of 1
Probabilistic random walk after 257139 steps, saw 128952 distinct states, run finished after 3019 ms. (steps per millisecond=85 ) properties seen :0
// Phase 1: matrix 1331 rows 363 cols
[2024-06-01 20:30:58] [INFO ] Computed 32 invariants in 27 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 237/358 variables, 27/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 237/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/363 variables, 5/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 5/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1331/1694 variables, 363/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1694/1694 variables, and 758 constraints, problems are : Problem set: 0 solved, 1 unsolved in 871 ms.
Refiners :[Domain max(s): 363/363 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 237/358 variables, 27/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 237/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/363 variables, 5/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 5/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1331/1694 variables, 363/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 758 constraints, problems are : Problem set: 0 solved, 1 unsolved in 541 ms.
Refiners :[Domain max(s): 363/363 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1472ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p2 p1), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 (NOT p2)))), (F (NOT (AND p1 p2))), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 270 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 258 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration timeout after 66230 steps with 626 reset in 10001 ms.
Product exploration timeout after 66200 steps with 626 reset in 10002 ms.
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 11 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2024-06-01 20:31:20] [INFO ] Computed 363 invariants in 9 ms
[2024-06-01 20:31:21] [INFO ] Implicit Places using invariants in 1282 ms returned []
[2024-06-01 20:31:21] [INFO ] Invariant cache hit.
[2024-06-01 20:31:24] [INFO ] Implicit Places using invariants and state equation in 2139 ms returned []
Implicit Place search using SMT with State Equation took 3426 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 3439 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Treatment of property Sudoku-PT-AN11-LTLCardinality-04 finished in 617855 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 (G((p1 U (X(p1)||G(!p1)))) U p1)))'
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 14 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-06-01 20:31:24] [INFO ] Invariant cache hit.
[2024-06-01 20:31:25] [INFO ] Implicit Places using invariants in 1741 ms returned []
[2024-06-01 20:31:26] [INFO ] Invariant cache hit.
[2024-06-01 20:31:28] [INFO ] Implicit Places using invariants and state equation in 2581 ms returned []
Implicit Place search using SMT with State Equation took 4324 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 4338 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 327 ms :[(NOT p1), false, (NOT p1), false, false, false, p1, (AND p0 p1), true, p0]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-05
Product exploration timeout after 66130 steps with 1852 reset in 10001 ms.
Product exploration timeout after 65460 steps with 1855 reset in 10001 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 256 ms. Reduced automaton from 10 states, 24 edges and 2 AP (stutter sensitive) to 9 states, 22 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[true, p1, p0, (AND p1 p0), false, false, false, false, false]
RANDOM walk for 40000 steps (376 resets) in 3784 ms. (10 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1423 ms. (28 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1448 ms. (27 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 370 ms. (107 steps per ms) remains 3/3 properties
[2024-06-01 20:35:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1452 variables, 1452/1452 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/1452 variables, 121/1573 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1694/3025 variables, and 1815 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1552 ms.
Refiners :[Domain max(s): 1452/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 0/1694 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1452 variables, 1452/1452 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1452 variables, 121/1573 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1694/3025 variables, and 1815 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2365 ms.
Refiners :[Domain max(s): 1452/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 0/1694 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 4348ms problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 17 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 1694/1694 places, 1331/1331 transitions.
RANDOM walk for 40000 steps (376 resets) in 4636 ms. (8 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1437 ms. (27 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 401 ms. (99 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 134821 steps, run timeout after 3002 ms. (steps per millisecond=44 ) properties seen :0 out of 2
Probabilistic random walk after 134821 steps, saw 85015 distinct states, run finished after 3002 ms. (steps per millisecond=44 ) properties seen :0
[2024-06-01 20:36:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1452 variables, 1452/1452 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1452 variables, 121/1573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 242/1694 variables, 242/1815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 242/2057 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1331/3025 variables, 1694/3751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2863 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1452 variables, 1452/1452 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1452 variables, 121/1573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 242/1694 variables, 242/1815 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 242/2057 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1331/3025 variables, 1694/3751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7438 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10557ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=12 )
Parikh walk visited 2 properties in 10 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 652 ms. Reduced automaton from 9 states, 22 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[true, p1, p0, false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 293 ms :[true, p1, p0, false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0)]
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 9 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-06-01 20:36:18] [INFO ] Invariant cache hit.
[2024-06-01 20:36:20] [INFO ] Implicit Places using invariants in 1752 ms returned []
[2024-06-01 20:36:20] [INFO ] Invariant cache hit.
[2024-06-01 20:36:23] [INFO ] Implicit Places using invariants and state equation in 2697 ms returned []
Implicit Place search using SMT with State Equation took 4451 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 5ms
Finished structural reductions in LTL mode , in 1 iterations and 4465 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 192 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[true, p1, p0, false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0)]
RANDOM walk for 40000 steps (376 resets) in 3576 ms. (11 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 394 ms. (101 steps per ms) remains 1/1 properties
[2024-06-01 20:38:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1331/1452 variables, 121/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1452 variables, 1331/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 242/1694 variables, 242/1815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1694 variables, 242/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2442 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1331/1452 variables, 121/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1452 variables, 1331/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 242/1694 variables, 242/1815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1694 variables, 242/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1331/3025 variables, 1694/3751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5008 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 7494ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.3 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 24 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 363/1694 places, 1331/1331 transitions.
RANDOM walk for 40000 steps (376 resets) in 3368 ms. (11 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 355 ms. (112 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 256573 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 1
Probabilistic random walk after 256573 steps, saw 128797 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
// Phase 1: matrix 1331 rows 363 cols
[2024-06-01 20:38:24] [INFO ] Computed 32 invariants in 28 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 232/353 variables, 22/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 232/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/363 variables, 10/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 10/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1331/1694 variables, 363/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1694/1694 variables, and 758 constraints, problems are : Problem set: 0 solved, 1 unsolved in 463 ms.
Refiners :[Domain max(s): 363/363 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 232/353 variables, 22/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 232/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/363 variables, 10/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 10/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1331/1694 variables, 363/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 758 constraints, problems are : Problem set: 0 solved, 1 unsolved in 703 ms.
Refiners :[Domain max(s): 363/363 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1226ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=10 )
Parikh walk visited 1 properties in 11 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 9 factoid took 290 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[true, p1, p0, false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 250 ms :[true, p1, p0, false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 252 ms :[true, p1, p0, false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0)]
Product exploration timeout after 68650 steps with 649 reset in 10001 ms.
Product exploration timeout after 68470 steps with 648 reset in 10001 ms.
Applying partial POR strategy [true, true, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 265 ms :[true, p1, p0, false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0)]
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 92 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-06-01 20:38:47] [INFO ] Redundant transitions in 15 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 119 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 10 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2024-06-01 20:38:47] [INFO ] Computed 363 invariants in 8 ms
[2024-06-01 20:38:48] [INFO ] Implicit Places using invariants in 1708 ms returned []
[2024-06-01 20:38:48] [INFO ] Invariant cache hit.
[2024-06-01 20:38:51] [INFO ] Implicit Places using invariants and state equation in 2764 ms returned []
Implicit Place search using SMT with State Equation took 4477 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 4489 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Treatment of property Sudoku-PT-AN11-LTLCardinality-05 finished in 447457 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||X(G(p1)))))'
Support contains 242 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1331 places and 0 transitions.
Iterating post reduction 0 with 1331 rules applied. Total rules applied 1331 place count 363 transition count 1331
Applied a total of 1331 rules in 18 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2024-06-01 20:38:51] [INFO ] Computed 32 invariants in 32 ms
[2024-06-01 20:38:52] [INFO ] Implicit Places using invariants in 611 ms returned []
[2024-06-01 20:38:52] [INFO ] Invariant cache hit.
[2024-06-01 20:38:55] [INFO ] Implicit Places using invariants and state equation in 3318 ms returned []
Implicit Place search using SMT with State Equation took 3931 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3950 ms. Remains : 363/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-06
Product exploration timeout after 79010 steps with 39505 reset in 10001 ms.
Product exploration timeout after 78260 steps with 39130 reset in 10001 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 18 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN11-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN11-LTLCardinality-06 finished in 37784 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))'
Support contains 2 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 362 are kept as prefixes of interest. Removing 1332 places using SCC suffix rule.5 ms
Discarding 1332 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 62 ms. Remains 362 /1694 variables (removed 1332) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 362 cols
[2024-06-01 20:39:29] [INFO ] Computed 30 invariants in 38 ms
[2024-06-01 20:39:30] [INFO ] Implicit Places using invariants in 1045 ms returned []
[2024-06-01 20:39:30] [INFO ] Invariant cache hit.
[2024-06-01 20:39:34] [INFO ] Implicit Places using invariants and state equation in 3830 ms returned []
Implicit Place search using SMT with State Equation took 4877 ms to find 0 implicit places.
[2024-06-01 20:39:34] [INFO ] Redundant transitions in 20 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 362/1694 places, 1331/1331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4965 ms. Remains : 362/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-08
Stuttering criterion allowed to conclude after 182 steps with 1 reset in 16 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-08 finished in 5031 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((p0&&X(G(p1))))))'
Support contains 4 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1331 places and 0 transitions.
Iterating post reduction 0 with 1331 rules applied. Total rules applied 1331 place count 363 transition count 1331
Applied a total of 1331 rules in 27 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2024-06-01 20:39:34] [INFO ] Computed 32 invariants in 32 ms
[2024-06-01 20:39:36] [INFO ] Implicit Places using invariants in 1562 ms returned []
[2024-06-01 20:39:36] [INFO ] Invariant cache hit.
[2024-06-01 20:39:40] [INFO ] Implicit Places using invariants and state equation in 4874 ms returned []
Implicit Place search using SMT with State Equation took 6438 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6467 ms. Remains : 363/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-12
Stuttering criterion allowed to conclude after 105 steps with 0 reset in 13 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-12 finished in 6624 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)))'
Support contains 2 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 344 are kept as prefixes of interest. Removing 1350 places using SCC suffix rule.2 ms
Discarding 1350 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 27 ms. Remains 344 /1694 variables (removed 1350) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 344 cols
[2024-06-01 20:39:41] [INFO ] Computed 24 invariants in 33 ms
[2024-06-01 20:39:41] [INFO ] Implicit Places using invariants in 655 ms returned []
[2024-06-01 20:39:41] [INFO ] Invariant cache hit.
[2024-06-01 20:39:44] [INFO ] Implicit Places using invariants and state equation in 2932 ms returned []
Implicit Place search using SMT with State Equation took 3587 ms to find 0 implicit places.
[2024-06-01 20:39:44] [INFO ] Redundant transitions in 17 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 344/1694 places, 1331/1331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3642 ms. Remains : 344/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-13
Stuttering criterion allowed to conclude after 106 steps with 0 reset in 15 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-13 finished in 3715 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 U p1))))'
Support contains 3 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 364 are kept as prefixes of interest. Removing 1330 places using SCC suffix rule.3 ms
Discarding 1330 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 35 ms. Remains 364 /1694 variables (removed 1330) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 364 cols
[2024-06-01 20:39:44] [INFO ] Computed 32 invariants in 31 ms
[2024-06-01 20:39:46] [INFO ] Implicit Places using invariants in 1562 ms returned []
[2024-06-01 20:39:46] [INFO ] Invariant cache hit.
[2024-06-01 20:39:51] [INFO ] Implicit Places using invariants and state equation in 4792 ms returned []
Implicit Place search using SMT with State Equation took 6357 ms to find 0 implicit places.
[2024-06-01 20:39:51] [INFO ] Redundant transitions in 18 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 364/1694 places, 1331/1331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6415 ms. Remains : 364/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-14
Stuttering criterion allowed to conclude after 104 steps with 0 reset in 9 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-14 finished in 6516 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)||G(F(p1))))||G(p2)))'
Support contains 7 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 364 are kept as prefixes of interest. Removing 1330 places using SCC suffix rule.3 ms
Discarding 1330 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 33 ms. Remains 364 /1694 variables (removed 1330) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 364 cols
[2024-06-01 20:39:51] [INFO ] Computed 32 invariants in 34 ms
[2024-06-01 20:39:52] [INFO ] Implicit Places using invariants in 1510 ms returned []
[2024-06-01 20:39:52] [INFO ] Invariant cache hit.
[2024-06-01 20:39:59] [INFO ] Implicit Places using invariants and state equation in 6382 ms returned []
Implicit Place search using SMT with State Equation took 7894 ms to find 0 implicit places.
[2024-06-01 20:39:59] [INFO ] Redundant transitions in 19 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 364/1694 places, 1331/1331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7951 ms. Remains : 364/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-15
Stuttering criterion allowed to conclude after 9222 steps with 92 reset in 728 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-15 finished in 8799 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))'
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(p1))))'
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((G(!p0) U X((p1 U X(p2))))))'
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 (G((p1 U (X(p1)||G(!p1)))) U p1)))'
Found a Lengthening insensitive property : Sudoku-PT-AN11-LTLCardinality-05
Stuttering acceptance computed with spot in 326 ms :[(NOT p1), false, (NOT p1), false, false, false, p1, (AND p0 p1), true, p0]
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 19 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2024-06-01 20:40:00] [INFO ] Computed 363 invariants in 7 ms
[2024-06-01 20:40:02] [INFO ] Implicit Places using invariants in 1752 ms returned []
[2024-06-01 20:40:02] [INFO ] Invariant cache hit.
[2024-06-01 20:40:05] [INFO ] Implicit Places using invariants and state equation in 2621 ms returned []
Implicit Place search using SMT with State Equation took 4374 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 4393 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-05
Product exploration timeout after 68520 steps with 1845 reset in 10001 ms.
Product exploration timeout after 67880 steps with 1822 reset in 10002 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 262 ms. Reduced automaton from 10 states, 24 edges and 2 AP (stutter sensitive) to 9 states, 22 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[true, p1, p0, (AND p1 p0), false, false, false, false, false]
RANDOM walk for 40000 steps (376 resets) in 3608 ms. (11 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1426 ms. (28 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1335 ms. (29 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 356 ms. (112 steps per ms) remains 3/3 properties
[2024-06-01 20:44:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1452 variables, 1452/1452 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/1452 variables, 121/1573 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1694/3025 variables, and 1815 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2430 ms.
Refiners :[Domain max(s): 1452/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 0/1694 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1452 variables, 1452/1452 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1452 variables, 121/1573 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 242/1694 variables, 242/1815 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1694 variables, 242/2057 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 1 solved, 2 unsolved in 5004 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 7694ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 2 properties in 11 ms. (steps per millisecond=11 )
Parikh walk visited 2 properties in 12 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 708 ms. Reduced automaton from 9 states, 22 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[true, p1, p0, false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 269 ms :[true, p1, p0, false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0)]
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 17 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-06-01 20:44:34] [INFO ] Invariant cache hit.
[2024-06-01 20:44:36] [INFO ] Implicit Places using invariants in 1612 ms returned []
[2024-06-01 20:44:36] [INFO ] Invariant cache hit.
[2024-06-01 20:44:39] [INFO ] Implicit Places using invariants and state equation in 2783 ms returned []
Implicit Place search using SMT with State Equation took 4397 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 4415 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 203 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[true, p1, p0, false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0)]
RANDOM walk for 40000 steps (377 resets) in 4409 ms. (9 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 1/1 properties
[2024-06-01 20:46:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1331/1452 variables, 121/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/1452 variables, 1331/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 242/1694 variables, 242/1815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1694 variables, 242/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2690 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1331/1452 variables, 121/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1452 variables, 1331/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1452 variables, 0/1573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 242/1694 variables, 242/1815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1694 variables, 242/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1694 variables, 0/2057 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1331/3025 variables, 1694/3751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/3025 variables, 0/3751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3025/3025 variables, and 3751 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5005 ms.
Refiners :[Domain max(s): 1694/1694 constraints, Positive P Invariants (semi-flows): 363/363 constraints, State Equation: 1694/1694 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 7735ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.3 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 27 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 363/1694 places, 1331/1331 transitions.
RANDOM walk for 40000 steps (376 resets) in 4405 ms. (9 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 376 ms. (106 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 260403 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 1
Probabilistic random walk after 260403 steps, saw 129489 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
// Phase 1: matrix 1331 rows 363 cols
[2024-06-01 20:46:37] [INFO ] Computed 32 invariants in 32 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 232/353 variables, 22/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 232/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/363 variables, 10/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 10/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1331/1694 variables, 363/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1694/1694 variables, and 758 constraints, problems are : Problem set: 0 solved, 1 unsolved in 442 ms.
Refiners :[Domain max(s): 363/363 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 232/353 variables, 22/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/353 variables, 232/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/363 variables, 10/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 10/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/363 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1331/1694 variables, 363/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1694 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 758 constraints, problems are : Problem set: 0 solved, 1 unsolved in 718 ms.
Refiners :[Domain max(s): 363/363 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 363/363 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1238ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 9 factoid took 290 ms. Reduced automaton from 8 states, 16 edges and 2 AP (stutter sensitive) to 8 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[true, p1, p0, false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 266 ms :[true, p1, p0, false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 270 ms :[true, p1, p0, false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0)]
Product exploration timeout after 71130 steps with 673 reset in 10003 ms.
Product exploration timeout after 70540 steps with 667 reset in 10003 ms.
Applying partial POR strategy [true, true, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 283 ms :[true, p1, p0, false, (AND (NOT p1) p0), (AND (NOT p1) p0), false, (AND (NOT p1) p0)]
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 18 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2024-06-01 20:47:00] [INFO ] Redundant transitions in 14 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 10 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2024-06-01 20:47:00] [INFO ] Computed 363 invariants in 6 ms
[2024-06-01 20:47:02] [INFO ] Implicit Places using invariants in 1711 ms returned []
[2024-06-01 20:47:02] [INFO ] Invariant cache hit.
[2024-06-01 20:47:05] [INFO ] Implicit Places using invariants and state equation in 2817 ms returned []
Implicit Place search using SMT with State Equation took 4530 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 4542 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Treatment of property Sudoku-PT-AN11-LTLCardinality-05 finished in 424830 ms.
[2024-06-01 20:47:05] [INFO ] Flatten gal took : 75 ms
[2024-06-01 20:47:05] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 6 ms.
[2024-06-01 20:47:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1694 places, 1331 transitions and 5324 arcs took 10 ms.
Total runtime 2017027 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

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

+ 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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024

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="Sudoku-PT-AN11"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Sudoku-PT-AN11, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-171690532800651"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN11.tgz
mv Sudoku-PT-AN11 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;