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.r485-tall-167912698800035.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 itstools
Input is Sudoku-COL-AN05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912698800035
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 7.2K Feb 26 09:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 09:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 09:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 09:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 09:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 09:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 09:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 09:08 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-AN05-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679146304049

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN05
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202303021504
[2023-03-18 13:31:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 13:31:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 13:31:45] [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 13:31:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 13:31:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 548 ms
[2023-03-18 13:31:46] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 200 PT places and 125.0 transition bindings in 9 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 13:31:46] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2023-03-18 13:31:46] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-COL-AN05-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10016 steps, including 370 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 21) seen :15
Incomplete Best-First random walk after 10016 steps, including 370 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10016 steps, including 370 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10016 steps, including 370 resets, run finished after 32 ms. (steps per millisecond=313 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10016 steps, including 370 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10016 steps, including 370 resets, run finished after 41 ms. (steps per millisecond=244 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10016 steps, including 370 resets, run finished after 22 ms. (steps per millisecond=455 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1 rows 4 cols
[2023-03-18 13:31:46] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-18 13:31:46] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 13:31:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-18 13:31:46] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 6 atomic propositions for a total of 15 simplifications.
FORMULA Sudoku-COL-AN05-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 13:31:46] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-18 13:31:46] [INFO ] Flatten gal took : 13 ms
FORMULA Sudoku-COL-AN05-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 13:31:46] [INFO ] Flatten gal took : 2 ms
Domain [N(5), N(5)] of place Rows breaks symmetries in sort N
[2023-03-18 13:31:46] [INFO ] Unfolded HLPN to a Petri net with 200 places and 125 transitions 500 arcs in 10 ms.
[2023-03-18 13:31:46] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Support contains 200 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 7 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 200 cols
[2023-03-18 13:31:46] [INFO ] Computed 75 place invariants in 5 ms
[2023-03-18 13:31:46] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-18 13:31:46] [INFO ] Invariant cache hit.
[2023-03-18 13:31:47] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2023-03-18 13:31:47] [INFO ] Invariant cache hit.
[2023-03-18 13:31:47] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 329 ms. Remains : 200/200 places, 125/125 transitions.
Support contains 200 out of 200 places after structural reductions.
[2023-03-18 13:31:47] [INFO ] Flatten gal took : 23 ms
[2023-03-18 13:31:47] [INFO ] Flatten gal took : 16 ms
[2023-03-18 13:31:47] [INFO ] Input system was already deterministic with 125 transitions.
Incomplete random walk after 10000 steps, including 456 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 17) seen :14
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-18 13:31:47] [INFO ] Invariant cache hit.
[2023-03-18 13:31:47] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 13:31:47] [INFO ] [Nat]Absence check using 75 positive place invariants in 13 ms returned sat
[2023-03-18 13:31:47] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
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(G(p0)))'
Support contains 25 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 75 transition count 125
Applied a total of 125 rules in 7 ms. Remains 75 /200 variables (removed 125) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2023-03-18 13:31:48] [INFO ] Computed 14 place invariants in 6 ms
[2023-03-18 13:31:48] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-18 13:31:48] [INFO ] Invariant cache hit.
[2023-03-18 13:31:48] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2023-03-18 13:31:48] [INFO ] Invariant cache hit.
[2023-03-18 13:31:48] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 75/200 places, 125/125 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 226 ms. Remains : 75/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 3 (ADD s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-00 finished in 464 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 U (F(X(p1)) U p2))&&G(p1)))) U p3))'
Support contains 150 out of 200 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 200 cols
[2023-03-18 13:31:48] [INFO ] Computed 75 place invariants in 4 ms
[2023-03-18 13:31:48] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-18 13:31:48] [INFO ] Invariant cache hit.
[2023-03-18 13:31:48] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2023-03-18 13:31:48] [INFO ] Invariant cache hit.
[2023-03-18 13:31:48] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 255 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p3), (OR (NOT p3) (AND p1 p2)), (AND p1 p2), p1]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(LEQ (ADD s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174) (ADD s25 s26 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-01 finished in 469 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(p0))'
Support contains 25 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Graph (complete) has 375 edges and 200 vertex of which 75 are kept as prefixes of interest. Removing 125 places using SCC suffix rule.2 ms
Discarding 125 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 75 /200 variables (removed 125) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2023-03-18 13:31:49] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-18 13:31:49] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-18 13:31:49] [INFO ] Invariant cache hit.
[2023-03-18 13:31:49] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2023-03-18 13:31:49] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 13:31:49] [INFO ] Invariant cache hit.
[2023-03-18 13:31:49] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/200 places, 125/125 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 221 ms. Remains : 75/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 (ADD s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49))], 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]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-02 finished in 265 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(((!p0 U G(p1))&&X((G(F(p0))&&F(p2))))))'
Support contains 175 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 200 cols
[2023-03-18 13:31:49] [INFO ] Computed 75 place invariants in 1 ms
[2023-03-18 13:31:49] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-18 13:31:49] [INFO ] Invariant cache hit.
[2023-03-18 13:31:49] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2023-03-18 13:31:49] [INFO ] Invariant cache hit.
[2023-03-18 13:31:49] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 240 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 375 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p2)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=(OR p1 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}, { cond=true, acceptance={} source=5 dest: 7}, { cond=(NOT p2), acceptance={} source=5 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(LEQ (ADD s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 6 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-03 finished in 646 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(p0))'
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 11 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:31:50] [INFO ] Invariant cache hit.
[2023-03-18 13:31:50] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-18 13:31:50] [INFO ] Invariant cache hit.
[2023-03-18 13:31:50] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2023-03-18 13:31:50] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 13:31:50] [INFO ] Invariant cache hit.
[2023-03-18 13:31:50] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 334 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59...], 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 25000 reset in 1550 ms.
Product exploration explored 100000 steps with 25000 reset in 1526 ms.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 175 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2023-03-18 13:31:54] [INFO ] Invariant cache hit.
[2023-03-18 13:31:54] [INFO ] [Real]Absence check using 75 positive place invariants in 19 ms returned sat
[2023-03-18 13:31:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 13:31:54] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-18 13:31:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 13:31:54] [INFO ] [Nat]Absence check using 75 positive place invariants in 24 ms returned sat
[2023-03-18 13:31:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 13:31:54] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2023-03-18 13:31:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-18 13:31:54] [INFO ] Added : 0 causal constraints over 0 iterations in 39 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 9 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:31:54] [INFO ] Invariant cache hit.
[2023-03-18 13:31:54] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-18 13:31:54] [INFO ] Invariant cache hit.
[2023-03-18 13:31:55] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2023-03-18 13:31:55] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 13:31:55] [INFO ] Invariant cache hit.
[2023-03-18 13:31:55] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 353 ms. Remains : 200/200 places, 125/125 transitions.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
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 130 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 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 166 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 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2023-03-18 13:31:55] [INFO ] Invariant cache hit.
[2023-03-18 13:31:55] [INFO ] [Real]Absence check using 75 positive place invariants in 14 ms returned sat
[2023-03-18 13:31:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 13:31:55] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-18 13:31:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 13:31:56] [INFO ] [Nat]Absence check using 75 positive place invariants in 25 ms returned sat
[2023-03-18 13:31:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 13:31:56] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2023-03-18 13:31:56] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-18 13:31:56] [INFO ] Added : 0 causal constraints over 0 iterations in 34 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 1468 ms.
Product exploration explored 100000 steps with 25000 reset in 1482 ms.
Built C files in :
/tmp/ltsmin722268223137921745
[2023-03-18 13:31:59] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2023-03-18 13:31:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:31:59] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2023-03-18 13:31:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:31:59] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2023-03-18 13:31:59] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:31:59] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin722268223137921745
Running compilation step : cd /tmp/ltsmin722268223137921745;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 395 ms.
Running link step : cd /tmp/ltsmin722268223137921745;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin722268223137921745;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12305393883555057225.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 16 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:32:14] [INFO ] Invariant cache hit.
[2023-03-18 13:32:14] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-18 13:32:14] [INFO ] Invariant cache hit.
[2023-03-18 13:32:14] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2023-03-18 13:32:14] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 13:32:14] [INFO ] Invariant cache hit.
[2023-03-18 13:32:15] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 356 ms. Remains : 200/200 places, 125/125 transitions.
Built C files in :
/tmp/ltsmin16147411822310190761
[2023-03-18 13:32:15] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2023-03-18 13:32:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:32:15] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2023-03-18 13:32:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:32:15] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2023-03-18 13:32:15] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:32:15] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16147411822310190761
Running compilation step : cd /tmp/ltsmin16147411822310190761;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 309 ms.
Running link step : cd /tmp/ltsmin16147411822310190761;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin16147411822310190761;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13285685002011206375.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 13:32:30] [INFO ] Flatten gal took : 11 ms
[2023-03-18 13:32:30] [INFO ] Flatten gal took : 12 ms
[2023-03-18 13:32:30] [INFO ] Time to serialize gal into /tmp/LTL12349222106144072583.gal : 4 ms
[2023-03-18 13:32:30] [INFO ] Time to serialize properties into /tmp/LTL2123457139238649045.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12349222106144072583.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13517194570184851181.hoa' '-atoms' '/tmp/LTL2123457139238649045.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL2123457139238649045.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13517194570184851181.hoa
Detected timeout of ITS tools.
[2023-03-18 13:32:45] [INFO ] Flatten gal took : 11 ms
[2023-03-18 13:32:45] [INFO ] Flatten gal took : 10 ms
[2023-03-18 13:32:45] [INFO ] Time to serialize gal into /tmp/LTL9399100581125644596.gal : 2 ms
[2023-03-18 13:32:45] [INFO ] Time to serialize properties into /tmp/LTL18047890929544417111.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9399100581125644596.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18047890929544417111.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F("((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+((Bo...1423
Formula 0 simplified : G!"((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+((Boa...1419
Detected timeout of ITS tools.
[2023-03-18 13:33:00] [INFO ] Flatten gal took : 9 ms
[2023-03-18 13:33:00] [INFO ] Applying decomposition
[2023-03-18 13:33:00] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13610534854953173209.txt' '-o' '/tmp/graph13610534854953173209.bin' '-w' '/tmp/graph13610534854953173209.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13610534854953173209.bin' '-l' '-1' '-v' '-w' '/tmp/graph13610534854953173209.weights' '-q' '0' '-e' '0.001'
[2023-03-18 13:33:00] [INFO ] Decomposing Gal with order
[2023-03-18 13:33:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 13:33:00] [INFO ] Removed a total of 207 redundant transitions.
[2023-03-18 13:33:00] [INFO ] Flatten gal took : 45 ms
[2023-03-18 13:33:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2023-03-18 13:33:00] [INFO ] Time to serialize gal into /tmp/LTL564357225446676045.gal : 3 ms
[2023-03-18 13:33:00] [INFO ] Time to serialize properties into /tmp/LTL10584364066783238721.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL564357225446676045.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10584364066783238721.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F("((((((((gu0.Board_0+gu0.Board_1)+(gu0.Board_2+gu0.Board_3))+((gu0.Board_4+gu0.Board_5)+(gu0.Board_6+gu0.Board_7)))+(((gu0.Board_...1923
Formula 0 simplified : G!"((((((((gu0.Board_0+gu0.Board_1)+(gu0.Board_2+gu0.Board_3))+((gu0.Board_4+gu0.Board_5)+(gu0.Board_6+gu0.Board_7)))+(((gu0.Board_8...1919
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9097099183616087221
[2023-03-18 13:33:15] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9097099183616087221
Running compilation step : cd /tmp/ltsmin9097099183616087221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 259 ms.
Running link step : cd /tmp/ltsmin9097099183616087221;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9097099183616087221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
LTSmin run took 2279 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Sudoku-COL-AN05-LTLCardinality-04 finished in 88113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(!(true U p0))||X(!((p1 U p0) U !p1)))))'
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 7 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:33:18] [INFO ] Invariant cache hit.
[2023-03-18 13:33:18] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-18 13:33:18] [INFO ] Invariant cache hit.
[2023-03-18 13:33:18] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2023-03-18 13:33:18] [INFO ] Invariant cache hit.
[2023-03-18 13:33:18] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 322 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(LEQ 2 (ADD s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4543 reset in 1749 ms.
Product exploration explored 100000 steps with 4552 reset in 1756 ms.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 457 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 454 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 13:33:23] [INFO ] Invariant cache hit.
[2023-03-18 13:33:23] [INFO ] After 28ms SMT Verify possible using all constraints in real 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) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0)), (F (AND p1 p0))]
Knowledge based reduction with 12 factoid took 496 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 40 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p0) p1))]
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 9 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:33:23] [INFO ] Invariant cache hit.
[2023-03-18 13:33:23] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-18 13:33:23] [INFO ] Invariant cache hit.
[2023-03-18 13:33:23] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2023-03-18 13:33:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 13:33:23] [INFO ] Invariant cache hit.
[2023-03-18 13:33:24] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 331 ms. Remains : 200/200 places, 125/125 transitions.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (OR (AND (NOT p0) p1) (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p0 (NOT p1)))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 365 ms. Reduced automaton from 1 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p0) p1))]
Finished random walk after 2 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (OR (AND (NOT p0) p1) (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p0 (NOT p1)))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (OR (AND (NOT p0) p1) (AND p0 (NOT p1)))), (F (AND p0 p1))]
Knowledge based reduction with 9 factoid took 373 ms. Reduced automaton from 1 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 30 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 38 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p0) p1))]
Product exploration explored 100000 steps with 4552 reset in 1853 ms.
Product exploration explored 100000 steps with 4546 reset in 1868 ms.
Built C files in :
/tmp/ltsmin13849275526542483769
[2023-03-18 13:33:28] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2023-03-18 13:33:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:33:28] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2023-03-18 13:33:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:33:29] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2023-03-18 13:33:29] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:33:29] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13849275526542483769
Running compilation step : cd /tmp/ltsmin13849275526542483769;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 315 ms.
Running link step : cd /tmp/ltsmin13849275526542483769;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13849275526542483769;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16345709288800844902.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 10 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:33:44] [INFO ] Invariant cache hit.
[2023-03-18 13:33:44] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-18 13:33:44] [INFO ] Invariant cache hit.
[2023-03-18 13:33:44] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2023-03-18 13:33:44] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 13:33:44] [INFO ] Invariant cache hit.
[2023-03-18 13:33:44] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 340 ms. Remains : 200/200 places, 125/125 transitions.
Built C files in :
/tmp/ltsmin286796027942017986
[2023-03-18 13:33:44] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2023-03-18 13:33:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:33:44] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2023-03-18 13:33:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:33:44] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2023-03-18 13:33:44] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:33:44] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin286796027942017986
Running compilation step : cd /tmp/ltsmin286796027942017986;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 308 ms.
Running link step : cd /tmp/ltsmin286796027942017986;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin286796027942017986;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10157870476588863826.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 13:33:59] [INFO ] Flatten gal took : 11 ms
[2023-03-18 13:33:59] [INFO ] Flatten gal took : 10 ms
[2023-03-18 13:33:59] [INFO ] Time to serialize gal into /tmp/LTL14023640153380152268.gal : 2 ms
[2023-03-18 13:33:59] [INFO ] Time to serialize properties into /tmp/LTL9602618711335699653.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14023640153380152268.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6166090965219982177.hoa' '-atoms' '/tmp/LTL9602618711335699653.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9602618711335699653.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6166090965219982177.hoa
Detected timeout of ITS tools.
[2023-03-18 13:34:14] [INFO ] Flatten gal took : 9 ms
[2023-03-18 13:34:14] [INFO ] Flatten gal took : 8 ms
[2023-03-18 13:34:14] [INFO ] Time to serialize gal into /tmp/LTL4183066891232975067.gal : 1 ms
[2023-03-18 13:34:14] [INFO ] Time to serialize properties into /tmp/LTL17749110376039685398.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4183066891232975067.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17749110376039685398.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((X(!(F("((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11...5635
Formula 0 simplified : XG(F"((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+((B...5616
Detected timeout of ITS tools.
[2023-03-18 13:34:29] [INFO ] Flatten gal took : 11 ms
[2023-03-18 13:34:29] [INFO ] Applying decomposition
[2023-03-18 13:34:29] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4512496085673124929.txt' '-o' '/tmp/graph4512496085673124929.bin' '-w' '/tmp/graph4512496085673124929.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4512496085673124929.bin' '-l' '-1' '-v' '-w' '/tmp/graph4512496085673124929.weights' '-q' '0' '-e' '0.001'
[2023-03-18 13:34:29] [INFO ] Decomposing Gal with order
[2023-03-18 13:34:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 13:34:29] [INFO ] Removed a total of 231 redundant transitions.
[2023-03-18 13:34:29] [INFO ] Flatten gal took : 27 ms
[2023-03-18 13:34:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-18 13:34:29] [INFO ] Time to serialize gal into /tmp/LTL2403381828539317955.gal : 2 ms
[2023-03-18 13:34:29] [INFO ] Time to serialize properties into /tmp/LTL3809473488234421331.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2403381828539317955.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3809473488234421331.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((X(!(F("((((((((gu22.Board_0+gu22.Board_1)+(gu22.Board_2+gu22.Board_3))+((gu22.Board_4+gu22.Board_5)+(gu22.Board_6+gu22.Board_7))...8135
Formula 0 simplified : XG(F"((((((((gu22.Board_0+gu22.Board_1)+(gu22.Board_2+gu22.Board_3))+((gu22.Board_4+gu22.Board_5)+(gu22.Board_6+gu22.Board_7)))+(((g...8116
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6765937317308514100
[2023-03-18 13:34:44] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6765937317308514100
Running compilation step : cd /tmp/ltsmin6765937317308514100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 270 ms.
Running link step : cd /tmp/ltsmin6765937317308514100;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6765937317308514100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(!(true U (LTLAPp0==true)))||X(!(((LTLAPp1==true) U (LTLAPp0==true)) U !(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN05-LTLCardinality-05 finished in 101886 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 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 10 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:35:00] [INFO ] Invariant cache hit.
[2023-03-18 13:35:00] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-18 13:35:00] [INFO ] Invariant cache hit.
[2023-03-18 13:35:00] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2023-03-18 13:35:00] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 13:35:00] [INFO ] Invariant cache hit.
[2023-03-18 13:35:00] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 300 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24) (ADD s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 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 4549 reset in 1265 ms.
Product exploration explored 100000 steps with 4548 reset in 1261 ms.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
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 183 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 31 ms :[(NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-18 13:35:03] [INFO ] Invariant cache hit.
[2023-03-18 13:35:03] [INFO ] [Real]Absence check using 75 positive place invariants in 13 ms returned sat
[2023-03-18 13:35:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 13:35:03] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-18 13:35:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 13:35:03] [INFO ] [Nat]Absence check using 75 positive place invariants in 35 ms returned sat
[2023-03-18 13:35:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 13:35:04] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-18 13:35:04] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-18 13:35:04] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:35:04] [INFO ] Invariant cache hit.
[2023-03-18 13:35:04] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-18 13:35:04] [INFO ] Invariant cache hit.
[2023-03-18 13:35:04] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-18 13:35:04] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 13:35:04] [INFO ] Invariant cache hit.
[2023-03-18 13:35:04] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 294 ms. Remains : 200/200 places, 125/125 transitions.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
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 144 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 p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
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 158 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 30 ms :[(NOT p0)]
[2023-03-18 13:35:04] [INFO ] Invariant cache hit.
[2023-03-18 13:35:05] [INFO ] [Real]Absence check using 75 positive place invariants in 17 ms returned sat
[2023-03-18 13:35:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 13:35:05] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-18 13:35:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 13:35:05] [INFO ] [Nat]Absence check using 75 positive place invariants in 34 ms returned sat
[2023-03-18 13:35:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 13:35:05] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2023-03-18 13:35:05] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-18 13:35:05] [INFO ] Added : 0 causal constraints over 0 iterations in 20 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4546 reset in 1214 ms.
Product exploration explored 100000 steps with 4546 reset in 1233 ms.
Built C files in :
/tmp/ltsmin11352297697095580354
[2023-03-18 13:35:08] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2023-03-18 13:35:08] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:35:08] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2023-03-18 13:35:08] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:35:08] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2023-03-18 13:35:08] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:35:08] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11352297697095580354
Running compilation step : cd /tmp/ltsmin11352297697095580354;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 284 ms.
Running link step : cd /tmp/ltsmin11352297697095580354;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin11352297697095580354;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2726411010535410535.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 8 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:35:23] [INFO ] Invariant cache hit.
[2023-03-18 13:35:23] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-18 13:35:23] [INFO ] Invariant cache hit.
[2023-03-18 13:35:23] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2023-03-18 13:35:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 13:35:23] [INFO ] Invariant cache hit.
[2023-03-18 13:35:23] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 289 ms. Remains : 200/200 places, 125/125 transitions.
Built C files in :
/tmp/ltsmin10922210244090589613
[2023-03-18 13:35:23] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2023-03-18 13:35:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:35:23] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2023-03-18 13:35:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:35:23] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2023-03-18 13:35:23] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:35:23] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10922210244090589613
Running compilation step : cd /tmp/ltsmin10922210244090589613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 280 ms.
Running link step : cd /tmp/ltsmin10922210244090589613;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10922210244090589613;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13035843776508949017.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 13:35:38] [INFO ] Flatten gal took : 12 ms
[2023-03-18 13:35:38] [INFO ] Flatten gal took : 7 ms
[2023-03-18 13:35:38] [INFO ] Time to serialize gal into /tmp/LTL11209778959475474983.gal : 1 ms
[2023-03-18 13:35:38] [INFO ] Time to serialize properties into /tmp/LTL11062195753932674367.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11209778959475474983.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18443111941414397288.hoa' '-atoms' '/tmp/LTL11062195753932674367.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL11062195753932674367.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18443111941414397288.hoa
Detected timeout of ITS tools.
[2023-03-18 13:35:53] [INFO ] Flatten gal took : 7 ms
[2023-03-18 13:35:53] [INFO ] Flatten gal took : 7 ms
[2023-03-18 13:35:53] [INFO ] Time to serialize gal into /tmp/LTL12635151213156981960.gal : 4 ms
[2023-03-18 13:35:53] [INFO ] Time to serialize properties into /tmp/LTL13803224413070013097.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12635151213156981960.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13803224413070013097.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows_1...1662
Formula 0 simplified : GF!"((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows_13)...1656
Detected timeout of ITS tools.
[2023-03-18 13:36:08] [INFO ] Flatten gal took : 7 ms
[2023-03-18 13:36:08] [INFO ] Applying decomposition
[2023-03-18 13:36:08] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11422056149534381992.txt' '-o' '/tmp/graph11422056149534381992.bin' '-w' '/tmp/graph11422056149534381992.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11422056149534381992.bin' '-l' '-1' '-v' '-w' '/tmp/graph11422056149534381992.weights' '-q' '0' '-e' '0.001'
[2023-03-18 13:36:08] [INFO ] Decomposing Gal with order
[2023-03-18 13:36:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 13:36:08] [INFO ] Removed a total of 126 redundant transitions.
[2023-03-18 13:36:08] [INFO ] Flatten gal took : 15 ms
[2023-03-18 13:36:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 3 ms.
[2023-03-18 13:36:08] [INFO ] Time to serialize gal into /tmp/LTL3024146358780912088.gal : 1 ms
[2023-03-18 13:36:08] [INFO ] Time to serialize properties into /tmp/LTL1082157281142862837.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3024146358780912088.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1082157281142862837.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((gu0.Rows_0+gu0.Rows_1)+(gu0.Rows_2+gu0.Rows_3))+((gu0.Rows_4+gu0.Rows_5)+(gu0.Rows_6+gu0.Rows_7)))+(((gu0.Rows_8+gu0.Row...2262
Formula 0 simplified : GF!"((((((gu0.Rows_0+gu0.Rows_1)+(gu0.Rows_2+gu0.Rows_3))+((gu0.Rows_4+gu0.Rows_5)+(gu0.Rows_6+gu0.Rows_7)))+(((gu0.Rows_8+gu0.Rows_...2256
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5658957530333685996
[2023-03-18 13:36:23] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5658957530333685996
Running compilation step : cd /tmp/ltsmin5658957530333685996;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 263 ms.
Running link step : cd /tmp/ltsmin5658957530333685996;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin5658957530333685996;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN05-LTLCardinality-06 finished in 98886 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((p0&&X(G(p1)))))'
Support contains 175 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:36:38] [INFO ] Invariant cache hit.
[2023-03-18 13:36:39] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-18 13:36:39] [INFO ] Invariant cache hit.
[2023-03-18 13:36:39] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2023-03-18 13:36:39] [INFO ] Invariant cache hit.
[2023-03-18 13:36:39] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 237 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ (ADD s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174) (ADD s25 s26 s2...], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-09 finished in 406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:36:39] [INFO ] Invariant cache hit.
[2023-03-18 13:36:39] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-18 13:36:39] [INFO ] Invariant cache hit.
[2023-03-18 13:36:39] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2023-03-18 13:36:39] [INFO ] Invariant cache hit.
[2023-03-18 13:36:39] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 286 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 3 (ADD s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 1348 ms.
Product exploration explored 100000 steps with 25000 reset in 1375 ms.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 13:36:43] [INFO ] Invariant cache hit.
[2023-03-18 13:36:43] [INFO ] [Real]Absence check using 75 positive place invariants in 15 ms returned sat
[2023-03-18 13:36:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 13:36:43] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-18 13:36:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 13:36:43] [INFO ] [Nat]Absence check using 75 positive place invariants in 24 ms returned sat
[2023-03-18 13:36:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 13:36:43] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2023-03-18 13:36:43] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-18 13:36:43] [INFO ] Added : 0 causal constraints over 0 iterations in 32 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:36:43] [INFO ] Invariant cache hit.
[2023-03-18 13:36:43] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-18 13:36:43] [INFO ] Invariant cache hit.
[2023-03-18 13:36:44] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-18 13:36:44] [INFO ] Invariant cache hit.
[2023-03-18 13:36:44] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 295 ms. Remains : 200/200 places, 125/125 transitions.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-18 13:36:44] [INFO ] Invariant cache hit.
[2023-03-18 13:36:44] [INFO ] [Real]Absence check using 75 positive place invariants in 13 ms returned sat
[2023-03-18 13:36:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 13:36:44] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-18 13:36:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 13:36:45] [INFO ] [Nat]Absence check using 75 positive place invariants in 24 ms returned sat
[2023-03-18 13:36:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 13:36:45] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2023-03-18 13:36:45] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-18 13:36:45] [INFO ] Added : 0 causal constraints over 0 iterations in 31 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 1362 ms.
Product exploration explored 100000 steps with 25000 reset in 1386 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 9 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:36:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 13:36:48] [INFO ] Invariant cache hit.
[2023-03-18 13:36:48] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112 ms. Remains : 200/200 places, 125/125 transitions.
Built C files in :
/tmp/ltsmin17692493008759903198
[2023-03-18 13:36:48] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17692493008759903198
Running compilation step : cd /tmp/ltsmin17692493008759903198;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 246 ms.
Running link step : cd /tmp/ltsmin17692493008759903198;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17692493008759903198;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10810273025074480898.hoa' '--buchi-type=spotba'
LTSmin run took 2851 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Sudoku-COL-AN05-LTLCardinality-10 finished in 12496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1||X(X(p2)))))))'
Support contains 200 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:36:51] [INFO ] Invariant cache hit.
[2023-03-18 13:36:51] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-18 13:36:51] [INFO ] Invariant cache hit.
[2023-03-18 13:36:52] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-18 13:36:52] [INFO ] Invariant cache hit.
[2023-03-18 13:36:52] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 203 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={1} source=1 dest: 2}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 0}]], initial=0, aps=[p0:(AND (LEQ 1 (ADD s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174)) (LEQ (A...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5889 reset in 1734 ms.
Product exploration explored 100000 steps with 5887 reset in 1736 ms.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 692 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 7 states, 32 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), false, (AND (NOT p0) (NOT p2) (NOT p1)), false, false, false, false]
Incomplete random walk after 10000 steps, including 455 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 10) seen :5
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-18 13:36:57] [INFO ] Invariant cache hit.
[2023-03-18 13:36:57] [INFO ] [Real]Absence check using 75 positive place invariants in 10 ms returned sat
[2023-03-18 13:36:57] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-18 13:36:57] [INFO ] [Nat]Absence check using 75 positive place invariants in 10 ms returned sat
[2023-03-18 13:36:57] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (G (NOT (AND p0 (NOT p2) (NOT p1)))), (G (NOT (AND p0 p2 p1))), (G (NOT (AND (NOT p0) (NOT p2) p1))), (G (NOT (AND (NOT p0) p2 p1)))]
False Knowledge obtained : [(F (AND p0 p2 (NOT p1))), (F (NOT (AND p0 (NOT p2) p1))), (F (AND (NOT p0) p2 (NOT p1))), (F (NOT (OR (AND p0 p2) (AND p0 p1)))), (F (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))]
Property proved to be true thanks to knowledge :(F (OR (G p0) (G (NOT p0))))
Knowledge based reduction with 17 factoid took 825 ms. Reduced automaton from 7 states, 32 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN05-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN05-LTLCardinality-11 finished in 6875 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||G(p1)))'
Support contains 175 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:36:58] [INFO ] Invariant cache hit.
[2023-03-18 13:36:58] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-18 13:36:58] [INFO ] Invariant cache hit.
[2023-03-18 13:36:58] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2023-03-18 13:36:58] [INFO ] Invariant cache hit.
[2023-03-18 13:36:58] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 227 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (LEQ 1 (ADD s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s5...], 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4553 reset in 1110 ms.
Product exploration explored 100000 steps with 4546 reset in 1123 ms.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 564 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 15 factoid took 719 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
[2023-03-18 13:37:03] [INFO ] Invariant cache hit.
[2023-03-18 13:37:03] [INFO ] [Real]Absence check using 75 positive place invariants in 21 ms returned sat
[2023-03-18 13:37:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 13:37:03] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-18 13:37:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-18 13:37:03] [INFO ] Added : 0 causal constraints over 0 iterations in 22 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 125 out of 200 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:37:03] [INFO ] Invariant cache hit.
[2023-03-18 13:37:03] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-18 13:37:03] [INFO ] Invariant cache hit.
[2023-03-18 13:37:03] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2023-03-18 13:37:03] [INFO ] Invariant cache hit.
[2023-03-18 13:37:03] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 230 ms. Remains : 200/200 places, 125/125 transitions.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
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 p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 193 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 240 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
[2023-03-18 13:37:04] [INFO ] Invariant cache hit.
[2023-03-18 13:37:04] [INFO ] [Real]Absence check using 75 positive place invariants in 13 ms returned sat
[2023-03-18 13:37:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 13:37:04] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-18 13:37:04] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-18 13:37:04] [INFO ] Added : 0 causal constraints over 0 iterations in 20 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4549 reset in 1083 ms.
Product exploration explored 100000 steps with 4555 reset in 1105 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 8 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:37:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 13:37:07] [INFO ] Invariant cache hit.
[2023-03-18 13:37:07] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 100 ms. Remains : 200/200 places, 125/125 transitions.
Built C files in :
/tmp/ltsmin10686267903689322693
[2023-03-18 13:37:07] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10686267903689322693
Running compilation step : cd /tmp/ltsmin10686267903689322693;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 241 ms.
Running link step : cd /tmp/ltsmin10686267903689322693;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin10686267903689322693;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4244763698838590384.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 5 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:37:22] [INFO ] Invariant cache hit.
[2023-03-18 13:37:22] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-18 13:37:22] [INFO ] Invariant cache hit.
[2023-03-18 13:37:22] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-18 13:37:22] [INFO ] Invariant cache hit.
[2023-03-18 13:37:22] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 310 ms. Remains : 200/200 places, 125/125 transitions.
Built C files in :
/tmp/ltsmin4911014247199852221
[2023-03-18 13:37:22] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4911014247199852221
Running compilation step : cd /tmp/ltsmin4911014247199852221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 251 ms.
Running link step : cd /tmp/ltsmin4911014247199852221;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4911014247199852221;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2868656327153709765.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 13:37:37] [INFO ] Flatten gal took : 7 ms
[2023-03-18 13:37:37] [INFO ] Flatten gal took : 5 ms
[2023-03-18 13:37:37] [INFO ] Time to serialize gal into /tmp/LTL18190733885739790832.gal : 1 ms
[2023-03-18 13:37:37] [INFO ] Time to serialize properties into /tmp/LTL17651526882935948682.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18190733885739790832.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1310817124016245909.hoa' '-atoms' '/tmp/LTL17651526882935948682.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17651526882935948682.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1310817124016245909.hoa
Detected timeout of ITS tools.
[2023-03-18 13:37:52] [INFO ] Flatten gal took : 6 ms
[2023-03-18 13:37:52] [INFO ] Flatten gal took : 6 ms
[2023-03-18 13:37:52] [INFO ] Time to serialize gal into /tmp/LTL10917748924174947215.gal : 1 ms
[2023-03-18 13:37:52] [INFO ] Time to serialize properties into /tmp/LTL2798281194731115668.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10917748924174947215.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2798281194731115668.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(G("((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+(...3336
Formula 0 simplified : XF!"((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+((Bo...3326
Detected timeout of ITS tools.
[2023-03-18 13:38:07] [INFO ] Flatten gal took : 10 ms
[2023-03-18 13:38:07] [INFO ] Applying decomposition
[2023-03-18 13:38:07] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph2547295616902641907.txt' '-o' '/tmp/graph2547295616902641907.bin' '-w' '/tmp/graph2547295616902641907.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2547295616902641907.bin' '-l' '-1' '-v' '-w' '/tmp/graph2547295616902641907.weights' '-q' '0' '-e' '0.001'
[2023-03-18 13:38:07] [INFO ] Decomposing Gal with order
[2023-03-18 13:38:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 13:38:08] [INFO ] Flatten gal took : 32 ms
[2023-03-18 13:38:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-18 13:38:08] [INFO ] Time to serialize gal into /tmp/LTL15128368154852000664.gal : 2 ms
[2023-03-18 13:38:08] [INFO ] Time to serialize properties into /tmp/LTL2125550161789721110.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15128368154852000664.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2125550161789721110.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(G("((((((((gu1.Board_0+gu1.Board_1)+(gu1.Board_2+gu1.Board_3))+((gu1.Board_4+gu1.Board_5)+(gu1.Board_6+gu1.Board_7)))+(((gu1.Boa...4536
Formula 0 simplified : XF!"((((((((gu1.Board_0+gu1.Board_1)+(gu1.Board_2+gu1.Board_3))+((gu1.Board_4+gu1.Board_5)+(gu1.Board_6+gu1.Board_7)))+(((gu1.Board_...4526
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14318644123805372394
[2023-03-18 13:38:23] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14318644123805372394
Running compilation step : cd /tmp/ltsmin14318644123805372394;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 265 ms.
Running link step : cd /tmp/ltsmin14318644123805372394;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14318644123805372394;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X([]((LTLAPp0==true)))||[]((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN05-LTLCardinality-12 finished in 99429 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 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 7 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:38:38] [INFO ] Invariant cache hit.
[2023-03-18 13:38:38] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-18 13:38:38] [INFO ] Invariant cache hit.
[2023-03-18 13:38:38] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2023-03-18 13:38:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 13:38:38] [INFO ] Invariant cache hit.
[2023-03-18 13:38:38] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 333 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 30 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 (ADD s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59...], 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 21 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-15 finished in 381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(!(true U p0))||X(!((p1 U p0) U !p1)))))'
Found a Shortening insensitive property : Sudoku-COL-AN05-LTLCardinality-05
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 7 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:38:38] [INFO ] Invariant cache hit.
[2023-03-18 13:38:38] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-18 13:38:38] [INFO ] Invariant cache hit.
[2023-03-18 13:38:38] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2023-03-18 13:38:38] [INFO ] Invariant cache hit.
[2023-03-18 13:38:39] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 311 ms. Remains : 200/200 places, 125/125 transitions.
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(LEQ 2 (ADD s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4543 reset in 1794 ms.
Product exploration explored 100000 steps with 4549 reset in 1811 ms.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 457 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Incomplete random walk after 10000 steps, including 455 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 13:38:43] [INFO ] Invariant cache hit.
[2023-03-18 13:38:43] [INFO ] After 34ms SMT Verify possible using all constraints in real 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) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0)), (F (AND p1 p0))]
Knowledge based reduction with 12 factoid took 500 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 31 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p0) p1))]
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 7 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:38:44] [INFO ] Invariant cache hit.
[2023-03-18 13:38:44] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-18 13:38:44] [INFO ] Invariant cache hit.
[2023-03-18 13:38:44] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-18 13:38:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 13:38:44] [INFO ] Invariant cache hit.
[2023-03-18 13:38:44] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 315 ms. Remains : 200/200 places, 125/125 transitions.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (OR (AND (NOT p0) p1) (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p0 (NOT p1)))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 317 ms. Reduced automaton from 1 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p0) p1))]
Finished random walk after 2 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (OR (AND (NOT p0) p1) (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p0 (NOT p1)))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (OR (AND (NOT p0) p1) (AND p0 (NOT p1)))), (F (AND p0 p1))]
Knowledge based reduction with 9 factoid took 329 ms. Reduced automaton from 1 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 27 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 43 ms :[(OR (AND p0 (NOT p1)) (AND (NOT p0) p1))]
Product exploration explored 100000 steps with 4548 reset in 1841 ms.
Product exploration explored 100000 steps with 4547 reset in 1866 ms.
Built C files in :
/tmp/ltsmin7744538930644466669
[2023-03-18 13:38:49] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2023-03-18 13:38:49] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:38:49] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2023-03-18 13:38:49] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:38:49] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2023-03-18 13:38:49] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:38:49] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7744538930644466669
Running compilation step : cd /tmp/ltsmin7744538930644466669;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 304 ms.
Running link step : cd /tmp/ltsmin7744538930644466669;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7744538930644466669;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10041815063541916432.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:39:04] [INFO ] Invariant cache hit.
[2023-03-18 13:39:04] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-18 13:39:04] [INFO ] Invariant cache hit.
[2023-03-18 13:39:04] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2023-03-18 13:39:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 13:39:04] [INFO ] Invariant cache hit.
[2023-03-18 13:39:04] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 331 ms. Remains : 200/200 places, 125/125 transitions.
Built C files in :
/tmp/ltsmin14874671192554179784
[2023-03-18 13:39:04] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2023-03-18 13:39:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:39:04] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2023-03-18 13:39:04] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:39:04] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2023-03-18 13:39:04] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:39:04] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14874671192554179784
Running compilation step : cd /tmp/ltsmin14874671192554179784;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 309 ms.
Running link step : cd /tmp/ltsmin14874671192554179784;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14874671192554179784;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10127131945207935428.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 13:39:19] [INFO ] Flatten gal took : 10 ms
[2023-03-18 13:39:19] [INFO ] Flatten gal took : 5 ms
[2023-03-18 13:39:19] [INFO ] Time to serialize gal into /tmp/LTL13513628324579011572.gal : 1 ms
[2023-03-18 13:39:19] [INFO ] Time to serialize properties into /tmp/LTL14918976901116449764.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13513628324579011572.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12008645404513331186.hoa' '-atoms' '/tmp/LTL14918976901116449764.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL14918976901116449764.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12008645404513331186.hoa
Detected timeout of ITS tools.
[2023-03-18 13:39:34] [INFO ] Flatten gal took : 5 ms
[2023-03-18 13:39:34] [INFO ] Flatten gal took : 6 ms
[2023-03-18 13:39:34] [INFO ] Time to serialize gal into /tmp/LTL4875460125783786239.gal : 2 ms
[2023-03-18 13:39:34] [INFO ] Time to serialize properties into /tmp/LTL18003113701808615972.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4875460125783786239.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18003113701808615972.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((X(!(F("((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11...5635
Formula 0 simplified : XG(F"((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+((B...5616
Detected timeout of ITS tools.
[2023-03-18 13:39:50] [INFO ] Flatten gal took : 8 ms
[2023-03-18 13:39:50] [INFO ] Applying decomposition
[2023-03-18 13:39:50] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12728538601240429154.txt' '-o' '/tmp/graph12728538601240429154.bin' '-w' '/tmp/graph12728538601240429154.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12728538601240429154.bin' '-l' '-1' '-v' '-w' '/tmp/graph12728538601240429154.weights' '-q' '0' '-e' '0.001'
[2023-03-18 13:39:50] [INFO ] Decomposing Gal with order
[2023-03-18 13:39:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 13:39:50] [INFO ] Removed a total of 222 redundant transitions.
[2023-03-18 13:39:50] [INFO ] Flatten gal took : 16 ms
[2023-03-18 13:39:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2023-03-18 13:39:50] [INFO ] Time to serialize gal into /tmp/LTL9738307256051733465.gal : 1 ms
[2023-03-18 13:39:50] [INFO ] Time to serialize properties into /tmp/LTL2410743732832362854.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9738307256051733465.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2410743732832362854.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((X(!(F("((((((((gu23.Board_0+gu23.Board_1)+(gu23.Board_2+gu23.Board_3))+((gu23.Board_4+gu23.Board_5)+(gu23.Board_6+gu23.Board_7))...8135
Formula 0 simplified : XG(F"((((((((gu23.Board_0+gu23.Board_1)+(gu23.Board_2+gu23.Board_3))+((gu23.Board_4+gu23.Board_5)+(gu23.Board_6+gu23.Board_7)))+(((g...8116
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3457169579191615898
[2023-03-18 13:40:05] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3457169579191615898
Running compilation step : cd /tmp/ltsmin3457169579191615898;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 268 ms.
Running link step : cd /tmp/ltsmin3457169579191615898;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin3457169579191615898;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(!(true U (LTLAPp0==true)))||X(!(((LTLAPp1==true) U (LTLAPp0==true)) U !(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN05-LTLCardinality-05 finished in 101735 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||G(p1)))'
Found a Lengthening insensitive property : Sudoku-COL-AN05-LTLCardinality-12
Stuttering acceptance computed with spot in 156 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 175 out of 200 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 5 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:40:20] [INFO ] Invariant cache hit.
[2023-03-18 13:40:20] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-18 13:40:20] [INFO ] Invariant cache hit.
[2023-03-18 13:40:20] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2023-03-18 13:40:20] [INFO ] Invariant cache hit.
[2023-03-18 13:40:20] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 233 ms. Remains : 200/200 places, 125/125 transitions.
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (LEQ 1 (ADD s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s5...], 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4545 reset in 1096 ms.
Product exploration explored 100000 steps with 4547 reset in 1123 ms.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 551 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 15 factoid took 493 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
[2023-03-18 13:40:24] [INFO ] Invariant cache hit.
[2023-03-18 13:40:24] [INFO ] [Real]Absence check using 75 positive place invariants in 12 ms returned sat
[2023-03-18 13:40:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 13:40:24] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-18 13:40:24] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-18 13:40:24] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 125 out of 200 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 0 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:40:24] [INFO ] Invariant cache hit.
[2023-03-18 13:40:24] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-18 13:40:24] [INFO ] Invariant cache hit.
[2023-03-18 13:40:25] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2023-03-18 13:40:25] [INFO ] Invariant cache hit.
[2023-03-18 13:40:25] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 233 ms. Remains : 200/200 places, 125/125 transitions.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
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 p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
[2023-03-18 13:40:25] [INFO ] Invariant cache hit.
[2023-03-18 13:40:26] [INFO ] [Real]Absence check using 75 positive place invariants in 13 ms returned sat
[2023-03-18 13:40:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 13:40:26] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-18 13:40:26] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-18 13:40:26] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4552 reset in 1089 ms.
Product exploration explored 100000 steps with 4554 reset in 1117 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:40:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 13:40:28] [INFO ] Invariant cache hit.
[2023-03-18 13:40:28] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 200/200 places, 125/125 transitions.
Built C files in :
/tmp/ltsmin16448002759186319657
[2023-03-18 13:40:28] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16448002759186319657
Running compilation step : cd /tmp/ltsmin16448002759186319657;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 249 ms.
Running link step : cd /tmp/ltsmin16448002759186319657;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin16448002759186319657;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8797589922089705240.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-18 13:40:43] [INFO ] Invariant cache hit.
[2023-03-18 13:40:43] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-18 13:40:43] [INFO ] Invariant cache hit.
[2023-03-18 13:40:43] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2023-03-18 13:40:43] [INFO ] Invariant cache hit.
[2023-03-18 13:40:44] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 299 ms. Remains : 200/200 places, 125/125 transitions.
Built C files in :
/tmp/ltsmin2859356530436168747
[2023-03-18 13:40:44] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2859356530436168747
Running compilation step : cd /tmp/ltsmin2859356530436168747;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 243 ms.
Running link step : cd /tmp/ltsmin2859356530436168747;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin2859356530436168747;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13720173804801839098.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 13:40:59] [INFO ] Flatten gal took : 6 ms
[2023-03-18 13:40:59] [INFO ] Flatten gal took : 4 ms
[2023-03-18 13:40:59] [INFO ] Time to serialize gal into /tmp/LTL10166787037858257005.gal : 1 ms
[2023-03-18 13:40:59] [INFO ] Time to serialize properties into /tmp/LTL12102050263380189045.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10166787037858257005.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11720269128115530467.hoa' '-atoms' '/tmp/LTL12102050263380189045.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12102050263380189045.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11720269128115530467.hoa
Detected timeout of ITS tools.
[2023-03-18 13:41:14] [INFO ] Flatten gal took : 5 ms
[2023-03-18 13:41:14] [INFO ] Flatten gal took : 5 ms
[2023-03-18 13:41:14] [INFO ] Time to serialize gal into /tmp/LTL7441820877233988548.gal : 2 ms
[2023-03-18 13:41:14] [INFO ] Time to serialize properties into /tmp/LTL5632930506029647781.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7441820877233988548.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5632930506029647781.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X(G("((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+(...3336
Formula 0 simplified : XF!"((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+((Bo...3326
Detected timeout of ITS tools.
[2023-03-18 13:41:29] [INFO ] Flatten gal took : 10 ms
[2023-03-18 13:41:29] [INFO ] Applying decomposition
[2023-03-18 13:41:29] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10949034390636856384.txt' '-o' '/tmp/graph10949034390636856384.bin' '-w' '/tmp/graph10949034390636856384.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10949034390636856384.bin' '-l' '-1' '-v' '-w' '/tmp/graph10949034390636856384.weights' '-q' '0' '-e' '0.001'
[2023-03-18 13:41:29] [INFO ] Decomposing Gal with order
[2023-03-18 13:41:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 13:41:29] [INFO ] Flatten gal took : 25 ms
[2023-03-18 13:41:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2023-03-18 13:41:29] [INFO ] Time to serialize gal into /tmp/LTL18126534190682306706.gal : 2 ms
[2023-03-18 13:41:29] [INFO ] Time to serialize properties into /tmp/LTL4713575415955140005.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18126534190682306706.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4713575415955140005.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(G("((((((((gu1.Board_0+gu1.Board_1)+(gu1.Board_2+gu1.Board_3))+((gu1.Board_4+gu1.Board_5)+(gu1.Board_6+gu1.Board_7)))+(((gu1.Boa...4536
Formula 0 simplified : XF!"((((((((gu1.Board_0+gu1.Board_1)+(gu1.Board_2+gu1.Board_3))+((gu1.Board_4+gu1.Board_5)+(gu1.Board_6+gu1.Board_7)))+(((gu1.Board_...4526
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16635315367566195882
[2023-03-18 13:41:44] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16635315367566195882
Running compilation step : cd /tmp/ltsmin16635315367566195882;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 279 ms.
Running link step : cd /tmp/ltsmin16635315367566195882;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16635315367566195882;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X([]((LTLAPp0==true)))||[]((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN05-LTLCardinality-12 finished in 99218 ms.
[2023-03-18 13:41:59] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17161048594543633177
[2023-03-18 13:41:59] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2023-03-18 13:41:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:41:59] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2023-03-18 13:41:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:41:59] [INFO ] Applying decomposition
[2023-03-18 13:41:59] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2023-03-18 13:41:59] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 13:41:59] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17161048594543633177
Running compilation step : cd /tmp/ltsmin17161048594543633177;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-18 13:41:59] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16819960392955934659.txt' '-o' '/tmp/graph16819960392955934659.bin' '-w' '/tmp/graph16819960392955934659.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16819960392955934659.bin' '-l' '-1' '-v' '-w' '/tmp/graph16819960392955934659.weights' '-q' '0' '-e' '0.001'
[2023-03-18 13:41:59] [INFO ] Decomposing Gal with order
[2023-03-18 13:41:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 13:41:59] [INFO ] Flatten gal took : 27 ms
[2023-03-18 13:41:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-18 13:41:59] [INFO ] Time to serialize gal into /tmp/LTLCardinality10906812937781235092.gal : 2 ms
[2023-03-18 13:41:59] [INFO ] Time to serialize properties into /tmp/LTLCardinality6642806001964229551.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10906812937781235092.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6642806001964229551.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 3 LTL properties
Checking formula 0 : !((F((X(!(F("((((((((gu0.Board_0+gu0.Board_1)+(gu0.Board_2+gu0.Board_3))+((gu0.Board_4+gu0.Board_5)+(gu0.Board_6+gu0.Board_7)))+(((gu0...7635
Formula 0 simplified : XG(F"((((((((gu0.Board_0+gu0.Board_1)+(gu0.Board_2+gu0.Board_3))+((gu0.Board_4+gu0.Board_5)+(gu0.Board_6+gu0.Board_7)))+(((gu0.Board...7616
Compilation finished in 336 ms.
Running link step : cd /tmp/ltsmin17161048594543633177;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin17161048594543633177;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(!(true U (LTLAPp0==true)))||X(!(((LTLAPp1==true) U (LTLAPp0==true)) U !(LTLAPp1==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: LTL layer: formula: <>((X(!(true U (LTLAPp0==true)))||X(!(((LTLAPp1==true) U (LTLAPp0==true)) U !(LTLAPp1==true)))))
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: "<>((X(!(true U (LTLAPp0==true)))||X(!(((LTLAPp1==true) U (LTLAPp0==true)) U !(LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.039: There are 130 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.039: State length is 201, there are 142 groups
pins2lts-mc-linux64( 0/ 8), 0.039: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.039: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.039: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.039: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.131: [Blue] ~22 levels ~960 states ~9336 transitions
pins2lts-mc-linux64( 4/ 8), 0.147: [Blue] ~22 levels ~1920 states ~12976 transitions
pins2lts-mc-linux64( 4/ 8), 0.173: [Blue] ~23 levels ~3840 states ~20272 transitions
pins2lts-mc-linux64( 4/ 8), 0.223: [Blue] ~23 levels ~7680 states ~37816 transitions
pins2lts-mc-linux64( 1/ 8), 0.342: [Blue] ~24 levels ~15360 states ~78288 transitions
pins2lts-mc-linux64( 2/ 8), 0.503: [Blue] ~24 levels ~30720 states ~148272 transitions
pins2lts-mc-linux64( 2/ 8), 0.769: [Blue] ~24 levels ~61440 states ~312408 transitions
pins2lts-mc-linux64( 2/ 8), 1.246: [Blue] ~24 levels ~122880 states ~693216 transitions
pins2lts-mc-linux64( 2/ 8), 2.185: [Blue] ~24 levels ~245760 states ~1407944 transitions
pins2lts-mc-linux64( 3/ 8), 3.695: [Blue] ~24 levels ~491520 states ~2945512 transitions
pins2lts-mc-linux64( 3/ 8), 6.197: [Blue] ~26 levels ~983040 states ~6315344 transitions
pins2lts-mc-linux64( 2/ 8), 10.726: [Blue] ~24 levels ~1966080 states ~12983832 transitions
pins2lts-mc-linux64( 2/ 8), 19.339: [Blue] ~24 levels ~3932160 states ~26240672 transitions
pins2lts-mc-linux64( 2/ 8), 37.245: [Blue] ~24 levels ~7864320 states ~54293520 transitions
pins2lts-mc-linux64( 5/ 8), 83.848: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 84.163:
pins2lts-mc-linux64( 0/ 8), 84.163: Explored 13970180 states 105201567 transitions, fanout: 7.530
pins2lts-mc-linux64( 0/ 8), 84.163: Total exploration time 84.100 sec (83.820 sec minimum, 83.908 sec on average)
pins2lts-mc-linux64( 0/ 8), 84.163: States per second: 166114, Transitions per second: 1250910
pins2lts-mc-linux64( 0/ 8), 84.163:
pins2lts-mc-linux64( 0/ 8), 84.163: State space has 13975594 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 84.163: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 84.163: blue states: 13970180 (99.96%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 84.163: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 84.163: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 84.163:
pins2lts-mc-linux64( 0/ 8), 84.163: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 84.163:
pins2lts-mc-linux64( 0/ 8), 84.163: Queue width: 8B, total height: 206, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 84.163: Tree memory: 362.6MB, 27.2 B/state, compr.: 3.4%
pins2lts-mc-linux64( 0/ 8), 84.164: Tree fill ratio (roots/leafs): 10.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 84.164: Stored 125 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 84.164: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 84.164: Est. total memory use: 362.6MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17161048594543633177;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(!(true U (LTLAPp0==true)))||X(!(((LTLAPp1==true) U (LTLAPp0==true)) U !(LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17161048594543633177;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((X(!(true U (LTLAPp0==true)))||X(!(((LTLAPp1==true) U (LTLAPp0==true)) U !(LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-18 14:05:34] [INFO ] Applying decomposition
[2023-03-18 14:05:34] [INFO ] Flatten gal took : 151 ms
[2023-03-18 14:05:34] [INFO ] Decomposing Gal with order
[2023-03-18 14:05:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 14:05:34] [INFO ] Removed a total of 205 redundant transitions.
[2023-03-18 14:05:35] [INFO ] Flatten gal took : 212 ms
[2023-03-18 14:05:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 121 ms.
[2023-03-18 14:05:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality16698174594577544524.gal : 9 ms
[2023-03-18 14:05:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality18343169795053430655.ltl : 22 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16698174594577544524.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality18343169795053430655.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 3 LTL properties
Checking formula 0 : !((F((X(!(F("((((((((gNNN0.Board_0+gNNN1.Board_1)+(gNNN2.Board_2+gNNN3.Board_3))+((gNNN4.Board_4+gNNN5.Board_5)+(gNNN6.Board_6+gNNN7.B...9195
Formula 0 simplified : XG(F"((((((((gNNN0.Board_0+gNNN1.Board_1)+(gNNN2.Board_2+gNNN3.Board_3))+((gNNN4.Board_4+gNNN5.Board_5)+(gNNN6.Board_6+gNNN7.Board_7...9176
Detected timeout of ITS tools.
[2023-03-18 14:29:12] [INFO ] Flatten gal took : 166 ms
[2023-03-18 14:29:12] [INFO ] Input system was already deterministic with 125 transitions.
[2023-03-18 14:29:12] [INFO ] Transformed 200 places.
[2023-03-18 14:29:12] [INFO ] Transformed 125 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-18 14:29:12] [INFO ] Time to serialize gal into /tmp/LTLCardinality8758100580773586010.gal : 12 ms
[2023-03-18 14:29:13] [INFO ] Time to serialize properties into /tmp/LTLCardinality10979883661636058115.ltl : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8758100580773586010.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10979883661636058115.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((X(!(F("((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11...5635
Formula 0 simplified : XG(F"((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+((B...5616
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12411400 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16113284 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-AN05"
export BK_EXAMINATION="LTLCardinality"
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-5348"
echo " Executing tool itstools"
echo " Input is Sudoku-COL-AN05, 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 r485-tall-167912698800035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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