Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r489-tall-167912706300091.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Sudoku-COL-AN12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912706300091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 8.4K Feb 26 09:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 09:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 08:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 08:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 10:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 09:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 09:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.5K Mar 5 18:23 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-AN12-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679184537046

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN12
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 00:08:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 00:08:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 00:08:58] [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.
[2023-03-19 00:08:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-19 00:08:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 604 ms
[2023-03-19 00:08:59] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 2160 PT places and 1728.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2023-03-19 00:08:59] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2023-03-19 00:08:59] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-COL-AN12-LTLCardinality-09 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 15 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).
Incomplete random walk after 10073 steps, including 68 resets, run finished after 39 ms. (steps per millisecond=258 ) properties (out of 18) seen :14
Incomplete Best-First random walk after 10073 steps, including 68 resets, run finished after 15 ms. (steps per millisecond=671 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10073 steps, including 68 resets, run finished after 11 ms. (steps per millisecond=915 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10073 steps, including 68 resets, run finished after 10 ms. (steps per millisecond=1007 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10073 steps, including 68 resets, run finished after 9 ms. (steps per millisecond=1119 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1 rows 4 cols
[2023-03-19 00:08:59] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-19 00:08:59] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 00:08:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 00:08:59] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
FORMULA Sudoku-COL-AN12-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN12-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN12-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 00:08:59] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-19 00:08:59] [INFO ] Flatten gal took : 15 ms
FORMULA Sudoku-COL-AN12-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 00:08:59] [INFO ] Flatten gal took : 1 ms
Domain [N(12), N(12)] of place Rows breaks symmetries in sort N
[2023-03-19 00:08:59] [INFO ] Unfolded HLPN to a Petri net with 2160 places and 1728 transitions 6912 arcs in 33 ms.
[2023-03-19 00:08:59] [INFO ] Unfolded 11 HLPN properties in 3 ms.
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 33 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 2160 cols
[2023-03-19 00:09:00] [INFO ] Computed 432 place invariants in 33 ms
[2023-03-19 00:09:00] [INFO ] Implicit Places using invariants in 491 ms returned []
[2023-03-19 00:09:00] [INFO ] Invariant cache hit.
[2023-03-19 00:09:01] [INFO ] Implicit Places using invariants and state equation in 1096 ms returned []
Implicit Place search using SMT with State Equation took 1591 ms to find 0 implicit places.
[2023-03-19 00:09:01] [INFO ] Invariant cache hit.
[2023-03-19 00:09:02] [INFO ] Dead Transitions using invariants and state equation in 1050 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2676 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Support contains 2160 out of 2160 places after structural reductions.
[2023-03-19 00:09:02] [INFO ] Flatten gal took : 196 ms
[2023-03-19 00:09:03] [INFO ] Flatten gal took : 136 ms
[2023-03-19 00:09:03] [INFO ] Input system was already deterministic with 1728 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1932 ms. (steps per millisecond=5 ) properties (out of 14) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-19 00:09:06] [INFO ] Invariant cache hit.
[2023-03-19 00:09:07] [INFO ] [Real]Absence check using 432 positive place invariants in 112 ms returned sat
[2023-03-19 00:09:08] [INFO ] After 1691ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 00:09:08] [INFO ] [Nat]Absence check using 432 positive place invariants in 110 ms returned sat
[2023-03-19 00:09:12] [INFO ] After 1331ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-19 00:09:12] [INFO ] After 1847ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 279 ms.
[2023-03-19 00:09:13] [INFO ] After 4729ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 1 different solutions.
Finished Parikh walk after 144 steps, including 0 resets, run visited all 4 properties in 18 ms. (steps per millisecond=8 )
Parikh walk visited 4 properties in 21 ms.
FORMULA Sudoku-COL-AN12-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G((p0||G(p1)))||((p0||G(p1))&&G((G(!p0) U !p1))))))'
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 88 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 00:09:13] [INFO ] Invariant cache hit.
[2023-03-19 00:09:14] [INFO ] Implicit Places using invariants in 775 ms returned []
[2023-03-19 00:09:14] [INFO ] Invariant cache hit.
[2023-03-19 00:09:16] [INFO ] Implicit Places using invariants and state equation in 2048 ms returned []
Implicit Place search using SMT with State Equation took 2826 ms to find 0 implicit places.
[2023-03-19 00:09:16] [INFO ] Redundant transitions in 101 ms returned []
[2023-03-19 00:09:16] [INFO ] Invariant cache hit.
[2023-03-19 00:09:17] [INFO ] Dead Transitions using invariants and state equation in 1043 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4070 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 493 ms :[(AND (NOT p0) (NOT p1)), true, (NOT p1), false, p0, (AND (NOT p1) p0), p1, p1]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 p1), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND p0 p1), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 4}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 7}], [{ cond=(AND p0 p1), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(GT 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Sudoku-COL-AN12-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN12-LTLCardinality-00 finished in 4654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||X(X(p1))))))'
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 25 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 00:09:18] [INFO ] Invariant cache hit.
[2023-03-19 00:09:18] [INFO ] Implicit Places using invariants in 786 ms returned []
[2023-03-19 00:09:18] [INFO ] Invariant cache hit.
[2023-03-19 00:09:20] [INFO ] Implicit Places using invariants and state equation in 2040 ms returned []
Implicit Place search using SMT with State Equation took 2831 ms to find 0 implicit places.
[2023-03-19 00:09:20] [INFO ] Invariant cache hit.
[2023-03-19 00:09:21] [INFO ] Dead Transitions using invariants and state equation in 1014 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3875 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 329 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=p0, acceptance={} source=7 dest: 1}, { cond=(NOT p0), acceptance={} source=7 dest: 3}], [{ cond=(NOT p0), acceptance={} source=8 dest: 4}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=5, aps=[p1:(LEQ 3 (ADD s2016 s2017 s2018 s2019 s2020 s2021 s2022 s2023 s2024 s2025 s2026 s2027 s2028 s2029 s2030 s2031 s2032 s2033 s2034 s2035 s2036 s2037 s2038 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 30730 steps with 6146 reset in 10002 ms.
Product exploration timeout after 31460 steps with 6292 reset in 10001 ms.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 203 ms. Reduced automaton from 9 states, 13 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1443 ms. (steps per millisecond=6 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 00:11:37] [INFO ] Invariant cache hit.
[2023-03-19 00:11:38] [INFO ] [Real]Absence check using 432 positive place invariants in 106 ms returned sat
[2023-03-19 00:11:41] [INFO ] After 3294ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-19 00:11:42] [INFO ] [Nat]Absence check using 432 positive place invariants in 107 ms returned sat
[2023-03-19 00:11:44] [INFO ] After 1169ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-19 00:11:44] [INFO ] After 1449ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 166 ms.
[2023-03-19 00:11:44] [INFO ] After 3050ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 142 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=15 )
Parikh walk visited 2 properties in 9 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 348 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 249 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 22 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 00:11:45] [INFO ] Invariant cache hit.
[2023-03-19 00:11:46] [INFO ] Implicit Places using invariants in 771 ms returned []
[2023-03-19 00:11:46] [INFO ] Invariant cache hit.
[2023-03-19 00:11:48] [INFO ] Implicit Places using invariants and state equation in 1947 ms returned []
Implicit Place search using SMT with State Equation took 2751 ms to find 0 implicit places.
[2023-03-19 00:11:48] [INFO ] Invariant cache hit.
[2023-03-19 00:11:49] [INFO ] Dead Transitions using invariants and state equation in 1041 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3831 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1217 ms. (steps per millisecond=8 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:12:09] [INFO ] Invariant cache hit.
[2023-03-19 00:12:10] [INFO ] [Real]Absence check using 432 positive place invariants in 123 ms returned sat
[2023-03-19 00:12:11] [INFO ] After 1078ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:12:11] [INFO ] [Nat]Absence check using 432 positive place invariants in 104 ms returned sat
[2023-03-19 00:12:36] [INFO ] After 25011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 144 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 432 are kept as prefixes of interest. Removing 1728 places using SCC suffix rule.5 ms
Discarding 1728 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 67 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 432/2160 places, 1728/1728 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1202 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 250356 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 250356 steps, saw 171431 distinct states, run finished after 3002 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1728 rows 432 cols
[2023-03-19 00:12:40] [INFO ] Computed 35 place invariants in 135 ms
[2023-03-19 00:12:40] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 59 ms returned sat
[2023-03-19 00:12:42] [INFO ] After 1096ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 00:12:42] [INFO ] After 1203ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-19 00:12:42] [INFO ] After 1501ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 142 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND p1 (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 4 factoid took 227 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 260 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 260 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration timeout after 34190 steps with 6838 reset in 10001 ms.
Product exploration timeout after 34070 steps with 6814 reset in 10001 ms.
Applying partial POR strategy [true, true, false, true, false, false, false, false]
Stuttering acceptance computed with spot in 275 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 72 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 00:13:03] [INFO ] Redundant transitions in 100 ms returned []
// Phase 1: matrix 1728 rows 2160 cols
[2023-03-19 00:13:03] [INFO ] Computed 432 place invariants in 24 ms
[2023-03-19 00:13:05] [INFO ] Dead Transitions using invariants and state equation in 1179 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1380 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 30 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 00:13:05] [INFO ] Invariant cache hit.
[2023-03-19 00:13:05] [INFO ] Implicit Places using invariants in 751 ms returned []
[2023-03-19 00:13:05] [INFO ] Invariant cache hit.
[2023-03-19 00:13:07] [INFO ] Implicit Places using invariants and state equation in 1907 ms returned []
Implicit Place search using SMT with State Equation took 2671 ms to find 0 implicit places.
[2023-03-19 00:13:07] [INFO ] Invariant cache hit.
[2023-03-19 00:13:08] [INFO ] Dead Transitions using invariants and state equation in 1134 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3848 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Treatment of property Sudoku-COL-AN12-LTLCardinality-01 finished in 231380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(X(X((X(G(p0))||(X(p0)&&F(p1)))))))))'
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 34 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 00:13:09] [INFO ] Invariant cache hit.
[2023-03-19 00:13:10] [INFO ] Implicit Places using invariants in 864 ms returned []
[2023-03-19 00:13:10] [INFO ] Invariant cache hit.
[2023-03-19 00:13:12] [INFO ] Implicit Places using invariants and state equation in 1949 ms returned []
Implicit Place search using SMT with State Equation took 2831 ms to find 0 implicit places.
[2023-03-19 00:13:12] [INFO ] Invariant cache hit.
[2023-03-19 00:13:13] [INFO ] Dead Transitions using invariants and state equation in 1002 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3868 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 1230 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true, (NOT p1), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 8}, { cond=p0, acceptance={} source=2 dest: 9}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 6}, { cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={} source=6 dest: 10}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 11}], [{ cond=true, acceptance={} source=8 dest: 12}], [{ cond=(NOT p0), acceptance={} source=9 dest: 13}, { cond=p0, acceptance={} source=9 dest: 14}], [{ cond=true, acceptance={0} source=10 dest: 10}], [{ cond=(NOT p1), acceptance={0} source=11 dest: 11}], [{ cond=true, acceptance={} source=12 dest: 15}], [{ cond=true, acceptance={} source=13 dest: 16}], [{ cond=(NOT p0), acceptance={} source=14 dest: 17}, { cond=p0, acceptance={} source=14 dest: 18}], [{ cond=true, acceptance={} source=15 dest: 19}, { cond=(NOT p1), acceptance={} source=15 dest: 20}], [{ cond=true, acceptance={} source=16 dest: 21}, { cond=(NOT p1), acceptance={} source=16 dest: 22}], [{ cond=true, acceptance={} source=17 dest: 23}, { cond=(NOT p1), acceptance={} source=17 dest: 24}], [{ cond=(NOT p0), acceptance={} source=18 dest: 25}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=18 dest: 26}, { cond=p0, acceptance={} source=18 dest: 27}, { cond=(AND p0 (NOT p1)), acceptance={} source=18 dest: 28}], [{ cond=(NOT p0), acceptance={} source=19 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=19 dest: 7}], [{ cond=(NOT p1), acceptance={} source=20 dest: 7}], [{ cond=(NOT p0), acceptance={} source=21 dest: 19}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=21 dest: 20}], [{ cond=(NOT p1), acceptance={} source=22 dest: 20}], [{ cond=(NOT p0), acceptance={} source=23 dest: 21}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=23 dest: 22}], [{ cond=(NOT p1), acceptance={} source=24 dest: 22}], [{ cond=(NOT p0), acceptance={} source=25 dest: 23}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=25 dest: 24}], [{ cond=(NOT p1), acceptance={} source=26 dest: 24}], [{ cond=(NOT p0), acceptance={} source=27 dest: 25}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=27 dest: 26}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=28 dest: 26}, { cond=(AND p0 (NOT p1)), acceptance={} source=28 dest: 28}]], initial=0, aps=[p0:(LEQ 3 (ADD s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 34970 steps with 845 reset in 10001 ms.
Product exploration timeout after 34870 steps with 878 reset in 10003 ms.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 353 ms. Reduced automaton from 29 states, 47 edges and 2 AP (stutter sensitive) to 9 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Finished random walk after 73 steps, including 0 resets, run visited all 4 properties in 19 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p0 (NOT p1))), (F p0)]
Knowledge based reduction with 6 factoid took 373 ms. Reduced automaton from 9 states, 11 edges and 2 AP (stutter sensitive) to 9 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 284 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
[2023-03-19 00:15:28] [INFO ] Invariant cache hit.
[2023-03-19 00:15:41] [INFO ] [Real]Absence check using 432 positive place invariants in 197 ms returned sat
[2023-03-19 00:15:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:15:43] [INFO ] [Real]Absence check using state equation in 1376 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 23 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 00:15:43] [INFO ] Invariant cache hit.
[2023-03-19 00:15:44] [INFO ] Implicit Places using invariants in 950 ms returned []
[2023-03-19 00:15:44] [INFO ] Invariant cache hit.
[2023-03-19 00:15:46] [INFO ] Implicit Places using invariants and state equation in 2002 ms returned []
Implicit Place search using SMT with State Equation took 2991 ms to find 0 implicit places.
[2023-03-19 00:15:46] [INFO ] Invariant cache hit.
[2023-03-19 00:15:47] [INFO ] Dead Transitions using invariants and state equation in 1041 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4056 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
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)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 9 states, 11 edges and 2 AP (stutter sensitive) to 9 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 333 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Finished random walk after 73 steps, including 0 resets, run visited all 4 properties in 19 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F (AND (NOT p1) p0)), (F p0)]
Knowledge based reduction with 4 factoid took 259 ms. Reduced automaton from 9 states, 11 edges and 2 AP (stutter sensitive) to 9 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 283 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
[2023-03-19 00:16:07] [INFO ] Invariant cache hit.
[2023-03-19 00:16:20] [INFO ] [Real]Absence check using 432 positive place invariants in 185 ms returned sat
[2023-03-19 00:16:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:16:22] [INFO ] [Real]Absence check using state equation in 1675 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 289 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Product exploration timeout after 31770 steps with 793 reset in 10004 ms.
Product exploration timeout after 31370 steps with 742 reset in 10002 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 353 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 31 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 00:16:43] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-19 00:16:43] [INFO ] Invariant cache hit.
[2023-03-19 00:16:44] [INFO ] Dead Transitions using invariants and state equation in 1096 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1215 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 28 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 00:16:44] [INFO ] Invariant cache hit.
[2023-03-19 00:16:45] [INFO ] Implicit Places using invariants in 843 ms returned []
[2023-03-19 00:16:45] [INFO ] Invariant cache hit.
[2023-03-19 00:16:47] [INFO ] Implicit Places using invariants and state equation in 2092 ms returned []
Implicit Place search using SMT with State Equation took 2958 ms to find 0 implicit places.
[2023-03-19 00:16:47] [INFO ] Invariant cache hit.
[2023-03-19 00:16:48] [INFO ] Dead Transitions using invariants and state equation in 1042 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4041 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Treatment of property Sudoku-COL-AN12-LTLCardinality-02 finished in 219027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1728 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 88 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 00:16:48] [INFO ] Invariant cache hit.
[2023-03-19 00:16:49] [INFO ] Implicit Places using invariants in 1098 ms returned []
[2023-03-19 00:16:49] [INFO ] Invariant cache hit.
[2023-03-19 00:16:52] [INFO ] Implicit Places using invariants and state equation in 2637 ms returned []
Implicit Place search using SMT with State Equation took 3764 ms to find 0 implicit places.
[2023-03-19 00:16:52] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-19 00:16:52] [INFO ] Invariant cache hit.
[2023-03-19 00:16:53] [INFO ] Dead Transitions using invariants and state equation in 1005 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4925 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 55430 steps with 439 reset in 10001 ms.
Product exploration timeout after 55330 steps with 439 reset in 10003 ms.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
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 138 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 p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1 )
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 146 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2023-03-19 00:19:02] [INFO ] Invariant cache hit.
[2023-03-19 00:19:16] [INFO ] [Real]Absence check using 432 positive place invariants in 182 ms returned sat
[2023-03-19 00:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:19:17] [INFO ] [Real]Absence check using state equation in 1370 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1728 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 38 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 00:19:17] [INFO ] Invariant cache hit.
[2023-03-19 00:19:18] [INFO ] Implicit Places using invariants in 951 ms returned []
[2023-03-19 00:19:18] [INFO ] Invariant cache hit.
[2023-03-19 00:19:20] [INFO ] Implicit Places using invariants and state equation in 2403 ms returned []
Implicit Place search using SMT with State Equation took 3367 ms to find 0 implicit places.
[2023-03-19 00:19:20] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-19 00:19:20] [INFO ] Invariant cache hit.
[2023-03-19 00:19:21] [INFO ] Dead Transitions using invariants and state equation in 1004 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4449 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
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 160 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 32 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1 )
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 151 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2023-03-19 00:21:14] [INFO ] Invariant cache hit.
[2023-03-19 00:21:27] [INFO ] [Real]Absence check using 432 positive place invariants in 186 ms returned sat
[2023-03-19 00:21:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:21:29] [INFO ] [Real]Absence check using state equation in 1286 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration timeout after 54990 steps with 436 reset in 10002 ms.
Product exploration timeout after 54320 steps with 431 reset in 10002 ms.
Support contains 1728 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 37 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 00:21:49] [INFO ] Invariant cache hit.
[2023-03-19 00:21:50] [INFO ] Implicit Places using invariants in 1081 ms returned []
[2023-03-19 00:21:50] [INFO ] Invariant cache hit.
[2023-03-19 00:21:52] [INFO ] Implicit Places using invariants and state equation in 2383 ms returned []
Implicit Place search using SMT with State Equation took 3474 ms to find 0 implicit places.
[2023-03-19 00:21:52] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-19 00:21:52] [INFO ] Invariant cache hit.
[2023-03-19 00:21:53] [INFO ] Dead Transitions using invariants and state equation in 997 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4559 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Treatment of property Sudoku-COL-AN12-LTLCardinality-03 finished in 305595 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(!p0)))'
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 16 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 00:21:54] [INFO ] Invariant cache hit.
[2023-03-19 00:21:54] [INFO ] Implicit Places using invariants in 790 ms returned []
[2023-03-19 00:21:54] [INFO ] Invariant cache hit.
[2023-03-19 00:21:56] [INFO ] Implicit Places using invariants and state equation in 1918 ms returned []
Implicit Place search using SMT with State Equation took 2711 ms to find 0 implicit places.
[2023-03-19 00:21:56] [INFO ] Invariant cache hit.
[2023-03-19 00:21:57] [INFO ] Dead Transitions using invariants and state equation in 938 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3666 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), true]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN12-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN12-LTLCardinality-06 finished in 3783 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 15 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 00:21:57] [INFO ] Invariant cache hit.
[2023-03-19 00:21:58] [INFO ] Implicit Places using invariants in 838 ms returned []
[2023-03-19 00:21:58] [INFO ] Invariant cache hit.
[2023-03-19 00:22:00] [INFO ] Implicit Places using invariants and state equation in 2086 ms returned []
Implicit Place search using SMT with State Equation took 2926 ms to find 0 implicit places.
[2023-03-19 00:22:00] [INFO ] Invariant cache hit.
[2023-03-19 00:22:01] [INFO ] Dead Transitions using invariants and state equation in 1022 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3977 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (LEQ 1 (ADD s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 39420 steps with 13140 reset in 10002 ms.
Product exploration timeout after 39210 steps with 13070 reset in 10003 ms.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
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 (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN12-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN12-LTLCardinality-08 finished in 141522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(F(p1)))||p0)))'
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 7 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 00:24:19] [INFO ] Invariant cache hit.
[2023-03-19 00:24:19] [INFO ] Implicit Places using invariants in 331 ms returned []
[2023-03-19 00:24:19] [INFO ] Invariant cache hit.
[2023-03-19 00:24:20] [INFO ] Implicit Places using invariants and state equation in 1083 ms returned []
Implicit Place search using SMT with State Equation took 1416 ms to find 0 implicit places.
[2023-03-19 00:24:20] [INFO ] Invariant cache hit.
[2023-03-19 00:24:21] [INFO ] Dead Transitions using invariants and state equation in 1012 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2437 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (GT (ADD s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s17...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 34740 steps with 469 reset in 10001 ms.
Product exploration timeout after 34470 steps with 465 reset in 10003 ms.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 256 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 73 steps, including 0 resets, run visited all 1 properties in 21 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 228 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-19 00:29:32] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 4 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 00:29:47] [INFO ] Invariant cache hit.
[2023-03-19 00:29:47] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-19 00:29:47] [INFO ] Invariant cache hit.
[2023-03-19 00:29:48] [INFO ] Implicit Places using invariants and state equation in 1079 ms returned []
Implicit Place search using SMT with State Equation took 1389 ms to find 0 implicit places.
[2023-03-19 00:29:48] [INFO ] Invariant cache hit.
[2023-03-19 00:29:49] [INFO ] Dead Transitions using invariants and state equation in 1007 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2403 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 162 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 73 steps, including 0 resets, run visited all 1 properties in 21 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 182 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-19 00:34:43] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 34360 steps with 464 reset in 10002 ms.
Product exploration timeout after 34390 steps with 464 reset in 10002 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 15 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 00:35:18] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-19 00:35:18] [INFO ] Invariant cache hit.
[2023-03-19 00:35:19] [INFO ] Dead Transitions using invariants and state equation in 1076 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1128 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 14 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 00:35:19] [INFO ] Invariant cache hit.
[2023-03-19 00:35:19] [INFO ] Implicit Places using invariants in 318 ms returned []
[2023-03-19 00:35:19] [INFO ] Invariant cache hit.
[2023-03-19 00:35:20] [INFO ] Implicit Places using invariants and state equation in 1047 ms returned []
Implicit Place search using SMT with State Equation took 1403 ms to find 0 implicit places.
[2023-03-19 00:35:20] [INFO ] Invariant cache hit.
[2023-03-19 00:35:21] [INFO ] Dead Transitions using invariants and state equation in 1004 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2432 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Treatment of property Sudoku-COL-AN12-LTLCardinality-10 finished in 662797 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 144 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 432 are kept as prefixes of interest. Removing 1728 places using SCC suffix rule.3 ms
Discarding 1728 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 26 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 432 cols
[2023-03-19 00:35:22] [INFO ] Computed 35 place invariants in 53 ms
[2023-03-19 00:35:22] [INFO ] Implicit Places using invariants in 379 ms returned []
[2023-03-19 00:35:22] [INFO ] Invariant cache hit.
[2023-03-19 00:35:24] [INFO ] Implicit Places using invariants and state equation in 1546 ms returned []
Implicit Place search using SMT with State Equation took 1936 ms to find 0 implicit places.
[2023-03-19 00:35:24] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-19 00:35:24] [INFO ] Invariant cache hit.
[2023-03-19 00:35:24] [INFO ] Dead Transitions using invariants and state equation in 613 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 432/2160 places, 1728/1728 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2644 ms. Remains : 432/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 73 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s288 s289 s290 s291 s292 s293 s294 s295 s296 s297 s298 s299 s300 s301 s302 s303 s304 s305 s306 s307 s308 s309 s310 s311 s312 s313 s314 s315...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 124 steps with 0 reset in 17 ms.
FORMULA Sudoku-COL-AN12-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN12-LTLCardinality-13 finished in 2753 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1))||G(p2))))'
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 29 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 2160 cols
[2023-03-19 00:35:25] [INFO ] Computed 432 place invariants in 11 ms
[2023-03-19 00:35:25] [INFO ] Implicit Places using invariants in 784 ms returned []
[2023-03-19 00:35:25] [INFO ] Invariant cache hit.
[2023-03-19 00:35:27] [INFO ] Implicit Places using invariants and state equation in 1916 ms returned []
Implicit Place search using SMT with State Equation took 2738 ms to find 0 implicit places.
[2023-03-19 00:35:27] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-19 00:35:27] [INFO ] Invariant cache hit.
[2023-03-19 00:35:28] [INFO ] Dead Transitions using invariants and state equation in 973 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3788 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 49440 steps with 392 reset in 10001 ms.
Product exploration timeout after 49330 steps with 391 reset in 10001 ms.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 651 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 79 resets, run finished after 3028 ms. (steps per millisecond=3 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1088 ms. (steps per millisecond=9 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 769 ms. (steps per millisecond=13 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 714 ms. (steps per millisecond=14 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 768 ms. (steps per millisecond=13 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-19 00:45:39] [INFO ] Invariant cache hit.
[2023-03-19 00:45:41] [INFO ] After 390ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 00:45:41] [INFO ] [Nat]Absence check using 432 positive place invariants in 103 ms returned sat
[2023-03-19 00:45:48] [INFO ] After 2185ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-19 00:45:54] [INFO ] After 8309ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 2057 ms.
[2023-03-19 00:45:56] [INFO ] After 15519ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 144 steps, including 0 resets, run visited all 2 properties in 20 ms. (steps per millisecond=7 )
Parikh walk visited 2 properties in 23 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p0) p2 (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p2) (NOT p1))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1)))), (F (AND p0 p2 (NOT p1)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) p2 (NOT p1))))
Knowledge based reduction with 14 factoid took 421 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN12-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN12-LTLCardinality-14 finished in 632319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 24 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 00:45:57] [INFO ] Invariant cache hit.
[2023-03-19 00:45:58] [INFO ] Implicit Places using invariants in 841 ms returned []
[2023-03-19 00:45:58] [INFO ] Invariant cache hit.
[2023-03-19 00:46:00] [INFO ] Implicit Places using invariants and state equation in 1975 ms returned []
Implicit Place search using SMT with State Equation took 2838 ms to find 0 implicit places.
[2023-03-19 00:46:00] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-19 00:46:00] [INFO ] Invariant cache hit.
[2023-03-19 00:46:01] [INFO ] Dead Transitions using invariants and state equation in 997 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3917 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 49930 steps with 395 reset in 10001 ms.
Product exploration timeout after 49570 steps with 393 reset in 10002 ms.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
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 132 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Finished random walk after 72 steps, including 0 resets, run visited all 1 properties in 21 ms. (steps per millisecond=3 )
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 190 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2023-03-19 00:48:23] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 00:48:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 27 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 00:48:39] [INFO ] Invariant cache hit.
[2023-03-19 00:48:40] [INFO ] Implicit Places using invariants in 860 ms returned []
[2023-03-19 00:48:40] [INFO ] Invariant cache hit.
[2023-03-19 00:48:42] [INFO ] Implicit Places using invariants and state equation in 2031 ms returned []
Implicit Place search using SMT with State Equation took 2912 ms to find 0 implicit places.
[2023-03-19 00:48:42] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-19 00:48:42] [INFO ] Invariant cache hit.
[2023-03-19 00:48:43] [INFO ] Dead Transitions using invariants and state equation in 969 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3943 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
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 152 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 38 ms :[(NOT p0)]
Finished random walk after 72 steps, including 0 resets, run visited all 1 properties in 19 ms. (steps per millisecond=3 )
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 149 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2023-03-19 00:50:43] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 00:50:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration timeout after 50340 steps with 399 reset in 10002 ms.
Product exploration timeout after 50190 steps with 398 reset in 10004 ms.
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 21 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 00:51:18] [INFO ] Invariant cache hit.
[2023-03-19 00:51:19] [INFO ] Implicit Places using invariants in 815 ms returned []
[2023-03-19 00:51:19] [INFO ] Invariant cache hit.
[2023-03-19 00:51:21] [INFO ] Implicit Places using invariants and state equation in 1985 ms returned []
Implicit Place search using SMT with State Equation took 2835 ms to find 0 implicit places.
[2023-03-19 00:51:21] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-19 00:51:21] [INFO ] Invariant cache hit.
[2023-03-19 00:51:22] [INFO ] Dead Transitions using invariants and state equation in 989 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3891 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Treatment of property Sudoku-COL-AN12-LTLCardinality-15 finished in 325681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||X(X(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(X(X((X(G(p0))||(X(p0)&&F(p1)))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(F(p1)))||p0)))'
Found a Shortening insensitive property : Sudoku-COL-AN12-LTLCardinality-10
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 20 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 00:51:23] [INFO ] Invariant cache hit.
[2023-03-19 00:51:23] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-19 00:51:23] [INFO ] Invariant cache hit.
[2023-03-19 00:51:24] [INFO ] Implicit Places using invariants and state equation in 1063 ms returned []
Implicit Place search using SMT with State Equation took 1439 ms to find 0 implicit places.
[2023-03-19 00:51:24] [INFO ] Invariant cache hit.
[2023-03-19 00:51:25] [INFO ] Dead Transitions using invariants and state equation in 988 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2453 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (GT (ADD s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s17...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 34960 steps with 472 reset in 10002 ms.
Product exploration timeout after 34870 steps with 471 reset in 10001 ms.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 73 steps, including 0 resets, run visited all 1 properties in 21 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 234 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-19 00:56:46] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 3 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 00:57:01] [INFO ] Invariant cache hit.
[2023-03-19 00:57:01] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-03-19 00:57:01] [INFO ] Invariant cache hit.
[2023-03-19 00:57:02] [INFO ] Implicit Places using invariants and state equation in 1075 ms returned []
Implicit Place search using SMT with State Equation took 1419 ms to find 0 implicit places.
[2023-03-19 00:57:02] [INFO ] Invariant cache hit.
[2023-03-19 00:57:03] [INFO ] Dead Transitions using invariants and state equation in 1054 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2483 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 190 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 73 steps, including 0 resets, run visited all 1 properties in 21 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 193 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-19 01:01:56] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 33830 steps with 457 reset in 10001 ms.
Product exploration timeout after 33830 steps with 457 reset in 10003 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 21 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 01:02:32] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-19 01:02:32] [INFO ] Invariant cache hit.
[2023-03-19 01:02:33] [INFO ] Dead Transitions using invariants and state equation in 1036 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1114 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 5 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 01:02:33] [INFO ] Invariant cache hit.
[2023-03-19 01:02:33] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-19 01:02:33] [INFO ] Invariant cache hit.
[2023-03-19 01:02:34] [INFO ] Implicit Places using invariants and state equation in 1128 ms returned []
Implicit Place search using SMT with State Equation took 1479 ms to find 0 implicit places.
[2023-03-19 01:02:34] [INFO ] Invariant cache hit.
[2023-03-19 01:02:35] [INFO ] Dead Transitions using invariants and state equation in 977 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2462 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Treatment of property Sudoku-COL-AN12-LTLCardinality-10 finished in 672692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-19 01:02:36] [INFO ] Flatten gal took : 101 ms
[2023-03-19 01:02:36] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 8 ms.
[2023-03-19 01:02:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2160 places, 1728 transitions and 6912 arcs took 9 ms.
Total runtime 3217583 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2567/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15993244 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16064780 kB

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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023

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-AN12"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is Sudoku-COL-AN12, 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 r489-tall-167912706300091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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