Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r254-tall-162106746000413.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Sudoku-COL-AN03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106746000413
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 300K
-rw-r--r-- 1 mcc users 9.6K May 15 08:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 15 08:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 15 08:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 15 08:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 13 19:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 13 19:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 19:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:52 equiv_pt
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 5 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 6.5K May 5 16:52 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-AN03-00
FORMULA_NAME Sudoku-COL-AN03-01
FORMULA_NAME Sudoku-COL-AN03-02
FORMULA_NAME Sudoku-COL-AN03-03
FORMULA_NAME Sudoku-COL-AN03-04
FORMULA_NAME Sudoku-COL-AN03-05
FORMULA_NAME Sudoku-COL-AN03-06
FORMULA_NAME Sudoku-COL-AN03-07
FORMULA_NAME Sudoku-COL-AN03-08
FORMULA_NAME Sudoku-COL-AN03-09
FORMULA_NAME Sudoku-COL-AN03-10
FORMULA_NAME Sudoku-COL-AN03-11
FORMULA_NAME Sudoku-COL-AN03-12
FORMULA_NAME Sudoku-COL-AN03-13
FORMULA_NAME Sudoku-COL-AN03-14
FORMULA_NAME Sudoku-COL-AN03-15

=== Now, execution of the tool begins

BK_START 1621194197046

Running Version 0
[2021-05-16 19:43:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-16 19:43:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 19:43:18] [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.
[2021-05-16 19:43:19] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-16 19:43:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 485 ms
[2021-05-16 19:43:19] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition select
[2021-05-16 19:43:19] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 54 PT places and 27.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 19:43:19] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions in 31 ms.
[2021-05-16 19:43:19] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_6211632068492362013.dot
[2021-05-16 19:43:19] [INFO ] Initial state test concluded for 2 properties.
FORMULA Sudoku-COL-AN03-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2021-05-16 19:43:19] [INFO ] Flatten gal took : 13 ms
[2021-05-16 19:43:19] [INFO ] Flatten gal took : 1 ms
[2021-05-16 19:43:19] [INFO ] Unfolded HLPN to a Petri net with 54 places and 27 transitions in 4 ms.
[2021-05-16 19:43:19] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_2844777558656919451.dot
[2021-05-16 19:43:19] [INFO ] Initial state test concluded for 2 properties.
FORMULA Sudoku-COL-AN03-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 27/27 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 27 transition count 27
Applied a total of 27 rules in 51 ms. Remains 27 /54 variables (removed 27) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:19] [INFO ] Computed 8 place invariants in 8 ms
[2021-05-16 19:43:19] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:19] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-16 19:43:19] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:19] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 19:43:19] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/54 places, 27/27 transitions.
[2021-05-16 19:43:19] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-16 19:43:19] [INFO ] Flatten gal took : 16 ms
FORMULA Sudoku-COL-AN03-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 19:43:19] [INFO ] Flatten gal took : 11 ms
[2021-05-16 19:43:20] [INFO ] Input system was already deterministic with 27 transitions.
Finished random walk after 10 steps, including 1 resets, run visited all 2 properties in 1 ms. (steps per millisecond=10 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:20] [INFO ] Computed 8 place invariants in 4 ms
[2021-05-16 19:43:20] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:20] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-16 19:43:20] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:20] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 19:43:20] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN03-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s18 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s20 1)) (AND (GEQ s4 1) (GEQ s12 1) (GEQ s19 1)) (AND (GEQ s6 1) (GEQ s17 1) (GEQ s24 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s25 1)) (AND (GEQ s4 1) (GEQ s14 1) (GEQ s25 1)) (AND (GEQ s6 1) (GEQ s15 1) (GEQ s18 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s14 1) (GEQ s24 1)) (AND (GEQ s5 1) (GEQ s13 1) (GEQ s23 1)) (AND (GEQ s8 1) (GEQ s17 1) (GEQ s26 1)) (AND (GEQ s5 1) (GEQ s12 1) (GEQ s20 1)) (AND (GEQ s7 1) (GEQ s16 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s21 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s26 1)) (AND (GEQ s7 1) (GEQ s17 1) (GEQ s25 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s7 1) (GEQ s15 1) (GEQ s19 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s24 1)) (AND (GEQ s3 1) (GEQ s12 1) (GEQ s18 1)) (AND (GEQ s8 1) (GEQ s15 1) (GEQ s20 1)) (AND (GEQ s6 1) (GEQ s16 1) (GEQ s21 1)) (AND (GEQ s5 1) (GEQ s14 1) (GEQ s26 1)) (AND (GEQ s4 1) (GEQ s13 1) (GEQ s22 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 334 ms.
Product exploration explored 100000 steps with 50000 reset in 267 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 27
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 : [(F (G (NOT p0))), p0]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 205 ms.
Product exploration explored 100000 steps with 50000 reset in 202 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Support contains 27 out of 27 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2021-05-16 19:43:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:21] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-16 19:43:21] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Product exploration explored 100000 steps with 50000 reset in 345 ms.
Product exploration explored 100000 steps with 50000 reset in 300 ms.
[2021-05-16 19:43:22] [INFO ] Flatten gal took : 4 ms
[2021-05-16 19:43:22] [INFO ] Flatten gal took : 4 ms
[2021-05-16 19:43:22] [INFO ] Time to serialize gal into /tmp/LTL15208222650579363343.gal : 1 ms
[2021-05-16 19:43:22] [INFO ] Time to serialize properties into /tmp/LTL908213853203986962.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15208222650579363343.gal, -t, CGAL, -LTL, /tmp/LTL908213853203986962.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15208222650579363343.gal -t CGAL -LTL /tmp/LTL908213853203986962.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(((((((((((((((((((((((((((((Rows_8>=1)&&(Cells_7>=1))&&(Columns_5>=1))||(((Rows_0>=1)&&(Cells_0>=1))&&(Columns_0>=1)))||(((Rows_2>=1)&&(Cells_0>=1))&&(Columns_2>=1)))||(((Rows_4>=1)&&(Cells_3>=1))&&(Columns_1>=1)))||(((Rows_6>=1)&&(Cells_8>=1))&&(Columns_6>=1)))||(((Rows_1>=1)&&(Cells_2>=1))&&(Columns_7>=1)))||(((Rows_4>=1)&&(Cells_5>=1))&&(Columns_7>=1)))||(((Rows_6>=1)&&(Cells_6>=1))&&(Columns_0>=1)))||(((Rows_1>=1)&&(Cells_1>=1))&&(Columns_4>=1)))||(((Rows_3>=1)&&(Cells_5>=1))&&(Columns_6>=1)))||(((Rows_5>=1)&&(Cells_4>=1))&&(Columns_5>=1)))||(((Rows_8>=1)&&(Cells_8>=1))&&(Columns_8>=1)))||(((Rows_5>=1)&&(Cells_3>=1))&&(Columns_2>=1)))||(((Rows_7>=1)&&(Cells_7>=1))&&(Columns_4>=1)))||(((Rows_3>=1)&&(Cells_4>=1))&&(Columns_3>=1)))||(((Rows_2>=1)&&(Cells_2>=1))&&(Columns_8>=1)))||(((Rows_7>=1)&&(Cells_8>=1))&&(Columns_7>=1)))||(((Rows_1>=1)&&(Cells_0>=1))&&(Columns_1>=1)))||(((Rows_7>=1)&&(Cells_6>=1))&&(Columns_1>=1)))||(((Rows_2>=1)&&(Cells_1>=1))&&(Columns_5>=1)))||(((Rows_0>=1)&&(Cells_1>=1))&&(Columns_3>=1)))||(((Rows_0>=1)&&(Cells_2>=1))&&(Columns_6>=1)))||(((Rows_3>=1)&&(Cells_3>=1))&&(Columns_0>=1)))||(((Rows_8>=1)&&(Cells_6>=1))&&(Columns_2>=1)))||(((Rows_6>=1)&&(Cells_7>=1))&&(Columns_3>=1)))||(((Rows_5>=1)&&(Cells_5>=1))&&(Columns_8>=1)))||(((Rows_4>=1)&&(Cells_4>=1))&&(Columns_4>=1)))"))))
Formula 0 simplified : !XF"(((((((((((((((((((((((((((((Rows_8>=1)&&(Cells_7>=1))&&(Columns_5>=1))||(((Rows_0>=1)&&(Cells_0>=1))&&(Columns_0>=1)))||(((Rows_2>=1)&&(Cells_0>=1))&&(Columns_2>=1)))||(((Rows_4>=1)&&(Cells_3>=1))&&(Columns_1>=1)))||(((Rows_6>=1)&&(Cells_8>=1))&&(Columns_6>=1)))||(((Rows_1>=1)&&(Cells_2>=1))&&(Columns_7>=1)))||(((Rows_4>=1)&&(Cells_5>=1))&&(Columns_7>=1)))||(((Rows_6>=1)&&(Cells_6>=1))&&(Columns_0>=1)))||(((Rows_1>=1)&&(Cells_1>=1))&&(Columns_4>=1)))||(((Rows_3>=1)&&(Cells_5>=1))&&(Columns_6>=1)))||(((Rows_5>=1)&&(Cells_4>=1))&&(Columns_5>=1)))||(((Rows_8>=1)&&(Cells_8>=1))&&(Columns_8>=1)))||(((Rows_5>=1)&&(Cells_3>=1))&&(Columns_2>=1)))||(((Rows_7>=1)&&(Cells_7>=1))&&(Columns_4>=1)))||(((Rows_3>=1)&&(Cells_4>=1))&&(Columns_3>=1)))||(((Rows_2>=1)&&(Cells_2>=1))&&(Columns_8>=1)))||(((Rows_7>=1)&&(Cells_8>=1))&&(Columns_7>=1)))||(((Rows_1>=1)&&(Cells_0>=1))&&(Columns_1>=1)))||(((Rows_7>=1)&&(Cells_6>=1))&&(Columns_1>=1)))||(((Rows_2>=1)&&(Cells_1>=1))&&(Columns_5>=1)))||(((Rows_0>=1)&&(Cells_1>=1))&&(Columns_3>=1)))||(((Rows_0>=1)&&(Cells_2>=1))&&(Columns_6>=1)))||(((Rows_3>=1)&&(Cells_3>=1))&&(Columns_0>=1)))||(((Rows_8>=1)&&(Cells_6>=1))&&(Columns_2>=1)))||(((Rows_6>=1)&&(Cells_7>=1))&&(Columns_3>=1)))||(((Rows_5>=1)&&(Cells_5>=1))&&(Columns_8>=1)))||(((Rows_4>=1)&&(Cells_4>=1))&&(Columns_4>=1)))"
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/0/27/27
Computing Next relation with stutter on 136 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
44 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.460812,33372,1,0,91,121640,75,31,838,92951,64
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Sudoku-COL-AN03-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Sudoku-COL-AN03-01 finished in 2814 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(p0)&&G(F(!p0))))))], workingDir=/home/mcc/execution]
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:22] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 19:43:22] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:22] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 19:43:22] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:22] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 19:43:22] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, true, true, (NOT p0), p0, p0]
Running random walk in product with property : Sudoku-COL-AN03-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s18 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s20 1)) (AND (GEQ s4 1) (GEQ s12 1) (GEQ s19 1)) (AND (GEQ s6 1) (GEQ s17 1) (GEQ s24 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s25 1)) (AND (GEQ s4 1) (GEQ s14 1) (GEQ s25 1)) (AND (GEQ s6 1) (GEQ s15 1) (GEQ s18 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s14 1) (GEQ s24 1)) (AND (GEQ s5 1) (GEQ s13 1) (GEQ s23 1)) (AND (GEQ s8 1) (GEQ s17 1) (GEQ s26 1)) (AND (GEQ s5 1) (GEQ s12 1) (GEQ s20 1)) (AND (GEQ s7 1) (GEQ s16 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s21 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s26 1)) (AND (GEQ s7 1) (GEQ s17 1) (GEQ s25 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s7 1) (GEQ s15 1) (GEQ s19 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s24 1)) (AND (GEQ s3 1) (GEQ s12 1) (GEQ s18 1)) (AND (GEQ s8 1) (GEQ s15 1) (GEQ s20 1)) (AND (GEQ s6 1) (GEQ s16 1) (GEQ s21 1)) (AND (GEQ s5 1) (GEQ s14 1) (GEQ s26 1)) (AND (GEQ s4 1) (GEQ s13 1) (GEQ s22 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 11755 reset in 304 ms.
Product exploration explored 100000 steps with 11749 reset in 342 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 27
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 : [(F (G (NOT p0))), p0]
Stuttering acceptance computed with spot in 145 ms :[true, true, true, (NOT p0), p0, p0]
Product exploration explored 100000 steps with 11762 reset in 271 ms.
Product exploration explored 100000 steps with 11748 reset in 261 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 144 ms :[true, true, true, (NOT p0), p0, p0]
Support contains 27 out of 27 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2021-05-16 19:43:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:24] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 19:43:24] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Product exploration explored 100000 steps with 11748 reset in 318 ms.
Product exploration explored 100000 steps with 11762 reset in 300 ms.
[2021-05-16 19:43:25] [INFO ] Flatten gal took : 3 ms
[2021-05-16 19:43:25] [INFO ] Flatten gal took : 3 ms
[2021-05-16 19:43:25] [INFO ] Time to serialize gal into /tmp/LTL5065595123668940405.gal : 1 ms
[2021-05-16 19:43:25] [INFO ] Time to serialize properties into /tmp/LTL16911781381215505986.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5065595123668940405.gal, -t, CGAL, -LTL, /tmp/LTL16911781381215505986.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5065595123668940405.gal -t CGAL -LTL /tmp/LTL16911781381215505986.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((F("(((((((((((((((((((((((((((((Rows_8>=1)&&(Cells_7>=1))&&(Columns_5>=1))||(((Rows_0>=1)&&(Cells_0>=1))&&(Columns_0>=1)))||(((Rows_2>=1)&&(Cells_0>=1))&&(Columns_2>=1)))||(((Rows_4>=1)&&(Cells_3>=1))&&(Columns_1>=1)))||(((Rows_6>=1)&&(Cells_8>=1))&&(Columns_6>=1)))||(((Rows_1>=1)&&(Cells_2>=1))&&(Columns_7>=1)))||(((Rows_4>=1)&&(Cells_5>=1))&&(Columns_7>=1)))||(((Rows_6>=1)&&(Cells_6>=1))&&(Columns_0>=1)))||(((Rows_1>=1)&&(Cells_1>=1))&&(Columns_4>=1)))||(((Rows_3>=1)&&(Cells_5>=1))&&(Columns_6>=1)))||(((Rows_5>=1)&&(Cells_4>=1))&&(Columns_5>=1)))||(((Rows_8>=1)&&(Cells_8>=1))&&(Columns_8>=1)))||(((Rows_5>=1)&&(Cells_3>=1))&&(Columns_2>=1)))||(((Rows_7>=1)&&(Cells_7>=1))&&(Columns_4>=1)))||(((Rows_3>=1)&&(Cells_4>=1))&&(Columns_3>=1)))||(((Rows_2>=1)&&(Cells_2>=1))&&(Columns_8>=1)))||(((Rows_7>=1)&&(Cells_8>=1))&&(Columns_7>=1)))||(((Rows_1>=1)&&(Cells_0>=1))&&(Columns_1>=1)))||(((Rows_7>=1)&&(Cells_6>=1))&&(Columns_1>=1)))||(((Rows_2>=1)&&(Cells_1>=1))&&(Columns_5>=1)))||(((Rows_0>=1)&&(Cells_1>=1))&&(Columns_3>=1)))||(((Rows_0>=1)&&(Cells_2>=1))&&(Columns_6>=1)))||(((Rows_3>=1)&&(Cells_3>=1))&&(Columns_0>=1)))||(((Rows_8>=1)&&(Cells_6>=1))&&(Columns_2>=1)))||(((Rows_6>=1)&&(Cells_7>=1))&&(Columns_3>=1)))||(((Rows_5>=1)&&(Cells_5>=1))&&(Columns_8>=1)))||(((Rows_4>=1)&&(Cells_4>=1))&&(Columns_4>=1)))"))&&(G(F("(((((((((((((((((((((((((((((Rows_8<1)||(Cells_7<1))||(Columns_5<1))&&(((Rows_0<1)||(Cells_0<1))||(Columns_0<1)))&&(((Rows_2<1)||(Cells_0<1))||(Columns_2<1)))&&(((Rows_4<1)||(Cells_3<1))||(Columns_1<1)))&&(((Rows_6<1)||(Cells_8<1))||(Columns_6<1)))&&(((Rows_1<1)||(Cells_2<1))||(Columns_7<1)))&&(((Rows_4<1)||(Cells_5<1))||(Columns_7<1)))&&(((Rows_6<1)||(Cells_6<1))||(Columns_0<1)))&&(((Rows_1<1)||(Cells_1<1))||(Columns_4<1)))&&(((Rows_3<1)||(Cells_5<1))||(Columns_6<1)))&&(((Rows_5<1)||(Cells_4<1))||(Columns_5<1)))&&(((Rows_8<1)||(Cells_8<1))||(Columns_8<1)))&&(((Rows_5<1)||(Cells_3<1))||(Columns_2<1)))&&(((Rows_7<1)||(Cells_7<1))||(Columns_4<1)))&&(((Rows_3<1)||(Cells_4<1))||(Columns_3<1)))&&(((Rows_2<1)||(Cells_2<1))||(Columns_8<1)))&&(((Rows_7<1)||(Cells_8<1))||(Columns_7<1)))&&(((Rows_1<1)||(Cells_0<1))||(Columns_1<1)))&&(((Rows_7<1)||(Cells_6<1))||(Columns_1<1)))&&(((Rows_2<1)||(Cells_1<1))||(Columns_5<1)))&&(((Rows_0<1)||(Cells_1<1))||(Columns_3<1)))&&(((Rows_0<1)||(Cells_2<1))||(Columns_6<1)))&&(((Rows_3<1)||(Cells_3<1))||(Columns_0<1)))&&(((Rows_8<1)||(Cells_6<1))||(Columns_2<1)))&&(((Rows_6<1)||(Cells_7<1))||(Columns_3<1)))&&(((Rows_5<1)||(Cells_5<1))||(Columns_8<1)))&&(((Rows_4<1)||(Cells_4<1))||(Columns_4<1)))")))))))
Formula 0 simplified : !XX(F"(((((((((((((((((((((((((((((Rows_8>=1)&&(Cells_7>=1))&&(Columns_5>=1))||(((Rows_0>=1)&&(Cells_0>=1))&&(Columns_0>=1)))||(((Rows_2>=1)&&(Cells_0>=1))&&(Columns_2>=1)))||(((Rows_4>=1)&&(Cells_3>=1))&&(Columns_1>=1)))||(((Rows_6>=1)&&(Cells_8>=1))&&(Columns_6>=1)))||(((Rows_1>=1)&&(Cells_2>=1))&&(Columns_7>=1)))||(((Rows_4>=1)&&(Cells_5>=1))&&(Columns_7>=1)))||(((Rows_6>=1)&&(Cells_6>=1))&&(Columns_0>=1)))||(((Rows_1>=1)&&(Cells_1>=1))&&(Columns_4>=1)))||(((Rows_3>=1)&&(Cells_5>=1))&&(Columns_6>=1)))||(((Rows_5>=1)&&(Cells_4>=1))&&(Columns_5>=1)))||(((Rows_8>=1)&&(Cells_8>=1))&&(Columns_8>=1)))||(((Rows_5>=1)&&(Cells_3>=1))&&(Columns_2>=1)))||(((Rows_7>=1)&&(Cells_7>=1))&&(Columns_4>=1)))||(((Rows_3>=1)&&(Cells_4>=1))&&(Columns_3>=1)))||(((Rows_2>=1)&&(Cells_2>=1))&&(Columns_8>=1)))||(((Rows_7>=1)&&(Cells_8>=1))&&(Columns_7>=1)))||(((Rows_1>=1)&&(Cells_0>=1))&&(Columns_1>=1)))||(((Rows_7>=1)&&(Cells_6>=1))&&(Columns_1>=1)))||(((Rows_2>=1)&&(Cells_1>=1))&&(Columns_5>=1)))||(((Rows_0>=1)&&(Cells_1>=1))&&(Columns_3>=1)))||(((Rows_0>=1)&&(Cells_2>=1))&&(Columns_6>=1)))||(((Rows_3>=1)&&(Cells_3>=1))&&(Columns_0>=1)))||(((Rows_8>=1)&&(Cells_6>=1))&&(Columns_2>=1)))||(((Rows_6>=1)&&(Cells_7>=1))&&(Columns_3>=1)))||(((Rows_5>=1)&&(Cells_5>=1))&&(Columns_8>=1)))||(((Rows_4>=1)&&(Cells_4>=1))&&(Columns_4>=1)))" & GF"(((((((((((((((((((((((((((((Rows_8<1)||(Cells_7<1))||(Columns_5<1))&&(((Rows_0<1)||(Cells_0<1))||(Columns_0<1)))&&(((Rows_2<1)||(Cells_0<1))||(Columns_2<1)))&&(((Rows_4<1)||(Cells_3<1))||(Columns_1<1)))&&(((Rows_6<1)||(Cells_8<1))||(Columns_6<1)))&&(((Rows_1<1)||(Cells_2<1))||(Columns_7<1)))&&(((Rows_4<1)||(Cells_5<1))||(Columns_7<1)))&&(((Rows_6<1)||(Cells_6<1))||(Columns_0<1)))&&(((Rows_1<1)||(Cells_1<1))||(Columns_4<1)))&&(((Rows_3<1)||(Cells_5<1))||(Columns_6<1)))&&(((Rows_5<1)||(Cells_4<1))||(Columns_5<1)))&&(((Rows_8<1)||(Cells_8<1))||(Columns_8<1)))&&(((Rows_5<1)||(Cells_3<1))||(Columns_2<1)))&&(((Rows_7<1)||(Cells_7<1))||(Columns_4<1)))&&(((Rows_3<1)||(Cells_4<1))||(Columns_3<1)))&&(((Rows_2<1)||(Cells_2<1))||(Columns_8<1)))&&(((Rows_7<1)||(Cells_8<1))||(Columns_7<1)))&&(((Rows_1<1)||(Cells_0<1))||(Columns_1<1)))&&(((Rows_7<1)||(Cells_6<1))||(Columns_1<1)))&&(((Rows_2<1)||(Cells_1<1))||(Columns_5<1)))&&(((Rows_0<1)||(Cells_1<1))||(Columns_3<1)))&&(((Rows_0<1)||(Cells_2<1))||(Columns_6<1)))&&(((Rows_3<1)||(Cells_3<1))||(Columns_0<1)))&&(((Rows_8<1)||(Cells_6<1))||(Columns_2<1)))&&(((Rows_6<1)||(Cells_7<1))||(Columns_3<1)))&&(((Rows_5<1)||(Cells_5<1))||(Columns_8<1)))&&(((Rows_4<1)||(Cells_4<1))||(Columns_4<1)))")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/0/27/27
Computing Next relation with stutter on 136 deadlock states
17 unique states visited
0 strongly connected components in search stack
17 transitions explored
10 items max in DFS search stack
144 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.44249,65180,1,0,122,245517,80,72,919,284724,194
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Sudoku-COL-AN03-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Sudoku-COL-AN03-02 finished in 4147 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:27] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 19:43:27] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:27] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 19:43:27] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2021-05-16 19:43:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:27] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 19:43:27] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN03-03 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s18 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s20 1)) (AND (GEQ s4 1) (GEQ s12 1) (GEQ s19 1)) (AND (GEQ s6 1) (GEQ s17 1) (GEQ s24 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s25 1)) (AND (GEQ s4 1) (GEQ s14 1) (GEQ s25 1)) (AND (GEQ s6 1) (GEQ s15 1) (GEQ s18 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s14 1) (GEQ s24 1)) (AND (GEQ s5 1) (GEQ s13 1) (GEQ s23 1)) (AND (GEQ s8 1) (GEQ s17 1) (GEQ s26 1)) (AND (GEQ s5 1) (GEQ s12 1) (GEQ s20 1)) (AND (GEQ s7 1) (GEQ s16 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s21 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s26 1)) (AND (GEQ s7 1) (GEQ s17 1) (GEQ s25 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s7 1) (GEQ s15 1) (GEQ s19 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s24 1)) (AND (GEQ s3 1) (GEQ s12 1) (GEQ s18 1)) (AND (GEQ s8 1) (GEQ s15 1) (GEQ s20 1)) (AND (GEQ s6 1) (GEQ s16 1) (GEQ s21 1)) (AND (GEQ s5 1) (GEQ s14 1) (GEQ s26 1)) (AND (GEQ s4 1) (GEQ s13 1) (GEQ s22 1))), p1:(OR (AND (GEQ s8 1) (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s18 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s20 1)) (AND (GEQ s4 1) (GEQ s12 1) (GEQ s19 1)) (AND (GEQ s6 1) (GEQ s17 1) (GEQ s24 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s25 1)) (AND (GEQ s4 1) (GEQ s14 1) (GEQ s25 1)) (AND (GEQ s6 1) (GEQ s15 1) (GEQ s18 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s14 1) (GEQ s24 1)) (AND (GEQ s5 1) (GEQ s13 1) (GEQ s23 1)) (AND (GEQ s8 1) (GEQ s17 1) (GEQ s26 1)) (AND (GEQ s5 1) (GEQ s12 1) (GEQ s20 1)) (AND (GEQ s7 1) (GEQ s16 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s21 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s26 1)) (AND (GEQ s7 1) (GEQ s17 1) (GEQ s25 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s7 1) (GEQ s15 1) (GEQ s19 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s24 1)) (AND (GEQ s3 1) (GEQ s12 1) (GEQ s18 1)) (AND (GEQ s8 1) (GEQ s15 1) (GEQ s20 1)) (AND (GEQ s6 1) (GEQ s16 1) (GEQ s21 1)) (AND (GEQ s5 1) (GEQ s14 1) (GEQ s26 1)) (AND (GEQ s4 1) (GEQ s13 1) (GEQ s22 1)) (AND (GEQ s8 1) (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s18 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s20 1)) (AND (GEQ s4 1) (GEQ s12 1) (GEQ s19 1)) (AND (GEQ s6 1) (GEQ s17 1) (GEQ s24 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s25 1)) (AND (GEQ s4 1) (GEQ s14 1) (GEQ s25 1)) (AND (GEQ s6 1) (GEQ s15 1) (GEQ s18 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s14 1) (GEQ s24 1)) (AND (GEQ s5 1) (GEQ s13 1) (GEQ s23 1)) (AND (GEQ s8 1) (GEQ s17 1) (GEQ s26 1)) (AND (GEQ s5 1) (GEQ s12 1) (GEQ s20 1)) (AND (GEQ s7 1) (GEQ s16 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s21 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s26 1)) (AND (GEQ s7 1) (GEQ s17 1) (GEQ s25 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s7 1) (GEQ s15 1) (GEQ s19 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s24 1)) (AND (GEQ s3 1) (GEQ s12 1) (GEQ s18 1)) (AND (GEQ s8 1) (GEQ s15 1) (GEQ s20 1)) (AND (GEQ s6 1) (GEQ s16 1) (GEQ s21 1)) (AND (GEQ s5 1) (GEQ s14 1) (GEQ s26 1)) (AND (GEQ s4 1) (GEQ s13 1) (GEQ s22 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN03-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN03-03 finished in 140 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0))||G(!p0))))], workingDir=/home/mcc/execution]
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:27] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 19:43:27] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:27] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 19:43:27] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:27] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 19:43:27] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 68 ms :[false, (NOT p0), false]
Running random walk in product with property : Sudoku-COL-AN03-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s18 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s20 1)) (AND (GEQ s4 1) (GEQ s12 1) (GEQ s19 1)) (AND (GEQ s6 1) (GEQ s17 1) (GEQ s24 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s25 1)) (AND (GEQ s4 1) (GEQ s14 1) (GEQ s25 1)) (AND (GEQ s6 1) (GEQ s15 1) (GEQ s18 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s14 1) (GEQ s24 1)) (AND (GEQ s5 1) (GEQ s13 1) (GEQ s23 1)) (AND (GEQ s8 1) (GEQ s17 1) (GEQ s26 1)) (AND (GEQ s5 1) (GEQ s12 1) (GEQ s20 1)) (AND (GEQ s7 1) (GEQ s16 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s21 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s26 1)) (AND (GEQ s7 1) (GEQ s17 1) (GEQ s25 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s7 1) (GEQ s15 1) (GEQ s19 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s24 1)) (AND (GEQ s3 1) (GEQ s12 1) (GEQ s18 1)) (AND (GEQ s8 1) (GEQ s15 1) (GEQ s20 1)) (AND (GEQ s6 1) (GEQ s16 1) (GEQ s21 1)) (AND (GEQ s5 1) (GEQ s14 1) (GEQ s26 1)) (AND (GEQ s4 1) (GEQ s13 1) (GEQ s22 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN03-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN03-07 finished in 155 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(!p0)))))], workingDir=/home/mcc/execution]
Support contains 0 out of 27 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 3 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:27] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 19:43:27] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:27] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 19:43:27] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2021-05-16 19:43:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:27] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 19:43:27] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 10 ms :[true]
Running random walk in product with property : Sudoku-COL-AN03-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}]], initial=0, aps=[], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN03-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN03-08 finished in 112 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U X(X(!p0)))))], workingDir=/home/mcc/execution]
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:27] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 19:43:27] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:27] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 19:43:27] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:27] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-16 19:43:27] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 165 ms :[p0, p0, p0, p0, p0, p0, p0, true]
Running random walk in product with property : Sudoku-COL-AN03-09 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=p0, acceptance={} source=4 dest: 0}], [{ cond=p0, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=6, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s18 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s20 1)) (AND (GEQ s4 1) (GEQ s12 1) (GEQ s19 1)) (AND (GEQ s6 1) (GEQ s17 1) (GEQ s24 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s25 1)) (AND (GEQ s4 1) (GEQ s14 1) (GEQ s25 1)) (AND (GEQ s6 1) (GEQ s15 1) (GEQ s18 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s14 1) (GEQ s24 1)) (AND (GEQ s5 1) (GEQ s13 1) (GEQ s23 1)) (AND (GEQ s8 1) (GEQ s17 1) (GEQ s26 1)) (AND (GEQ s5 1) (GEQ s12 1) (GEQ s20 1)) (AND (GEQ s7 1) (GEQ s16 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s21 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s26 1)) (AND (GEQ s7 1) (GEQ s17 1) (GEQ s25 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s7 1) (GEQ s15 1) (GEQ s19 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s24 1)) (AND (GEQ s3 1) (GEQ s12 1) (GEQ s18 1)) (AND (GEQ s8 1) (GEQ s15 1) (GEQ s20 1)) (AND (GEQ s6 1) (GEQ s16 1) (GEQ s21 1)) (AND (GEQ s5 1) (GEQ s14 1) (GEQ s26 1)) (AND (GEQ s4 1) (GEQ s13 1) (GEQ s22 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 11761 reset in 258 ms.
Product exploration explored 100000 steps with 11742 reset in 287 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 27
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 : [(F (G (NOT p0))), p0]
Stuttering acceptance computed with spot in 172 ms :[p0, p0, p0, p0, p0, p0, p0, true]
Product exploration explored 100000 steps with 11745 reset in 256 ms.
Product exploration explored 100000 steps with 11740 reset in 279 ms.
Applying partial POR strategy [true, false, false, false, false, true, false, true]
Stuttering acceptance computed with spot in 186 ms :[p0, p0, p0, p0, p0, p0, p0, true]
Support contains 27 out of 27 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2021-05-16 19:43:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:29] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 19:43:29] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Product exploration explored 100000 steps with 11725 reset in 320 ms.
Product exploration explored 100000 steps with 11729 reset in 342 ms.
[2021-05-16 19:43:30] [INFO ] Flatten gal took : 3 ms
[2021-05-16 19:43:30] [INFO ] Flatten gal took : 3 ms
[2021-05-16 19:43:30] [INFO ] Time to serialize gal into /tmp/LTL13644126481612437590.gal : 1 ms
[2021-05-16 19:43:30] [INFO ] Time to serialize properties into /tmp/LTL9400263414973797749.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13644126481612437590.gal, -t, CGAL, -LTL, /tmp/LTL9400263414973797749.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13644126481612437590.gal -t CGAL -LTL /tmp/LTL9400263414973797749.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(((((((((((((((((((((((((((((Rows_8>=1)&&(Cells_7>=1))&&(Columns_5>=1))||(((Rows_0>=1)&&(Cells_0>=1))&&(Columns_0>=1)))||(((Rows_2>=1)&&(Cells_0>=1))&&(Columns_2>=1)))||(((Rows_4>=1)&&(Cells_3>=1))&&(Columns_1>=1)))||(((Rows_6>=1)&&(Cells_8>=1))&&(Columns_6>=1)))||(((Rows_1>=1)&&(Cells_2>=1))&&(Columns_7>=1)))||(((Rows_4>=1)&&(Cells_5>=1))&&(Columns_7>=1)))||(((Rows_6>=1)&&(Cells_6>=1))&&(Columns_0>=1)))||(((Rows_1>=1)&&(Cells_1>=1))&&(Columns_4>=1)))||(((Rows_3>=1)&&(Cells_5>=1))&&(Columns_6>=1)))||(((Rows_5>=1)&&(Cells_4>=1))&&(Columns_5>=1)))||(((Rows_8>=1)&&(Cells_8>=1))&&(Columns_8>=1)))||(((Rows_5>=1)&&(Cells_3>=1))&&(Columns_2>=1)))||(((Rows_7>=1)&&(Cells_7>=1))&&(Columns_4>=1)))||(((Rows_3>=1)&&(Cells_4>=1))&&(Columns_3>=1)))||(((Rows_2>=1)&&(Cells_2>=1))&&(Columns_8>=1)))||(((Rows_7>=1)&&(Cells_8>=1))&&(Columns_7>=1)))||(((Rows_1>=1)&&(Cells_0>=1))&&(Columns_1>=1)))||(((Rows_7>=1)&&(Cells_6>=1))&&(Columns_1>=1)))||(((Rows_2>=1)&&(Cells_1>=1))&&(Columns_5>=1)))||(((Rows_0>=1)&&(Cells_1>=1))&&(Columns_3>=1)))||(((Rows_0>=1)&&(Cells_2>=1))&&(Columns_6>=1)))||(((Rows_3>=1)&&(Cells_3>=1))&&(Columns_0>=1)))||(((Rows_8>=1)&&(Cells_6>=1))&&(Columns_2>=1)))||(((Rows_6>=1)&&(Cells_7>=1))&&(Columns_3>=1)))||(((Rows_5>=1)&&(Cells_5>=1))&&(Columns_8>=1)))||(((Rows_4>=1)&&(Cells_4>=1))&&(Columns_4>=1)))")U(X(X("(((((((((((((((((((((((((((((Rows_8<1)||(Cells_7<1))||(Columns_5<1))&&(((Rows_0<1)||(Cells_0<1))||(Columns_0<1)))&&(((Rows_2<1)||(Cells_0<1))||(Columns_2<1)))&&(((Rows_4<1)||(Cells_3<1))||(Columns_1<1)))&&(((Rows_6<1)||(Cells_8<1))||(Columns_6<1)))&&(((Rows_1<1)||(Cells_2<1))||(Columns_7<1)))&&(((Rows_4<1)||(Cells_5<1))||(Columns_7<1)))&&(((Rows_6<1)||(Cells_6<1))||(Columns_0<1)))&&(((Rows_1<1)||(Cells_1<1))||(Columns_4<1)))&&(((Rows_3<1)||(Cells_5<1))||(Columns_6<1)))&&(((Rows_5<1)||(Cells_4<1))||(Columns_5<1)))&&(((Rows_8<1)||(Cells_8<1))||(Columns_8<1)))&&(((Rows_5<1)||(Cells_3<1))||(Columns_2<1)))&&(((Rows_7<1)||(Cells_7<1))||(Columns_4<1)))&&(((Rows_3<1)||(Cells_4<1))||(Columns_3<1)))&&(((Rows_2<1)||(Cells_2<1))||(Columns_8<1)))&&(((Rows_7<1)||(Cells_8<1))||(Columns_7<1)))&&(((Rows_1<1)||(Cells_0<1))||(Columns_1<1)))&&(((Rows_7<1)||(Cells_6<1))||(Columns_1<1)))&&(((Rows_2<1)||(Cells_1<1))||(Columns_5<1)))&&(((Rows_0<1)||(Cells_1<1))||(Columns_3<1)))&&(((Rows_0<1)||(Cells_2<1))||(Columns_6<1)))&&(((Rows_3<1)||(Cells_3<1))||(Columns_0<1)))&&(((Rows_8<1)||(Cells_6<1))||(Columns_2<1)))&&(((Rows_6<1)||(Cells_7<1))||(Columns_3<1)))&&(((Rows_5<1)||(Cells_5<1))||(Columns_8<1)))&&(((Rows_4<1)||(Cells_4<1))||(Columns_4<1)))"))))))
Formula 0 simplified : !X("(((((((((((((((((((((((((((((Rows_8>=1)&&(Cells_7>=1))&&(Columns_5>=1))||(((Rows_0>=1)&&(Cells_0>=1))&&(Columns_0>=1)))||(((Rows_2>=1)&&(Cells_0>=1))&&(Columns_2>=1)))||(((Rows_4>=1)&&(Cells_3>=1))&&(Columns_1>=1)))||(((Rows_6>=1)&&(Cells_8>=1))&&(Columns_6>=1)))||(((Rows_1>=1)&&(Cells_2>=1))&&(Columns_7>=1)))||(((Rows_4>=1)&&(Cells_5>=1))&&(Columns_7>=1)))||(((Rows_6>=1)&&(Cells_6>=1))&&(Columns_0>=1)))||(((Rows_1>=1)&&(Cells_1>=1))&&(Columns_4>=1)))||(((Rows_3>=1)&&(Cells_5>=1))&&(Columns_6>=1)))||(((Rows_5>=1)&&(Cells_4>=1))&&(Columns_5>=1)))||(((Rows_8>=1)&&(Cells_8>=1))&&(Columns_8>=1)))||(((Rows_5>=1)&&(Cells_3>=1))&&(Columns_2>=1)))||(((Rows_7>=1)&&(Cells_7>=1))&&(Columns_4>=1)))||(((Rows_3>=1)&&(Cells_4>=1))&&(Columns_3>=1)))||(((Rows_2>=1)&&(Cells_2>=1))&&(Columns_8>=1)))||(((Rows_7>=1)&&(Cells_8>=1))&&(Columns_7>=1)))||(((Rows_1>=1)&&(Cells_0>=1))&&(Columns_1>=1)))||(((Rows_7>=1)&&(Cells_6>=1))&&(Columns_1>=1)))||(((Rows_2>=1)&&(Cells_1>=1))&&(Columns_5>=1)))||(((Rows_0>=1)&&(Cells_1>=1))&&(Columns_3>=1)))||(((Rows_0>=1)&&(Cells_2>=1))&&(Columns_6>=1)))||(((Rows_3>=1)&&(Cells_3>=1))&&(Columns_0>=1)))||(((Rows_8>=1)&&(Cells_6>=1))&&(Columns_2>=1)))||(((Rows_6>=1)&&(Cells_7>=1))&&(Columns_3>=1)))||(((Rows_5>=1)&&(Cells_5>=1))&&(Columns_8>=1)))||(((Rows_4>=1)&&(Cells_4>=1))&&(Columns_4>=1)))" U XX"(((((((((((((((((((((((((((((Rows_8<1)||(Cells_7<1))||(Columns_5<1))&&(((Rows_0<1)||(Cells_0<1))||(Columns_0<1)))&&(((Rows_2<1)||(Cells_0<1))||(Columns_2<1)))&&(((Rows_4<1)||(Cells_3<1))||(Columns_1<1)))&&(((Rows_6<1)||(Cells_8<1))||(Columns_6<1)))&&(((Rows_1<1)||(Cells_2<1))||(Columns_7<1)))&&(((Rows_4<1)||(Cells_5<1))||(Columns_7<1)))&&(((Rows_6<1)||(Cells_6<1))||(Columns_0<1)))&&(((Rows_1<1)||(Cells_1<1))||(Columns_4<1)))&&(((Rows_3<1)||(Cells_5<1))||(Columns_6<1)))&&(((Rows_5<1)||(Cells_4<1))||(Columns_5<1)))&&(((Rows_8<1)||(Cells_8<1))||(Columns_8<1)))&&(((Rows_5<1)||(Cells_3<1))||(Columns_2<1)))&&(((Rows_7<1)||(Cells_7<1))||(Columns_4<1)))&&(((Rows_3<1)||(Cells_4<1))||(Columns_3<1)))&&(((Rows_2<1)||(Cells_2<1))||(Columns_8<1)))&&(((Rows_7<1)||(Cells_8<1))||(Columns_7<1)))&&(((Rows_1<1)||(Cells_0<1))||(Columns_1<1)))&&(((Rows_7<1)||(Cells_6<1))||(Columns_1<1)))&&(((Rows_2<1)||(Cells_1<1))||(Columns_5<1)))&&(((Rows_0<1)||(Cells_1<1))||(Columns_3<1)))&&(((Rows_0<1)||(Cells_2<1))||(Columns_6<1)))&&(((Rows_3<1)||(Cells_3<1))||(Columns_0<1)))&&(((Rows_8<1)||(Cells_6<1))||(Columns_2<1)))&&(((Rows_6<1)||(Cells_7<1))||(Columns_3<1)))&&(((Rows_5<1)||(Cells_5<1))||(Columns_8<1)))&&(((Rows_4<1)||(Cells_4<1))||(Columns_4<1)))")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/0/27/27
Computing Next relation with stutter on 136 deadlock states
10 unique states visited
0 strongly connected components in search stack
9 transitions explored
10 items max in DFS search stack
140 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.41024,64320,1,0,116,244514,78,53,886,239232,148
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Sudoku-COL-AN03-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Sudoku-COL-AN03-09 finished in 4172 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:31] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 19:43:31] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:31] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 19:43:31] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2021-05-16 19:43:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:31] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 19:43:31] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN03-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s18 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s20 1)) (AND (GEQ s4 1) (GEQ s12 1) (GEQ s19 1)) (AND (GEQ s6 1) (GEQ s17 1) (GEQ s24 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s25 1)) (AND (GEQ s4 1) (GEQ s14 1) (GEQ s25 1)) (AND (GEQ s6 1) (GEQ s15 1) (GEQ s18 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s14 1) (GEQ s24 1)) (AND (GEQ s5 1) (GEQ s13 1) (GEQ s23 1)) (AND (GEQ s8 1) (GEQ s17 1) (GEQ s26 1)) (AND (GEQ s5 1) (GEQ s12 1) (GEQ s20 1)) (AND (GEQ s7 1) (GEQ s16 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s21 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s26 1)) (AND (GEQ s7 1) (GEQ s17 1) (GEQ s25 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s7 1) (GEQ s15 1) (GEQ s19 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s24 1)) (AND (GEQ s3 1) (GEQ s12 1) (GEQ s18 1)) (AND (GEQ s8 1) (GEQ s15 1) (GEQ s20 1)) (AND (GEQ s6 1) (GEQ s16 1) (GEQ s21 1)) (AND (GEQ s5 1) (GEQ s14 1) (GEQ s26 1)) (AND (GEQ s4 1) (GEQ s13 1) (GEQ s22 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN03-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN03-10 finished in 124 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:31] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 19:43:31] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:31] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 19:43:31] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2021-05-16 19:43:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:31] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 19:43:31] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN03-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s18 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s20 1)) (AND (GEQ s4 1) (GEQ s12 1) (GEQ s19 1)) (AND (GEQ s6 1) (GEQ s17 1) (GEQ s24 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s25 1)) (AND (GEQ s4 1) (GEQ s14 1) (GEQ s25 1)) (AND (GEQ s6 1) (GEQ s15 1) (GEQ s18 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s14 1) (GEQ s24 1)) (AND (GEQ s5 1) (GEQ s13 1) (GEQ s23 1)) (AND (GEQ s8 1) (GEQ s17 1) (GEQ s26 1)) (AND (GEQ s5 1) (GEQ s12 1) (GEQ s20 1)) (AND (GEQ s7 1) (GEQ s16 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s21 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s26 1)) (AND (GEQ s7 1) (GEQ s17 1) (GEQ s25 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s7 1) (GEQ s15 1) (GEQ s19 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s24 1)) (AND (GEQ s3 1) (GEQ s12 1) (GEQ s18 1)) (AND (GEQ s8 1) (GEQ s15 1) (GEQ s20 1)) (AND (GEQ s6 1) (GEQ s16 1) (GEQ s21 1)) (AND (GEQ s5 1) (GEQ s14 1) (GEQ s26 1)) (AND (GEQ s4 1) (GEQ s13 1) (GEQ s22 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN03-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN03-11 finished in 100 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:31] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 19:43:31] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:31] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 19:43:31] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2021-05-16 19:43:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:31] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 19:43:31] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN03-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s18 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s20 1)) (AND (GEQ s4 1) (GEQ s12 1) (GEQ s19 1)) (AND (GEQ s6 1) (GEQ s17 1) (GEQ s24 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s25 1)) (AND (GEQ s4 1) (GEQ s14 1) (GEQ s25 1)) (AND (GEQ s6 1) (GEQ s15 1) (GEQ s18 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s14 1) (GEQ s24 1)) (AND (GEQ s5 1) (GEQ s13 1) (GEQ s23 1)) (AND (GEQ s8 1) (GEQ s17 1) (GEQ s26 1)) (AND (GEQ s5 1) (GEQ s12 1) (GEQ s20 1)) (AND (GEQ s7 1) (GEQ s16 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s21 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s26 1)) (AND (GEQ s7 1) (GEQ s17 1) (GEQ s25 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s7 1) (GEQ s15 1) (GEQ s19 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s24 1)) (AND (GEQ s3 1) (GEQ s12 1) (GEQ s18 1)) (AND (GEQ s8 1) (GEQ s15 1) (GEQ s20 1)) (AND (GEQ s6 1) (GEQ s16 1) (GEQ s21 1)) (AND (GEQ s5 1) (GEQ s14 1) (GEQ s26 1)) (AND (GEQ s4 1) (GEQ s13 1) (GEQ s22 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN03-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN03-12 finished in 99 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(!p0))], workingDir=/home/mcc/execution]
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:31] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 19:43:31] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:31] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 19:43:31] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2021-05-16 19:43:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:31] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-16 19:43:31] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 21 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN03-14 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s18 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s20 1)) (AND (GEQ s4 1) (GEQ s12 1) (GEQ s19 1)) (AND (GEQ s6 1) (GEQ s17 1) (GEQ s24 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s25 1)) (AND (GEQ s4 1) (GEQ s14 1) (GEQ s25 1)) (AND (GEQ s6 1) (GEQ s15 1) (GEQ s18 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s14 1) (GEQ s24 1)) (AND (GEQ s5 1) (GEQ s13 1) (GEQ s23 1)) (AND (GEQ s8 1) (GEQ s17 1) (GEQ s26 1)) (AND (GEQ s5 1) (GEQ s12 1) (GEQ s20 1)) (AND (GEQ s7 1) (GEQ s16 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s21 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s26 1)) (AND (GEQ s7 1) (GEQ s17 1) (GEQ s25 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s7 1) (GEQ s15 1) (GEQ s19 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s24 1)) (AND (GEQ s3 1) (GEQ s12 1) (GEQ s18 1)) (AND (GEQ s8 1) (GEQ s15 1) (GEQ s20 1)) (AND (GEQ s6 1) (GEQ s16 1) (GEQ s21 1)) (AND (GEQ s5 1) (GEQ s14 1) (GEQ s26 1)) (AND (GEQ s4 1) (GEQ s13 1) (GEQ s22 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 11746 reset in 261 ms.
Product exploration explored 100000 steps with 11739 reset in 262 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 27 transition count 27
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 : [(F (G (NOT p0))), p0]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
FORMULA Sudoku-COL-AN03-14 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Sudoku-COL-AN03-14 finished in 672 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 27/27 places, 27/27 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:32] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 19:43:32] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:32] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 19:43:32] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:32] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 19:43:32] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/27 places, 27/27 transitions.
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN03-15 automaton TGBA [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:(OR (AND (GEQ s8 1) (GEQ s16 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s18 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s20 1)) (AND (GEQ s4 1) (GEQ s12 1) (GEQ s19 1)) (AND (GEQ s6 1) (GEQ s17 1) (GEQ s24 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s25 1)) (AND (GEQ s4 1) (GEQ s14 1) (GEQ s25 1)) (AND (GEQ s6 1) (GEQ s15 1) (GEQ s18 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s14 1) (GEQ s24 1)) (AND (GEQ s5 1) (GEQ s13 1) (GEQ s23 1)) (AND (GEQ s8 1) (GEQ s17 1) (GEQ s26 1)) (AND (GEQ s5 1) (GEQ s12 1) (GEQ s20 1)) (AND (GEQ s7 1) (GEQ s16 1) (GEQ s22 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s21 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s26 1)) (AND (GEQ s7 1) (GEQ s17 1) (GEQ s25 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s7 1) (GEQ s15 1) (GEQ s19 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s24 1)) (AND (GEQ s3 1) (GEQ s12 1) (GEQ s18 1)) (AND (GEQ s8 1) (GEQ s15 1) (GEQ s20 1)) (AND (GEQ s6 1) (GEQ s16 1) (GEQ s21 1)) (AND (GEQ s5 1) (GEQ s14 1) (GEQ s26 1)) (AND (GEQ s4 1) (GEQ s13 1) (GEQ s22 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN03-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN03-15 finished in 129 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621194214077

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-AN03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is Sudoku-COL-AN03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-162106746000413"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN03.tgz
mv Sudoku-COL-AN03 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;