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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.3K Apr 12 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 12 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 11:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 11:42 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 4.3K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Apr 12 12:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 12:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 12:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:00 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-AN08-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717033152119

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 01:39:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 01:39:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:39:13] [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-05-30 01:39:13] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 01:39:13] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 540 ms
[2024-05-30 01:39:13] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 704 PT places and 512.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 01:39:14] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2024-05-30 01:39:14] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-COL-AN08-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-LTLCardinality-12 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 13 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 40124 steps (604 resets) in 245 ms. (163 steps per ms) remains 10/25 properties
BEST_FIRST walk for 40124 steps (604 resets) in 158 ms. (252 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40124 steps (604 resets) in 146 ms. (272 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40124 steps (604 resets) in 98 ms. (405 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40124 steps (604 resets) in 77 ms. (514 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40124 steps (604 resets) in 99 ms. (401 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40124 steps (604 resets) in 79 ms. (501 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40124 steps (604 resets) in 42 ms. (933 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40124 steps (604 resets) in 44 ms. (891 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40124 steps (604 resets) in 70 ms. (565 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40124 steps (604 resets) in 59 ms. (668 steps per ms) remains 10/10 properties
// Phase 1: matrix 1 rows 4 cols
[2024-05-30 01:39:14] [INFO ] Computed 3 invariants in 6 ms
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 10 solved, 0 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 137ms problems are : Problem set: 10 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 10 atomic propositions for a total of 13 simplifications.
FORMULA Sudoku-COL-AN08-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 01:39:14] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-05-30 01:39:14] [INFO ] Flatten gal took : 14 ms
FORMULA Sudoku-COL-AN08-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 01:39:14] [INFO ] Flatten gal took : 1 ms
Domain [N(8), N(8)] of place Rows breaks symmetries in sort N
[2024-05-30 01:39:14] [INFO ] Unfolded HLPN to a Petri net with 704 places and 512 transitions 2048 arcs in 22 ms.
[2024-05-30 01:39:14] [INFO ] Unfolded 8 HLPN properties in 1 ms.
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 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 01:39:15] [INFO ] Computed 192 invariants in 11 ms
[2024-05-30 01:39:15] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-30 01:39:15] [INFO ] Invariant cache hit.
[2024-05-30 01:39:15] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 7ms
Finished structural reductions in LTL mode , in 1 iterations and 617 ms. Remains : 704/704 places, 512/512 transitions.
Support contains 704 out of 704 places after structural reductions.
[2024-05-30 01:39:15] [INFO ] Flatten gal took : 69 ms
[2024-05-30 01:39:15] [INFO ] Flatten gal took : 56 ms
[2024-05-30 01:39:16] [INFO ] Input system was already deterministic with 512 transitions.
RANDOM walk for 40000 steps (717 resets) in 4040 ms. (9 steps per ms) remains 6/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1350 ms. (29 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 441 ms. (90 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 6/6 properties
[2024-05-30 01:39:18] [INFO ] Invariant cache hit.
Problem AtomicPropp7 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 192/192 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 0/192 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 512/1216 variables, 704/896 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1216 variables, 0/896 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 0/1216 variables, 0/896 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1216/1216 variables, and 896 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1500 ms.
Refiners :[Positive P Invariants (semi-flows): 192/192 constraints, State Equation: 704/704 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 512/704 variables, 192/192 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/704 variables, 0/192 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 512/1216 variables, 704/896 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1216/1216 variables, and 901 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 192/192 constraints, State Equation: 704/704 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 7045ms problems are : Problem set: 1 solved, 5 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 16 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 16 ms. Remains : 192/704 places, 512/512 transitions.
RANDOM walk for 40000 steps (716 resets) in 2494 ms. (16 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 110904 steps, run visited all 5 properties in 1164 ms. (steps per millisecond=95 )
Probabilistic random walk after 110904 steps, saw 34413 distinct states, run finished after 1167 ms. (steps per millisecond=95 ) properties seen :5
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
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 20 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 01:39:27] [INFO ] Invariant cache hit.
[2024-05-30 01:39:28] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-30 01:39:28] [INFO ] Invariant cache hit.
[2024-05-30 01:39:28] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 683 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 704 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p0) p1), true, p1, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 36 steps with 1 reset in 14 ms.
FORMULA Sudoku-COL-AN08-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN08-LTLCardinality-00 finished in 1064 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 37 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 01:39:28] [INFO ] Invariant cache hit.
[2024-05-30 01:39:29] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-30 01:39:29] [INFO ] Invariant cache hit.
[2024-05-30 01:39:29] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
[2024-05-30 01:39:29] [INFO ] Redundant transitions in 23 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 816 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-COL-AN08-LTLCardinality-01
Product exploration explored 100000 steps with 3030 reset in 5551 ms.
Product exploration explored 100000 steps with 3030 reset in 5654 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 112 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 41 ms :[(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 123 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 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2024-05-30 01:39:45] [INFO ] Invariant cache hit.
[2024-05-30 01:39:46] [INFO ] [Real]Absence check using 192 positive place invariants in 61 ms returned sat
[2024-05-30 01:39:47] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2024-05-30 01:39:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 01:39:49] [INFO ] [Nat]Absence check using 192 positive place invariants in 727 ms returned sat
[2024-05-30 01:39:50] [INFO ] [Nat]Absence check using state equation in 734 ms returned sat
[2024-05-30 01:39:50] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 42 ms.
[2024-05-30 01:39:50] [INFO ] Added : 0 causal constraints over 0 iterations in 117 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 14 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 01:39:50] [INFO ] Invariant cache hit.
[2024-05-30 01:39:50] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-30 01:39:50] [INFO ] Invariant cache hit.
[2024-05-30 01:39:51] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 801 ms to find 0 implicit places.
[2024-05-30 01:39:51] [INFO ] Redundant transitions in 12 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 834 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 103 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 115 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-05-30 01:39:55] [INFO ] Invariant cache hit.
[2024-05-30 01:39:57] [INFO ] [Real]Absence check using 192 positive place invariants in 59 ms returned sat
[2024-05-30 01:39:58] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2024-05-30 01:39:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 01:40:00] [INFO ] [Nat]Absence check using 192 positive place invariants in 707 ms returned sat
[2024-05-30 01:40:01] [INFO ] [Nat]Absence check using state equation in 748 ms returned sat
[2024-05-30 01:40:01] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 24 ms.
[2024-05-30 01:40:01] [INFO ] Added : 0 causal constraints over 0 iterations in 86 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3030 reset in 5646 ms.
Product exploration explored 100000 steps with 3030 reset in 5662 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 13 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 01:40:12] [INFO ] Invariant cache hit.
[2024-05-30 01:40:12] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-30 01:40:12] [INFO ] Invariant cache hit.
[2024-05-30 01:40:13] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
[2024-05-30 01:40:13] [INFO ] Redundant transitions in 4 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 880 ms. Remains : 704/704 places, 512/512 transitions.
Treatment of property Sudoku-COL-AN08-LTLCardinality-01 finished in 44870 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 3 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 01:40:13] [INFO ] Invariant cache hit.
[2024-05-30 01:40:14] [INFO ] Implicit Places using invariants in 686 ms returned []
[2024-05-30 01:40:14] [INFO ] Invariant cache hit.
[2024-05-30 01:40:14] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 1122 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 1126 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 326 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-COL-AN08-LTLCardinality-02
Product exploration explored 100000 steps with 1798 reset in 2995 ms.
Product exploration explored 100000 steps with 1798 reset in 3045 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 (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X p0), (X (NOT (AND p0 (NOT p2) p1))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X p0)), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (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 1112 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 333 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 6799 ms. (5 steps per ms) remains 9/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 340 ms. (117 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1238 ms. (32 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 936 ms. (42 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 893 ms. (44 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 654 ms. (61 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 596 ms. (67 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 691 ms. (57 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 9/9 properties
[2024-05-30 01:40:40] [INFO ] Invariant cache hit.
Problem apf3 is UNSAT
Problem apf5 is UNSAT
Problem apf8 is UNSAT
Problem apf9 is UNSAT
Problem apf10 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 128/128 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 0/128 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 64/704 variables, 64/192 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/704 variables, 0/192 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 512/1216 variables, 704/896 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1216 variables, 0/896 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/1216 variables, 0/896 constraints. Problems are: Problem set: 5 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1216/1216 variables, and 896 constraints, problems are : Problem set: 5 solved, 4 unsolved in 1073 ms.
Refiners :[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, 128/128 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 0/128 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 64/704 variables, 64/192 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/704 variables, 0/192 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 512/1216 variables, 704/896 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 900 constraints, problems are : Problem set: 5 solved, 4 unsolved in 5013 ms.
Refiners :[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 6872ms problems are : Problem set: 5 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 2 properties in 121 ms.
Support contains 128 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.1 ms
Discarding 512 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 24 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 24 ms. Remains : 192/704 places, 512/512 transitions.
RANDOM walk for 40000 steps (716 resets) in 1789 ms. (22 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 327 ms. (121 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 110904 steps, run visited all 2 properties in 624 ms. (steps per millisecond=177 )
Probabilistic random walk after 110904 steps, saw 34413 distinct states, run finished after 624 ms. (steps per millisecond=177 ) properties seen :2
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1 (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X p0), (X (NOT (AND p0 (NOT p2) p1))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X p0)), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (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 (OR p1 p2 p0 p3)), (G (OR p1 p2)), (G (AND (OR (NOT p1) p0 p3) (OR (NOT p2) p0 p3))), (G (OR (NOT p1) p2 p0 p3)), (G (OR p1 p2 (NOT p0) p3))]
False Knowledge obtained : [(F (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)) (AND p0 (NOT p3))))), (F (NOT (AND p1 (NOT p2) p0))), (F (NOT (AND p1 (NOT p2)))), (F (NOT p1)), (F p2), (F p3), (F (NOT p0)), (F (NOT (AND p1 (NOT p2) p0 (NOT p3))))]
Knowledge based reduction with 25 factoid took 2651 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 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 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 16 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 01:40:51] [INFO ] Invariant cache hit.
[2024-05-30 01:40:51] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-30 01:40:51] [INFO ] Invariant cache hit.
[2024-05-30 01:40:52] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
[2024-05-30 01:40:52] [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 699 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 77 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 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (717 resets) in 1811 ms. (22 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 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 491 ms. (steps per millisecond=225 ) 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 111 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1800 reset in 2861 ms.
Product exploration explored 100000 steps with 1799 reset in 2920 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 32 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 01:41:01] [INFO ] Computed 23 invariants in 16 ms
[2024-05-30 01:41:01] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-30 01:41:01] [INFO ] Invariant cache hit.
[2024-05-30 01:41:01] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
[2024-05-30 01:41:01] [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 : 192/704 places, 512/512 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 587 ms. Remains : 192/704 places, 512/512 transitions.
Treatment of property Sudoku-COL-AN08-LTLCardinality-02 finished in 48036 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 16 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 01:41:01] [INFO ] Computed 192 invariants in 8 ms
[2024-05-30 01:41:02] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-30 01:41:02] [INFO ] Invariant cache hit.
[2024-05-30 01:41:02] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 810 ms to find 0 implicit places.
[2024-05-30 01:41:02] [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 836 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-04
Product exploration explored 100000 steps with 3030 reset in 6632 ms.
Product exploration explored 100000 steps with 3030 reset in 6803 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 181 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 174 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 (718 resets) in 3902 ms. (10 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1415 ms. (28 steps per ms) remains 1/1 properties
[2024-05-30 01:41:27] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
After SMT solving in domain Real declared 576/1216 variables, and 64 constraints, problems are : Problem set: 1 solved, 0 unsolved in 99 ms.
Refiners :[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 214ms 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 p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 10 factoid took 347 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 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
[2024-05-30 01:41:28] [INFO ] Invariant cache hit.
[2024-05-30 01:41:29] [INFO ] [Real]Absence check using 192 positive place invariants in 61 ms returned sat
[2024-05-30 01:41:30] [INFO ] [Real]Absence check using state equation in 529 ms returned sat
[2024-05-30 01:41:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 01:41:32] [INFO ] [Nat]Absence check using 192 positive place invariants in 654 ms returned sat
[2024-05-30 01:41:33] [INFO ] [Nat]Absence check using state equation in 766 ms returned sat
[2024-05-30 01:41:33] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 23 ms.
[2024-05-30 01:41:33] [INFO ] Added : 0 causal constraints over 0 iterations in 76 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 17 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 01:41:33] [INFO ] Invariant cache hit.
[2024-05-30 01:41:33] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-30 01:41:33] [INFO ] Invariant cache hit.
[2024-05-30 01:41:34] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
[2024-05-30 01:41:34] [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 895 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 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 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 154 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 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
[2024-05-30 01:41:38] [INFO ] Invariant cache hit.
[2024-05-30 01:41:40] [INFO ] [Real]Absence check using 192 positive place invariants in 66 ms returned sat
[2024-05-30 01:41:41] [INFO ] [Real]Absence check using state equation in 530 ms returned sat
[2024-05-30 01:41:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 01:41:43] [INFO ] [Nat]Absence check using 192 positive place invariants in 715 ms returned sat
[2024-05-30 01:41:44] [INFO ] [Nat]Absence check using state equation in 765 ms returned sat
[2024-05-30 01:41:44] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 23 ms.
[2024-05-30 01:41:44] [INFO ] Added : 0 causal constraints over 0 iterations in 77 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3030 reset in 5560 ms.
Product exploration explored 100000 steps with 3030 reset in 5504 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 9 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 01:41:55] [INFO ] Invariant cache hit.
[2024-05-30 01:41:55] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-05-30 01:41:55] [INFO ] Invariant cache hit.
[2024-05-30 01:41:56] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 800 ms to find 0 implicit places.
[2024-05-30 01:41:56] [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 818 ms. Remains : 704/704 places, 512/512 transitions.
Treatment of property Sudoku-COL-AN08-LTLCardinality-04 finished in 54515 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 11 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 01:41:56] [INFO ] Computed 23 invariants in 12 ms
[2024-05-30 01:41:56] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-30 01:41:56] [INFO ] Invariant cache hit.
[2024-05-30 01:41:56] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 458 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 469 ms. Remains : 192/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN08-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN08-LTLCardinality-06 finished in 623 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 7 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
[2024-05-30 01:41:56] [INFO ] Invariant cache hit.
[2024-05-30 01:41:56] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-30 01:41:56] [INFO ] Invariant cache hit.
[2024-05-30 01:41:57] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 438 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 447 ms. Remains : 192/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 4154 ms.
Product exploration explored 100000 steps with 50000 reset in 4075 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 21 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-COL-AN08-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN08-LTLCardinality-07 finished in 9918 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||X((!p0&&G(F(!p1)))))))'
Support contains 640 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 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 01:42:06] [INFO ] Computed 192 invariants in 3 ms
[2024-05-30 01:42:06] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-30 01:42:06] [INFO ] Invariant cache hit.
[2024-05-30 01:42:07] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2024-05-30 01:42:07] [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 625 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) p1), (OR p0 p1), true, p1, p1]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-09
Stuttering criterion allowed to conclude after 55 steps with 0 reset in 3 ms.
FORMULA Sudoku-COL-AN08-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN08-LTLCardinality-09 finished in 845 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(G(p1))))))'
Support contains 576 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 6 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 01:42:07] [INFO ] Invariant cache hit.
[2024-05-30 01:42:07] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-05-30 01:42:07] [INFO ] Invariant cache hit.
[2024-05-30 01:42:08] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 811 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 820 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-10
Product exploration explored 100000 steps with 1796 reset in 6877 ms.
Product exploration explored 100000 steps with 1797 reset in 6920 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 p1)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 180 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 7 states, 20 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (AND p0 (NOT p1)), false, false, false]
RANDOM walk for 40000 steps (718 resets) in 1871 ms. (21 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 791 ms. (50 steps per ms) remains 1/1 properties
[2024-05-30 01:42:36] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
After SMT solving in domain Real declared 576/1216 variables, and 64 constraints, problems are : Problem set: 1 solved, 0 unsolved in 96 ms.
Refiners :[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 207ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (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 p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 498 ms. Reduced automaton from 7 states, 20 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
[2024-05-30 01:42:36] [INFO ] Invariant cache hit.
[2024-05-30 01:42:38] [INFO ] [Real]Absence check using 192 positive place invariants in 50 ms returned sat
[2024-05-30 01:42:38] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2024-05-30 01:42:38] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 21 ms.
[2024-05-30 01:42:38] [INFO ] Added : 0 causal constraints over 0 iterations in 80 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 512 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 01:42:38] [INFO ] Invariant cache hit.
[2024-05-30 01:42:39] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-30 01:42:39] [INFO ] Invariant cache hit.
[2024-05-30 01:42:39] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
[2024-05-30 01:42:39] [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 807 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 p1), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 168 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 33 ms :[(NOT p1)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 139 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 43 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
[2024-05-30 01:42:43] [INFO ] Invariant cache hit.
[2024-05-30 01:42:44] [INFO ] [Real]Absence check using 192 positive place invariants in 48 ms returned sat
[2024-05-30 01:42:45] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2024-05-30 01:42:45] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-30 01:42:45] [INFO ] Added : 0 causal constraints over 0 iterations in 68 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Product exploration explored 100000 steps with 1798 reset in 4892 ms.
Product exploration explored 100000 steps with 1797 reset in 5050 ms.
Support contains 512 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 10 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 01:42:55] [INFO ] Invariant cache hit.
[2024-05-30 01:42:55] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-05-30 01:42:55] [INFO ] Invariant cache hit.
[2024-05-30 01:42:56] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 1057 ms to find 0 implicit places.
[2024-05-30 01:42:56] [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 1076 ms. Remains : 704/704 places, 512/512 transitions.
Treatment of property Sudoku-COL-AN08-LTLCardinality-10 finished in 48932 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-COL-AN08-LTLCardinality-02
Stuttering acceptance computed with spot in 376 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 5 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 01:42:57] [INFO ] Invariant cache hit.
[2024-05-30 01:42:57] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-30 01:42:57] [INFO ] Invariant cache hit.
[2024-05-30 01:42:57] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 635 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 641 ms. Remains : 704/704 places, 512/512 transitions.
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-02
Product exploration explored 100000 steps with 1798 reset in 2939 ms.
Product exploration explored 100000 steps with 1796 reset in 2985 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 (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X p0), (X (NOT (AND p0 (NOT p2) p1))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X p0)), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (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 1108 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 292 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 5896 ms. (6 steps per ms) remains 9/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1206 ms. (33 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1053 ms. (37 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1201 ms. (33 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1055 ms. (37 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 910 ms. (43 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 916 ms. (43 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 9/9 properties
[2024-05-30 01:43:22] [INFO ] Invariant cache hit.
Problem apf3 is UNSAT
Problem apf5 is UNSAT
Problem apf8 is UNSAT
Problem apf9 is UNSAT
Problem apf10 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 128/128 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 0/128 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 64/704 variables, 64/192 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/704 variables, 0/192 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 512/1216 variables, 704/896 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1216 variables, 0/896 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/1216 variables, 0/896 constraints. Problems are: Problem set: 5 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1216/1216 variables, and 896 constraints, problems are : Problem set: 5 solved, 4 unsolved in 951 ms.
Refiners :[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, 128/128 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 0/128 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 64/704 variables, 64/192 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/704 variables, 0/192 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 512/1216 variables, 704/896 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 900 constraints, problems are : Problem set: 5 solved, 4 unsolved in 5003 ms.
Refiners :[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 6634ms 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 20 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 20 ms. Remains : 704/704 places, 512/512 transitions.
RANDOM walk for 40000 steps (717 resets) in 2334 ms. (17 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 753 ms. (53 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 110898 steps, run visited all 4 properties in 1013 ms. (steps per millisecond=109 )
Probabilistic random walk after 110898 steps, saw 34881 distinct states, run finished after 1013 ms. (steps per millisecond=109 ) properties seen :4
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1 (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p2), (X p0), (X (NOT (AND p0 (NOT p2) p1))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X p0)), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (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 (OR p1 p2 p0 p3)), (G (OR p1 p2)), (G (AND (OR (NOT p1) p0 p3) (OR (NOT p2) p0 p3))), (G (OR (NOT p1) p2 p0 p3)), (G (OR p1 p2 (NOT p0) p3))]
False Knowledge obtained : [(F (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)) (AND p0 (NOT p3))))), (F (NOT (AND p1 (NOT p2) p0))), (F (NOT (AND p1 (NOT p2)))), (F (NOT p1)), (F p2), (F p3), (F (NOT p0)), (F (NOT (AND p1 (NOT p2) p0 (NOT p3))))]
Knowledge based reduction with 25 factoid took 2662 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 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 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 9 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 01:43:34] [INFO ] Invariant cache hit.
[2024-05-30 01:43:34] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-30 01:43:34] [INFO ] Invariant cache hit.
[2024-05-30 01:43:35] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
[2024-05-30 01:43:35] [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 698 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 89 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 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (716 resets) in 1586 ms. (25 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 110898 steps, run visited all 1 properties in 489 ms. (steps per millisecond=226 )
Probabilistic random walk after 110898 steps, saw 34881 distinct states, run finished after 489 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 109 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 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1795 reset in 2938 ms.
Product exploration explored 100000 steps with 1798 reset in 2979 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.5 ms
Discarding 512 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 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 01:43:43] [INFO ] Computed 23 invariants in 17 ms
[2024-05-30 01:43:44] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-30 01:43:44] [INFO ] Invariant cache hit.
[2024-05-30 01:43:44] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2024-05-30 01:43:44] [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 505 ms. Remains : 192/704 places, 512/512 transitions.
Treatment of property Sudoku-COL-AN08-LTLCardinality-02 finished in 47779 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))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(G(p1))))))'
Found a Shortening insensitive property : Sudoku-COL-AN08-LTLCardinality-10
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 576 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 10 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 01:43:44] [INFO ] Computed 192 invariants in 3 ms
[2024-05-30 01:43:45] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-30 01:43:45] [INFO ] Invariant cache hit.
[2024-05-30 01:43:45] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 871 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 883 ms. Remains : 704/704 places, 512/512 transitions.
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-10
Product exploration explored 100000 steps with 1799 reset in 7033 ms.
Product exploration explored 100000 steps with 1798 reset in 7147 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 p1)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 169 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 7 states, 20 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (AND p0 (NOT p1)), false, false, false]
RANDOM walk for 40000 steps (717 resets) in 3512 ms. (11 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1403 ms. (28 steps per ms) remains 1/1 properties
[2024-05-30 01:44:14] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
After SMT solving in domain Real declared 576/1216 variables, and 64 constraints, problems are : Problem set: 1 solved, 0 unsolved in 96 ms.
Refiners :[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 223ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (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 p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 530 ms. Reduced automaton from 7 states, 20 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
[2024-05-30 01:44:15] [INFO ] Invariant cache hit.
[2024-05-30 01:44:16] [INFO ] [Real]Absence check using 192 positive place invariants in 56 ms returned sat
[2024-05-30 01:44:17] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2024-05-30 01:44:17] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 23 ms.
[2024-05-30 01:44:17] [INFO ] Added : 0 causal constraints over 0 iterations in 72 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 512 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 7 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 01:44:17] [INFO ] Invariant cache hit.
[2024-05-30 01:44:17] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-30 01:44:17] [INFO ] Invariant cache hit.
[2024-05-30 01:44:18] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 808 ms to find 0 implicit places.
[2024-05-30 01:44:18] [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 823 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 p1), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 80 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 30 ms :[(NOT p1)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 112 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 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
[2024-05-30 01:44:22] [INFO ] Invariant cache hit.
[2024-05-30 01:44:23] [INFO ] [Real]Absence check using 192 positive place invariants in 50 ms returned sat
[2024-05-30 01:44:23] [INFO ] [Real]Absence check using state equation in 304 ms returned sat
[2024-05-30 01:44:23] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 22 ms.
[2024-05-30 01:44:23] [INFO ] Added : 0 causal constraints over 0 iterations in 72 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Product exploration explored 100000 steps with 1797 reset in 5021 ms.
Product exploration explored 100000 steps with 1795 reset in 5033 ms.
Support contains 512 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 7 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 01:44:34] [INFO ] Invariant cache hit.
[2024-05-30 01:44:34] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-30 01:44:34] [INFO ] Invariant cache hit.
[2024-05-30 01:44:34] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 969 ms to find 0 implicit places.
[2024-05-30 01:44:35] [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 990 ms. Remains : 704/704 places, 512/512 transitions.
Treatment of property Sudoku-COL-AN08-LTLCardinality-10 finished in 50461 ms.
[2024-05-30 01:44:35] [INFO ] Flatten gal took : 109 ms
[2024-05-30 01:44:35] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-05-30 01:44:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 704 places, 512 transitions and 2048 arcs took 6 ms.
Total runtime 321925 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Sudoku-COL-AN08

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/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.013s, Sys 0.000s]


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.002s, 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: 1678
MODEL NAME: /home/mcc/execution/410/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.

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
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-COL-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-COL-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-171690530400467"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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