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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.2K Feb 26 09:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 09:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 09:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 09:08 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:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 09:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 26 09:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 09:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 09:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:17 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 146K 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-BN09-LTLCardinality-00
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-01
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-02
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-03
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-04
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-05
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-06
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-07
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-08
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-09
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-10
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-11
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-12
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-13
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-14
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679173344907

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-BN09
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202303021504
[2023-03-18 21:02:27] [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 21:02:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 21:02:27] [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 21:02:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 21:02:28] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 475 ms
[2023-03-18 21:02:28] [INFO ] Imported 5 HL places and 1 HL transitions for a total of 1053 PT places and 6561.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 21:02:28] [INFO ] Built PT skeleton of HLPN with 5 places and 1 transitions 5 arcs in 4 ms.
[2023-03-18 21:02:28] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-COL-BN09-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 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 10042 steps, including 120 resets, run finished after 72 ms. (steps per millisecond=139 ) properties (out of 22) seen :12
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 45 ms. (steps per millisecond=223 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 30 ms. (steps per millisecond=334 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 17 ms. (steps per millisecond=590 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 12 ms. (steps per millisecond=836 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 11 ms. (steps per millisecond=912 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 12 ms. (steps per millisecond=836 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 10 ms. (steps per millisecond=1004 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 13 ms. (steps per millisecond=772 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 9 ms. (steps per millisecond=1115 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 9 ms. (steps per millisecond=1115 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1 rows 5 cols
[2023-03-18 21:02:28] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-18 21:02:28] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-18 21:02:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-18 21:02:28] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :1
[2023-03-18 21:02:28] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-18 21:02:28] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :1
Fused 10 Parikh solutions to 1 different solutions.
Finished Parikh walk after 41 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 2 ms.
Successfully simplified 9 atomic propositions for a total of 12 simplifications.
FORMULA Sudoku-COL-BN09-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 21:02:28] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2023-03-18 21:02:28] [INFO ] Flatten gal took : 17 ms
FORMULA Sudoku-COL-BN09-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 21:02:28] [INFO ] Flatten gal took : 1 ms
Domain [N(9), N(9)] of place Rows breaks symmetries in sort N
[2023-03-18 21:02:28] [INFO ] Unfolded HLPN to a Petri net with 1053 places and 729 transitions 3645 arcs in 41 ms.
[2023-03-18 21:02:28] [INFO ] Unfolded 7 HLPN properties in 2 ms.
Support contains 1053 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 16 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 1053 cols
[2023-03-18 21:02:28] [INFO ] Computed 324 place invariants in 25 ms
[2023-03-18 21:02:29] [INFO ] Implicit Places using invariants in 248 ms returned []
[2023-03-18 21:02:29] [INFO ] Invariant cache hit.
[2023-03-18 21:02:29] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
[2023-03-18 21:02:29] [INFO ] Invariant cache hit.
[2023-03-18 21:02:30] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1279 ms. Remains : 1053/1053 places, 729/729 transitions.
Support contains 1053 out of 1053 places after structural reductions.
[2023-03-18 21:02:30] [INFO ] Flatten gal took : 106 ms
[2023-03-18 21:02:30] [INFO ] Flatten gal took : 74 ms
[2023-03-18 21:02:30] [INFO ] Input system was already deterministic with 729 transitions.
Incomplete random walk after 10000 steps, including 150 resets, run finished after 1006 ms. (steps per millisecond=9 ) properties (out of 13) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-18 21:02:32] [INFO ] Invariant cache hit.
[2023-03-18 21:02:33] [INFO ] [Real]Absence check using 324 positive place invariants in 73 ms returned sat
[2023-03-18 21:02:55] [INFO ] After 22868ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 21:02:55] [INFO ] [Nat]Absence check using 324 positive place invariants in 74 ms returned sat
[2023-03-18 21:03:20] [INFO ] After 23495ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-18 21:03:20] [INFO ] After 23501ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-18 21:03:20] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 7 Parikh solutions to 4 different solutions.
Finished Parikh walk after 81 steps, including 0 resets, run visited all 6 properties in 8 ms. (steps per millisecond=10 )
Parikh walk visited 6 properties in 9 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
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' '!((G(p0) U p1))'
Support contains 810 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 66 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 21:03:21] [INFO ] Invariant cache hit.
[2023-03-18 21:03:22] [INFO ] Implicit Places using invariants in 519 ms returned []
[2023-03-18 21:03:22] [INFO ] Invariant cache hit.
[2023-03-18 21:03:23] [INFO ] Implicit Places using invariants and state equation in 1020 ms returned []
Implicit Place search using SMT with State Equation took 1553 ms to find 0 implicit places.
[2023-03-18 21:03:23] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-18 21:03:23] [INFO ] Invariant cache hit.
[2023-03-18 21:03:23] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2105 ms. Remains : 1053/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 250 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (LEQ 1 (ADD s891 s892 s893 s894 s895 s896 s897 s898 s899 s900 s901 s902 s903 s904 s905 s906 s907 s908 s909 s910 s911 s912 s913 s914 s915 s916 s917...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1975 reset in 5427 ms.
Product exploration explored 100000 steps with 1971 reset in 5385 ms.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 364 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 150 resets, run finished after 598 ms. (steps per millisecond=16 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 21:03:52] [INFO ] Invariant cache hit.
[2023-03-18 21:03:52] [INFO ] [Real]Absence check using 324 positive place invariants in 67 ms returned sat
[2023-03-18 21:03:52] [INFO ] After 378ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:03:53] [INFO ] [Nat]Absence check using 324 positive place invariants in 62 ms returned sat
[2023-03-18 21:04:03] [INFO ] After 10243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:04:14] [INFO ] After 20957ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3398 ms.
[2023-03-18 21:04:17] [INFO ] After 25010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 81 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=16 )
Parikh walk visited 2 properties in 4 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 10 factoid took 479 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), true, (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), true, (NOT p0)]
[2023-03-18 21:04:18] [INFO ] Invariant cache hit.
[2023-03-18 21:04:21] [INFO ] [Real]Absence check using 324 positive place invariants in 116 ms returned sat
[2023-03-18 21:04:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 21:04:22] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2023-03-18 21:04:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 21:04:25] [INFO ] [Nat]Absence check using 324 positive place invariants in 166 ms returned sat
[2023-03-18 21:04:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 21:04:26] [INFO ] [Nat]Absence check using state equation in 967 ms returned sat
[2023-03-18 21:04:26] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 32 ms.
[2023-03-18 21:04:26] [INFO ] Added : 0 causal constraints over 0 iterations in 115 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 810 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 37 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 21:04:26] [INFO ] Invariant cache hit.
[2023-03-18 21:04:26] [INFO ] Implicit Places using invariants in 454 ms returned []
[2023-03-18 21:04:26] [INFO ] Invariant cache hit.
[2023-03-18 21:04:27] [INFO ] Implicit Places using invariants and state equation in 853 ms returned []
Implicit Place search using SMT with State Equation took 1309 ms to find 0 implicit places.
[2023-03-18 21:04:27] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-18 21:04:27] [INFO ] Invariant cache hit.
[2023-03-18 21:04:28] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1790 ms. Remains : 1053/1053 places, 729/729 transitions.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 876 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 150 resets, run finished after 614 ms. (steps per millisecond=16 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 21:04:46] [INFO ] Invariant cache hit.
[2023-03-18 21:04:46] [INFO ] [Real]Absence check using 324 positive place invariants in 69 ms returned sat
[2023-03-18 21:04:46] [INFO ] After 399ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:04:46] [INFO ] [Nat]Absence check using 324 positive place invariants in 65 ms returned sat
[2023-03-18 21:04:58] [INFO ] After 10602ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:05:08] [INFO ] After 20966ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3374 ms.
[2023-03-18 21:05:11] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 81 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=16 )
Parikh walk visited 2 properties in 5 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 10 factoid took 496 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), true, (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), true, (NOT p0)]
[2023-03-18 21:05:12] [INFO ] Invariant cache hit.
[2023-03-18 21:05:15] [INFO ] [Real]Absence check using 324 positive place invariants in 110 ms returned sat
[2023-03-18 21:05:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 21:05:16] [INFO ] [Real]Absence check using state equation in 558 ms returned sat
[2023-03-18 21:05:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 21:05:19] [INFO ] [Nat]Absence check using 324 positive place invariants in 173 ms returned sat
[2023-03-18 21:05:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 21:05:20] [INFO ] [Nat]Absence check using state equation in 979 ms returned sat
[2023-03-18 21:05:20] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 28 ms.
[2023-03-18 21:05:20] [INFO ] Added : 0 causal constraints over 0 iterations in 104 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), true, (NOT p0)]
Product exploration explored 100000 steps with 2005 reset in 5270 ms.
Product exploration explored 100000 steps with 1980 reset in 5308 ms.
Built C files in :
/tmp/ltsmin17606305330673644470
[2023-03-18 21:05:30] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2023-03-18 21:05:30] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:05:30] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2023-03-18 21:05:30] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:05:31] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2023-03-18 21:05:31] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:05:31] [INFO ] Built C files in 146ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17606305330673644470
Running compilation step : cd /tmp/ltsmin17606305330673644470;'/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 2368 ms.
Running link step : cd /tmp/ltsmin17606305330673644470;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin17606305330673644470;'/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/stateBased4596980046325096580.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 810 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 16 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 21:05:45] [INFO ] Invariant cache hit.
[2023-03-18 21:05:46] [INFO ] Implicit Places using invariants in 493 ms returned []
[2023-03-18 21:05:46] [INFO ] Invariant cache hit.
[2023-03-18 21:05:47] [INFO ] Implicit Places using invariants and state equation in 836 ms returned []
Implicit Place search using SMT with State Equation took 1331 ms to find 0 implicit places.
[2023-03-18 21:05:47] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-18 21:05:47] [INFO ] Invariant cache hit.
[2023-03-18 21:05:47] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1802 ms. Remains : 1053/1053 places, 729/729 transitions.
Built C files in :
/tmp/ltsmin10303857440957526925
[2023-03-18 21:05:47] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2023-03-18 21:05:47] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:05:47] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2023-03-18 21:05:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:05:47] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2023-03-18 21:05:47] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:05:47] [INFO ] Built C files in 127ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10303857440957526925
Running compilation step : cd /tmp/ltsmin10303857440957526925;'/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 2292 ms.
Running link step : cd /tmp/ltsmin10303857440957526925;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin10303857440957526925;'/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/stateBased14549722306863030432.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 21:06:02] [INFO ] Flatten gal took : 50 ms
[2023-03-18 21:06:03] [INFO ] Flatten gal took : 54 ms
[2023-03-18 21:06:03] [INFO ] Time to serialize gal into /tmp/LTL4594152901752873479.gal : 16 ms
[2023-03-18 21:06:03] [INFO ] Time to serialize properties into /tmp/LTL10859357888537836351.prop : 2 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/LTL4594152901752873479.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17425851025067922199.hoa' '-atoms' '/tmp/LTL10859357888537836351.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/LTL10859357888537836351.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17425851025067922199.hoa
Detected timeout of ITS tools.
[2023-03-18 21:06:18] [INFO ] Flatten gal took : 44 ms
[2023-03-18 21:06:18] [INFO ] Flatten gal took : 42 ms
[2023-03-18 21:06:18] [INFO ] Time to serialize gal into /tmp/LTL17940781362707767663.gal : 9 ms
[2023-03-18 21:06:18] [INFO ] Time to serialize properties into /tmp/LTL1043186177082436143.ltl : 5 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/LTL17940781362707767663.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1043186177082436143.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 : !(((G("((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((C...10448
Formula 0 simplified : F!"((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((Cel...10443
Detected timeout of ITS tools.
[2023-03-18 21:06:33] [INFO ] Flatten gal took : 41 ms
[2023-03-18 21:06:33] [INFO ] Applying decomposition
[2023-03-18 21:06:33] [INFO ] Flatten gal took : 39 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/graph9627932901863908665.txt' '-o' '/tmp/graph9627932901863908665.bin' '-w' '/tmp/graph9627932901863908665.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9627932901863908665.bin' '-l' '-1' '-v' '-w' '/tmp/graph9627932901863908665.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:06:34] [INFO ] Decomposing Gal with order
[2023-03-18 21:06:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:06:35] [INFO ] Removed a total of 648 redundant transitions.
[2023-03-18 21:06:35] [INFO ] Flatten gal took : 778 ms
[2023-03-18 21:06:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 729 labels/synchronizations in 44 ms.
[2023-03-18 21:06:35] [INFO ] Time to serialize gal into /tmp/LTL17849236475392088995.gal : 10 ms
[2023-03-18 21:06:35] [INFO ] Time to serialize properties into /tmp/LTL1174885406024894706.ltl : 2 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/LTL17849236475392088995.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1174885406024894706.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 : !(((G("((((((((gu1.Cells_0+gu1.Cells_1)+(gu1.Cells_2+gu1.Cells_3))+((gu1.Cells_4+gu1.Cells_5)+(gu1.Cells_6+gu1.Cells_7)))+(((gu1.Cells...14012
Formula 0 simplified : F!"((((((((gu1.Cells_0+gu1.Cells_1)+(gu1.Cells_2+gu1.Cells_3))+((gu1.Cells_4+gu1.Cells_5)+(gu1.Cells_6+gu1.Cells_7)))+(((gu1.Cells_8...14007
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17459803172538458259
[2023-03-18 21:06:50] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17459803172538458259
Running compilation step : cd /tmp/ltsmin17459803172538458259;'/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 1674 ms.
Running link step : cd /tmp/ltsmin17459803172538458259;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17459803172538458259;'/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)) U (LTLAPp1==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-BN09-LTLCardinality-00 finished in 224785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(p1&&F((!p1&&G(!p0))))))))'
Support contains 891 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 8 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 21:07:06] [INFO ] Invariant cache hit.
[2023-03-18 21:07:06] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-18 21:07:06] [INFO ] Invariant cache hit.
[2023-03-18 21:07:07] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 1113 ms to find 0 implicit places.
[2023-03-18 21:07:07] [INFO ] Invariant cache hit.
[2023-03-18 21:07:07] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1559 ms. Remains : 1053/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (AND (NOT p0) p1), false, (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(GT (ADD s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 61 steps with 0 reset in 12 ms.
FORMULA Sudoku-COL-BN09-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN09-LTLCardinality-01 finished in 2392 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 U (G(p0)||(p0&&(F(G(p1))||G(!p2)||(G(F(p3))&&(!p2||F(G(p1))))))))))'
Support contains 891 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 18 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 21:07:08] [INFO ] Invariant cache hit.
[2023-03-18 21:07:08] [INFO ] Implicit Places using invariants in 381 ms returned []
[2023-03-18 21:07:08] [INFO ] Invariant cache hit.
[2023-03-18 21:07:09] [INFO ] Implicit Places using invariants and state equation in 754 ms returned []
Implicit Place search using SMT with State Equation took 1137 ms to find 0 implicit places.
[2023-03-18 21:07:09] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-18 21:07:09] [INFO ] Invariant cache hit.
[2023-03-18 21:07:09] [INFO ] Dead Transitions using invariants and state equation in 434 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1609 ms. Remains : 1053/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 295 ms :[(NOT p0), (AND (NOT p0) (NOT p1) p2 (NOT p3)), (AND (NOT p0) (NOT p1) p2 (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p2) (NOT p3) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3) (NOT p0)), acceptance={2} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), acceptance={0, 2} source=1 dest: 1}, { cond=(AND p1 p2 (NOT p3) p0), acceptance={1} source=1 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={0, 1} source=1 dest: 4}, { cond=(AND p1 p2 (NOT p3) (NOT p0)), acceptance={1, 2} source=1 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={0, 1, 2} source=1 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) (NOT p0))), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2 p0), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={1, 2} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2) (NOT p3) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={0} source=4 dest: 1}, { cond=(AND p1 p2 (NOT p3) p0), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={1, 2} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={0, 1, 2} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 2}, { cond=(OR (AND p2 (NOT p3)) (AND (NOT p3) (NOT p0))), acceptance={} source=5 dest: 4}, { cond=(OR p2 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GT 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s3...], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 66 steps with 0 reset in 9 ms.
FORMULA Sudoku-COL-BN09-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN09-LTLCardinality-03 finished in 1953 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)&&X(G(p1))))'
Support contains 1053 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 6 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 21:07:09] [INFO ] Invariant cache hit.
[2023-03-18 21:07:10] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-18 21:07:10] [INFO ] Invariant cache hit.
[2023-03-18 21:07:10] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
[2023-03-18 21:07:10] [INFO ] Invariant cache hit.
[2023-03-18 21:07:11] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1036 ms. Remains : 1053/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 1854 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GT (ADD s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-BN09-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN09-LTLCardinality-04 finished in 2915 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 81 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 324 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.5 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 44 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2023-03-18 21:07:12] [INFO ] Computed 75 place invariants in 44 ms
[2023-03-18 21:07:13] [INFO ] Implicit Places using invariants in 338 ms returned []
[2023-03-18 21:07:13] [INFO ] Invariant cache hit.
[2023-03-18 21:07:13] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 1021 ms to find 0 implicit places.
[2023-03-18 21:07:13] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-18 21:07:13] [INFO ] Invariant cache hit.
[2023-03-18 21:07:14] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 324/1053 places, 729/729 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1353 ms. Remains : 324/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 3 (ADD s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 65 steps with 0 reset in 4 ms.
FORMULA Sudoku-COL-BN09-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN09-LTLCardinality-08 finished in 1465 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 81 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 324 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.3 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
[2023-03-18 21:07:14] [INFO ] Invariant cache hit.
[2023-03-18 21:07:14] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-18 21:07:14] [INFO ] Invariant cache hit.
[2023-03-18 21:07:15] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 887 ms to find 0 implicit places.
[2023-03-18 21:07:15] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-18 21:07:15] [INFO ] Invariant cache hit.
[2023-03-18 21:07:15] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 324/1053 places, 729/729 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1185 ms. Remains : 324/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 729 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1508 reset in 4795 ms.
Product exploration explored 100000 steps with 1508 reset in 4891 ms.
Computed a total of 324 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 201 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 45 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 151 resets, run finished after 487 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 518705 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :{}
Probabilistic random walk after 518705 steps, saw 110676 distinct states, run finished after 3004 ms. (steps per millisecond=172 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:07:33] [INFO ] Invariant cache hit.
[2023-03-18 21:07:33] [INFO ] [Real]Absence check using 0 positive and 75 generalized place invariants in 23 ms returned sat
[2023-03-18 21:07:41] [INFO ] After 8034ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:07:41] [INFO ] [Nat]Absence check using 0 positive and 75 generalized place invariants in 21 ms returned sat
[2023-03-18 21:07:44] [INFO ] After 2750ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:07:46] [INFO ] After 5061ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7244 ms.
[2023-03-18 21:07:53] [INFO ] After 12393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 81 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=27 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 81 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 17 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 21:07:54] [INFO ] Invariant cache hit.
[2023-03-18 21:07:54] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-18 21:07:54] [INFO ] Invariant cache hit.
[2023-03-18 21:07:55] [INFO ] Implicit Places using invariants and state equation in 659 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
[2023-03-18 21:07:55] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-18 21:07:55] [INFO ] Invariant cache hit.
[2023-03-18 21:07:55] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1229 ms. Remains : 324/324 places, 729/729 transitions.
Computed a total of 324 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 218 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)]
Incomplete random walk after 10000 steps, including 150 resets, run finished after 484 ms. (steps per millisecond=20 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 520988 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :{}
Probabilistic random walk after 520988 steps, saw 110935 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:08:02] [INFO ] Invariant cache hit.
[2023-03-18 21:08:02] [INFO ] [Real]Absence check using 0 positive and 75 generalized place invariants in 21 ms returned sat
[2023-03-18 21:08:10] [INFO ] After 7940ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:08:10] [INFO ] [Nat]Absence check using 0 positive and 75 generalized place invariants in 21 ms returned sat
[2023-03-18 21:08:13] [INFO ] After 2746ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:08:15] [INFO ] After 4906ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7289 ms.
[2023-03-18 21:08:22] [INFO ] After 12286ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 81 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 171 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 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1507 reset in 4786 ms.
Product exploration explored 100000 steps with 1508 reset in 4857 ms.
Built C files in :
/tmp/ltsmin14629267011483503848
[2023-03-18 21:08:32] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2023-03-18 21:08:32] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:08:32] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2023-03-18 21:08:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:08:32] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2023-03-18 21:08:32] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:08:32] [INFO ] Built C files in 105ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14629267011483503848
Running compilation step : cd /tmp/ltsmin14629267011483503848;'/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 2442 ms.
Running link step : cd /tmp/ltsmin14629267011483503848;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin14629267011483503848;'/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/stateBased10819528170009862183.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 81 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 16 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 21:08:47] [INFO ] Invariant cache hit.
[2023-03-18 21:08:48] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-18 21:08:48] [INFO ] Invariant cache hit.
[2023-03-18 21:08:48] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
[2023-03-18 21:08:48] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-18 21:08:48] [INFO ] Invariant cache hit.
[2023-03-18 21:08:49] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1208 ms. Remains : 324/324 places, 729/729 transitions.
Built C files in :
/tmp/ltsmin11084938518462748340
[2023-03-18 21:08:49] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2023-03-18 21:08:49] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:08:49] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2023-03-18 21:08:49] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:08:49] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2023-03-18 21:08:49] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:08:49] [INFO ] Built C files in 109ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11084938518462748340
Running compilation step : cd /tmp/ltsmin11084938518462748340;'/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 2076 ms.
Running link step : cd /tmp/ltsmin11084938518462748340;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin11084938518462748340;'/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/stateBased18012225872069951490.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 21:09:04] [INFO ] Flatten gal took : 45 ms
[2023-03-18 21:09:04] [INFO ] Flatten gal took : 44 ms
[2023-03-18 21:09:04] [INFO ] Time to serialize gal into /tmp/LTL14714141842801416700.gal : 4 ms
[2023-03-18 21:09:04] [INFO ] Time to serialize properties into /tmp/LTL7610896886876169303.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/LTL14714141842801416700.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9326757898405110626.hoa' '-atoms' '/tmp/LTL7610896886876169303.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/LTL7610896886876169303.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9326757898405110626.hoa
Detected timeout of ITS tools.
[2023-03-18 21:09:19] [INFO ] Flatten gal took : 32 ms
[2023-03-18 21:09:19] [INFO ] Flatten gal took : 33 ms
[2023-03-18 21:09:19] [INFO ] Time to serialize gal into /tmp/LTL7172968054258019621.gal : 4 ms
[2023-03-18 21:09:19] [INFO ] Time to serialize properties into /tmp/LTL13834321514793576569.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/LTL7172968054258019621.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13834321514793576569.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(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...836
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_1...830
Detected timeout of ITS tools.
[2023-03-18 21:09:34] [INFO ] Flatten gal took : 34 ms
[2023-03-18 21:09:34] [INFO ] Applying decomposition
[2023-03-18 21:09:34] [INFO ] Flatten gal took : 31 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/graph3126260804891510062.txt' '-o' '/tmp/graph3126260804891510062.bin' '-w' '/tmp/graph3126260804891510062.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3126260804891510062.bin' '-l' '-1' '-v' '-w' '/tmp/graph3126260804891510062.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:09:34] [INFO ] Decomposing Gal with order
[2023-03-18 21:09:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:09:34] [INFO ] Removed a total of 2592 redundant transitions.
[2023-03-18 21:09:34] [INFO ] Flatten gal took : 95 ms
[2023-03-18 21:09:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2023-03-18 21:09:35] [INFO ] Time to serialize gal into /tmp/LTL5450815282895284946.gal : 5 ms
[2023-03-18 21:09:35] [INFO ] Time to serialize properties into /tmp/LTL6588490079436895107.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/LTL5450815282895284946.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6588490079436895107.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.R...1160
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.Row...1154
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1992765349111703751
[2023-03-18 21:09:50] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1992765349111703751
Running compilation step : cd /tmp/ltsmin1992765349111703751;'/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 1390 ms.
Running link step : cd /tmp/ltsmin1992765349111703751;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1992765349111703751;'/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-BN09-LTLCardinality-13 finished in 170831 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(F(p1)))))))'
Support contains 891 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 28 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 1053 cols
[2023-03-18 21:10:05] [INFO ] Computed 324 place invariants in 16 ms
[2023-03-18 21:10:05] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-18 21:10:05] [INFO ] Invariant cache hit.
[2023-03-18 21:10:06] [INFO ] Implicit Places using invariants and state equation in 726 ms returned []
Implicit Place search using SMT with State Equation took 1084 ms to find 0 implicit places.
[2023-03-18 21:10:06] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-18 21:10:06] [INFO ] Invariant cache hit.
[2023-03-18 21:10:06] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1552 ms. Remains : 1053/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ (ADD s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 73 steps with 1 reset in 7 ms.
FORMULA Sudoku-COL-BN09-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN09-LTLCardinality-14 finished in 1781 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U p1))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-18 21:10:07] [INFO ] Flatten gal took : 37 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3059964604716393189
[2023-03-18 21:10:07] [INFO ] Computing symmetric may disable matrix : 729 transitions.
[2023-03-18 21:10:07] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:10:07] [INFO ] Computing symmetric may enable matrix : 729 transitions.
[2023-03-18 21:10:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:10:07] [INFO ] Applying decomposition
[2023-03-18 21:10:07] [INFO ] Flatten gal took : 35 ms
[2023-03-18 21:10:07] [INFO ] Computing Do-Not-Accords matrix : 729 transitions.
[2023-03-18 21:10:07] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 21:10:07] [INFO ] Built C files in 145ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3059964604716393189
Running compilation step : cd /tmp/ltsmin3059964604716393189;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' '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'
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/graph12268818642021458554.txt' '-o' '/tmp/graph12268818642021458554.bin' '-w' '/tmp/graph12268818642021458554.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12268818642021458554.bin' '-l' '-1' '-v' '-w' '/tmp/graph12268818642021458554.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:10:08] [INFO ] Decomposing Gal with order
[2023-03-18 21:10:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:10:08] [INFO ] Removed a total of 1296 redundant transitions.
[2023-03-18 21:10:08] [INFO ] Flatten gal took : 433 ms
[2023-03-18 21:10:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2023-03-18 21:10:08] [INFO ] Time to serialize gal into /tmp/LTLCardinality17063666793878955875.gal : 6 ms
[2023-03-18 21:10:08] [INFO ] Time to serialize properties into /tmp/LTLCardinality11187594513512574708.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/LTLCardinality17063666793878955875.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11187594513512574708.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 2 LTL properties
Checking formula 0 : !(((G("((((((((gu2.Cells_0+gu2.Cells_1)+(gu2.Cells_2+gu2.Cells_3))+((gu2.Cells_4+gu2.Cells_5)+(gu2.Cells_6+gu2.Cells_7)))+(((gu2.Cells...14012
Formula 0 simplified : F!"((((((((gu2.Cells_0+gu2.Cells_1)+(gu2.Cells_2+gu2.Cells_3))+((gu2.Cells_4+gu2.Cells_5)+(gu2.Cells_6+gu2.Cells_7)))+(((gu2.Cells_8...14007
Compilation finished in 2511 ms.
Running link step : cd /tmp/ltsmin3059964604716393189;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin3059964604716393189;'/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' '--ltl' '([]((LTLAPp0==true)) U (LTLAPp1==true))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.079: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.078: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.089: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.092: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.098: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.098: Initializing POR dependencies: labels 732, guards 729
pins2lts-mc-linux64( 4/ 8), 0.106: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.110: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 15.319: LTL layer: formula: ([]((LTLAPp0==true)) U (LTLAPp1==true))
pins2lts-mc-linux64( 2/ 8), 15.319: "([]((LTLAPp0==true)) U (LTLAPp1==true))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 15.320: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 16.071: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 16.095: There are 733 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 16.095: State length is 1054, there are 737 groups
pins2lts-mc-linux64( 0/ 8), 16.095: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 16.095: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 16.095: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 16.095: Visible groups: 0 / 737, labels: 2 / 733
pins2lts-mc-linux64( 0/ 8), 16.095: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 16.095: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 1/ 8), 17.949: [Blue] ~65 levels ~960 states ~111176 transitions
pins2lts-mc-linux64( 1/ 8), 18.024: [Blue] ~65 levels ~1920 states ~114248 transitions
pins2lts-mc-linux64( 1/ 8), 18.169: [Blue] ~65 levels ~3840 states ~122712 transitions
pins2lts-mc-linux64( 1/ 8), 18.422: [Blue] ~65 levels ~7680 states ~140216 transitions
pins2lts-mc-linux64( 1/ 8), 18.931: [Blue] ~65 levels ~15360 states ~174744 transitions
pins2lts-mc-linux64( 1/ 8), 20.159: [Blue] ~65 levels ~30720 states ~256640 transitions
pins2lts-mc-linux64( 1/ 8), 22.534: [Blue] ~66 levels ~61440 states ~428928 transitions
pins2lts-mc-linux64( 1/ 8), 27.589: [Blue] ~66 levels ~122880 states ~793880 transitions
pins2lts-mc-linux64( 1/ 8), 37.763: [Blue] ~66 levels ~245760 states ~1556912 transitions
pins2lts-mc-linux64( 1/ 8), 61.247: [Blue] ~67 levels ~491520 states ~3189952 transitions
pins2lts-mc-linux64( 2/ 8), 106.668: [Blue] ~68 levels ~983040 states ~6774200 transitions
pins2lts-mc-linux64( 1/ 8), 196.921: [Blue] ~67 levels ~1966080 states ~14242648 transitions
pins2lts-mc-linux64( 2/ 8), 392.286: [Blue] ~68 levels ~3932160 states ~30349992 transitions
pins2lts-mc-linux64( 6/ 8), 629.415: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 629.565:
pins2lts-mc-linux64( 0/ 8), 629.565: Explored 6093463 states 49441192 transitions, fanout: 8.114
pins2lts-mc-linux64( 0/ 8), 629.565: Total exploration time 613.450 sec (613.350 sec minimum, 613.385 sec on average)
pins2lts-mc-linux64( 0/ 8), 629.565: States per second: 9933, Transitions per second: 80595
pins2lts-mc-linux64( 0/ 8), 629.565:
pins2lts-mc-linux64( 0/ 8), 629.565: State space has 6197729 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 629.565: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 629.565: blue states: 6093463 (98.32%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 629.565: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 629.565: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 629.565:
pins2lts-mc-linux64( 0/ 8), 629.565: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 629.565:
pins2lts-mc-linux64( 0/ 8), 629.565: Queue width: 8B, total height: 546, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 629.565: Tree memory: 303.3MB, 51.3 B/state, compr.: 1.2%
pins2lts-mc-linux64( 0/ 8), 629.565: Tree fill ratio (roots/leafs): 4.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 629.565: Stored 777 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 629.565: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 629.565: Est. total memory use: 303.3MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3059964604716393189;'/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' '--ltl' '([]((LTLAPp0==true)) U (LTLAPp1==true))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3059964604716393189;'/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' '--ltl' '([]((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 21:32:50] [INFO ] Applying decomposition
[2023-03-18 21:32:50] [INFO ] Flatten gal took : 228 ms
[2023-03-18 21:32:50] [INFO ] Decomposing Gal with order
[2023-03-18 21:32:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:32:51] [INFO ] Removed a total of 1872 redundant transitions.
[2023-03-18 21:32:52] [INFO ] Flatten gal took : 681 ms
[2023-03-18 21:32:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 52 ms.
[2023-03-18 21:32:52] [INFO ] Time to serialize gal into /tmp/LTLCardinality18172050397690451866.gal : 29 ms
[2023-03-18 21:32:52] [INFO ] Time to serialize properties into /tmp/LTLCardinality12142931419407556531.ltl : 5 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/LTLCardinality18172050397690451866.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12142931419407556531.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 2 LTL properties
Checking formula 0 : !(((G("((((((((gNN0.Cells_0+gNN1.Cells_1)+(gNN2.Cells_2+gNN3.Cells_3))+((gNN4.Cells_4+gNN5.Cells_5)+(gNN6.Cells_6+gNN7.Cells_7)))+(((g...17122
Formula 0 simplified : F!"((((((((gNN0.Cells_0+gNN1.Cells_1)+(gNN2.Cells_2+gNN3.Cells_3))+((gNN4.Cells_4+gNN5.Cells_5)+(gNN6.Cells_6+gNN7.Cells_7)))+(((gNN...17117
Detected timeout of ITS tools.
[2023-03-18 21:55:27] [INFO ] Flatten gal took : 410 ms
[2023-03-18 21:55:37] [INFO ] Input system was already deterministic with 729 transitions.
[2023-03-18 21:55:37] [INFO ] Transformed 1053 places.
[2023-03-18 21:55:37] [INFO ] Transformed 729 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 21:55:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality11562729805613039129.gal : 12 ms
[2023-03-18 21:55:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality8070836688894820319.ltl : 7 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/LTLCardinality11562729805613039129.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8070836688894820319.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 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G("((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((C...10448
Formula 0 simplified : F!"((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((Cel...10443
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6400436 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15753904 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-BN09"
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-BN09, 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-167912699000147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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