fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r536-tall-171690532800635
Last Updated
July 7, 2024

About the Execution of LTSMin+red for Sudoku-PT-AN09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1222.451 3600000.00 14692598.00 1282.90 FTT??TFTTFTTFFTF normal

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-171690532800635.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-AN09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532800635
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 237K Apr 12 10:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Apr 12 10:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 769K Apr 12 10:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.7M Apr 12 10:07 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 205K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 691K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 367K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 549K Apr 12 11:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.6M Apr 12 11:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1M Apr 12 10:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11M Apr 12 10:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 28K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 70K 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 416K 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-AN09-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717271010159

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-AN09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:43:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 19:43:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:43:31] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2024-06-01 19:43:31] [INFO ] Transformed 972 places.
[2024-06-01 19:43:31] [INFO ] Transformed 729 transitions.
[2024-06-01 19:43:31] [INFO ] Found NUPN structural information;
[2024-06-01 19:43:31] [INFO ] Parsed PT model containing 972 places and 729 transitions and 2916 arcs in 247 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 41 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-PT-AN09-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 895 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 27 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 972 cols
[2024-06-01 19:43:31] [INFO ] Computed 243 invariants in 21 ms
[2024-06-01 19:43:32] [INFO ] Implicit Places using invariants in 686 ms returned []
[2024-06-01 19:43:32] [INFO ] Invariant cache hit.
[2024-06-01 19:43:33] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1586 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 1633 ms. Remains : 972/972 places, 729/729 transitions.
Support contains 895 out of 972 places after structural reductions.
[2024-06-01 19:43:33] [INFO ] Flatten gal took : 109 ms
[2024-06-01 19:43:34] [INFO ] Flatten gal took : 72 ms
[2024-06-01 19:43:34] [INFO ] Input system was already deterministic with 729 transitions.
RANDOM walk for 40000 steps (565 resets) in 3565 ms. (11 steps per ms) remains 5/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 348 ms. (114 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 395 ms. (101 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 364 ms. (109 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 375 ms. (106 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 953 ms. (41 steps per ms) remains 5/5 properties
[2024-06-01 19:43:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/891 variables, 891/891 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/891 variables, 162/1053 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/891 variables, 0/1053 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 81/972 variables, 81/1134 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/972 variables, 81/1215 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/972 variables, 0/1215 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 729/1701 variables, 972/2187 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1701 variables, 0/2187 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1701 variables, 0/2187 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1701/1701 variables, and 2187 constraints, problems are : Problem set: 2 solved, 3 unsolved in 1727 ms.
Refiners :[Domain max(s): 972/972 constraints, Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 162/162 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/162 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 729/891 variables, 162/324 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/891 variables, 729/1053 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/891 variables, 0/1053 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 81/972 variables, 81/1134 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/972 variables, 81/1215 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/972 variables, 0/1215 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 729/1701 variables, 972/2187 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1701/1701 variables, and 2190 constraints, problems are : Problem set: 2 solved, 3 unsolved in 4248 ms.
Refiners :[Domain max(s): 972/972 constraints, Positive P Invariants (semi-flows): 243/243 constraints, State Equation: 972/972 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 6467ms problems are : Problem set: 2 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 162 out of 972 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 972/972 places, 729/729 transitions.
Graph (complete) has 2187 edges and 972 vertex of which 243 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.4 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 29 ms. Remains 243 /972 variables (removed 729) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 243/972 places, 729/729 transitions.
RANDOM walk for 40000 steps (566 resets) in 2344 ms. (17 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 315 ms. (126 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 344573 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 3
Probabilistic random walk after 344573 steps, saw 88471 distinct states, run finished after 3005 ms. (steps per millisecond=114 ) properties seen :0
// Phase 1: matrix 729 rows 243 cols
[2024-06-01 19:43:46] [INFO ] Computed 26 invariants in 36 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 162/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 4/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 81/243 variables, 22/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 81/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 729/972 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 972/972 variables, and 512 constraints, problems are : Problem set: 0 solved, 3 unsolved in 403 ms.
Refiners :[Domain max(s): 243/243 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 162/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 4/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 81/243 variables, 22/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 81/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 729/972 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/972 variables, 3/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/972 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/972 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 972/972 variables, and 515 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45008 ms.
Refiners :[Domain max(s): 243/243 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 45539ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 81 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=27 )
Parikh walk visited 3 properties in 11 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 81 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Reduce places removed 729 places and 0 transitions.
Iterating post reduction 0 with 729 rules applied. Total rules applied 729 place count 243 transition count 729
Applied a total of 729 rules in 23 ms. Remains 243 /972 variables (removed 729) and now considering 729/729 (removed 0) transitions.
[2024-06-01 19:44:32] [INFO ] Invariant cache hit.
[2024-06-01 19:44:32] [INFO ] Implicit Places using invariants in 436 ms returned []
[2024-06-01 19:44:32] [INFO ] Invariant cache hit.
[2024-06-01 19:44:33] [INFO ] Implicit Places using invariants and state equation in 1107 ms returned []
Implicit Place search using SMT with State Equation took 1552 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 : 243/972 places, 729/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1577 ms. Remains : 243/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 276 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-00
Product exploration explored 100000 steps with 1417 reset in 4823 ms.
Product exploration explored 100000 steps with 1419 reset in 4781 ms.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
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 : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (566 resets) in 2442 ms. (16 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 324 ms. (123 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 615370 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :0 out of 1
Probabilistic random walk after 615370 steps, saw 128275 distinct states, run finished after 3004 ms. (steps per millisecond=204 ) properties seen :0
[2024-06-01 19:44:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 161/242 variables, 25/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 161/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/243 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/972 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 972/972 variables, and 512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 311 ms.
Refiners :[Domain max(s): 243/243 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 161/242 variables, 25/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 161/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/243 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/972 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 972/972 variables, and 513 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1291 ms.
Refiners :[Domain max(s): 243/243 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1634ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 16 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 243/243 places, 729/729 transitions.
RANDOM walk for 40000 steps (567 resets) in 1952 ms. (20 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 635220 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :0 out of 1
Probabilistic random walk after 635220 steps, saw 131448 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
[2024-06-01 19:44:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 161/242 variables, 25/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 161/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/243 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/972 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 972/972 variables, and 512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 340 ms.
Refiners :[Domain max(s): 243/243 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 161/242 variables, 25/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 161/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/243 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/972 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/972 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/972 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/972 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 972/972 variables, and 513 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5997 ms.
Refiners :[Domain max(s): 243/243 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 6364ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 81 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN09-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN09-LTLCardinality-00 finished in 30300 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&&X(p0))))'
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 31 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 972 cols
[2024-06-01 19:45:02] [INFO ] Computed 243 invariants in 12 ms
[2024-06-01 19:45:03] [INFO ] Implicit Places using invariants in 877 ms returned []
[2024-06-01 19:45:03] [INFO ] Invariant cache hit.
[2024-06-01 19:45:04] [INFO ] Implicit Places using invariants and state equation in 1164 ms returned []
Implicit Place search using SMT with State Equation took 2044 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 2076 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 9256 ms.
Product exploration explored 100000 steps with 50000 reset in 9296 ms.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
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 : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN09-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN09-LTLCardinality-01 finished in 30361 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U X(!p1)))'
Support contains 891 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 10 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 19:45:32] [INFO ] Invariant cache hit.
[2024-06-01 19:45:33] [INFO ] Implicit Places using invariants in 523 ms returned []
[2024-06-01 19:45:33] [INFO ] Invariant cache hit.
[2024-06-01 19:45:34] [INFO ] Implicit Places using invariants and state equation in 805 ms returned []
Implicit Place search using SMT with State Equation took 1332 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 1342 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 136 ms :[p1, (OR (NOT p0) p1), true, p1]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 8059 ms.
Product exploration explored 100000 steps with 50000 reset in 8110 ms.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
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 p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 19 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-AN09-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN09-LTLCardinality-02 finished in 43552 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&&F(p1))))'
Support contains 891 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 21 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 19:46:16] [INFO ] Invariant cache hit.
[2024-06-01 19:46:17] [INFO ] Implicit Places using invariants in 534 ms returned []
[2024-06-01 19:46:17] [INFO ] Invariant cache hit.
[2024-06-01 19:46:17] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 1349 ms to find 0 implicit places.
[2024-06-01 19:46:17] [INFO ] Redundant transitions in 37 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 1420 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-03
Product exploration explored 100000 steps with 2380 reset in 8743 ms.
Product exploration explored 100000 steps with 2380 reset in 8846 ms.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
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) p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X 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 185 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 164 steps (0 resets) in 28 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 9 factoid took 202 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
[2024-06-01 19:46:54] [INFO ] Invariant cache hit.
[2024-06-01 19:46:57] [INFO ] [Real]Absence check using 243 positive place invariants in 473 ms returned sat
[2024-06-01 19:47:01] [INFO ] [Real]Absence check using state equation in 3862 ms returned sat
[2024-06-01 19:47:01] [INFO ] Solution in real domain found non-integer solution.
Could not prove EG (NOT p1)
Support contains 810 out of 972 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 22 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 19:47:04] [INFO ] Invariant cache hit.
[2024-06-01 19:47:05] [INFO ] Implicit Places using invariants in 515 ms returned []
[2024-06-01 19:47:05] [INFO ] Invariant cache hit.
[2024-06-01 19:47:06] [INFO ] Implicit Places using invariants and state equation in 783 ms returned []
Implicit Place search using SMT with State Equation took 1317 ms to find 0 implicit places.
[2024-06-01 19:47:06] [INFO ] Redundant transitions in 7 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 1350 ms. Remains : 972/972 places, 729/729 transitions.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
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 p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 164 steps (0 resets) in 26 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
[2024-06-01 19:47:16] [INFO ] Invariant cache hit.
[2024-06-01 19:47:19] [INFO ] [Real]Absence check using 243 positive place invariants in 467 ms returned sat
[2024-06-01 19:47:23] [INFO ] [Real]Absence check using state equation in 3870 ms returned sat
[2024-06-01 19:47:23] [INFO ] Solution in real domain found non-integer solution.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2380 reset in 8826 ms.
Product exploration explored 100000 steps with 2380 reset in 8983 ms.
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 16 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 19:47:44] [INFO ] Invariant cache hit.
[2024-06-01 19:47:45] [INFO ] Implicit Places using invariants in 1128 ms returned []
[2024-06-01 19:47:45] [INFO ] Invariant cache hit.
[2024-06-01 19:47:46] [INFO ] Implicit Places using invariants and state equation in 1188 ms returned []
Implicit Place search using SMT with State Equation took 2318 ms to find 0 implicit places.
[2024-06-01 19:47:46] [INFO ] Redundant transitions in 25 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 2366 ms. Remains : 972/972 places, 729/729 transitions.
Treatment of property Sudoku-PT-AN09-LTLCardinality-03 finished in 90278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 81 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Graph (complete) has 2187 edges and 972 vertex of which 243 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.4 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 243 /972 variables (removed 729) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 243 cols
[2024-06-01 19:47:46] [INFO ] Computed 26 invariants in 12 ms
[2024-06-01 19:47:47] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-06-01 19:47:47] [INFO ] Invariant cache hit.
[2024-06-01 19:47:48] [INFO ] Implicit Places using invariants and state equation in 1001 ms returned []
Implicit Place search using SMT with State Equation took 1458 ms to find 0 implicit places.
[2024-06-01 19:47:48] [INFO ] Redundant transitions in 12 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 : 243/972 places, 729/729 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1494 ms. Remains : 243/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-04
Product exploration explored 100000 steps with 1418 reset in 4662 ms.
Product exploration explored 100000 steps with 1420 reset in 4722 ms.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
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 : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (566 resets) in 2908 ms. (13 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 522255 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :0 out of 1
Probabilistic random walk after 522255 steps, saw 112987 distinct states, run finished after 3001 ms. (steps per millisecond=174 ) properties seen :0
[2024-06-01 19:48:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 153/234 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 153/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/243 variables, 9/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 9/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/972 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 972/972 variables, and 512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 338 ms.
Refiners :[Domain max(s): 243/243 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 153/234 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 153/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/243 variables, 9/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 9/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/972 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 972/972 variables, and 513 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1275 ms.
Refiners :[Domain max(s): 243/243 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1641ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 13 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 243/243 places, 729/729 transitions.
RANDOM walk for 40000 steps (566 resets) in 2967 ms. (13 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 353 ms. (113 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 523929 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :0 out of 1
Probabilistic random walk after 523929 steps, saw 113369 distinct states, run finished after 3001 ms. (steps per millisecond=174 ) properties seen :0
[2024-06-01 19:48:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 153/234 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 153/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/243 variables, 9/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 9/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/972 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 972/972 variables, and 512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 322 ms.
Refiners :[Domain max(s): 243/243 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 153/234 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 153/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/243 variables, 9/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 9/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/972 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/972 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/972 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 972/972 variables, and 513 constraints, problems are : Problem set: 0 solved, 1 unsolved in 13866 ms.
Refiners :[Domain max(s): 243/243 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 14239ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 9 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 243/243 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 8 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 19:48:24] [INFO ] Invariant cache hit.
[2024-06-01 19:48:25] [INFO ] Implicit Places using invariants in 463 ms returned []
[2024-06-01 19:48:25] [INFO ] Invariant cache hit.
[2024-06-01 19:48:26] [INFO ] Implicit Places using invariants and state equation in 999 ms returned []
Implicit Place search using SMT with State Equation took 1480 ms to find 0 implicit places.
[2024-06-01 19:48:26] [INFO ] Redundant transitions in 5 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1498 ms. Remains : 243/243 places, 729/729 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 10 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 19:48:26] [INFO ] Invariant cache hit.
[2024-06-01 19:48:26] [INFO ] Implicit Places using invariants in 519 ms returned []
[2024-06-01 19:48:26] [INFO ] Invariant cache hit.
[2024-06-01 19:48:27] [INFO ] Implicit Places using invariants and state equation in 998 ms returned []
Implicit Place search using SMT with State Equation took 1552 ms to find 0 implicit places.
[2024-06-01 19:48:28] [INFO ] Redundant transitions in 5 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 1575 ms. Remains : 243/243 places, 729/729 transitions.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
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 : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (565 resets) in 2622 ms. (15 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 533082 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :0 out of 1
Probabilistic random walk after 533082 steps, saw 114973 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
[2024-06-01 19:48:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 153/234 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 153/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/243 variables, 9/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 9/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/972 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 972/972 variables, and 512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 327 ms.
Refiners :[Domain max(s): 243/243 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 153/234 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 153/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/243 variables, 9/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 9/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/972 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 972/972 variables, and 513 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1285 ms.
Refiners :[Domain max(s): 243/243 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1662ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 11 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 243/243 places, 729/729 transitions.
RANDOM walk for 40000 steps (566 resets) in 3078 ms. (12 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 496 ms. (80 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 528170 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 1
Probabilistic random walk after 528170 steps, saw 114085 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
[2024-06-01 19:48:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 153/234 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 153/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/243 variables, 9/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 9/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/972 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/972 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 972/972 variables, and 512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 275 ms.
Refiners :[Domain max(s): 243/243 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 153/234 variables, 17/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 153/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/243 variables, 9/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 9/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 729/972 variables, 243/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/972 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/972 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 972/972 variables, and 513 constraints, problems are : Problem set: 0 solved, 1 unsolved in 13807 ms.
Refiners :[Domain max(s): 243/243 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 14130ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 9 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 243/243 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 5 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 19:48:54] [INFO ] Invariant cache hit.
[2024-06-01 19:48:55] [INFO ] Implicit Places using invariants in 495 ms returned []
[2024-06-01 19:48:55] [INFO ] Invariant cache hit.
[2024-06-01 19:48:56] [INFO ] Implicit Places using invariants and state equation in 1028 ms returned []
Implicit Place search using SMT with State Equation took 1548 ms to find 0 implicit places.
[2024-06-01 19:48:56] [INFO ] Redundant transitions in 5 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1563 ms. Remains : 243/243 places, 729/729 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1419 reset in 4530 ms.
Product exploration explored 100000 steps with 1420 reset in 4582 ms.
Support contains 81 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 6 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 19:49:05] [INFO ] Invariant cache hit.
[2024-06-01 19:49:06] [INFO ] Implicit Places using invariants in 541 ms returned []
[2024-06-01 19:49:06] [INFO ] Invariant cache hit.
[2024-06-01 19:49:07] [INFO ] Implicit Places using invariants and state equation in 1070 ms returned []
Implicit Place search using SMT with State Equation took 1631 ms to find 0 implicit places.
[2024-06-01 19:49:07] [INFO ] Redundant transitions in 5 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 1648 ms. Remains : 243/243 places, 729/729 transitions.
Treatment of property Sudoku-PT-AN09-LTLCardinality-04 finished in 80786 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 729 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 19 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 972 cols
[2024-06-01 19:49:07] [INFO ] Computed 243 invariants in 4 ms
[2024-06-01 19:49:09] [INFO ] Implicit Places using invariants in 1424 ms returned []
[2024-06-01 19:49:09] [INFO ] Invariant cache hit.
[2024-06-01 19:49:10] [INFO ] Implicit Places using invariants and state equation in 1477 ms returned []
Implicit Place search using SMT with State Equation took 2917 ms to find 0 implicit places.
[2024-06-01 19:49:10] [INFO ] Redundant transitions in 5 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 2951 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 8348 ms.
Product exploration explored 100000 steps with 50000 reset in 8566 ms.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
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 p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 13 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN09-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN09-LTLCardinality-05 finished in 29025 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U p1)))'
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 8 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-06-01 19:49:36] [INFO ] Invariant cache hit.
[2024-06-01 19:49:37] [INFO ] Implicit Places using invariants in 808 ms returned []
[2024-06-01 19:49:37] [INFO ] Invariant cache hit.
[2024-06-01 19:49:38] [INFO ] Implicit Places using invariants and state equation in 1095 ms returned []
Implicit Place search using SMT with State Equation took 1945 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 1954 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN09-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN09-LTLCardinality-06 finished in 2108 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 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Graph (complete) has 2187 edges and 972 vertex of which 243 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.2 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 20 ms. Remains 243 /972 variables (removed 729) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 243 cols
[2024-06-01 19:49:38] [INFO ] Computed 26 invariants in 9 ms
[2024-06-01 19:49:39] [INFO ] Implicit Places using invariants in 660 ms returned []
[2024-06-01 19:49:39] [INFO ] Invariant cache hit.
[2024-06-01 19:49:40] [INFO ] Implicit Places using invariants and state equation in 1336 ms returned []
Implicit Place search using SMT with State Equation took 2021 ms to find 0 implicit places.
[2024-06-01 19:49:40] [INFO ] Redundant transitions in 5 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 : 243/972 places, 729/729 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2050 ms. Remains : 243/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-09
Stuttering criterion allowed to conclude after 70 steps with 0 reset in 6 ms.
FORMULA Sudoku-PT-AN09-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN09-LTLCardinality-09 finished in 2102 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Reduce places removed 728 places and 0 transitions.
Iterating post reduction 0 with 728 rules applied. Total rules applied 728 place count 244 transition count 729
Applied a total of 728 rules in 16 ms. Remains 244 /972 variables (removed 728) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 244 cols
[2024-06-01 19:49:40] [INFO ] Computed 26 invariants in 23 ms
[2024-06-01 19:49:41] [INFO ] Implicit Places using invariants in 767 ms returned []
[2024-06-01 19:49:41] [INFO ] Invariant cache hit.
[2024-06-01 19:49:42] [INFO ] Implicit Places using invariants and state equation in 1254 ms returned []
Implicit Place search using SMT with State Equation took 2026 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 : 244/972 places, 729/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2044 ms. Remains : 244/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN09-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN09-LTLCardinality-12 finished in 2154 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!X(X((F(p1)&&p0)))) U X(p2)))'
Support contains 6 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Reduce places removed 727 places and 0 transitions.
Iterating post reduction 0 with 727 rules applied. Total rules applied 727 place count 245 transition count 729
Applied a total of 727 rules in 9 ms. Remains 245 /972 variables (removed 727) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 245 cols
[2024-06-01 19:49:42] [INFO ] Computed 26 invariants in 17 ms
[2024-06-01 19:49:43] [INFO ] Implicit Places using invariants in 633 ms returned []
[2024-06-01 19:49:43] [INFO ] Invariant cache hit.
[2024-06-01 19:49:44] [INFO ] Implicit Places using invariants and state equation in 1198 ms returned []
Implicit Place search using SMT with State Equation took 1845 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 : 245/972 places, 729/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1854 ms. Remains : 245/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p2), (NOT p2), (OR (NOT p2) (AND p0 p1)), (AND p1 p0), true, p1]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 4534 steps with 2198 reset in 335 ms.
FORMULA Sudoku-PT-AN09-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN09-LTLCardinality-13 finished in 2403 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(!(!G(X(p0)) U (!p0 U !p1)))))'
Support contains 4 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Reduce places removed 727 places and 0 transitions.
Iterating post reduction 0 with 727 rules applied. Total rules applied 727 place count 245 transition count 729
Applied a total of 727 rules in 15 ms. Remains 245 /972 variables (removed 727) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 245 cols
[2024-06-01 19:49:45] [INFO ] Computed 26 invariants in 12 ms
[2024-06-01 19:49:46] [INFO ] Implicit Places using invariants in 656 ms returned []
[2024-06-01 19:49:46] [INFO ] Invariant cache hit.
[2024-06-01 19:49:47] [INFO ] Implicit Places using invariants and state equation in 1272 ms returned []
Implicit Place search using SMT with State Equation took 1943 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 9ms
Starting structural reductions in LTL mode, iteration 1 : 245/972 places, 729/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1968 ms. Remains : 245/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN09-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 119 steps with 1 reset in 7 ms.
FORMULA Sudoku-PT-AN09-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN09-LTLCardinality-15 finished in 2177 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&&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(F(p0)))'
[2024-06-01 19:49:47] [INFO ] Flatten gal took : 95 ms
[2024-06-01 19:49:47] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 19:49:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 972 places, 729 transitions and 2916 arcs took 7 ms.
Total runtime 376654 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-AN09"
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-AN09, 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-171690532800635"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN09.tgz
mv Sudoku-PT-AN09 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 ;