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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.3K Apr 12 12:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 12 12:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 10:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 10:16 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 3.6K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 13:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 13:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 12:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 12 12:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K 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-COL-AN14-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN14-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN14-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN14-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN14-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN14-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN14-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN14-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN14-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN14-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN14-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN14-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN14-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN14-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN14-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN14-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717263703029

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:41:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 17:41:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:41:44] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 17:41:44] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 17:41:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 545 ms
[2024-06-01 17:41:44] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 3332 PT places and 2744.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 17:41:45] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2024-06-01 17:41:45] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 7 formulas.
FORMULA Sudoku-COL-AN14-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN14-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN14-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN14-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN14-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN14-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN14-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 9 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40388 steps (200 resets) in 199 ms. (201 steps per ms) remains 4/17 properties
BEST_FIRST walk for 40388 steps (200 resets) in 23 ms. (1682 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40388 steps (200 resets) in 38 ms. (1035 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40388 steps (200 resets) in 84 ms. (475 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40388 steps (200 resets) in 38 ms. (1035 steps per ms) remains 4/4 properties
// Phase 1: matrix 1 rows 4 cols
[2024-06-01 17:41:45] [INFO ] Computed 3 invariants in 3 ms
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp16 is UNSAT
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 4 solved, 0 unsolved in 90 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 130ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 9 simplifications.
[2024-06-01 17:41:45] [INFO ] Flatten gal took : 17 ms
[2024-06-01 17:41:45] [INFO ] Flatten gal took : 1 ms
Domain [N(14), N(14)] of place Rows breaks symmetries in sort N
[2024-06-01 17:41:45] [INFO ] Unfolded HLPN to a Petri net with 3332 places and 2744 transitions 10976 arcs in 50 ms.
[2024-06-01 17:41:45] [INFO ] Unfolded 9 HLPN properties in 5 ms.
Support contains 3332 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 35 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 3332 cols
[2024-06-01 17:41:45] [INFO ] Computed 588 invariants in 43 ms
[2024-06-01 17:41:46] [INFO ] Implicit Places using invariants in 828 ms returned []
[2024-06-01 17:41:46] [INFO ] Invariant cache hit.
[2024-06-01 17:41:50] [INFO ] Implicit Places using invariants and state equation in 3342 ms returned []
Implicit Place search using SMT with State Equation took 4180 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 4241 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Support contains 3332 out of 3332 places after structural reductions.
[2024-06-01 17:41:50] [INFO ] Flatten gal took : 294 ms
[2024-06-01 17:41:50] [INFO ] Flatten gal took : 185 ms
[2024-06-01 17:41:51] [INFO ] Input system was already deterministic with 2744 transitions.
RANDOM walk for 40000 steps (229 resets) in 21881 ms. (1 steps per ms) remains 11/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1209 ms. (33 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 772 ms. (51 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5666 ms. (7 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 658 ms. (60 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1043 ms. (38 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 617 ms. (64 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 615 ms. (64 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 614 ms. (65 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 614 ms. (65 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 625 ms. (63 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2772 ms. (14 steps per ms) remains 11/11 properties
[2024-06-01 17:42:01] [INFO ] Invariant cache hit.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3332 variables, 588/588 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3332/6076 variables, and 588 constraints, problems are : Problem set: 2 solved, 9 unsolved in 5036 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 constraints, PredecessorRefiner: 9/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3332/6076 variables, and 588 constraints, problems are : Problem set: 2 solved, 9 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 11708ms problems are : Problem set: 2 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3332 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 53 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 3332/3332 places, 2744/2744 transitions.
RANDOM walk for 40000 steps (230 resets) in 19313 ms. (2 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 806 ms. (49 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5204 ms. (7 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 597 ms. (66 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 591 ms. (67 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 602 ms. (66 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 618 ms. (64 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 628 ms. (63 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 643 ms. (62 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2723 ms. (14 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 88481 steps, run timeout after 24029 ms. (steps per millisecond=3 ) properties seen :0 out of 9
Probabilistic random walk after 88481 steps, saw 88442 distinct states, run finished after 24036 ms. (steps per millisecond=3 ) properties seen :0
[2024-06-01 17:42:44] [INFO ] Invariant cache hit.
Problem AtomicPropp6 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3332/6076 variables, and 588 constraints, problems are : Problem set: 1 solved, 8 unsolved in 45017 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3332 variables, 588/588 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3332 variables, 0/588 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2744/6076 variables, 3332/3920 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6076/6076 variables, and 3920 constraints, problems are : Problem set: 1 solved, 8 unsolved in 45035 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 3332/3332 constraints, PredecessorRefiner: 8/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 91383ms problems are : Problem set: 1 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3332 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 49 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Successfully simplified 3 atomic propositions for a total of 9 simplifications.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
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' '!(G(F(p0)))'
Support contains 196 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Graph (complete) has 8232 edges and 3332 vertex of which 588 are kept as prefixes of interest. Removing 2744 places using SCC suffix rule.11 ms
Discarding 2744 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 231 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2024-06-01 17:44:17] [INFO ] Computed 41 invariants in 313 ms
[2024-06-01 17:44:17] [INFO ] Implicit Places using invariants in 1135 ms returned []
[2024-06-01 17:44:17] [INFO ] Invariant cache hit.
[2024-06-01 17:44:30] [INFO ] Implicit Places using invariants and state equation in 12367 ms returned []
Implicit Place search using SMT with State Equation took 13517 ms to find 0 implicit places.
[2024-06-01 17:44:30] [INFO ] Redundant transitions in 153 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 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13910 ms. Remains : 588/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN14-LTLCardinality-01
Stuttering criterion allowed to conclude after 172 steps with 0 reset in 51 ms.
FORMULA Sudoku-COL-AN14-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN14-LTLCardinality-01 finished in 14201 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((G(F(p0))&&F(p1))))))'
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 39 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 3332 cols
[2024-06-01 17:44:30] [INFO ] Computed 588 invariants in 26 ms
[2024-06-01 17:44:31] [INFO ] Implicit Places using invariants in 1121 ms returned []
[2024-06-01 17:44:31] [INFO ] Invariant cache hit.
[2024-06-01 17:44:36] [INFO ] Implicit Places using invariants and state equation in 4489 ms returned []
Implicit Place search using SMT with State Equation took 5621 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 5662 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 416 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN14-LTLCardinality-07
Product exploration timeout after 28100 steps with 282 reset in 10002 ms.
Product exploration timeout after 27930 steps with 281 reset in 10004 ms.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
RANDOM walk for 396 steps (0 resets) in 290 ms. (1 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
[2024-06-01 17:45:00] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2024-06-01 17:45:16] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 18 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:45:31] [INFO ] Invariant cache hit.
[2024-06-01 17:45:32] [INFO ] Implicit Places using invariants in 1035 ms returned []
[2024-06-01 17:45:32] [INFO ] Invariant cache hit.
[2024-06-01 17:45:37] [INFO ] Implicit Places using invariants and state equation in 4466 ms returned []
Implicit Place search using SMT with State Equation took 5505 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 5525 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
RANDOM walk for 396 steps (0 resets) in 254 ms. (1 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
[2024-06-01 17:45:40] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2024-06-01 17:45:56] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Product exploration timeout after 29400 steps with 296 reset in 10005 ms.
Product exploration timeout after 29420 steps with 296 reset in 10004 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 44 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:46:32] [INFO ] Redundant transitions in 187 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 241 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 21 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:46:32] [INFO ] Invariant cache hit.
[2024-06-01 17:46:33] [INFO ] Implicit Places using invariants in 1056 ms returned []
[2024-06-01 17:46:33] [INFO ] Invariant cache hit.
[2024-06-01 17:46:37] [INFO ] Implicit Places using invariants and state equation in 4405 ms returned []
Implicit Place search using SMT with State Equation took 5463 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 5485 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Treatment of property Sudoku-COL-AN14-LTLCardinality-07 finished in 127673 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 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 40 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:46:38] [INFO ] Invariant cache hit.
[2024-06-01 17:46:39] [INFO ] Implicit Places using invariants in 1044 ms returned []
[2024-06-01 17:46:39] [INFO ] Invariant cache hit.
[2024-06-01 17:46:43] [INFO ] Implicit Places using invariants and state equation in 4332 ms returned []
Implicit Place search using SMT with State Equation took 5379 ms to find 0 implicit places.
[2024-06-01 17:46:43] [INFO ] Redundant transitions in 57 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 5482 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN14-LTLCardinality-08
Stuttering criterion allowed to conclude after 174 steps with 0 reset in 76 ms.
FORMULA Sudoku-COL-AN14-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN14-LTLCardinality-08 finished in 5634 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||X(G(!p0))))))'
Support contains 196 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Reduce places removed 2744 places and 0 transitions.
Iterating post reduction 0 with 2744 rules applied. Total rules applied 2744 place count 588 transition count 2744
Applied a total of 2744 rules in 40 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2024-06-01 17:46:44] [INFO ] Computed 41 invariants in 121 ms
[2024-06-01 17:46:44] [INFO ] Implicit Places using invariants in 593 ms returned []
[2024-06-01 17:46:44] [INFO ] Invariant cache hit.
[2024-06-01 17:46:57] [INFO ] Implicit Places using invariants and state equation in 12503 ms returned []
Implicit Place search using SMT with State Equation took 13103 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 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13147 ms. Remains : 588/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, p0, false, false]
Running random walk in product with property : Sudoku-COL-AN14-LTLCardinality-09
Product exploration timeout after 56890 steps with 330 reset in 10001 ms.
Product exploration timeout after 55920 steps with 324 reset in 10001 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[true, false, p0]
RANDOM walk for 40000 steps (230 resets) in 7518 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 711 ms. (56 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 337484 steps, run timeout after 6001 ms. (steps per millisecond=56 ) properties seen :0 out of 1
Probabilistic random walk after 337484 steps, saw 281565 distinct states, run finished after 6001 ms. (steps per millisecond=56 ) properties seen :0
[2024-06-01 17:47:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 382/578 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/578 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/588 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1380 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 382/578 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/578 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/588 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1192 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2694ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 194 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=17 )
Parikh walk visited 1 properties in 17 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[true, false, p0]
Stuttering acceptance computed with spot in 69 ms :[true, false, p0]
Support contains 196 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 51 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:47:29] [INFO ] Invariant cache hit.
[2024-06-01 17:47:29] [INFO ] Implicit Places using invariants in 492 ms returned []
[2024-06-01 17:47:29] [INFO ] Invariant cache hit.
[2024-06-01 17:47:42] [INFO ] Implicit Places using invariants and state equation in 12373 ms returned []
Implicit Place search using SMT with State Equation took 12884 ms to find 0 implicit places.
[2024-06-01 17:47:42] [INFO ] Redundant transitions in 55 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 13016 ms. Remains : 588/588 places, 2744/2744 transitions.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[true, false, p0]
RANDOM walk for 40000 steps (230 resets) in 7936 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 645 ms. (61 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 324197 steps, run timeout after 6001 ms. (steps per millisecond=54 ) properties seen :0 out of 1
Probabilistic random walk after 324197 steps, saw 279423 distinct states, run finished after 6001 ms. (steps per millisecond=54 ) properties seen :0
[2024-06-01 17:47:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 382/578 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/578 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/588 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1277 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 382/578 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/578 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/588 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1224 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2554ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 194 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=17 )
Parikh walk visited 1 properties in 11 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[true, false, p0]
Stuttering acceptance computed with spot in 81 ms :[true, false, p0]
Stuttering acceptance computed with spot in 90 ms :[true, false, p0]
Product exploration timeout after 55920 steps with 324 reset in 10001 ms.
Product exploration timeout after 55870 steps with 324 reset in 10001 ms.
Support contains 196 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 33 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:48:14] [INFO ] Invariant cache hit.
[2024-06-01 17:48:14] [INFO ] Implicit Places using invariants in 459 ms returned []
[2024-06-01 17:48:14] [INFO ] Invariant cache hit.
[2024-06-01 17:48:27] [INFO ] Implicit Places using invariants and state equation in 12848 ms returned []
Implicit Place search using SMT with State Equation took 13324 ms to find 0 implicit places.
[2024-06-01 17:48:27] [INFO ] Redundant transitions in 53 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 13421 ms. Remains : 588/588 places, 2744/2744 transitions.
Treatment of property Sudoku-COL-AN14-LTLCardinality-09 finished in 103631 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2744 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 49 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 3332 cols
[2024-06-01 17:48:27] [INFO ] Computed 588 invariants in 18 ms
[2024-06-01 17:48:29] [INFO ] Implicit Places using invariants in 1931 ms returned []
[2024-06-01 17:48:29] [INFO ] Invariant cache hit.
[2024-06-01 17:48:35] [INFO ] Implicit Places using invariants and state equation in 5543 ms returned []
Implicit Place search using SMT with State Equation took 7487 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 7539 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN14-LTLCardinality-10
Stuttering criterion allowed to conclude after 174 steps with 0 reset in 44 ms.
FORMULA Sudoku-COL-AN14-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN14-LTLCardinality-10 finished in 7693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p1)||G(p2))))))'
Support contains 196 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Graph (complete) has 8232 edges and 3332 vertex of which 588 are kept as prefixes of interest. Removing 2744 places using SCC suffix rule.7 ms
Discarding 2744 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 63 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2024-06-01 17:48:35] [INFO ] Computed 41 invariants in 121 ms
[2024-06-01 17:48:36] [INFO ] Implicit Places using invariants in 580 ms returned []
[2024-06-01 17:48:36] [INFO ] Invariant cache hit.
[2024-06-01 17:48:47] [INFO ] Implicit Places using invariants and state equation in 11086 ms returned []
Implicit Place search using SMT with State Equation took 11680 ms to find 0 implicit places.
[2024-06-01 17:48:47] [INFO ] Redundant transitions in 57 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 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11806 ms. Remains : 588/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-COL-AN14-LTLCardinality-11
Product exploration timeout after 53670 steps with 311 reset in 10002 ms.
Product exploration timeout after 53460 steps with 310 reset in 10002 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X p0), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 430 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (230 resets) in 18816 ms. (2 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 985 ms. (40 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1883 ms. (21 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1541 ms. (25 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1282 ms. (31 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1208 ms. (33 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1063 ms. (37 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 719 ms. (55 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 262683 steps, run timeout after 21015 ms. (steps per millisecond=12 ) properties seen :0 out of 7
Probabilistic random walk after 262683 steps, saw 262506 distinct states, run finished after 21016 ms. (steps per millisecond=12 ) properties seen :0
[2024-06-01 17:49:36] [INFO ] Invariant cache hit.
Problem apf6 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 382/578 variables, 31/31 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/578 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/588 variables, 10/41 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2744/3332 variables, 588/629 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 1 solved, 6 unsolved in 3198 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 382/578 variables, 31/31 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/578 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/588 variables, 10/41 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 1 solved, 6 unsolved in 5015 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 6/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 8556ms problems are : Problem set: 1 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Finished Parikh walk after 196 steps, including 0 resets, run visited all 6 properties in 24 ms. (steps per millisecond=8 )
Parikh walk visited 6 properties in 25 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 p2)), (X p0), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p1) p2))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p2))), (F (NOT (OR p1 (NOT p2)))), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT (AND p1 p2))), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 1778 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Support contains 196 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 38 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:49:47] [INFO ] Invariant cache hit.
[2024-06-01 17:49:48] [INFO ] Implicit Places using invariants in 541 ms returned []
[2024-06-01 17:49:48] [INFO ] Invariant cache hit.
[2024-06-01 17:49:59] [INFO ] Implicit Places using invariants and state equation in 11398 ms returned []
Implicit Place search using SMT with State Equation took 11943 ms to find 0 implicit places.
[2024-06-01 17:49:59] [INFO ] Redundant transitions in 54 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 12044 ms. Remains : 588/588 places, 2744/2744 transitions.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X p0), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 222 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
RANDOM walk for 40000 steps (230 resets) in 9526 ms. (4 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 736 ms. (54 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 645 ms. (61 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 641 ms. (62 steps per ms) remains 3/3 properties
Probabilistic random walk after 202476 steps, saw 202374 distinct states, run finished after 9016 ms. (steps per millisecond=22 ) properties seen :0
[2024-06-01 17:50:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 382/578 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/578 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 10/588 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4415 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 382/578 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/578 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 10/588 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2897 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 7410ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 2 properties in 783 ms.
Support contains 196 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 38 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 588/588 places, 2744/2744 transitions.
RANDOM walk for 40000 steps (229 resets) in 7278 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 659 ms. (60 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 336046 steps, run timeout after 6001 ms. (steps per millisecond=55 ) properties seen :0 out of 1
Probabilistic random walk after 336046 steps, saw 281406 distinct states, run finished after 6002 ms. (steps per millisecond=55 ) properties seen :0
[2024-06-01 17:50:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 382/578 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/578 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/588 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2744/3332 variables, 588/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 0 solved, 1 unsolved in 863 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 382/578 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/578 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/588 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2744/3332 variables, 588/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2272 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3177ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 196 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X p0), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 426 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Product exploration timeout after 56420 steps with 327 reset in 10001 ms.
Product exploration timeout after 54630 steps with 317 reset in 10001 ms.
Support contains 196 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 33 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:50:53] [INFO ] Invariant cache hit.
[2024-06-01 17:50:53] [INFO ] Implicit Places using invariants in 504 ms returned []
[2024-06-01 17:50:53] [INFO ] Invariant cache hit.
[2024-06-01 17:51:04] [INFO ] Implicit Places using invariants and state equation in 10908 ms returned []
Implicit Place search using SMT with State Equation took 11422 ms to find 0 implicit places.
[2024-06-01 17:51:04] [INFO ] Redundant transitions in 51 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 11518 ms. Remains : 588/588 places, 2744/2744 transitions.
Treatment of property Sudoku-COL-AN14-LTLCardinality-11 finished in 149350 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) U X(G(p1))))'
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 36 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 3332 cols
[2024-06-01 17:51:04] [INFO ] Computed 588 invariants in 42 ms
[2024-06-01 17:51:06] [INFO ] Implicit Places using invariants in 1414 ms returned []
[2024-06-01 17:51:06] [INFO ] Invariant cache hit.
[2024-06-01 17:51:11] [INFO ] Implicit Places using invariants and state equation in 4997 ms returned []
Implicit Place search using SMT with State Equation took 6439 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 6478 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN14-LTLCardinality-12
Product exploration timeout after 24770 steps with 8337 reset in 10003 ms.
Product exploration timeout after 24810 steps with 8315 reset in 10002 ms.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 137 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (231 resets) in 14256 ms. (2 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3371 ms. (11 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 746 ms. (53 steps per ms) remains 2/2 properties
[2024-06-01 17:51:37] [INFO ] Invariant cache hit.
Problem apf0 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2940 variables, 196/196 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2940 variables, 0/196 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3332/6076 variables, and 588 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1565 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2744/2940 variables, 196/196 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2940 variables, 0/196 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3332/6076 variables, and 588 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1500 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3529ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 196 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Graph (complete) has 8232 edges and 3332 vertex of which 588 are kept as prefixes of interest. Removing 2744 places using SCC suffix rule.3 ms
Discarding 2744 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 51 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 588/3332 places, 2744/2744 transitions.
RANDOM walk for 40000 steps (232 resets) in 7108 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 728 ms. (54 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 331243 steps, run timeout after 6001 ms. (steps per millisecond=55 ) properties seen :0 out of 1
Probabilistic random walk after 331243 steps, saw 280581 distinct states, run finished after 6001 ms. (steps per millisecond=55 ) properties seen :0
// Phase 1: matrix 2744 rows 588 cols
[2024-06-01 17:51:49] [INFO ] Computed 41 invariants in 100 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 388/584 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/588 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2744/3332 variables, 588/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2024 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 388/584 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/588 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2744/3332 variables, 588/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3457 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 5635ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 194 steps, including 0 resets, run visited all 1 properties in 17 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 18 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 252 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Support contains 196 out of 3332 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 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 46 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 3332 cols
[2024-06-01 17:51:55] [INFO ] Computed 588 invariants in 9 ms
[2024-06-01 17:51:56] [INFO ] Implicit Places using invariants in 1392 ms returned []
[2024-06-01 17:51:56] [INFO ] Invariant cache hit.
[2024-06-01 17:52:01] [INFO ] Implicit Places using invariants and state equation in 4935 ms returned []
Implicit Place search using SMT with State Equation took 6334 ms to find 0 implicit places.
[2024-06-01 17:52:01] [INFO ] Redundant transitions in 57 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 6443 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
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 : [p1, (X p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
RANDOM walk for 40000 steps (231 resets) in 7442 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 700 ms. (57 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 305851 steps, run timeout after 6001 ms. (steps per millisecond=50 ) properties seen :0 out of 1
Probabilistic random walk after 305851 steps, saw 275743 distinct states, run finished after 6001 ms. (steps per millisecond=50 ) properties seen :0
[2024-06-01 17:52:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2744/2940 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2940 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3332/6076 variables, and 588 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1472 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2744/2940 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2940 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3332/6076 variables, and 588 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1491 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3011ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 196 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Graph (complete) has 8232 edges and 3332 vertex of which 588 are kept as prefixes of interest. Removing 2744 places using SCC suffix rule.3 ms
Discarding 2744 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 51 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 588/3332 places, 2744/2744 transitions.
RANDOM walk for 40000 steps (229 resets) in 7088 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 641 ms. (62 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 326765 steps, run timeout after 6001 ms. (steps per millisecond=54 ) properties seen :0 out of 1
Probabilistic random walk after 326765 steps, saw 279841 distinct states, run finished after 6003 ms. (steps per millisecond=54 ) properties seen :0
// Phase 1: matrix 2744 rows 588 cols
[2024-06-01 17:52:22] [INFO ] Computed 41 invariants in 111 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 388/584 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/588 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2744/3332 variables, 588/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2074 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 388/584 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/588 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2744/3332 variables, 588/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3526 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 5797ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 194 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=17 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [p1, (X p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Product exploration timeout after 53730 steps with 311 reset in 10001 ms.
Product exploration timeout after 54450 steps with 316 reset in 10002 ms.
Support contains 196 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Graph (complete) has 8232 edges and 3332 vertex of which 588 are kept as prefixes of interest. Removing 2744 places using SCC suffix rule.5 ms
Discarding 2744 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 49 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:52:48] [INFO ] Invariant cache hit.
[2024-06-01 17:52:48] [INFO ] Implicit Places using invariants in 485 ms returned []
[2024-06-01 17:52:48] [INFO ] Invariant cache hit.
[2024-06-01 17:52:59] [INFO ] Implicit Places using invariants and state equation in 11387 ms returned []
Implicit Place search using SMT with State Equation took 11874 ms to find 0 implicit places.
[2024-06-01 17:53:00] [INFO ] Redundant transitions in 53 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 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11993 ms. Remains : 588/3332 places, 2744/2744 transitions.
Treatment of property Sudoku-COL-AN14-LTLCardinality-12 finished in 115527 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) U p1) U X(G(p0))))'
Support contains 392 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Reduce places removed 2744 places and 0 transitions.
Iterating post reduction 0 with 2744 rules applied. Total rules applied 2744 place count 588 transition count 2744
Applied a total of 2744 rules in 33 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:53:00] [INFO ] Invariant cache hit.
[2024-06-01 17:53:00] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-06-01 17:53:00] [INFO ] Invariant cache hit.
[2024-06-01 17:53:11] [INFO ] Implicit Places using invariants and state equation in 10607 ms returned []
Implicit Place search using SMT with State Equation took 10928 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 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10965 ms. Remains : 588/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN14-LTLCardinality-13
Product exploration timeout after 51580 steps with 299 reset in 10003 ms.
Product exploration timeout after 51430 steps with 298 reset in 10002 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 125 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (231 resets) in 9231 ms. (4 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1238 ms. (32 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 772 ms. (51 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 668 ms. (59 steps per ms) remains 3/3 properties
Probabilistic random walk after 202476 steps, saw 202374 distinct states, run finished after 9014 ms. (steps per millisecond=22 ) properties seen :0
[2024-06-01 17:53:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 196/588 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2744/3332 variables, 588/629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2078 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 196/588 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2744/3332 variables, 588/629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1304 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3531ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 196 steps, including 0 resets, run visited all 3 properties in 19 ms. (steps per millisecond=10 )
Parikh walk visited 3 properties in 19 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 270 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 392 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 17 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:53:48] [INFO ] Invariant cache hit.
[2024-06-01 17:53:49] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-06-01 17:53:49] [INFO ] Invariant cache hit.
[2024-06-01 17:53:59] [INFO ] Implicit Places using invariants and state equation in 10705 ms returned []
Implicit Place search using SMT with State Equation took 11043 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 11064 ms. Remains : 588/588 places, 2744/2744 transitions.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 136 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (232 resets) in 9259 ms. (4 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1143 ms. (34 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 551 ms. (72 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 610 ms. (65 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 186828 steps, run timeout after 9007 ms. (steps per millisecond=20 ) properties seen :0 out of 3
Probabilistic random walk after 186828 steps, saw 186736 distinct states, run finished after 9008 ms. (steps per millisecond=20 ) properties seen :0
[2024-06-01 17:54:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 196/588 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2268 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 196/588 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2744/3332 variables, 588/629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1310 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3679ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 196 steps, including 0 resets, run visited all 3 properties in 19 ms. (steps per millisecond=10 )
Parikh walk visited 3 properties in 19 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 287 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration timeout after 53730 steps with 312 reset in 10003 ms.
Product exploration timeout after 53130 steps with 308 reset in 10003 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 392 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 17 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:54:37] [INFO ] Redundant transitions in 54 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 78 ms. Remains : 588/588 places, 2744/2744 transitions.
Support contains 392 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 10 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:54:37] [INFO ] Invariant cache hit.
[2024-06-01 17:54:37] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-06-01 17:54:37] [INFO ] Invariant cache hit.
[2024-06-01 17:54:48] [INFO ] Implicit Places using invariants and state equation in 10475 ms returned []
Implicit Place search using SMT with State Equation took 10774 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 10788 ms. Remains : 588/588 places, 2744/2744 transitions.
Treatment of property Sudoku-COL-AN14-LTLCardinality-13 finished in 108303 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) U X(!p1))||X(X(G(!p2)))))'
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 31 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 3332 cols
[2024-06-01 17:54:48] [INFO ] Computed 588 invariants in 14 ms
[2024-06-01 17:54:50] [INFO ] Implicit Places using invariants in 1399 ms returned []
[2024-06-01 17:54:50] [INFO ] Invariant cache hit.
[2024-06-01 17:54:54] [INFO ] Implicit Places using invariants and state equation in 4934 ms returned []
Implicit Place search using SMT with State Equation took 6343 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 6375 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 519 ms :[(AND p1 p2), (AND (NOT p0) p1 p2), (AND p1 p2), (AND (NOT p0) p2), (AND (NOT p0) p2 p1), (AND p1 p2), (NOT p0), (AND (NOT p0) p1), p1]
Running random walk in product with property : Sudoku-COL-AN14-LTLCardinality-15
Product exploration timeout after 19710 steps with 114 reset in 10007 ms.
Product exploration timeout after 19690 steps with 114 reset in 10001 ms.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 280 ms. Reduced automaton from 9 states, 17 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 366 ms :[(AND p1 p2), (AND p1 p2), (AND (NOT p0) p2), (AND (NOT p0) p2 p1), (AND p1 p2), (NOT p0), (AND (NOT p0) p1), p1]
RANDOM walk for 40000 steps (229 resets) in 27420 ms. (1 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5011 ms. (7 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4688 ms. (8 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2598 ms. (15 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2644 ms. (15 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2911 ms. (13 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 590 ms. (67 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2766 ms. (14 steps per ms) remains 7/7 properties
[2024-06-01 17:55:29] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
Problem apf2 is UNSAT
Problem apf3 is UNSAT
Problem apf7 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2940 variables, 196/196 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2940 variables, 0/196 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3332/6076 variables, and 588 constraints, problems are : Problem set: 4 solved, 3 unsolved in 4051 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2940 variables, 196/196 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2940 variables, 0/196 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3332/6076 variables, and 588 constraints, problems are : Problem set: 4 solved, 3 unsolved in 3674 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 9563ms problems are : Problem set: 4 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 45 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 3332/3332 places, 2744/2744 transitions.
RANDOM walk for 40000 steps (230 resets) in 16075 ms. (2 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2579 ms. (15 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 684 ms. (58 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2707 ms. (14 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 135854 steps, run timeout after 18032 ms. (steps per millisecond=7 ) properties seen :0 out of 3
Probabilistic random walk after 135854 steps, saw 135790 distinct states, run finished after 18036 ms. (steps per millisecond=7 ) properties seen :0
[2024-06-01 17:56:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2940 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2940 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3332/6076 variables, and 588 constraints, problems are : Problem set: 0 solved, 3 unsolved in 27315 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2940 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2940 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3332/6076 variables, and 588 constraints, problems are : Problem set: 0 solved, 3 unsolved in 27870 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 55941ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 43 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 59 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:56:59] [INFO ] Invariant cache hit.
[2024-06-01 17:57:01] [INFO ] Implicit Places using invariants in 1470 ms returned []
[2024-06-01 17:57:01] [INFO ] Invariant cache hit.
[2024-06-01 17:57:05] [INFO ] Implicit Places using invariants and state equation in 4744 ms returned []
Implicit Place search using SMT with State Equation took 6228 ms to find 0 implicit places.
[2024-06-01 17:57:05] [INFO ] Redundant transitions in 52 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 6354 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p2) p0)), (G (OR (NOT p2) p0 (NOT p1))), (G (OR p2 p0 (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p2 p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2))]
Knowledge based reduction with 11 factoid took 1043 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[p1, (AND p1 p2), (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 133 ms :[p1, (AND p1 p2), (AND p1 p2), (AND p1 p2)]
[2024-06-01 17:57:09] [INFO ] Invariant cache hit.
Could not prove EG (AND p1 p2)
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 27 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:57:24] [INFO ] Invariant cache hit.
[2024-06-01 17:57:25] [INFO ] Implicit Places using invariants in 1467 ms returned []
[2024-06-01 17:57:25] [INFO ] Invariant cache hit.
[2024-06-01 17:57:30] [INFO ] Implicit Places using invariants and state equation in 5075 ms returned []
Implicit Place search using SMT with State Equation took 6543 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 6573 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
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 p1 p2), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[p1, (AND p1 p2), (AND p1 p2), (AND p1 p2)]
RANDOM walk for 40000 steps (231 resets) in 9533 ms. (4 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2594 ms. (15 steps per ms) remains 1/1 properties
[2024-06-01 17:57:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2940 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2940 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3332/6076 variables, and 588 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1576 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2940 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2940 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3332/6076 variables, and 588 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1522 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3481ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 47 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 3332/3332 places, 2744/2744 transitions.
RANDOM walk for 40000 steps (232 resets) in 12703 ms. (3 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3469 ms. (11 steps per ms) remains 1/1 properties
Probabilistic random walk after 173219 steps, saw 173139 distinct states, run finished after 12058 ms. (steps per millisecond=14 ) properties seen :0
[2024-06-01 17:57:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2940 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2940 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3332/6076 variables, and 588 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9889 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2940 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2940 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3332/6076 variables, and 588 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9540 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 19838ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 41 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 39 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:58:15] [INFO ] Invariant cache hit.
[2024-06-01 17:58:16] [INFO ] Implicit Places using invariants in 1510 ms returned []
[2024-06-01 17:58:16] [INFO ] Invariant cache hit.
[2024-06-01 17:58:21] [INFO ] Implicit Places using invariants and state equation in 5034 ms returned []
Implicit Place search using SMT with State Equation took 6555 ms to find 0 implicit places.
[2024-06-01 17:58:21] [INFO ] Redundant transitions in 52 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 6653 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Knowledge obtained : [(AND p1 p2), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 3 factoid took 195 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[p1, (AND p1 p2), (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 164 ms :[p1, (AND p1 p2), (AND p1 p2), (AND p1 p2)]
[2024-06-01 17:58:24] [INFO ] Invariant cache hit.
Could not prove EG (AND p1 p2)
Stuttering acceptance computed with spot in 151 ms :[p1, (AND p1 p2), (AND p1 p2), (AND p1 p2)]
Product exploration timeout after 21230 steps with 123 reset in 10003 ms.
Product exploration timeout after 21640 steps with 125 reset in 10002 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 155 ms :[p1, (AND p1 p2), (AND p1 p2), (AND p1 p2)]
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 44 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:59:00] [INFO ] Redundant transitions in 56 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 25 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:59:00] [INFO ] Invariant cache hit.
[2024-06-01 17:59:01] [INFO ] Implicit Places using invariants in 1509 ms returned []
[2024-06-01 17:59:01] [INFO ] Invariant cache hit.
[2024-06-01 17:59:06] [INFO ] Implicit Places using invariants and state equation in 5285 ms returned []
Implicit Place search using SMT with State Equation took 6797 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 6824 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Treatment of property Sudoku-COL-AN14-LTLCardinality-15 finished in 258476 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((G(F(p0))&&F(p1))))))'
Found a Shortening insensitive property : Sudoku-COL-AN14-LTLCardinality-07
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 25 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 17:59:07] [INFO ] Invariant cache hit.
[2024-06-01 17:59:08] [INFO ] Implicit Places using invariants in 1065 ms returned []
[2024-06-01 17:59:08] [INFO ] Invariant cache hit.
[2024-06-01 17:59:13] [INFO ] Implicit Places using invariants and state equation in 4630 ms returned []
Implicit Place search using SMT with State Equation took 5707 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 5735 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Running random walk in product with property : Sudoku-COL-AN14-LTLCardinality-07
Product exploration timeout after 29330 steps with 295 reset in 10004 ms.
Product exploration timeout after 29400 steps with 295 reset in 10001 ms.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
RANDOM walk for 396 steps (0 resets) in 198 ms. (1 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 3 factoid took 171 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 355 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
[2024-06-01 17:59:36] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2024-06-01 17:59:52] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 16 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 18:00:07] [INFO ] Invariant cache hit.
[2024-06-01 18:00:08] [INFO ] Implicit Places using invariants in 1118 ms returned []
[2024-06-01 18:00:08] [INFO ] Invariant cache hit.
[2024-06-01 18:00:13] [INFO ] Implicit Places using invariants and state equation in 4598 ms returned []
Implicit Place search using SMT with State Equation took 5733 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 5752 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
RANDOM walk for 396 steps (0 resets) in 204 ms. (1 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 322 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
[2024-06-01 18:00:16] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
[2024-06-01 18:00:32] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Product exploration timeout after 28930 steps with 291 reset in 10003 ms.
Product exploration timeout after 29320 steps with 295 reset in 10002 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 20 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 18:01:08] [INFO ] Redundant transitions in 58 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 85 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 10 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 18:01:08] [INFO ] Invariant cache hit.
[2024-06-01 18:01:09] [INFO ] Implicit Places using invariants in 1107 ms returned []
[2024-06-01 18:01:09] [INFO ] Invariant cache hit.
[2024-06-01 18:01:13] [INFO ] Implicit Places using invariants and state equation in 4595 ms returned []
Implicit Place search using SMT with State Equation took 5706 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 5718 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Treatment of property Sudoku-COL-AN14-LTLCardinality-07 finished in 127138 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||X(G(!p0))))))'
Found a Lengthening insensitive property : Sudoku-COL-AN14-LTLCardinality-09
Stuttering acceptance computed with spot in 140 ms :[true, p0, false, false]
Support contains 196 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Graph (complete) has 8232 edges and 3332 vertex of which 588 are kept as prefixes of interest. Removing 2744 places using SCC suffix rule.6 ms
Discarding 2744 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 42 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2024-06-01 18:01:14] [INFO ] Computed 41 invariants in 106 ms
[2024-06-01 18:01:15] [INFO ] Implicit Places using invariants in 572 ms returned []
[2024-06-01 18:01:15] [INFO ] Invariant cache hit.
[2024-06-01 18:01:27] [INFO ] Implicit Places using invariants and state equation in 12628 ms returned []
Implicit Place search using SMT with State Equation took 13205 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 LI_LTL mode, iteration 1 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 13250 ms. Remains : 588/3332 places, 2744/2744 transitions.
Running random walk in product with property : Sudoku-COL-AN14-LTLCardinality-09
Product exploration timeout after 55350 steps with 320 reset in 10001 ms.
Product exploration timeout after 56260 steps with 326 reset in 10001 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[true, false, p0]
RANDOM walk for 40000 steps (229 resets) in 6987 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 547 ms. (73 steps per ms) remains 1/1 properties
Probabilistic random walk after 159058 steps, saw 158983 distinct states, run finished after 3037 ms. (steps per millisecond=52 ) properties seen :0
[2024-06-01 18:01:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 382/578 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/578 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/588 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1259 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 382/578 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/578 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/588 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1207 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2501ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 194 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[true, false, p0]
Stuttering acceptance computed with spot in 90 ms :[true, false, p0]
Support contains 196 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 40 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 18:01:56] [INFO ] Invariant cache hit.
[2024-06-01 18:01:56] [INFO ] Implicit Places using invariants in 470 ms returned []
[2024-06-01 18:01:56] [INFO ] Invariant cache hit.
[2024-06-01 18:02:09] [INFO ] Implicit Places using invariants and state equation in 13039 ms returned []
Implicit Place search using SMT with State Equation took 13511 ms to find 0 implicit places.
[2024-06-01 18:02:09] [INFO ] Redundant transitions in 54 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 13616 ms. Remains : 588/588 places, 2744/2744 transitions.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
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), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[true, false, p0]
RANDOM walk for 40000 steps (232 resets) in 7035 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 606 ms. (65 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 339786 steps, run timeout after 6001 ms. (steps per millisecond=56 ) properties seen :0 out of 1
Probabilistic random walk after 339786 steps, saw 281875 distinct states, run finished after 6001 ms. (steps per millisecond=56 ) properties seen :0
[2024-06-01 18:02:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 382/578 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/578 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/588 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1304 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 382/578 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/578 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/588 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1238 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2580ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 194 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 11 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[true, false, p0]
Stuttering acceptance computed with spot in 97 ms :[true, false, p0]
Stuttering acceptance computed with spot in 99 ms :[true, false, p0]
Product exploration timeout after 56770 steps with 329 reset in 10001 ms.
Product exploration timeout after 56460 steps with 327 reset in 10001 ms.
Support contains 196 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 32 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 18:02:41] [INFO ] Invariant cache hit.
[2024-06-01 18:02:42] [INFO ] Implicit Places using invariants in 470 ms returned []
[2024-06-01 18:02:42] [INFO ] Invariant cache hit.
[2024-06-01 18:02:54] [INFO ] Implicit Places using invariants and state equation in 12786 ms returned []
Implicit Place search using SMT with State Equation took 13263 ms to find 0 implicit places.
[2024-06-01 18:02:54] [INFO ] Redundant transitions in 54 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 13360 ms. Remains : 588/588 places, 2744/2744 transitions.
Treatment of property Sudoku-COL-AN14-LTLCardinality-09 finished in 100908 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p1)||G(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(G(p1))))'
Found a Lengthening insensitive property : Sudoku-COL-AN14-LTLCardinality-12
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 39 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 3332 cols
[2024-06-01 18:02:55] [INFO ] Computed 588 invariants in 13 ms
[2024-06-01 18:02:56] [INFO ] Implicit Places using invariants in 1393 ms returned []
[2024-06-01 18:02:56] [INFO ] Invariant cache hit.
[2024-06-01 18:03:01] [INFO ] Implicit Places using invariants and state equation in 4976 ms returned []
Implicit Place search using SMT with State Equation took 6372 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 6413 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Running random walk in product with property : Sudoku-COL-AN14-LTLCardinality-12
Product exploration timeout after 25280 steps with 8345 reset in 10004 ms.
Product exploration timeout after 25280 steps with 8429 reset in 10004 ms.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 123 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (230 resets) in 17075 ms. (2 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2762 ms. (14 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 577 ms. (69 steps per ms) remains 2/2 properties
[2024-06-01 18:03:28] [INFO ] Invariant cache hit.
Problem apf0 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2940 variables, 196/196 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2940 variables, 0/196 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3332/6076 variables, and 588 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1573 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2744/2940 variables, 196/196 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2940 variables, 0/196 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3332/6076 variables, and 588 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1453 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3434ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 196 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Graph (complete) has 8232 edges and 3332 vertex of which 588 are kept as prefixes of interest. Removing 2744 places using SCC suffix rule.3 ms
Discarding 2744 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 53 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 588/3332 places, 2744/2744 transitions.
RANDOM walk for 40000 steps (230 resets) in 7045 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 819 ms. (48 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 340266 steps, run timeout after 6001 ms. (steps per millisecond=56 ) properties seen :0 out of 1
Probabilistic random walk after 340266 steps, saw 281954 distinct states, run finished after 6001 ms. (steps per millisecond=56 ) properties seen :0
// Phase 1: matrix 2744 rows 588 cols
[2024-06-01 18:03:40] [INFO ] Computed 41 invariants in 99 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 388/584 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/588 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2744/3332 variables, 588/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2201 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 388/584 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/588 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2744/3332 variables, 588/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3510 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 5863ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 194 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 13 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 267 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Support contains 196 out of 3332 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 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 39 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 3332 cols
[2024-06-01 18:03:46] [INFO ] Computed 588 invariants in 15 ms
[2024-06-01 18:03:47] [INFO ] Implicit Places using invariants in 1304 ms returned []
[2024-06-01 18:03:47] [INFO ] Invariant cache hit.
[2024-06-01 18:03:53] [INFO ] Implicit Places using invariants and state equation in 5217 ms returned []
Implicit Place search using SMT with State Equation took 6525 ms to find 0 implicit places.
[2024-06-01 18:03:53] [INFO ] Redundant transitions in 53 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 6627 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
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 : [p1, (X p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
RANDOM walk for 40000 steps (229 resets) in 7057 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 701 ms. (56 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 315774 steps, run timeout after 6001 ms. (steps per millisecond=52 ) properties seen :0 out of 1
Probabilistic random walk after 315774 steps, saw 277867 distinct states, run finished after 6001 ms. (steps per millisecond=52 ) properties seen :0
[2024-06-01 18:04:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2744/2940 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2940 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3332/6076 variables, and 588 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1426 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2744/2940 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2940 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3332/6076 variables, and 588 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1469 ms.
Refiners :[Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2942ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 196 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Graph (complete) has 8232 edges and 3332 vertex of which 588 are kept as prefixes of interest. Removing 2744 places using SCC suffix rule.4 ms
Discarding 2744 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 51 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 588/3332 places, 2744/2744 transitions.
RANDOM walk for 40000 steps (231 resets) in 7375 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 488 ms. (81 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 350162 steps, run timeout after 6001 ms. (steps per millisecond=58 ) properties seen :0 out of 1
Probabilistic random walk after 350162 steps, saw 283292 distinct states, run finished after 6001 ms. (steps per millisecond=58 ) properties seen :0
// Phase 1: matrix 2744 rows 588 cols
[2024-06-01 18:04:13] [INFO ] Computed 41 invariants in 97 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 388/584 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/588 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2744/3332 variables, 588/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2077 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 388/584 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/588 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2744/3332 variables, 588/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3536 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 5746ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 194 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=17 )
Parikh walk visited 1 properties in 11 ms.
Knowledge obtained : [p1, (X p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p1)]
Product exploration timeout after 56330 steps with 327 reset in 10001 ms.
Product exploration timeout after 55550 steps with 322 reset in 10001 ms.
Support contains 196 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Graph (complete) has 8232 edges and 3332 vertex of which 588 are kept as prefixes of interest. Removing 2744 places using SCC suffix rule.4 ms
Discarding 2744 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 44 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 18:04:39] [INFO ] Invariant cache hit.
[2024-06-01 18:04:39] [INFO ] Implicit Places using invariants in 455 ms returned []
[2024-06-01 18:04:39] [INFO ] Invariant cache hit.
[2024-06-01 18:04:50] [INFO ] Implicit Places using invariants and state equation in 11056 ms returned []
Implicit Place search using SMT with State Equation took 11513 ms to find 0 implicit places.
[2024-06-01 18:04:50] [INFO ] Redundant transitions in 58 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 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11625 ms. Remains : 588/3332 places, 2744/2744 transitions.
Treatment of property Sudoku-COL-AN14-LTLCardinality-12 finished in 115702 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) U p1) U X(G(p0))))'
Found a Lengthening insensitive property : Sudoku-COL-AN14-LTLCardinality-13
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 392 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Graph (complete) has 8232 edges and 3332 vertex of which 588 are kept as prefixes of interest. Removing 2744 places using SCC suffix rule.4 ms
Discarding 2744 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 36 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 18:04:51] [INFO ] Invariant cache hit.
[2024-06-01 18:04:51] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-06-01 18:04:51] [INFO ] Invariant cache hit.
[2024-06-01 18:05:02] [INFO ] Implicit Places using invariants and state equation in 11281 ms returned []
Implicit Place search using SMT with State Equation took 11557 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 LI_LTL mode, iteration 1 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 11593 ms. Remains : 588/3332 places, 2744/2744 transitions.
Running random walk in product with property : Sudoku-COL-AN14-LTLCardinality-13
Product exploration timeout after 53680 steps with 311 reset in 10002 ms.
Product exploration timeout after 53260 steps with 308 reset in 10001 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 214 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (230 resets) in 9008 ms. (4 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1175 ms. (34 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 680 ms. (58 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 561 ms. (71 steps per ms) remains 3/3 properties
Probabilistic random walk after 192963 steps, saw 192868 distinct states, run finished after 9046 ms. (steps per millisecond=21 ) properties seen :0
[2024-06-01 18:05:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 196/588 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2744/3332 variables, 588/629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1916 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 196/588 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2744/3332 variables, 588/629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1410 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3463ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 196 steps, including 0 resets, run visited all 3 properties in 18 ms. (steps per millisecond=10 )
Parikh walk visited 3 properties in 18 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 329 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 392 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 11 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 18:05:39] [INFO ] Invariant cache hit.
[2024-06-01 18:05:40] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-06-01 18:05:40] [INFO ] Invariant cache hit.
[2024-06-01 18:05:50] [INFO ] Implicit Places using invariants and state equation in 10463 ms returned []
Implicit Place search using SMT with State Equation took 10775 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 10789 ms. Remains : 588/588 places, 2744/2744 transitions.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 141 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (230 resets) in 10657 ms. (3 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1229 ms. (32 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 541 ms. (73 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 618 ms. (64 steps per ms) remains 3/3 properties
Probabilistic random walk after 191277 steps, saw 191184 distinct states, run finished after 9011 ms. (steps per millisecond=21 ) properties seen :0
[2024-06-01 18:06:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 196/588 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2744/3332 variables, 588/629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2306 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 196/588 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/588 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2744/3332 variables, 588/629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/3332 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3332/3332 variables, and 629 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1342 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3813ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 196 steps, including 0 resets, run visited all 3 properties in 15 ms. (steps per millisecond=13 )
Parikh walk visited 3 properties in 15 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 258 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration timeout after 52960 steps with 307 reset in 10001 ms.
Product exploration timeout after 53180 steps with 308 reset in 10001 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 392 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 13 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 18:06:29] [INFO ] Redundant transitions in 51 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 69 ms. Remains : 588/588 places, 2744/2744 transitions.
Support contains 392 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 10 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2024-06-01 18:06:29] [INFO ] Invariant cache hit.
[2024-06-01 18:06:29] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-06-01 18:06:29] [INFO ] Invariant cache hit.
[2024-06-01 18:06:40] [INFO ] Implicit Places using invariants and state equation in 10790 ms returned []
Implicit Place search using SMT with State Equation took 11090 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 11102 ms. Remains : 588/588 places, 2744/2744 transitions.
Treatment of property Sudoku-COL-AN14-LTLCardinality-13 finished in 109454 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) U X(!p1))||X(X(G(!p2)))))'
[2024-06-01 18:06:40] [INFO ] Flatten gal took : 149 ms
[2024-06-01 18:06:40] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 8 ms.
[2024-06-01 18:06:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3332 places, 2744 transitions and 10976 arcs took 16 ms.
Total runtime 1496517 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-COL-AN14"
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-COL-AN14, 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-171690532500515"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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