Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 7.9K Apr 30 12:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 30 12:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 09:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 09:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 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-AN06-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653065866188

Running Version 202205111006
[2022-05-20 16:57:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 16:57:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 16:57:47] [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.
[2022-05-20 16:57:47] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 16:57:47] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 479 ms
[2022-05-20 16:57:47] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 324 PT places and 216.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2022-05-20 16:57:47] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 8 ms.
[2022-05-20 16:57:47] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 5 formulas.
FORMULA Sudoku-COL-AN06-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN06-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10031 steps, including 263 resets, run finished after 85 ms. (steps per millisecond=118 ) properties (out of 14) seen :8
Incomplete Best-First random walk after 10031 steps, including 263 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10031 steps, including 263 resets, run finished after 29 ms. (steps per millisecond=345 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10031 steps, including 263 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10031 steps, including 263 resets, run finished after 26 ms. (steps per millisecond=385 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10031 steps, including 263 resets, run finished after 16 ms. (steps per millisecond=626 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10031 steps, including 263 resets, run finished after 26 ms. (steps per millisecond=385 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 16:57:48] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-20 16:57:48] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-20 16:57:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-20 16:57:48] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :1
[2022-05-20 16:57:48] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-20 16:57:48] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :1
Fused 6 Parikh solutions to 1 different solutions.
Finished Parikh walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 1 ms.
Successfully simplified 5 atomic propositions for a total of 11 simplifications.
FORMULA Sudoku-COL-AN06-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN06-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 16:57:48] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-20 16:57:48] [INFO ] Flatten gal took : 12 ms
FORMULA Sudoku-COL-AN06-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 16:57:48] [INFO ] Flatten gal took : 1 ms
Domain [N(6), N(6)] of place Rows breaks symmetries in sort N
[2022-05-20 16:57:48] [INFO ] Unfolded HLPN to a Petri net with 324 places and 216 transitions 864 arcs in 12 ms.
[2022-05-20 16:57:48] [INFO ] Unfolded 8 HLPN properties in 1 ms.
Support contains 324 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 8 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 16:57:48] [INFO ] Computed 108 place invariants in 6 ms
[2022-05-20 16:57:48] [INFO ] Implicit Places using invariants in 104 ms returned []
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 16:57:48] [INFO ] Computed 108 place invariants in 9 ms
[2022-05-20 16:57:48] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 16:57:48] [INFO ] Computed 108 place invariants in 7 ms
[2022-05-20 16:57:49] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 216/216 transitions.
Support contains 324 out of 324 places after structural reductions.
[2022-05-20 16:57:49] [INFO ] Flatten gal took : 35 ms
[2022-05-20 16:57:49] [INFO ] Flatten gal took : 29 ms
[2022-05-20 16:57:49] [INFO ] Input system was already deterministic with 216 transitions.
Incomplete random walk after 10000 steps, including 317 resets, run finished after 480 ms. (steps per millisecond=20 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 16:57:49] [INFO ] Computed 108 place invariants in 5 ms
[2022-05-20 16:57:50] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 16:57:50] [INFO ] [Nat]Absence check using 108 positive place invariants in 15 ms returned sat
[2022-05-20 16:57:50] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2022-05-20 16:57:50] [INFO ] After 303ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2022-05-20 16:57:50] [INFO ] After 484ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 36 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 1 ms.
Successfully simplified 3 atomic propositions for a total of 8 simplifications.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(F(p0)))))'
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 18 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 16:57:50] [INFO ] Computed 108 place invariants in 2 ms
[2022-05-20 16:57:50] [INFO ] Implicit Places using invariants in 127 ms returned []
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 16:57:50] [INFO ] Computed 108 place invariants in 2 ms
[2022-05-20 16:57:51] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2022-05-20 16:57:51] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 16:57:51] [INFO ] Computed 108 place invariants in 2 ms
[2022-05-20 16:57:51] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-00 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:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35) (ADD s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5263 reset in 2504 ms.
Product exploration explored 100000 steps with 5263 reset in 2458 ms.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 16:57:57] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-20 16:57:57] [INFO ] [Real]Absence check using 108 positive place invariants in 22 ms returned sat
[2022-05-20 16:57:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 16:57:57] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2022-05-20 16:57:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 16:57:58] [INFO ] [Nat]Absence check using 108 positive place invariants in 72 ms returned sat
[2022-05-20 16:57:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 16:57:58] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2022-05-20 16:57:58] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-20 16:57:58] [INFO ] Added : 0 causal constraints over 0 iterations in 45 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 16 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 16:57:58] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-20 16:57:58] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 16:57:58] [INFO ] Computed 108 place invariants in 2 ms
[2022-05-20 16:57:59] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2022-05-20 16:57:59] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 16:57:59] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-20 16:57:59] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 216/216 transitions.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 951 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 16:58:01] [INFO ] Computed 108 place invariants in 3 ms
[2022-05-20 16:58:01] [INFO ] [Real]Absence check using 108 positive place invariants in 24 ms returned sat
[2022-05-20 16:58:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 16:58:01] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2022-05-20 16:58:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 16:58:02] [INFO ] [Nat]Absence check using 108 positive place invariants in 76 ms returned sat
[2022-05-20 16:58:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 16:58:02] [INFO ] [Nat]Absence check using state equation in 489 ms returned sat
[2022-05-20 16:58:02] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-20 16:58:02] [INFO ] Added : 0 causal constraints over 0 iterations in 50 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5263 reset in 2453 ms.
Product exploration explored 100000 steps with 5263 reset in 2473 ms.
Built C files in :
/tmp/ltsmin13947614523685629340
[2022-05-20 16:58:07] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2022-05-20 16:58:07] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:58:07] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2022-05-20 16:58:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:58:07] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2022-05-20 16:58:07] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:58:07] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13947614523685629340
Running compilation step : cd /tmp/ltsmin13947614523685629340;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 573 ms.
Running link step : cd /tmp/ltsmin13947614523685629340;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin13947614523685629340;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11446799735076736618.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 14 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 16:58:22] [INFO ] Computed 108 place invariants in 2 ms
[2022-05-20 16:58:22] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 16:58:22] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-20 16:58:23] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2022-05-20 16:58:23] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 16:58:23] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-20 16:58:23] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 216/216 transitions.
Built C files in :
/tmp/ltsmin1714833207335034922
[2022-05-20 16:58:23] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2022-05-20 16:58:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:58:23] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2022-05-20 16:58:23] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:58:23] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2022-05-20 16:58:23] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:58:23] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1714833207335034922
Running compilation step : cd /tmp/ltsmin1714833207335034922;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 470 ms.
Running link step : cd /tmp/ltsmin1714833207335034922;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1714833207335034922;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11058668808786545261.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 16:58:38] [INFO ] Flatten gal took : 27 ms
[2022-05-20 16:58:38] [INFO ] Flatten gal took : 26 ms
[2022-05-20 16:58:38] [INFO ] Time to serialize gal into /tmp/LTL4657187533885801053.gal : 4 ms
[2022-05-20 16:58:38] [INFO ] Time to serialize properties into /tmp/LTL8583200691556830748.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4657187533885801053.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8583200691556830748.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4657187...266
Read 1 LTL properties
Checking formula 0 : !((G(X(G(F("(((((((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+R...2870
Formula 0 simplified : !GXGF"(((((((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_...2860
Detected timeout of ITS tools.
[2022-05-20 16:58:53] [INFO ] Flatten gal took : 21 ms
[2022-05-20 16:58:53] [INFO ] Applying decomposition
[2022-05-20 16:58:53] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1158610449184852006.txt' '-o' '/tmp/graph1158610449184852006.bin' '-w' '/tmp/graph1158610449184852006.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1158610449184852006.bin' '-l' '-1' '-v' '-w' '/tmp/graph1158610449184852006.weights' '-q' '0' '-e' '0.001'
[2022-05-20 16:58:53] [INFO ] Decomposing Gal with order
[2022-05-20 16:58:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:58:53] [INFO ] Removed a total of 281 redundant transitions.
[2022-05-20 16:58:53] [INFO ] Flatten gal took : 121 ms
[2022-05-20 16:58:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 10 ms.
[2022-05-20 16:58:53] [INFO ] Time to serialize gal into /tmp/LTL15529186935787091450.gal : 4 ms
[2022-05-20 16:58:53] [INFO ] Time to serialize properties into /tmp/LTL12792247723490536180.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15529186935787091450.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12792247723490536180.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1552918...268
Read 1 LTL properties
Checking formula 0 : !((G(X(G(F("(((((((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+gu...3878
Formula 0 simplified : !GXGF"(((((((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.Ro...3868
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7327921090440459463
[2022-05-20 16:59:08] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7327921090440459463
Running compilation step : cd /tmp/ltsmin7327921090440459463;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 622 ms.
Running link step : cd /tmp/ltsmin7327921090440459463;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin7327921090440459463;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X([](<>((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN06-LTLCardinality-00 finished in 93364 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(G(p0))) U X(p1)))'
Support contains 72 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 108 transition count 216
Applied a total of 216 rules in 14 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 16:59:24] [INFO ] Computed 17 place invariants in 10 ms
[2022-05-20 16:59:24] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 16:59:24] [INFO ] Computed 17 place invariants in 6 ms
[2022-05-20 16:59:24] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 16:59:24] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-20 16:59:24] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35)), p0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1615 ms.
Product exploration explored 100000 steps with 50000 reset in 1668 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 6 factoid took 90 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN06-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN06-LTLCardinality-02 finished in 4007 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1 U (F(G(p2))&&p2)))))'
Support contains 324 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 16:59:28] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-20 16:59:28] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 16:59:28] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-20 16:59:28] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 16:59:28] [INFO ] Computed 108 place invariants in 2 ms
[2022-05-20 16:59:28] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2)]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GT 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN06-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN06-LTLCardinality-04 finished in 465 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 36 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 108 transition count 216
Applied a total of 216 rules in 4 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 16:59:28] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-20 16:59:28] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 16:59:28] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-20 16:59:28] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 16:59:28] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-20 16:59:28] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1624 ms.
Product exploration explored 100000 steps with 50000 reset in 1661 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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 : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 1004 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN06-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN06-LTLCardinality-06 finished in 4850 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(p0) U p0))'
Support contains 216 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 5 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 16:59:33] [INFO ] Computed 108 place invariants in 0 ms
[2022-05-20 16:59:33] [INFO ] Implicit Places using invariants in 129 ms returned []
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 16:59:33] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-20 16:59:33] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 16:59:33] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-20 16:59:33] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 61 ms :[p0, true, p0]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 3 (ADD s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2495 ms.
Product exploration explored 100000 steps with 50000 reset in 2533 ms.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN06-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN06-LTLCardinality-10 finished in 5891 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(true U false)&&X(p0)))'
Support contains 108 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 108 transition count 216
Applied a total of 216 rules in 4 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 16:59:39] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-20 16:59:39] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 16:59:39] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-20 16:59:39] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
// Phase 1: matrix 216 rows 108 cols
[2022-05-20 16:59:39] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-20 16:59:39] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions, in 1 iterations. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GT 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN06-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN06-LTLCardinality-11 finished in 283 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(p0)))'
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 12 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 16:59:39] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-20 16:59:39] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 16:59:39] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-20 16:59:39] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2022-05-20 16:59:39] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 16:59:39] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-20 16:59:39] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s7...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5000 reset in 2236 ms.
Product exploration explored 100000 steps with 5000 reset in 2299 ms.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 132 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 610 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 16:59:45] [INFO ] Computed 108 place invariants in 2 ms
[2022-05-20 16:59:46] [INFO ] [Real]Absence check using 108 positive place invariants in 26 ms returned sat
[2022-05-20 16:59:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 16:59:46] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2022-05-20 16:59:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 16:59:46] [INFO ] [Nat]Absence check using 108 positive place invariants in 100 ms returned sat
[2022-05-20 16:59:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 16:59:46] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2022-05-20 16:59:46] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-20 16:59:46] [INFO ] Added : 0 causal constraints over 0 iterations in 37 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 8 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 16:59:46] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-20 16:59:46] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 16:59:46] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-20 16:59:47] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2022-05-20 16:59:47] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 16:59:47] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-20 16:59:47] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 216/216 transitions.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 122 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 19 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 16:59:48] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-20 16:59:48] [INFO ] [Real]Absence check using 108 positive place invariants in 25 ms returned sat
[2022-05-20 16:59:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 16:59:48] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2022-05-20 16:59:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 16:59:48] [INFO ] [Nat]Absence check using 108 positive place invariants in 100 ms returned sat
[2022-05-20 16:59:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 16:59:49] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2022-05-20 16:59:49] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-20 16:59:49] [INFO ] Added : 0 causal constraints over 0 iterations in 49 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5000 reset in 2247 ms.
Product exploration explored 100000 steps with 5000 reset in 2237 ms.
Built C files in :
/tmp/ltsmin2468124389085845117
[2022-05-20 16:59:53] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2022-05-20 16:59:53] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:59:53] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2022-05-20 16:59:53] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:59:53] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2022-05-20 16:59:53] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 16:59:53] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2468124389085845117
Running compilation step : cd /tmp/ltsmin2468124389085845117;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 483 ms.
Running link step : cd /tmp/ltsmin2468124389085845117;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin2468124389085845117;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13325522982885706878.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 12 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 17:00:08] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-20 17:00:08] [INFO ] Implicit Places using invariants in 124 ms returned []
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 17:00:08] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-20 17:00:09] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2022-05-20 17:00:09] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 17:00:09] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-20 17:00:09] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 216/216 transitions.
Built C files in :
/tmp/ltsmin6867176274007679211
[2022-05-20 17:00:09] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2022-05-20 17:00:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:00:09] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2022-05-20 17:00:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:00:09] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2022-05-20 17:00:09] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:00:09] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6867176274007679211
Running compilation step : cd /tmp/ltsmin6867176274007679211;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 488 ms.
Running link step : cd /tmp/ltsmin6867176274007679211;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6867176274007679211;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3506679373856239227.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 17:00:24] [INFO ] Flatten gal took : 17 ms
[2022-05-20 17:00:24] [INFO ] Flatten gal took : 14 ms
[2022-05-20 17:00:24] [INFO ] Time to serialize gal into /tmp/LTL389440822872195931.gal : 2 ms
[2022-05-20 17:00:24] [INFO ] Time to serialize properties into /tmp/LTL10779564111277794710.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL389440822872195931.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10779564111277794710.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3894408...266
Read 1 LTL properties
Checking formula 0 : !((F(F("(((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+(...2971
Formula 0 simplified : !F"(((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+((Bo...2964
Detected timeout of ITS tools.
[2022-05-20 17:00:39] [INFO ] Flatten gal took : 18 ms
[2022-05-20 17:00:39] [INFO ] Applying decomposition
[2022-05-20 17:00:39] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1574236627735275161.txt' '-o' '/tmp/graph1574236627735275161.bin' '-w' '/tmp/graph1574236627735275161.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1574236627735275161.bin' '-l' '-1' '-v' '-w' '/tmp/graph1574236627735275161.weights' '-q' '0' '-e' '0.001'
[2022-05-20 17:00:39] [INFO ] Decomposing Gal with order
[2022-05-20 17:00:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 17:00:39] [INFO ] Removed a total of 273 redundant transitions.
[2022-05-20 17:00:39] [INFO ] Flatten gal took : 92 ms
[2022-05-20 17:00:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 5 ms.
[2022-05-20 17:00:39] [INFO ] Time to serialize gal into /tmp/LTL14855386397641857175.gal : 2 ms
[2022-05-20 17:00:39] [INFO ] Time to serialize properties into /tmp/LTL9918901761746750328.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14855386397641857175.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9918901761746750328.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1485538...267
Read 1 LTL properties
Checking formula 0 : !((F(F("(((((((((gu51.Board_0+gu51.Board_1)+(gu51.Board_2+gu51.Board_3))+((gu51.Board_4+gu51.Board_5)+(gu51.Board_6+gu51.Board_7)))+((...4231
Formula 0 simplified : !F"(((((((((gu51.Board_0+gu51.Board_1)+(gu51.Board_2+gu51.Board_3))+((gu51.Board_4+gu51.Board_5)+(gu51.Board_6+gu51.Board_7)))+(((gu...4224
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12705155641776391863
[2022-05-20 17:00:54] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12705155641776391863
Running compilation step : cd /tmp/ltsmin12705155641776391863;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 419 ms.
Running link step : cd /tmp/ltsmin12705155641776391863;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin12705155641776391863;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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-AN06-LTLCardinality-12 finished in 90257 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U F((F(G(!(F(p1)||p0)))&&!p2))))'
Support contains 324 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 9 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 17:01:09] [INFO ] Computed 108 place invariants in 2 ms
[2022-05-20 17:01:09] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 17:01:09] [INFO ] Computed 108 place invariants in 0 ms
[2022-05-20 17:01:09] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2022-05-20 17:01:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 17:01:09] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-20 17:01:10] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 89 ms :[(OR p0 p2 p1), (OR p1 p0), p2]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(OR p0 p1), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35) (ADD s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3183 reset in 2518 ms.
Product exploration explored 100000 steps with 3183 reset in 2448 ms.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
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 p2) p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (OR p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (OR p0 p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 320 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 36 ms :[(OR p1 p0)]
Finished random walk after 19 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p2)), (X (OR p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p2))), (X (X (OR p0 p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 426 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 37 ms :[(OR p1 p0)]
Stuttering acceptance computed with spot in 33 ms :[(OR p1 p0)]
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 17:01:16] [INFO ] Computed 108 place invariants in 2 ms
[2022-05-20 17:01:17] [INFO ] [Real]Absence check using 108 positive place invariants in 24 ms returned sat
[2022-05-20 17:01:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 17:01:17] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2022-05-20 17:01:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 17:01:17] [INFO ] [Nat]Absence check using 108 positive place invariants in 98 ms returned sat
[2022-05-20 17:01:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 17:01:17] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2022-05-20 17:01:17] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-20 17:01:17] [INFO ] Added : 0 causal constraints over 0 iterations in 39 ms. Result :sat
Could not prove EG p1
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 17:01:17] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-20 17:01:18] [INFO ] [Real]Absence check using 108 positive place invariants in 23 ms returned sat
[2022-05-20 17:01:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 17:01:18] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2022-05-20 17:01:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 17:01:18] [INFO ] [Nat]Absence check using 108 positive place invariants in 105 ms returned sat
[2022-05-20 17:01:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 17:01:18] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2022-05-20 17:01:18] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-20 17:01:18] [INFO ] Added : 0 causal constraints over 0 iterations in 33 ms. Result :sat
Could not prove EG p0
Support contains 288 out of 324 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 11 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 17:01:18] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-20 17:01:19] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 17:01:19] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-20 17:01:19] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2022-05-20 17:01:19] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 17:01:19] [INFO ] Computed 108 place invariants in 0 ms
[2022-05-20 17:01:19] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 216/216 transitions.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 253 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 32 ms :[(OR p1 p0)]
Finished random walk after 19 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 233 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 26 ms :[(OR p1 p0)]
Stuttering acceptance computed with spot in 24 ms :[(OR p1 p0)]
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 17:01:20] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-20 17:01:20] [INFO ] [Real]Absence check using 108 positive place invariants in 24 ms returned sat
[2022-05-20 17:01:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 17:01:20] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2022-05-20 17:01:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 17:01:21] [INFO ] [Nat]Absence check using 108 positive place invariants in 101 ms returned sat
[2022-05-20 17:01:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 17:01:21] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2022-05-20 17:01:21] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-20 17:01:21] [INFO ] Added : 0 causal constraints over 0 iterations in 35 ms. Result :sat
Could not prove EG p1
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 17:01:21] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-20 17:01:21] [INFO ] [Real]Absence check using 108 positive place invariants in 22 ms returned sat
[2022-05-20 17:01:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 17:01:21] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2022-05-20 17:01:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 17:01:22] [INFO ] [Nat]Absence check using 108 positive place invariants in 106 ms returned sat
[2022-05-20 17:01:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 17:01:22] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2022-05-20 17:01:22] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-20 17:01:22] [INFO ] Added : 0 causal constraints over 0 iterations in 35 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 29 ms :[(OR p1 p0)]
Product exploration explored 100000 steps with 3187 reset in 2385 ms.
Product exploration explored 100000 steps with 3186 reset in 2419 ms.
Built C files in :
/tmp/ltsmin4413086567385332843
[2022-05-20 17:01:27] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2022-05-20 17:01:27] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:01:27] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2022-05-20 17:01:27] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:01:27] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2022-05-20 17:01:27] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:01:27] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4413086567385332843
Running compilation step : cd /tmp/ltsmin4413086567385332843;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 488 ms.
Running link step : cd /tmp/ltsmin4413086567385332843;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin4413086567385332843;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3225607240046664989.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 288 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 11 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 17:01:42] [INFO ] Computed 108 place invariants in 1 ms
[2022-05-20 17:01:42] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 17:01:42] [INFO ] Computed 108 place invariants in 2 ms
[2022-05-20 17:01:42] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2022-05-20 17:01:42] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 216 rows 324 cols
[2022-05-20 17:01:42] [INFO ] Computed 108 place invariants in 0 ms
[2022-05-20 17:01:42] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 216/216 transitions.
Built C files in :
/tmp/ltsmin13826807601855266459
[2022-05-20 17:01:42] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2022-05-20 17:01:42] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:01:42] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2022-05-20 17:01:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:01:42] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2022-05-20 17:01:42] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:01:42] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13826807601855266459
Running compilation step : cd /tmp/ltsmin13826807601855266459;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 504 ms.
Running link step : cd /tmp/ltsmin13826807601855266459;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13826807601855266459;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6457121077659393117.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 17:01:58] [INFO ] Flatten gal took : 26 ms
[2022-05-20 17:01:58] [INFO ] Flatten gal took : 12 ms
[2022-05-20 17:01:58] [INFO ] Time to serialize gal into /tmp/LTL16772101976776734171.gal : 2 ms
[2022-05-20 17:01:58] [INFO ] Time to serialize properties into /tmp/LTL10248190904179757029.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16772101976776734171.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10248190904179757029.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1677210...268
Read 1 LTL properties
Checking formula 0 : !(((F(G("(((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+...11571
Formula 0 simplified : !(FG"(((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_11))+((...11553
Detected timeout of ITS tools.
[2022-05-20 17:02:13] [INFO ] Flatten gal took : 12 ms
[2022-05-20 17:02:13] [INFO ] Applying decomposition
[2022-05-20 17:02:13] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14745555469038676871.txt' '-o' '/tmp/graph14745555469038676871.bin' '-w' '/tmp/graph14745555469038676871.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14745555469038676871.bin' '-l' '-1' '-v' '-w' '/tmp/graph14745555469038676871.weights' '-q' '0' '-e' '0.001'
[2022-05-20 17:02:13] [INFO ] Decomposing Gal with order
[2022-05-20 17:02:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 17:02:13] [INFO ] Removed a total of 360 redundant transitions.
[2022-05-20 17:02:13] [INFO ] Flatten gal took : 70 ms
[2022-05-20 17:02:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-20 17:02:13] [INFO ] Time to serialize gal into /tmp/LTL10923637992468019512.gal : 3 ms
[2022-05-20 17:02:13] [INFO ] Time to serialize properties into /tmp/LTL946267239344201963.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10923637992468019512.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL946267239344201963.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1092363...266
Read 1 LTL properties
Checking formula 0 : !(((F(G("(((((((((gu1.Board_0+gu1.Board_1)+(gu1.Board_2+gu1.Board_3))+((gu1.Board_4+gu1.Board_5)+(gu1.Board_6+gu1.Board_7)))+(((gu1.Bo...15603
Formula 0 simplified : !(FG"(((((((((gu1.Board_0+gu1.Board_1)+(gu1.Board_2+gu1.Board_3))+((gu1.Board_4+gu1.Board_5)+(gu1.Board_6+gu1.Board_7)))+(((gu1.Boar...15585
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5898623573337808871
[2022-05-20 17:02:28] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5898623573337808871
Running compilation step : cd /tmp/ltsmin5898623573337808871;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 458 ms.
Running link step : cd /tmp/ltsmin5898623573337808871;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin5898623573337808871;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>([]((LTLAPp0==true))) U <>((<>([](!(<>((LTLAPp1==true))||(LTLAPp0==true))))&&!(LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN06-LTLCardinality-13 finished in 93922 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(F(p0)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U F((F(G(!(F(p1)||p0)))&&!p2))))'
[2022-05-20 17:02:44] [INFO ] Flatten gal took : 26 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17572979198890792518
[2022-05-20 17:02:44] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2022-05-20 17:02:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:02:44] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2022-05-20 17:02:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:02:44] [INFO ] Applying decomposition
[2022-05-20 17:02:44] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2022-05-20 17:02:44] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:02:44] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17572979198890792518
Running compilation step : cd /tmp/ltsmin17572979198890792518;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-20 17:02:44] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14575747087343101083.txt' '-o' '/tmp/graph14575747087343101083.bin' '-w' '/tmp/graph14575747087343101083.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14575747087343101083.bin' '-l' '-1' '-v' '-w' '/tmp/graph14575747087343101083.weights' '-q' '0' '-e' '0.001'
[2022-05-20 17:02:44] [INFO ] Decomposing Gal with order
[2022-05-20 17:02:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 17:02:44] [INFO ] Removed a total of 540 redundant transitions.
[2022-05-20 17:02:44] [INFO ] Flatten gal took : 91 ms
[2022-05-20 17:02:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-20 17:02:44] [INFO ] Time to serialize gal into /tmp/LTLCardinality17827553439836335771.gal : 2 ms
[2022-05-20 17:02:44] [INFO ] Time to serialize properties into /tmp/LTLCardinality10847504398403548471.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17827553439836335771.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10847504398403548471.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
Compilation finished in 561 ms.
Running link step : cd /tmp/ltsmin17572979198890792518;'gcc' '-shared' '-o' 'gal.so' 'model.o'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...290
Read 3 LTL properties
Checking formula 0 : !((G(X(G(F("(((((((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+gu...4742
Formula 0 simplified : !GXGF"(((((((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.Ro...4732
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin17572979198890792518;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X([](<>((LTLAPp0==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: LTL layer: formula: [](X([](<>((LTLAPp0==true)))))
pins2lts-mc-linux64( 5/ 8), 0.002: "[](X([](<>((LTLAPp0==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.009: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.025: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.091: DFS-FIFO for weak LTL, using special progress label 220
pins2lts-mc-linux64( 0/ 8), 0.091: There are 221 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.091: State length is 325, there are 219 groups
pins2lts-mc-linux64( 0/ 8), 0.091: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.091: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.091: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.091: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.387: ~19 levels ~960 states ~18144 transitions
pins2lts-mc-linux64( 4/ 8), 0.411: ~19 levels ~1920 states ~19568 transitions
pins2lts-mc-linux64( 4/ 8), 0.426: ~19 levels ~3840 states ~21904 transitions
pins2lts-mc-linux64( 4/ 8), 0.495: ~19 levels ~7680 states ~31408 transitions
pins2lts-mc-linux64( 5/ 8), 0.614: ~19 levels ~15360 states ~45624 transitions
pins2lts-mc-linux64( 7/ 8), 0.800: ~19 levels ~30720 states ~78464 transitions
pins2lts-mc-linux64( 6/ 8), 1.120: ~19 levels ~61440 states ~146992 transitions
pins2lts-mc-linux64( 6/ 8), 1.747: ~19 levels ~122880 states ~326192 transitions
pins2lts-mc-linux64( 0/ 8), 2.918: ~19 levels ~245760 states ~716776 transitions
pins2lts-mc-linux64( 0/ 8), 4.964: ~19 levels ~491520 states ~1472056 transitions
pins2lts-mc-linux64( 0/ 8), 8.736: ~19 levels ~983040 states ~3035112 transitions
pins2lts-mc-linux64( 6/ 8), 16.295: ~19 levels ~1966080 states ~6495096 transitions
pins2lts-mc-linux64( 4/ 8), 31.554: ~19 levels ~3932160 states ~14777016 transitions
pins2lts-mc-linux64( 4/ 8), 62.973: ~19 levels ~7864320 states ~31081520 transitions
pins2lts-mc-linux64( 3/ 8), 115.153: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 115.509:
pins2lts-mc-linux64( 0/ 8), 115.509: mean standard work distribution: 2.1% (states) 3.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 115.509:
pins2lts-mc-linux64( 0/ 8), 115.509: Explored 13185577 states 56340833 transitions, fanout: 4.273
pins2lts-mc-linux64( 0/ 8), 115.509: Total exploration time 115.390 sec (115.050 sec minimum, 115.177 sec on average)
pins2lts-mc-linux64( 0/ 8), 115.509: States per second: 114270, Transitions per second: 488264
pins2lts-mc-linux64( 0/ 8), 115.509:
pins2lts-mc-linux64( 0/ 8), 115.509: Progress states detected: 1
pins2lts-mc-linux64( 0/ 8), 115.509: Redundant explorations: -0.1007
pins2lts-mc-linux64( 0/ 8), 115.509:
pins2lts-mc-linux64( 0/ 8), 115.509: Queue width: 8B, total height: 160, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 115.509: Tree memory: 356.7MB, 28.3 B/state, compr.: 2.2%
pins2lts-mc-linux64( 0/ 8), 115.509: Tree fill ratio (roots/leafs): 9.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 115.509: Stored 216 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 115.509: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 115.509: Est. total memory use: 356.7MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17572979198890792518;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X([](<>((LTLAPp0==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17572979198890792518;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X([](<>((LTLAPp0==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-20 17:25:07] [INFO ] Applying decomposition
[2022-05-20 17:25:07] [INFO ] Flatten gal took : 132 ms
[2022-05-20 17:25:07] [INFO ] Decomposing Gal with order
[2022-05-20 17:25:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 17:25:07] [INFO ] Removed a total of 402 redundant transitions.
[2022-05-20 17:25:08] [INFO ] Flatten gal took : 164 ms
[2022-05-20 17:25:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2022-05-20 17:25:08] [INFO ] Time to serialize gal into /tmp/LTLCardinality1649960371141755955.gal : 25 ms
[2022-05-20 17:25:08] [INFO ] Time to serialize properties into /tmp/LTLCardinality17948248695535604090.ltl : 20 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1649960371141755955.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17948248695535604090.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 3 LTL properties
Checking formula 0 : !((G(X(G(F("(((((((gNN0.Rows_0+gNN1.Rows_1)+(gNN2.Rows_2+gNN3.Rows_3))+((gNN4.Rows_4+gNN5.Rows_5)+(gNN6.Rows_6+gNN7.Rows_7)))+(((gNN8....4694
Formula 0 simplified : !GXGF"(((((((gNN0.Rows_0+gNN1.Rows_1)+(gNN2.Rows_2+gNN3.Rows_3))+((gNN4.Rows_4+gNN5.Rows_5)+(gNN6.Rows_6+gNN7.Rows_7)))+(((gNN8.Rows...4684
Detected timeout of ITS tools.
[2022-05-20 17:47:05] [INFO ] Flatten gal took : 388 ms
[2022-05-20 17:47:06] [INFO ] Input system was already deterministic with 216 transitions.
[2022-05-20 17:47:06] [INFO ] Transformed 324 places.
[2022-05-20 17:47:06] [INFO ] Transformed 216 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-05-20 17:47:06] [INFO ] Time to serialize gal into /tmp/LTLCardinality16181195345901605.gal : 9 ms
[2022-05-20 17:47:06] [INFO ] Time to serialize properties into /tmp/LTLCardinality540627129532983480.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16181195345901605.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality540627129532983480.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...330
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(X(G(F("(((((((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+R...2870
Formula 0 simplified : !GXGF"(((((((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_...2860

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-AN06"
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-4028"
echo " Executing tool itstools"
echo " Input is Sudoku-COL-AN06, 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 r258-tall-165303545300083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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