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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.1K Feb 26 09:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 09:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 09:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 09:05 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 4.2K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 15K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 09:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 09:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 09:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K 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-AN11-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN11-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679183908841

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-AN11
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 23:58:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 23:58:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:58:30] [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-18 23:58:30] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 23:58:30] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 400 ms
[2023-03-18 23:58:30] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 1694 PT places and 1331.0 transition bindings in 204 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 23:58:31] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 5 ms.
[2023-03-18 23:58:31] [INFO ] Skeletonized 16 HLPN properties in 11 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-COL-AN11-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN11-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN11-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN11-LTLCardinality-14 FALSE 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 12 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 10085 steps, including 81 resets, run finished after 30 ms. (steps per millisecond=336 ) properties (out of 21) seen :17
Incomplete Best-First random walk after 10085 steps, including 81 resets, run finished after 15 ms. (steps per millisecond=672 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10085 steps, including 81 resets, run finished after 13 ms. (steps per millisecond=775 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10085 steps, including 81 resets, run finished after 13 ms. (steps per millisecond=775 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10085 steps, including 81 resets, run finished after 11 ms. (steps per millisecond=916 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1 rows 4 cols
[2023-03-18 23:58:31] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-18 23:58:31] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 23:58:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 23:58:31] [INFO ] After 39ms 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 0 ms.
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
[2023-03-18 23:58:31] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-18 23:58:31] [INFO ] Flatten gal took : 15 ms
[2023-03-18 23:58:31] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA Sudoku-COL-AN11-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN11-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 23:58:31] [INFO ] Flatten gal took : 2 ms
Domain [N(11), N(11)] of place Rows breaks symmetries in sort N
[2023-03-18 23:58:31] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 1331 transitions 5324 arcs in 37 ms.
[2023-03-18 23:58:31] [INFO ] Unfolded 10 HLPN properties in 1 ms.
Support contains 1694 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 23 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2023-03-18 23:58:31] [INFO ] Computed 363 place invariants in 31 ms
[2023-03-18 23:58:32] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-03-18 23:58:32] [INFO ] Invariant cache hit.
[2023-03-18 23:58:32] [INFO ] Implicit Places using invariants and state equation in 821 ms returned []
Implicit Place search using SMT with State Equation took 1217 ms to find 0 implicit places.
[2023-03-18 23:58:32] [INFO ] Invariant cache hit.
[2023-03-18 23:58:33] [INFO ] Dead Transitions using invariants and state equation in 796 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2042 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Support contains 1694 out of 1694 places after structural reductions.
[2023-03-18 23:58:33] [INFO ] Flatten gal took : 170 ms
[2023-03-18 23:58:34] [INFO ] Flatten gal took : 142 ms
[2023-03-18 23:58:34] [INFO ] Input system was already deterministic with 1331 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1616 ms. (steps per millisecond=6 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-18 23:58:37] [INFO ] Invariant cache hit.
[2023-03-18 23:58:37] [INFO ] [Real]Absence check using 363 positive place invariants in 111 ms returned sat
[2023-03-18 23:58:38] [INFO ] After 1380ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-18 23:58:39] [INFO ] [Nat]Absence check using 363 positive place invariants in 100 ms returned sat
[2023-03-18 23:58:41] [INFO ] After 1085ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :7
[2023-03-18 23:58:42] [INFO ] After 1761ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :7
Attempting to minimize the solution found.
Minimization took 375 ms.
[2023-03-18 23:58:42] [INFO ] After 4029ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :7
Fused 10 Parikh solutions to 1 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 7 properties in 12 ms. (steps per millisecond=10 )
Parikh walk visited 7 properties in 12 ms.
FORMULA Sudoku-COL-AN11-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 9 simplifications.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
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' '!(X(X(G(p0))))'
Support contains 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1331 places and 0 transitions.
Iterating post reduction 0 with 1331 rules applied. Total rules applied 1331 place count 363 transition count 1331
Applied a total of 1331 rules in 56 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2023-03-18 23:58:43] [INFO ] Computed 32 place invariants in 70 ms
[2023-03-18 23:58:43] [INFO ] Implicit Places using invariants in 363 ms returned []
[2023-03-18 23:58:43] [INFO ] Invariant cache hit.
[2023-03-18 23:58:45] [INFO ] Implicit Places using invariants and state equation in 1704 ms returned []
Implicit Place search using SMT with State Equation took 2069 ms to find 0 implicit places.
[2023-03-18 23:58:45] [INFO ] Invariant cache hit.
[2023-03-18 23:58:45] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2565 ms. Remains : 363/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 2 (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 944 reset in 9385 ms.
Product exploration explored 100000 steps with 945 reset in 9411 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 914 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 253855 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 253855 steps, saw 128402 distinct states, run finished after 3003 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 23:59:21] [INFO ] Invariant cache hit.
[2023-03-18 23:59:21] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 25 ms returned sat
[2023-03-18 23:59:21] [INFO ] After 321ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 23:59:21] [INFO ] After 381ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-18 23:59:21] [INFO ] After 510ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 120 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 12 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-18 23:59:22] [INFO ] Invariant cache hit.
[2023-03-18 23:59:22] [INFO ] Implicit Places using invariants in 258 ms returned []
[2023-03-18 23:59:22] [INFO ] Invariant cache hit.
[2023-03-18 23:59:23] [INFO ] Implicit Places using invariants and state equation in 1587 ms returned []
Implicit Place search using SMT with State Equation took 1857 ms to find 0 implicit places.
[2023-03-18 23:59:23] [INFO ] Invariant cache hit.
[2023-03-18 23:59:24] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2283 ms. Remains : 363/363 places, 1331/1331 transitions.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 898 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 258777 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 258777 steps, saw 129157 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 23:59:40] [INFO ] Invariant cache hit.
[2023-03-18 23:59:40] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 21 ms returned sat
[2023-03-18 23:59:41] [INFO ] After 314ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 23:59:41] [INFO ] After 387ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-18 23:59:41] [INFO ] After 500ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 120 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 946 reset in 9326 ms.
Product exploration explored 100000 steps with 945 reset in 9369 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 53 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 00:00:00] [INFO ] Redundant transitions in 85 ms returned []
[2023-03-19 00:00:00] [INFO ] Invariant cache hit.
[2023-03-19 00:00:01] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 598 ms. Remains : 363/363 places, 1331/1331 transitions.
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 26 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 00:00:01] [INFO ] Invariant cache hit.
[2023-03-19 00:00:01] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-19 00:00:01] [INFO ] Invariant cache hit.
[2023-03-19 00:00:02] [INFO ] Implicit Places using invariants and state equation in 1031 ms returned []
Implicit Place search using SMT with State Equation took 1281 ms to find 0 implicit places.
[2023-03-19 00:00:02] [INFO ] Invariant cache hit.
[2023-03-19 00:00:03] [INFO ] Dead Transitions using invariants and state equation in 415 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1724 ms. Remains : 363/363 places, 1331/1331 transitions.
Treatment of property Sudoku-COL-AN11-LTLCardinality-01 finished in 80293 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(p0)||F(p1))))'
Support contains 1694 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 8 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2023-03-19 00:00:03] [INFO ] Computed 363 place invariants in 6 ms
[2023-03-19 00:00:03] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-19 00:00:03] [INFO ] Invariant cache hit.
[2023-03-19 00:00:04] [INFO ] Implicit Places using invariants and state equation in 792 ms returned []
Implicit Place search using SMT with State Equation took 1110 ms to find 0 implicit places.
[2023-03-19 00:00:04] [INFO ] Invariant cache hit.
[2023-03-19 00:00:05] [INFO ] Dead Transitions using invariants and state equation in 713 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1832 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 3 (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148...], 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, null][false, false, false, false]]
Product exploration timeout after 48100 steps with 16033 reset in 10002 ms.
Product exploration timeout after 47880 steps with 15960 reset in 10001 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) (NOT p0)))))
Knowledge based reduction with 5 factoid took 110 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN11-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN11-LTLCardinality-03 finished in 138901 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(F(p0)))'
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 95 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 00:02:22] [INFO ] Invariant cache hit.
[2023-03-19 00:02:22] [INFO ] Implicit Places using invariants in 583 ms returned []
[2023-03-19 00:02:22] [INFO ] Invariant cache hit.
[2023-03-19 00:02:24] [INFO ] Implicit Places using invariants and state equation in 1383 ms returned []
Implicit Place search using SMT with State Equation took 1975 ms to find 0 implicit places.
[2023-03-19 00:02:24] [INFO ] Invariant cache hit.
[2023-03-19 00:02:24] [INFO ] Dead Transitions using invariants and state equation in 711 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2781 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], 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, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 61090 steps with 985 reset in 10001 ms.
Product exploration timeout after 60410 steps with 974 reset in 10001 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=5 )
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 159 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-19 00:03:39] [INFO ] Invariant cache hit.
[2023-03-19 00:03:50] [INFO ] [Real]Absence check using 363 positive place invariants in 167 ms returned sat
[2023-03-19 00:03:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:03:52] [INFO ] [Real]Absence check using state equation in 1567 ms returned sat
[2023-03-19 00:03:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:04:07] [INFO ] [Nat]Absence check using 363 positive place invariants in 4639 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 42 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 00:04:07] [INFO ] Invariant cache hit.
[2023-03-19 00:04:08] [INFO ] Implicit Places using invariants in 587 ms returned []
[2023-03-19 00:04:08] [INFO ] Invariant cache hit.
[2023-03-19 00:04:09] [INFO ] Implicit Places using invariants and state equation in 1403 ms returned []
Implicit Place search using SMT with State Equation took 1991 ms to find 0 implicit places.
[2023-03-19 00:04:09] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-19 00:04:09] [INFO ] Invariant cache hit.
[2023-03-19 00:04:10] [INFO ] Dead Transitions using invariants and state equation in 707 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2776 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
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 135 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=4 )
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 160 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-19 00:05:03] [INFO ] Invariant cache hit.
[2023-03-19 00:05:15] [INFO ] [Real]Absence check using 363 positive place invariants in 152 ms returned sat
[2023-03-19 00:05:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:05:16] [INFO ] [Real]Absence check using state equation in 1507 ms returned sat
[2023-03-19 00:05:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:05:31] [INFO ] [Nat]Absence check using 363 positive place invariants in 4680 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration timeout after 60770 steps with 980 reset in 10001 ms.
Product exploration timeout after 60600 steps with 977 reset in 10002 ms.
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 29 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 00:05:51] [INFO ] Invariant cache hit.
[2023-03-19 00:05:52] [INFO ] Implicit Places using invariants in 588 ms returned []
[2023-03-19 00:05:52] [INFO ] Invariant cache hit.
[2023-03-19 00:05:53] [INFO ] Implicit Places using invariants and state equation in 1490 ms returned []
Implicit Place search using SMT with State Equation took 2080 ms to find 0 implicit places.
[2023-03-19 00:05:53] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-19 00:05:53] [INFO ] Invariant cache hit.
[2023-03-19 00:05:54] [INFO ] Dead Transitions using invariants and state equation in 687 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2815 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Treatment of property Sudoku-COL-AN11-LTLCardinality-04 finished in 212522 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' '!(G((F(p0)&&F(G(p1)))))'
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 34 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 00:05:54] [INFO ] Invariant cache hit.
[2023-03-19 00:05:55] [INFO ] Implicit Places using invariants in 549 ms returned []
[2023-03-19 00:05:55] [INFO ] Invariant cache hit.
[2023-03-19 00:05:56] [INFO ] Implicit Places using invariants and state equation in 1337 ms returned []
Implicit Place search using SMT with State Equation took 1888 ms to find 0 implicit places.
[2023-03-19 00:05:56] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-19 00:05:56] [INFO ] Invariant cache hit.
[2023-03-19 00:05:57] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2632 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 83370 steps with 1538 reset in 10002 ms.
Product exploration timeout after 82090 steps with 1462 reset in 10001 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 281 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 923 ms. (steps per millisecond=10 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:07:12] [INFO ] Invariant cache hit.
[2023-03-19 00:07:12] [INFO ] [Real]Absence check using 363 positive place invariants in 93 ms returned sat
[2023-03-19 00:07:13] [INFO ] After 960ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:07:13] [INFO ] [Nat]Absence check using 363 positive place invariants in 79 ms returned sat
[2023-03-19 00:07:15] [INFO ] After 757ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:07:15] [INFO ] After 857ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-19 00:07:15] [INFO ] After 1676ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 120 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 350 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-19 00:07:16] [INFO ] Invariant cache hit.
[2023-03-19 00:07:24] [INFO ] [Real]Absence check using 363 positive place invariants in 138 ms returned sat
[2023-03-19 00:07:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:07:25] [INFO ] [Real]Absence check using state equation in 1138 ms returned sat
[2023-03-19 00:07:25] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 53 ms.
[2023-03-19 00:07:26] [INFO ] Added : 0 causal constraints over 0 iterations in 173 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 21 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 00:07:26] [INFO ] Invariant cache hit.
[2023-03-19 00:07:26] [INFO ] Implicit Places using invariants in 573 ms returned []
[2023-03-19 00:07:26] [INFO ] Invariant cache hit.
[2023-03-19 00:07:28] [INFO ] Implicit Places using invariants and state equation in 1448 ms returned []
Implicit Place search using SMT with State Equation took 2023 ms to find 0 implicit places.
[2023-03-19 00:07:28] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-19 00:07:28] [INFO ] Invariant cache hit.
[2023-03-19 00:07:28] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2777 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 237 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 870 ms. (steps per millisecond=11 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:08:22] [INFO ] Invariant cache hit.
[2023-03-19 00:08:22] [INFO ] [Real]Absence check using 363 positive place invariants in 80 ms returned sat
[2023-03-19 00:08:23] [INFO ] After 893ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:08:23] [INFO ] [Nat]Absence check using 363 positive place invariants in 77 ms returned sat
[2023-03-19 00:08:24] [INFO ] After 739ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:08:25] [INFO ] After 835ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-19 00:08:25] [INFO ] After 1601ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 120 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 251 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-19 00:08:25] [INFO ] Invariant cache hit.
[2023-03-19 00:08:34] [INFO ] [Real]Absence check using 363 positive place invariants in 148 ms returned sat
[2023-03-19 00:08:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:08:35] [INFO ] [Real]Absence check using state equation in 1257 ms returned sat
[2023-03-19 00:08:35] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 48 ms.
[2023-03-19 00:08:35] [INFO ] Added : 0 causal constraints over 0 iterations in 175 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration timeout after 84680 steps with 1614 reset in 10002 ms.
Product exploration timeout after 85530 steps with 1617 reset in 10003 ms.
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 20 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 00:08:55] [INFO ] Invariant cache hit.
[2023-03-19 00:08:56] [INFO ] Implicit Places using invariants in 580 ms returned []
[2023-03-19 00:08:56] [INFO ] Invariant cache hit.
[2023-03-19 00:08:57] [INFO ] Implicit Places using invariants and state equation in 1320 ms returned []
Implicit Place search using SMT with State Equation took 1903 ms to find 0 implicit places.
[2023-03-19 00:08:57] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-19 00:08:57] [INFO ] Invariant cache hit.
[2023-03-19 00:08:58] [INFO ] Dead Transitions using invariants and state equation in 710 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2653 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Treatment of property Sudoku-COL-AN11-LTLCardinality-05 finished in 183883 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 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.7 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 26 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2023-03-19 00:08:58] [INFO ] Computed 32 place invariants in 29 ms
[2023-03-19 00:08:58] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-19 00:08:58] [INFO ] Invariant cache hit.
[2023-03-19 00:08:59] [INFO ] Implicit Places using invariants and state equation in 1007 ms returned []
Implicit Place search using SMT with State Equation took 1309 ms to find 0 implicit places.
[2023-03-19 00:08:59] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-19 00:08:59] [INFO ] Invariant cache hit.
[2023-03-19 00:09:00] [INFO ] Dead Transitions using invariants and state equation in 456 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1813 ms. Remains : 363/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-07 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 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 945 reset in 8767 ms.
Product exploration explored 100000 steps with 946 reset in 8783 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 134 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)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 854 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 272764 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 272764 steps, saw 131141 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:09:34] [INFO ] Invariant cache hit.
[2023-03-19 00:09:34] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 20 ms returned sat
[2023-03-19 00:09:34] [INFO ] After 297ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 00:09:34] [INFO ] After 360ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-19 00:09:34] [INFO ] After 472ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 119 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 217 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 17 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 00:09:35] [INFO ] Invariant cache hit.
[2023-03-19 00:09:35] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-19 00:09:35] [INFO ] Invariant cache hit.
[2023-03-19 00:09:37] [INFO ] Implicit Places using invariants and state equation in 2198 ms returned []
Implicit Place search using SMT with State Equation took 2420 ms to find 0 implicit places.
[2023-03-19 00:09:37] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-19 00:09:37] [INFO ] Invariant cache hit.
[2023-03-19 00:09:37] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2842 ms. Remains : 363/363 places, 1331/1331 transitions.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 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 24 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 849 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 256768 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 256768 steps, saw 128860 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:09:54] [INFO ] Invariant cache hit.
[2023-03-19 00:09:54] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 19 ms returned sat
[2023-03-19 00:09:54] [INFO ] After 316ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 00:09:54] [INFO ] After 374ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-19 00:09:54] [INFO ] After 488ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 119 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 947 reset in 8683 ms.
Product exploration explored 100000 steps with 945 reset in 8796 ms.
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 13 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 00:10:12] [INFO ] Invariant cache hit.
[2023-03-19 00:10:12] [INFO ] Implicit Places using invariants in 241 ms returned []
[2023-03-19 00:10:12] [INFO ] Invariant cache hit.
[2023-03-19 00:10:13] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned []
Implicit Place search using SMT with State Equation took 1253 ms to find 0 implicit places.
[2023-03-19 00:10:13] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-19 00:10:13] [INFO ] Invariant cache hit.
[2023-03-19 00:10:14] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1695 ms. Remains : 363/363 places, 1331/1331 transitions.
Treatment of property Sudoku-COL-AN11-LTLCardinality-07 finished in 75756 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)) U p1))'
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 19 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2023-03-19 00:10:14] [INFO ] Computed 363 place invariants in 9 ms
[2023-03-19 00:10:14] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-19 00:10:14] [INFO ] Invariant cache hit.
[2023-03-19 00:10:15] [INFO ] Implicit Places using invariants and state equation in 1057 ms returned []
Implicit Place search using SMT with State Equation took 1474 ms to find 0 implicit places.
[2023-03-19 00:10:15] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-19 00:10:15] [INFO ] Invariant cache hit.
[2023-03-19 00:10:16] [INFO ] Dead Transitions using invariants and state equation in 666 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2181 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ (ADD s1573 s1574 s1575 s1576 s1577 s1578 s1579 s1580 s1581 s1582 s1583 s1584 s1585 s1586 s1587 s1588 s1589 s1590 s1591 s1592 s1593 s1594 s1595 s15...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 945 reset in 8859 ms.
Product exploration explored 100000 steps with 945 reset in 8999 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 249 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 861 ms. (steps per millisecond=11 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:11:31] [INFO ] Invariant cache hit.
[2023-03-19 00:11:31] [INFO ] [Real]Absence check using 363 positive place invariants in 78 ms returned sat
[2023-03-19 00:11:56] [INFO ] After 25015ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.1 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 363/1694 places, 1331/1331 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 838 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 270227 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 270227 steps, saw 130427 distinct states, run finished after 3001 ms. (steps per millisecond=90 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1331 rows 363 cols
[2023-03-19 00:12:00] [INFO ] Computed 32 place invariants in 37 ms
[2023-03-19 00:12:00] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 17 ms returned sat
[2023-03-19 00:12:00] [INFO ] After 588ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:12:00] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 16 ms returned sat
[2023-03-19 00:12:01] [INFO ] After 438ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:12:01] [INFO ] After 489ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-19 00:12:01] [INFO ] After 590ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 387 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (NOT p0)]
// Phase 1: matrix 1331 rows 1694 cols
[2023-03-19 00:12:02] [INFO ] Computed 363 place invariants in 23 ms
[2023-03-19 00:12:11] [INFO ] [Real]Absence check using 363 positive place invariants in 157 ms returned sat
[2023-03-19 00:12:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:12:12] [INFO ] [Real]Absence check using state equation in 1592 ms returned sat
[2023-03-19 00:12:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:12:24] [INFO ] [Nat]Absence check using 363 positive place invariants in 3756 ms returned sat
[2023-03-19 00:12:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:12:27] [INFO ] [Nat]Absence check using state equation in 2863 ms returned unknown
Could not prove EG (NOT p1)
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 25 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 00:12:27] [INFO ] Invariant cache hit.
[2023-03-19 00:12:28] [INFO ] Implicit Places using invariants in 379 ms returned []
[2023-03-19 00:12:28] [INFO ] Invariant cache hit.
[2023-03-19 00:12:29] [INFO ] Implicit Places using invariants and state equation in 1005 ms returned []
Implicit Place search using SMT with State Equation took 1386 ms to find 0 implicit places.
[2023-03-19 00:12:29] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-19 00:12:29] [INFO ] Invariant cache hit.
[2023-03-19 00:12:29] [INFO ] Dead Transitions using invariants and state equation in 660 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2103 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 272 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 874 ms. (steps per millisecond=11 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:13:26] [INFO ] Invariant cache hit.
[2023-03-19 00:13:26] [INFO ] [Real]Absence check using 363 positive place invariants in 82 ms returned sat
[2023-03-19 00:13:51] [INFO ] After 25017ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.1 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 20 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 363/1694 places, 1331/1331 transitions.
Incomplete random walk after 10000 steps, including 95 resets, run finished after 882 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 255704 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 255704 steps, saw 128645 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1331 rows 363 cols
[2023-03-19 00:13:55] [INFO ] Computed 32 place invariants in 30 ms
[2023-03-19 00:13:55] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 19 ms returned sat
[2023-03-19 00:13:56] [INFO ] After 632ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:13:56] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 18 ms returned sat
[2023-03-19 00:13:56] [INFO ] After 439ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:13:56] [INFO ] After 489ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-19 00:13:57] [INFO ] After 610ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 280 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (NOT p0)]
// Phase 1: matrix 1331 rows 1694 cols
[2023-03-19 00:13:57] [INFO ] Computed 363 place invariants in 11 ms
[2023-03-19 00:14:06] [INFO ] [Real]Absence check using 363 positive place invariants in 157 ms returned sat
[2023-03-19 00:14:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:14:08] [INFO ] [Real]Absence check using state equation in 1632 ms returned sat
[2023-03-19 00:14:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:14:22] [INFO ] [Nat]Absence check using 363 positive place invariants in 4969 ms returned sat
[2023-03-19 00:14:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 00:14:23] [INFO ] [Nat]Absence check using state equation in 1497 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 946 reset in 8863 ms.
Product exploration explored 100000 steps with 946 reset in 8956 ms.
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 18 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 00:14:41] [INFO ] Invariant cache hit.
[2023-03-19 00:14:41] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-19 00:14:41] [INFO ] Invariant cache hit.
[2023-03-19 00:14:42] [INFO ] Implicit Places using invariants and state equation in 1052 ms returned []
Implicit Place search using SMT with State Equation took 1432 ms to find 0 implicit places.
[2023-03-19 00:14:42] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-19 00:14:42] [INFO ] Invariant cache hit.
[2023-03-19 00:14:43] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2124 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Treatment of property Sudoku-COL-AN11-LTLCardinality-08 finished in 269349 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 (p1&&F(G(p1)))))'
Support contains 1573 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 12 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 00:14:43] [INFO ] Invariant cache hit.
[2023-03-19 00:14:44] [INFO ] Implicit Places using invariants in 380 ms returned []
[2023-03-19 00:14:44] [INFO ] Invariant cache hit.
[2023-03-19 00:14:45] [INFO ] Implicit Places using invariants and state equation in 1039 ms returned []
Implicit Place search using SMT with State Equation took 1421 ms to find 0 implicit places.
[2023-03-19 00:14:45] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-19 00:14:45] [INFO ] Invariant cache hit.
[2023-03-19 00:14:45] [INFO ] Dead Transitions using invariants and state equation in 655 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2112 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ (ADD s1573 s1574 s1575 s1576 s1577 s1578 s1579 s1580 s1581 s1582 s1583 s1584 s1585 s1586 s1587 s1588 s1589 s1590 s1591 s1592 s1593 s1594 s1595 s15...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 60900 steps with 576 reset in 10002 ms.
Product exploration timeout after 59230 steps with 560 reset in 10001 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 371 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1216 ms. (steps per millisecond=8 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 398 ms. (steps per millisecond=25 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:17:35] [INFO ] Invariant cache hit.
[2023-03-19 00:17:36] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:17:36] [INFO ] [Nat]Absence check using 363 positive place invariants in 84 ms returned sat
[2023-03-19 00:17:36] [INFO ] After 338ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (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 (NOT (AND (NOT p1) p0))), (F p1)]
Knowledge based reduction with 11 factoid took 443 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
[2023-03-19 00:17:37] [INFO ] Invariant cache hit.
[2023-03-19 00:17:46] [INFO ] [Real]Absence check using 363 positive place invariants in 162 ms returned sat
[2023-03-19 00:17:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:17:48] [INFO ] [Real]Absence check using state equation in 1471 ms returned sat
[2023-03-19 00:17:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:18:03] [INFO ] [Nat]Absence check using 363 positive place invariants in 6105 ms returned unknown
Could not prove EG (NOT p1)
Support contains 1452 out of 1694 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 29 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 00:18:03] [INFO ] Invariant cache hit.
[2023-03-19 00:18:03] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-03-19 00:18:03] [INFO ] Invariant cache hit.
[2023-03-19 00:18:04] [INFO ] Implicit Places using invariants and state equation in 1126 ms returned []
Implicit Place search using SMT with State Equation took 1526 ms to find 0 implicit places.
[2023-03-19 00:18:04] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-19 00:18:04] [INFO ] Invariant cache hit.
[2023-03-19 00:18:05] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2275 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 162 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 p1)]
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 164 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 41 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
[2023-03-19 00:18:59] [INFO ] Invariant cache hit.
[2023-03-19 00:19:09] [INFO ] [Real]Absence check using 363 positive place invariants in 148 ms returned sat
[2023-03-19 00:19:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:19:10] [INFO ] [Real]Absence check using state equation in 1368 ms returned sat
[2023-03-19 00:19:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:19:25] [INFO ] [Nat]Absence check using 363 positive place invariants in 6384 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 45 ms :[(NOT p1)]
Product exploration timeout after 71250 steps with 674 reset in 10002 ms.
Product exploration timeout after 70770 steps with 669 reset in 10002 ms.
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 16 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 00:19:45] [INFO ] Invariant cache hit.
[2023-03-19 00:19:46] [INFO ] Implicit Places using invariants in 544 ms returned []
[2023-03-19 00:19:46] [INFO ] Invariant cache hit.
[2023-03-19 00:19:47] [INFO ] Implicit Places using invariants and state equation in 1355 ms returned []
Implicit Place search using SMT with State Equation took 1900 ms to find 0 implicit places.
[2023-03-19 00:19:47] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-19 00:19:47] [INFO ] Invariant cache hit.
[2023-03-19 00:19:48] [INFO ] Dead Transitions using invariants and state equation in 662 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2599 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Treatment of property Sudoku-COL-AN11-LTLCardinality-10 finished in 304643 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 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.1 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 20 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2023-03-19 00:19:48] [INFO ] Computed 32 place invariants in 30 ms
[2023-03-19 00:19:48] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-03-19 00:19:48] [INFO ] Invariant cache hit.
[2023-03-19 00:19:49] [INFO ] Implicit Places using invariants and state equation in 1039 ms returned []
Implicit Place search using SMT with State Equation took 1326 ms to find 0 implicit places.
[2023-03-19 00:19:49] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-19 00:19:49] [INFO ] Invariant cache hit.
[2023-03-19 00:19:50] [INFO ] Dead Transitions using invariants and state equation in 430 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1807 ms. Remains : 363/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-13 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 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 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 945 reset in 8670 ms.
Product exploration explored 100000 steps with 944 reset in 8748 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 843 ms. (steps per millisecond=11 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 269805 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 269805 steps, saw 130406 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:20:23] [INFO ] Invariant cache hit.
[2023-03-19 00:20:23] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 18 ms returned sat
[2023-03-19 00:20:24] [INFO ] After 294ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 00:20:24] [INFO ] After 340ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-19 00:20:24] [INFO ] After 452ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 119 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 145 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 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 15 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 00:20:24] [INFO ] Invariant cache hit.
[2023-03-19 00:20:24] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-19 00:20:24] [INFO ] Invariant cache hit.
[2023-03-19 00:20:25] [INFO ] Implicit Places using invariants and state equation in 1053 ms returned []
Implicit Place search using SMT with State Equation took 1294 ms to find 0 implicit places.
[2023-03-19 00:20:25] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-19 00:20:25] [INFO ] Invariant cache hit.
[2023-03-19 00:20:26] [INFO ] Dead Transitions using invariants and state equation in 376 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1706 ms. Remains : 363/363 places, 1331/1331 transitions.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 140 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 25 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 860 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 253884 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 253884 steps, saw 128415 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:20:42] [INFO ] Invariant cache hit.
[2023-03-19 00:20:42] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 20 ms returned sat
[2023-03-19 00:20:42] [INFO ] After 323ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 00:20:42] [INFO ] After 383ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-19 00:20:42] [INFO ] After 505ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 119 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
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 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 946 reset in 8852 ms.
Product exploration explored 100000 steps with 945 reset in 8794 ms.
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 10 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 00:21:00] [INFO ] Invariant cache hit.
[2023-03-19 00:21:01] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-19 00:21:01] [INFO ] Invariant cache hit.
[2023-03-19 00:21:02] [INFO ] Implicit Places using invariants and state equation in 979 ms returned []
Implicit Place search using SMT with State Equation took 1223 ms to find 0 implicit places.
[2023-03-19 00:21:02] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-19 00:21:02] [INFO ] Invariant cache hit.
[2023-03-19 00:21:02] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1634 ms. Remains : 363/363 places, 1331/1331 transitions.
Treatment of property Sudoku-COL-AN11-LTLCardinality-13 finished in 74273 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' '!(G((F(p0)&&F(p1))))'
Support contains 1694 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 11 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2023-03-19 00:21:02] [INFO ] Computed 363 place invariants in 7 ms
[2023-03-19 00:21:02] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-03-19 00:21:02] [INFO ] Invariant cache hit.
[2023-03-19 00:21:03] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 998 ms to find 0 implicit places.
[2023-03-19 00:21:03] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-19 00:21:03] [INFO ] Invariant cache hit.
[2023-03-19 00:21:04] [INFO ] Dead Transitions using invariants and state equation in 680 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1709 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 (ADD s1573 s1574 s1575 s1576 s1577 s1578 s1579 s1580 s1581 s1582 s1583 s1584 s1585 s1586 s1587 s1588 s1589 s1590 s1591 s1592 s1593 s1594 s1595 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 15 ms.
FORMULA Sudoku-COL-AN11-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN11-LTLCardinality-15 finished in 1844 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))))'
Found a Lengthening insensitive property : Sudoku-COL-AN11-LTLCardinality-01
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.5 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 24 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2023-03-19 00:21:04] [INFO ] Computed 32 place invariants in 30 ms
[2023-03-19 00:21:04] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-19 00:21:04] [INFO ] Invariant cache hit.
[2023-03-19 00:21:06] [INFO ] Implicit Places using invariants and state equation in 1039 ms returned []
Implicit Place search using SMT with State Equation took 1314 ms to find 0 implicit places.
[2023-03-19 00:21:06] [INFO ] Invariant cache hit.
[2023-03-19 00:21:06] [INFO ] Dead Transitions using invariants and state equation in 398 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1739 ms. Remains : 363/1694 places, 1331/1331 transitions.
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 2 (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 946 reset in 8750 ms.
Product exploration explored 100000 steps with 946 reset in 8807 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 856 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 268785 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 268785 steps, saw 130346 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:21:40] [INFO ] Invariant cache hit.
[2023-03-19 00:21:40] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 20 ms returned sat
[2023-03-19 00:21:40] [INFO ] After 316ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 00:21:40] [INFO ] After 367ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-19 00:21:40] [INFO ] After 484ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 120 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 15 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 00:21:40] [INFO ] Invariant cache hit.
[2023-03-19 00:21:41] [INFO ] Implicit Places using invariants in 240 ms returned []
[2023-03-19 00:21:41] [INFO ] Invariant cache hit.
[2023-03-19 00:21:42] [INFO ] Implicit Places using invariants and state equation in 1140 ms returned []
Implicit Place search using SMT with State Equation took 1382 ms to find 0 implicit places.
[2023-03-19 00:21:42] [INFO ] Invariant cache hit.
[2023-03-19 00:21:42] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1800 ms. Remains : 363/363 places, 1331/1331 transitions.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 885 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 258317 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 258317 steps, saw 129093 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:21:59] [INFO ] Invariant cache hit.
[2023-03-19 00:21:59] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 20 ms returned sat
[2023-03-19 00:21:59] [INFO ] After 311ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-19 00:21:59] [INFO ] After 361ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-19 00:21:59] [INFO ] After 471ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 120 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 946 reset in 8837 ms.
Product exploration explored 100000 steps with 946 reset in 8855 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 19 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 00:22:18] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-19 00:22:18] [INFO ] Invariant cache hit.
[2023-03-19 00:22:18] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 422 ms. Remains : 363/363 places, 1331/1331 transitions.
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 9 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 00:22:18] [INFO ] Invariant cache hit.
[2023-03-19 00:22:18] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-03-19 00:22:18] [INFO ] Invariant cache hit.
[2023-03-19 00:22:19] [INFO ] Implicit Places using invariants and state equation in 1006 ms returned []
Implicit Place search using SMT with State Equation took 1236 ms to find 0 implicit places.
[2023-03-19 00:22:19] [INFO ] Invariant cache hit.
[2023-03-19 00:22:20] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1666 ms. Remains : 363/363 places, 1331/1331 transitions.
Treatment of property Sudoku-COL-AN11-LTLCardinality-01 finished in 75978 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(F(p0)))'
Found a Shortening insensitive property : Sudoku-COL-AN11-LTLCardinality-04
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 18 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2023-03-19 00:22:20] [INFO ] Computed 363 place invariants in 5 ms
[2023-03-19 00:22:21] [INFO ] Implicit Places using invariants in 567 ms returned []
[2023-03-19 00:22:21] [INFO ] Invariant cache hit.
[2023-03-19 00:22:22] [INFO ] Implicit Places using invariants and state equation in 1472 ms returned []
Implicit Place search using SMT with State Equation took 2042 ms to find 0 implicit places.
[2023-03-19 00:22:22] [INFO ] Invariant cache hit.
[2023-03-19 00:22:23] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2753 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Running random walk in product with property : Sudoku-COL-AN11-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], 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, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration timeout after 62520 steps with 1008 reset in 10002 ms.
Product exploration timeout after 61820 steps with 997 reset in 10001 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
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 123 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=4 )
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 165 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2023-03-19 00:23:36] [INFO ] Invariant cache hit.
[2023-03-19 00:23:47] [INFO ] [Real]Absence check using 363 positive place invariants in 153 ms returned sat
[2023-03-19 00:23:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:23:49] [INFO ] [Real]Absence check using state equation in 1550 ms returned sat
[2023-03-19 00:23:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:24:04] [INFO ] [Nat]Absence check using 363 positive place invariants in 4978 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 27 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 00:24:04] [INFO ] Invariant cache hit.
[2023-03-19 00:24:05] [INFO ] Implicit Places using invariants in 572 ms returned []
[2023-03-19 00:24:05] [INFO ] Invariant cache hit.
[2023-03-19 00:24:06] [INFO ] Implicit Places using invariants and state equation in 1412 ms returned []
Implicit Place search using SMT with State Equation took 1989 ms to find 0 implicit places.
[2023-03-19 00:24:06] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-19 00:24:06] [INFO ] Invariant cache hit.
[2023-03-19 00:24:07] [INFO ] Dead Transitions using invariants and state equation in 676 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2719 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
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 176 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=5 )
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 170 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2023-03-19 00:25:00] [INFO ] Invariant cache hit.
[2023-03-19 00:25:11] [INFO ] [Real]Absence check using 363 positive place invariants in 134 ms returned sat
[2023-03-19 00:25:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 00:25:13] [INFO ] [Real]Absence check using state equation in 1511 ms returned sat
[2023-03-19 00:25:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 00:25:28] [INFO ] [Nat]Absence check using 363 positive place invariants in 4693 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration timeout after 60500 steps with 975 reset in 10001 ms.
Product exploration timeout after 60030 steps with 968 reset in 10001 ms.
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 16 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 00:25:48] [INFO ] Invariant cache hit.
[2023-03-19 00:25:49] [INFO ] Implicit Places using invariants in 605 ms returned []
[2023-03-19 00:25:49] [INFO ] Invariant cache hit.
[2023-03-19 00:25:50] [INFO ] Implicit Places using invariants and state equation in 1390 ms returned []
Implicit Place search using SMT with State Equation took 1997 ms to find 0 implicit places.
[2023-03-19 00:25:50] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-19 00:25:50] [INFO ] Invariant cache hit.
[2023-03-19 00:25:51] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2722 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Treatment of property Sudoku-COL-AN11-LTLCardinality-04 finished in 210746 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' '!(G((F(p0)&&F(G(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(G(p0)) U 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 (p1&&F(G(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)))'
[2023-03-19 00:25:51] [INFO ] Flatten gal took : 84 ms
[2023-03-19 00:25:51] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2023-03-19 00:25:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1694 places, 1331 transitions and 5324 arcs took 7 ms.
Total runtime 1641470 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2416/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 510 seconds
MemTotal: 16393216 kB
MemFree: 16051840 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16109512 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2416/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 510 seconds
MemTotal: 16393216 kB
MemFree: 15986472 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16067704 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2416/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 510 seconds
MemTotal: 16393216 kB
MemFree: 15983788 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16063192 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2416/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 16001064 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16062224 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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-AN11"
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-AN11, 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-167912706300083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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