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.r399-tall-171690530800627.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 greatspnxred
Input is Sudoku-PT-AN08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530800627
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 178K Apr 12 11:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 897K Apr 12 11:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 437K Apr 12 11:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.1M Apr 12 11:43 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 163K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 564K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 227K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 820K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 521K Apr 12 12:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.6M Apr 12 12:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 652K Apr 12 12:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.1M Apr 12 12:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 51K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 298K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717064900184

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 10:28:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 10:28:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 10:28:21] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2024-05-30 10:28:21] [INFO ] Transformed 704 places.
[2024-05-30 10:28:21] [INFO ] Transformed 512 transitions.
[2024-05-30 10:28:21] [INFO ] Found NUPN structural information;
[2024-05-30 10:28:21] [INFO ] Parsed PT model containing 704 places and 512 transitions and 2048 arcs in 230 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 46 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-AN08-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN08-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 704 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 15 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2024-05-30 10:28:22] [INFO ] Computed 192 invariants in 30 ms
[2024-05-30 10:28:22] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-30 10:28:22] [INFO ] Invariant cache hit.
[2024-05-30 10:28:22] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 777 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 2ms
Finished structural reductions in LTL mode , in 1 iterations and 814 ms. Remains : 704/704 places, 512/512 transitions.
Support contains 704 out of 704 places after structural reductions.
[2024-05-30 10:28:23] [INFO ] Flatten gal took : 88 ms
[2024-05-30 10:28:23] [INFO ] Flatten gal took : 53 ms
[2024-05-30 10:28:23] [INFO ] Input system was already deterministic with 512 transitions.
RANDOM walk for 40000 steps (719 resets) in 4423 ms. (9 steps per ms) remains 11/24 properties
BEST_FIRST walk for 40004 steps (8 resets) in 402 ms. (99 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 400 ms. (99 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 558 ms. (71 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 374 ms. (106 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1113 ms. (35 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 347 ms. (114 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 11/11 properties
[2024-05-30 10:28:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 704/704 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 192/896 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/704 variables, 0/896 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 512/1216 variables, 704/1600 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1216 variables, 0/1600 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/1216 variables, 0/1600 constraints. Problems are: Problem set: 5 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1216/1216 variables, and 1600 constraints, problems are : Problem set: 5 solved, 6 unsolved in 1478 ms.
Refiners :[Domain max(s): 704/704 constraints, Positive P Invariants (semi-flows): 192/192 constraints, State Equation: 704/704 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 512/704 variables, 192/384 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/704 variables, 512/896 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/704 variables, 0/896 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 512/1216 variables, 704/1600 constraints. Problems are: Problem set: 5 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1216/1216 variables, and 1606 constraints, problems are : Problem set: 5 solved, 6 unsolved in 5010 ms.
Refiners :[Domain max(s): 704/704 constraints, Positive P Invariants (semi-flows): 192/192 constraints, State Equation: 704/704 constraints, PredecessorRefiner: 6/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 7067ms problems are : Problem set: 5 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 192 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 512/512 transitions.
Graph (complete) has 1536 edges and 704 vertex of which 192 are kept as prefixes of interest. Removing 512 places using SCC suffix rule.2 ms
Discarding 512 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 192/704 places, 512/512 transitions.
RANDOM walk for 40000 steps (717 resets) in 2001 ms. (19 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 110904 steps, run visited all 6 properties in 1118 ms. (steps per millisecond=99 )
Probabilistic random walk after 110904 steps, saw 34413 distinct states, run finished after 1123 ms. (steps per millisecond=98 ) properties seen :6
FORMULA Sudoku-PT-AN08-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
FORMULA Sudoku-PT-AN08-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN08-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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' '!((F(X((F(p0) U X(p0))))&&!(p0 U p1)))'
Support contains 640 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 9 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 10:28:35] [INFO ] Invariant cache hit.
[2024-05-30 10:28:35] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-05-30 10:28:35] [INFO ] Invariant cache hit.
[2024-05-30 10:28:36] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 961 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 971 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p0) p1), true, p1, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 39 steps with 2 reset in 11 ms.
FORMULA Sudoku-PT-AN08-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN08-LTLCardinality-00 finished in 1338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 46 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 10:28:36] [INFO ] Invariant cache hit.
[2024-05-30 10:28:37] [INFO ] Implicit Places using invariants in 687 ms returned []
[2024-05-30 10:28:37] [INFO ] Invariant cache hit.
[2024-05-30 10:28:38] [INFO ] Implicit Places using invariants and state equation in 751 ms returned []
Implicit Place search using SMT with State Equation took 1446 ms to find 0 implicit places.
[2024-05-30 10:28:38] [INFO ] Redundant transitions in 32 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 1531 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-01
Product exploration explored 100000 steps with 3030 reset in 6059 ms.
Product exploration explored 100000 steps with 3030 reset in 6138 ms.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
RANDOM walk for 128 steps (0 resets) in 19 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2024-05-30 10:28:54] [INFO ] Invariant cache hit.
[2024-05-30 10:28:56] [INFO ] [Real]Absence check using 192 positive place invariants in 244 ms returned sat
[2024-05-30 10:28:57] [INFO ] [Real]Absence check using state equation in 1417 ms returned sat
[2024-05-30 10:28:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 10:29:00] [INFO ] [Nat]Absence check using 192 positive place invariants in 50 ms returned sat
[2024-05-30 10:29:00] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2024-05-30 10:29:00] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 24 ms.
[2024-05-30 10:29:00] [INFO ] Added : 0 causal constraints over 0 iterations in 94 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 21 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 10:29:00] [INFO ] Invariant cache hit.
[2024-05-30 10:29:01] [INFO ] Implicit Places using invariants in 611 ms returned []
[2024-05-30 10:29:01] [INFO ] Invariant cache hit.
[2024-05-30 10:29:02] [INFO ] Implicit Places using invariants and state equation in 756 ms returned []
Implicit Place search using SMT with State Equation took 1367 ms to find 0 implicit places.
[2024-05-30 10:29:02] [INFO ] Redundant transitions in 4 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 1399 ms. Remains : 704/704 places, 512/512 transitions.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 128 steps (0 resets) in 14 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 109 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-05-30 10:29:06] [INFO ] Invariant cache hit.
[2024-05-30 10:29:08] [INFO ] [Real]Absence check using 192 positive place invariants in 249 ms returned sat
[2024-05-30 10:29:09] [INFO ] [Real]Absence check using state equation in 1480 ms returned sat
[2024-05-30 10:29:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 10:29:12] [INFO ] [Nat]Absence check using 192 positive place invariants in 48 ms returned sat
[2024-05-30 10:29:12] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2024-05-30 10:29:12] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 26 ms.
[2024-05-30 10:29:12] [INFO ] Added : 0 causal constraints over 0 iterations in 75 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3030 reset in 6195 ms.
Product exploration explored 100000 steps with 3030 reset in 6267 ms.
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 14 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 10:29:25] [INFO ] Invariant cache hit.
[2024-05-30 10:29:26] [INFO ] Implicit Places using invariants in 672 ms returned []
[2024-05-30 10:29:26] [INFO ] Invariant cache hit.
[2024-05-30 10:29:26] [INFO ] Implicit Places using invariants and state equation in 787 ms returned []
Implicit Place search using SMT with State Equation took 1462 ms to find 0 implicit places.
[2024-05-30 10:29:26] [INFO ] Redundant transitions in 5 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1490 ms. Remains : 704/704 places, 512/512 transitions.
Treatment of property Sudoku-PT-AN08-LTLCardinality-01 finished in 50414 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||X((((p1 U p2)||G(F(p3))) U (p0&&((p1 U p2)||G(F(p3))))))))))'
Support contains 640 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 5 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 10:29:27] [INFO ] Invariant cache hit.
[2024-05-30 10:29:27] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-05-30 10:29:27] [INFO ] Invariant cache hit.
[2024-05-30 10:29:28] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 837 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 843 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 320 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-02
Product exploration explored 100000 steps with 1796 reset in 3485 ms.
Product exploration explored 100000 steps with 1797 reset in 3523 ms.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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 (NOT p2) p1 (NOT p3)), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 1230 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 7 states, 25 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 313 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
RANDOM walk for 40000 steps (717 resets) in 2898 ms. (13 steps per ms) remains 9/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 265 ms. (150 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 927 ms. (43 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 892 ms. (44 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 840 ms. (47 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1089 ms. (36 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 879 ms. (45 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1163 ms. (34 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 9/9 properties
[2024-05-30 10:29:52] [INFO ] Invariant cache hit.
Problem apf5 is UNSAT
Problem apf7 is UNSAT
Problem apf8 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 640/640 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 128/768 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 0/768 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 64/704 variables, 64/832 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/704 variables, 64/896 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/704 variables, 0/896 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 512/1216 variables, 704/1600 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1216 variables, 0/1600 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1216 variables, 0/1600 constraints. Problems are: Problem set: 5 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1216/1216 variables, and 1600 constraints, problems are : Problem set: 5 solved, 4 unsolved in 1331 ms.
Refiners :[Domain max(s): 704/704 constraints, Positive P Invariants (semi-flows): 192/192 constraints, State Equation: 704/704 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 640/640 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 128/768 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 0/768 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 64/704 variables, 64/832 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/704 variables, 64/896 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/704 variables, 0/896 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 512/1216 variables, 704/1600 constraints. Problems are: Problem set: 5 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1216/1216 variables, and 1604 constraints, problems are : Problem set: 5 solved, 4 unsolved in 5004 ms.
Refiners :[Domain max(s): 704/704 constraints, Positive P Invariants (semi-flows): 192/192 constraints, State Equation: 704/704 constraints, PredecessorRefiner: 4/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 7037ms problems are : Problem set: 5 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 640 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 9 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 704/704 places, 512/512 transitions.
RANDOM walk for 40000 steps (717 resets) in 2371 ms. (16 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 966 ms. (41 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 110898 steps, run visited all 4 properties in 1021 ms. (steps per millisecond=108 )
Probabilistic random walk after 110898 steps, saw 34881 distinct states, run finished after 1021 ms. (steps per millisecond=108 ) properties seen :4
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1 (NOT p3)), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (G (AND (OR p0 (NOT p1) p3) (OR p0 (NOT p2) p3))), (G (OR p0 (NOT p1) p2 p3)), (G (OR (NOT p0) p1 p2 p3)), (G (OR p0 p1 p2 p3)), (G (OR p1 p2))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (F (NOT (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (F (NOT p1)), (F p2), (F p3), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND p0 p1 (NOT p2))))]
Knowledge based reduction with 25 factoid took 2831 ms. Reduced automaton from 7 states, 25 edges and 4 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Support contains 64 out of 704 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 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 15 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 10:30:04] [INFO ] Invariant cache hit.
[2024-05-30 10:30:05] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-05-30 10:30:05] [INFO ] Invariant cache hit.
[2024-05-30 10:30:05] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 908 ms to find 0 implicit places.
[2024-05-30 10:30:05] [INFO ] Redundant transitions in 2 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 943 ms. Remains : 704/704 places, 512/512 transitions.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (718 resets) in 1950 ms. (20 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 110898 steps, run visited all 1 properties in 494 ms. (steps per millisecond=224 )
Probabilistic random walk after 110898 steps, saw 34881 distinct states, run finished after 495 ms. (steps per millisecond=224 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1798 reset in 3432 ms.
Product exploration explored 100000 steps with 1798 reset in 3477 ms.
Support contains 64 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Graph (complete) has 1536 edges and 704 vertex of which 192 are kept as prefixes of interest. Removing 512 places using SCC suffix rule.2 ms
Discarding 512 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 27 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2024-05-30 10:30:15] [INFO ] Computed 23 invariants in 22 ms
[2024-05-30 10:30:16] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-05-30 10:30:16] [INFO ] Invariant cache hit.
[2024-05-30 10:30:16] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
[2024-05-30 10:30:16] [INFO ] Redundant transitions in 4 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 : 192/704 places, 512/512 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 895 ms. Remains : 192/704 places, 512/512 transitions.
Treatment of property Sudoku-PT-AN08-LTLCardinality-02 finished in 49608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0||X(F((p0&&F(p1))))))'
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 11 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2024-05-30 10:30:16] [INFO ] Computed 192 invariants in 3 ms
[2024-05-30 10:30:17] [INFO ] Implicit Places using invariants in 678 ms returned []
[2024-05-30 10:30:17] [INFO ] Invariant cache hit.
[2024-05-30 10:30:18] [INFO ] Implicit Places using invariants and state equation in 749 ms returned []
Implicit Place search using SMT with State Equation took 1435 ms to find 0 implicit places.
[2024-05-30 10:30:18] [INFO ] Redundant transitions in 2 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 1455 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-04
Product exploration explored 100000 steps with 3030 reset in 7432 ms.
Product exploration explored 100000 steps with 3030 reset in 7465 ms.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 176 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (717 resets) in 2978 ms. (13 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1290 ms. (30 steps per ms) remains 1/1 properties
[2024-05-30 10:30:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 576/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 576/1216 variables, and 640 constraints, problems are : Problem set: 1 solved, 0 unsolved in 143 ms.
Refiners :[Domain max(s): 576/704 constraints, Positive P Invariants (semi-flows): 64/192 constraints, State Equation: 0/704 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 263ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 10 factoid took 411 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
[2024-05-30 10:30:44] [INFO ] Invariant cache hit.
[2024-05-30 10:30:46] [INFO ] [Real]Absence check using 192 positive place invariants in 169 ms returned sat
[2024-05-30 10:30:47] [INFO ] [Real]Absence check using state equation in 1014 ms returned sat
[2024-05-30 10:30:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 10:30:49] [INFO ] [Nat]Absence check using 192 positive place invariants in 47 ms returned sat
[2024-05-30 10:30:49] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2024-05-30 10:30:49] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 24 ms.
[2024-05-30 10:30:50] [INFO ] Added : 0 causal constraints over 0 iterations in 67 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 11 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 10:30:50] [INFO ] Invariant cache hit.
[2024-05-30 10:30:50] [INFO ] Implicit Places using invariants in 593 ms returned []
[2024-05-30 10:30:50] [INFO ] Invariant cache hit.
[2024-05-30 10:30:51] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 1371 ms to find 0 implicit places.
[2024-05-30 10:30:51] [INFO ] Redundant transitions in 3 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 1392 ms. Remains : 704/704 places, 512/512 transitions.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 128 steps (0 resets) in 15 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
[2024-05-30 10:30:55] [INFO ] Invariant cache hit.
[2024-05-30 10:30:57] [INFO ] [Real]Absence check using 192 positive place invariants in 168 ms returned sat
[2024-05-30 10:30:58] [INFO ] [Real]Absence check using state equation in 997 ms returned sat
[2024-05-30 10:30:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 10:31:01] [INFO ] [Nat]Absence check using 192 positive place invariants in 47 ms returned sat
[2024-05-30 10:31:01] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2024-05-30 10:31:01] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 21 ms.
[2024-05-30 10:31:01] [INFO ] Added : 0 causal constraints over 0 iterations in 75 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3030 reset in 6204 ms.
Product exploration explored 100000 steps with 3030 reset in 6307 ms.
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 8 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 10:31:13] [INFO ] Invariant cache hit.
[2024-05-30 10:31:14] [INFO ] Implicit Places using invariants in 598 ms returned []
[2024-05-30 10:31:14] [INFO ] Invariant cache hit.
[2024-05-30 10:31:15] [INFO ] Implicit Places using invariants and state equation in 722 ms returned []
Implicit Place search using SMT with State Equation took 1322 ms to find 0 implicit places.
[2024-05-30 10:31:15] [INFO ] Redundant transitions in 8 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 1343 ms. Remains : 704/704 places, 512/512 transitions.
Treatment of property Sudoku-PT-AN08-LTLCardinality-04 finished in 58624 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G(p0)))))'
Support contains 64 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Reduce places removed 512 places and 0 transitions.
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 192 transition count 512
Applied a total of 512 rules in 9 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2024-05-30 10:31:15] [INFO ] Computed 23 invariants in 14 ms
[2024-05-30 10:31:15] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-30 10:31:15] [INFO ] Invariant cache hit.
[2024-05-30 10:31:16] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 829 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 : 192/704 places, 512/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 839 ms. Remains : 192/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN08-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN08-LTLCardinality-06 finished in 969 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 64 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Reduce places removed 512 places and 0 transitions.
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 192 transition count 512
Applied a total of 512 rules in 13 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
[2024-05-30 10:31:16] [INFO ] Invariant cache hit.
[2024-05-30 10:31:16] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-30 10:31:16] [INFO ] Invariant cache hit.
[2024-05-30 10:31:17] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 845 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Starting structural reductions in LTL mode, iteration 1 : 192/704 places, 512/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 859 ms. Remains : 192/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 5012 ms.
Product exploration explored 100000 steps with 50000 reset in 5053 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 192 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 10 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN08-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN08-LTLCardinality-07 finished in 12249 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Graph (complete) has 1536 edges and 704 vertex of which 192 are kept as prefixes of interest. Removing 512 places using SCC suffix rule.3 ms
Discarding 512 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
[2024-05-30 10:31:28] [INFO ] Invariant cache hit.
[2024-05-30 10:31:28] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-05-30 10:31:28] [INFO ] Invariant cache hit.
[2024-05-30 10:31:29] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 1055 ms to find 0 implicit places.
[2024-05-30 10:31:29] [INFO ] Redundant transitions in 3 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 : 192/704 places, 512/512 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1077 ms. Remains : 192/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-09
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 7 ms.
FORMULA Sudoku-PT-AN08-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN08-LTLCardinality-09 finished in 1175 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Reduce places removed 512 places and 0 transitions.
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 192 transition count 512
Applied a total of 512 rules in 7 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
[2024-05-30 10:31:29] [INFO ] Invariant cache hit.
[2024-05-30 10:31:30] [INFO ] Implicit Places using invariants in 405 ms returned []
[2024-05-30 10:31:30] [INFO ] Invariant cache hit.
[2024-05-30 10:31:30] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 1031 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 : 192/704 places, 512/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1039 ms. Remains : 192/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 394 steps with 7 reset in 16 ms.
FORMULA Sudoku-PT-AN08-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN08-LTLCardinality-10 finished in 1149 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 4 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Graph (complete) has 1536 edges and 704 vertex of which 193 are kept as prefixes of interest. Removing 511 places using SCC suffix rule.1 ms
Discarding 511 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 193 /704 variables (removed 511) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 193 cols
[2024-05-30 10:31:30] [INFO ] Computed 23 invariants in 16 ms
[2024-05-30 10:31:31] [INFO ] Implicit Places using invariants in 415 ms returned []
[2024-05-30 10:31:31] [INFO ] Invariant cache hit.
[2024-05-30 10:31:31] [INFO ] Implicit Places using invariants and state equation in 653 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
[2024-05-30 10:31:31] [INFO ] Redundant transitions in 5 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 193/704 places, 512/512 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1096 ms. Remains : 193/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-12
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 6 ms.
FORMULA Sudoku-PT-AN08-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN08-LTLCardinality-12 finished in 1178 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Graph (complete) has 1536 edges and 704 vertex of which 181 are kept as prefixes of interest. Removing 523 places using SCC suffix rule.2 ms
Discarding 523 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 34 ms. Remains 181 /704 variables (removed 523) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 181 cols
[2024-05-30 10:31:32] [INFO ] Computed 17 invariants in 7 ms
[2024-05-30 10:31:32] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-30 10:31:32] [INFO ] Invariant cache hit.
[2024-05-30 10:31:32] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
[2024-05-30 10:31:32] [INFO ] Redundant transitions in 21 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 : 181/704 places, 512/512 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 798 ms. Remains : 181/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-14
Stuttering criterion allowed to conclude after 97 steps with 2 reset in 7 ms.
FORMULA Sudoku-PT-AN08-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN08-LTLCardinality-14 finished in 848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X((((p1 U p2)||G(F(p3))) U (p0&&((p1 U p2)||G(F(p3))))))))))'
Found a Lengthening insensitive property : Sudoku-PT-AN08-LTLCardinality-02
Stuttering acceptance computed with spot in 319 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 640 out of 704 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 9 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2024-05-30 10:31:33] [INFO ] Computed 192 invariants in 2 ms
[2024-05-30 10:31:33] [INFO ] Implicit Places using invariants in 353 ms returned []
[2024-05-30 10:31:33] [INFO ] Invariant cache hit.
[2024-05-30 10:31:34] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 858 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 869 ms. Remains : 704/704 places, 512/512 transitions.
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-02
Product exploration explored 100000 steps with 1798 reset in 3403 ms.
Product exploration explored 100000 steps with 1799 reset in 3459 ms.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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 (NOT p2) p1 (NOT p3)), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 1128 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 7 states, 25 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 378 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
RANDOM walk for 40000 steps (718 resets) in 2916 ms. (13 steps per ms) remains 9/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 742 ms. (53 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 842 ms. (47 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 851 ms. (46 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 975 ms. (40 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 882 ms. (45 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 986 ms. (40 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 9/9 properties
[2024-05-30 10:31:58] [INFO ] Invariant cache hit.
Problem apf5 is UNSAT
Problem apf7 is UNSAT
Problem apf8 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 640/640 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 128/768 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 0/768 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 64/704 variables, 64/832 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/704 variables, 64/896 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/704 variables, 0/896 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 512/1216 variables, 704/1600 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1216 variables, 0/1600 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1216 variables, 0/1600 constraints. Problems are: Problem set: 5 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1216/1216 variables, and 1600 constraints, problems are : Problem set: 5 solved, 4 unsolved in 1229 ms.
Refiners :[Domain max(s): 704/704 constraints, Positive P Invariants (semi-flows): 192/192 constraints, State Equation: 704/704 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 640/640 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 128/768 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 0/768 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 64/704 variables, 64/832 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/704 variables, 64/896 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/704 variables, 0/896 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 512/1216 variables, 704/1600 constraints. Problems are: Problem set: 5 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1216/1216 variables, and 1604 constraints, problems are : Problem set: 5 solved, 4 unsolved in 5004 ms.
Refiners :[Domain max(s): 704/704 constraints, Positive P Invariants (semi-flows): 192/192 constraints, State Equation: 704/704 constraints, PredecessorRefiner: 4/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 6769ms problems are : Problem set: 5 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 640 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 15 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 704/704 places, 512/512 transitions.
RANDOM walk for 40000 steps (716 resets) in 2329 ms. (17 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 773 ms. (51 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 110898 steps, run visited all 4 properties in 1031 ms. (steps per millisecond=107 )
Probabilistic random walk after 110898 steps, saw 34881 distinct states, run finished after 1031 ms. (steps per millisecond=107 ) properties seen :4
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1 (NOT p3)), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (G (AND (OR p0 (NOT p1) p3) (OR p0 (NOT p2) p3))), (G (OR p0 (NOT p1) p2 p3)), (G (OR (NOT p0) p1 p2 p3)), (G (OR p0 p1 p2 p3)), (G (OR p1 p2))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (F (NOT (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (F (NOT p1)), (F p2), (F p3), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND p0 p1 (NOT p2))))]
Knowledge based reduction with 25 factoid took 2765 ms. Reduced automaton from 7 states, 25 edges and 4 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 64 out of 704 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 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 14 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 10:32:10] [INFO ] Invariant cache hit.
[2024-05-30 10:32:10] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-30 10:32:10] [INFO ] Invariant cache hit.
[2024-05-30 10:32:10] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
[2024-05-30 10:32:10] [INFO ] Redundant transitions in 17 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 867 ms. Remains : 704/704 places, 512/512 transitions.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (716 resets) in 1906 ms. (20 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 110898 steps, run visited all 1 properties in 490 ms. (steps per millisecond=226 )
Probabilistic random walk after 110898 steps, saw 34881 distinct states, run finished after 490 ms. (steps per millisecond=226 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1798 reset in 3389 ms.
Product exploration explored 100000 steps with 1800 reset in 3458 ms.
Support contains 64 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Graph (complete) has 1536 edges and 704 vertex of which 192 are kept as prefixes of interest. Removing 512 places using SCC suffix rule.1 ms
Discarding 512 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2024-05-30 10:32:20] [INFO ] Computed 23 invariants in 6 ms
[2024-05-30 10:32:21] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-30 10:32:21] [INFO ] Invariant cache hit.
[2024-05-30 10:32:21] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
[2024-05-30 10:32:21] [INFO ] Redundant transitions in 6 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 : 192/704 places, 512/512 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 834 ms. Remains : 192/704 places, 512/512 transitions.
Treatment of property Sudoku-PT-AN08-LTLCardinality-02 finished in 48495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0||X(F((p0&&F(p1))))))'
[2024-05-30 10:32:21] [INFO ] Flatten gal took : 39 ms
[2024-05-30 10:32:21] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-05-30 10:32:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 704 places, 512 transitions and 2048 arcs took 5 ms.
Total runtime 240342 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Sudoku-PT-AN08

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 704
TRANSITIONS: 512
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.010s, Sys 0.004s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1414
MODEL NAME: /home/mcc/execution/412/model
704 places, 512 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1717067905031

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-PT-AN08"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is Sudoku-PT-AN08, 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 r399-tall-171690530800627"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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