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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 5.8K Apr 30 12:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 30 12:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 30 12:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Apr 30 12:30 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 3.6K May 9 09:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 09:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:11 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-AN08-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653069678719

Running Version 202205111006
[2022-05-20 18:01:19] [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 18:01:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 18:01:19] [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 18:01:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 18:01:20] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 472 ms
[2022-05-20 18:01:20] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 704 PT places and 512.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
FORMULA Sudoku-COL-AN08-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 18:01:20] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 9 ms.
[2022-05-20 18:01:20] [INFO ] Skeletonized 15 HLPN properties in 0 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-COL-AN08-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN08-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 10 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 151 resets, run finished after 53 ms. (steps per millisecond=189 ) properties (out of 14) seen :9
Incomplete Best-First random walk after 10031 steps, including 151 resets, run finished after 37 ms. (steps per millisecond=271 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10031 steps, including 151 resets, run finished after 16 ms. (steps per millisecond=626 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10031 steps, including 151 resets, run finished after 15 ms. (steps per millisecond=668 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10031 steps, including 151 resets, run finished after 15 ms. (steps per millisecond=668 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10031 steps, including 151 resets, run finished after 14 ms. (steps per millisecond=716 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1 rows 4 cols
[2022-05-20 18:01:20] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-20 18:01:20] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 18:01:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-05-20 18:01:20] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :1
[2022-05-20 18:01:20] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-20 18:01:20] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :1
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 32 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 2 ms.
Successfully simplified 4 atomic propositions for a total of 10 simplifications.
[2022-05-20 18:01:20] [INFO ] Flatten gal took : 12 ms
FORMULA Sudoku-COL-AN08-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 18:01:20] [INFO ] Flatten gal took : 1 ms
Domain [N(8), N(8)] of place Rows breaks symmetries in sort N
[2022-05-20 18:01:20] [INFO ] Unfolded HLPN to a Petri net with 704 places and 512 transitions 2048 arcs in 18 ms.
[2022-05-20 18:01:20] [INFO ] Unfolded 9 HLPN properties in 1 ms.
Support contains 704 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 14 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:01:21] [INFO ] Computed 192 place invariants in 10 ms
[2022-05-20 18:01:21] [INFO ] Implicit Places using invariants in 174 ms returned []
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:01:21] [INFO ] Computed 192 place invariants in 14 ms
[2022-05-20 18:01:21] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:01:21] [INFO ] Computed 192 place invariants in 8 ms
[2022-05-20 18:01:21] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 704/704 places, 512/512 transitions.
Support contains 704 out of 704 places after structural reductions.
[2022-05-20 18:01:21] [INFO ] Flatten gal took : 69 ms
[2022-05-20 18:01:22] [INFO ] Flatten gal took : 56 ms
[2022-05-20 18:01:22] [INFO ] Input system was already deterministic with 512 transitions.
Incomplete random walk after 10000 steps, including 179 resets, run finished after 887 ms. (steps per millisecond=11 ) properties (out of 12) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:01:23] [INFO ] Computed 192 place invariants in 9 ms
[2022-05-20 18:01:24] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-20 18:01:24] [INFO ] [Nat]Absence check using 192 positive place invariants in 33 ms returned sat
[2022-05-20 18:01:29] [INFO ] After 4811ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :4
[2022-05-20 18:01:33] [INFO ] After 9263ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :4
Attempting to minimize the solution found.
Minimization took 4518 ms.
[2022-05-20 18:01:38] [INFO ] After 14093ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :4
Fused 8 Parikh solutions to 4 different solutions.
Finished Parikh walk after 64 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=10 )
Parikh walk visited 4 properties in 6 ms.
Successfully simplified 4 atomic propositions for a total of 9 simplifications.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA Sudoku-COL-AN08-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 512 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 46 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:01:38] [INFO ] Computed 192 place invariants in 2 ms
[2022-05-20 18:01:38] [INFO ] Implicit Places using invariants in 282 ms returned []
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:01:38] [INFO ] Computed 192 place invariants in 6 ms
[2022-05-20 18:01:39] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
[2022-05-20 18:01:39] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:01:39] [INFO ] Computed 192 place invariants in 8 ms
[2022-05-20 18:01:39] [INFO ] Dead Transitions using invariants and state equation in 277 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GT 3 (ADD s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 3 ms.
FORMULA Sudoku-COL-AN08-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN08-LTLCardinality-00 finished in 1390 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(((true U G(p0))||!p0))))'
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 10 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:01:39] [INFO ] Computed 192 place invariants in 2 ms
[2022-05-20 18:01:40] [INFO ] Implicit Places using invariants in 230 ms returned []
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:01:40] [INFO ] Computed 192 place invariants in 11 ms
[2022-05-20 18:01:40] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:01:40] [INFO ] Computed 192 place invariants in 4 ms
[2022-05-20 18:01:40] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 86 ms :[false, false, (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 55 steps with 0 reset in 9 ms.
FORMULA Sudoku-COL-AN08-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN08-LTLCardinality-04 finished in 1092 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((G(p0)&&p1))))'
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 8 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:01:41] [INFO ] Computed 192 place invariants in 4 ms
[2022-05-20 18:01:41] [INFO ] Implicit Places using invariants in 237 ms returned []
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:01:41] [INFO ] Computed 192 place invariants in 4 ms
[2022-05-20 18:01:41] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:01:41] [INFO ] Computed 192 place invariants in 3 ms
[2022-05-20 18:01:42] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1798 reset in 4365 ms.
Product exploration explored 100000 steps with 1799 reset in 4363 ms.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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 (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), true, (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 427 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Incomplete random walk after 10000 steps, including 180 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:01:58] [INFO ] Computed 192 place invariants in 3 ms
[2022-05-20 18:01:58] [INFO ] [Real]Absence check using 192 positive place invariants in 32 ms returned sat
[2022-05-20 18:01:58] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 18:01:58] [INFO ] [Nat]Absence check using 192 positive place invariants in 34 ms returned sat
[2022-05-20 18:01:59] [INFO ] After 761ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 18:02:00] [INFO ] After 1690ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 596 ms.
[2022-05-20 18:02:00] [INFO ] After 2443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 62 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=31 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), true, (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1))]
Knowledge based reduction with 11 factoid took 417 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:02:01] [INFO ] Computed 192 place invariants in 5 ms
[2022-05-20 18:02:03] [INFO ] [Real]Absence check using 192 positive place invariants in 55 ms returned sat
[2022-05-20 18:02:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 18:02:03] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2022-05-20 18:02:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 18:02:05] [INFO ] [Nat]Absence check using 192 positive place invariants in 484 ms returned sat
[2022-05-20 18:02:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 18:02:07] [INFO ] [Nat]Absence check using state equation in 1212 ms returned sat
[2022-05-20 18:02:07] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 20 ms.
[2022-05-20 18:02:07] [INFO ] Added : 0 causal constraints over 0 iterations in 96 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 6 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:02:07] [INFO ] Computed 192 place invariants in 2 ms
[2022-05-20 18:02:07] [INFO ] Implicit Places using invariants in 236 ms returned []
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:02:07] [INFO ] Computed 192 place invariants in 2 ms
[2022-05-20 18:02:07] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:02:07] [INFO ] Computed 192 place invariants in 5 ms
[2022-05-20 18:02:08] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 704/704 places, 512/512 transitions.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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 (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), true, (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 421 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Incomplete random walk after 10000 steps, including 179 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:02:15] [INFO ] Computed 192 place invariants in 5 ms
[2022-05-20 18:02:15] [INFO ] [Real]Absence check using 192 positive place invariants in 32 ms returned sat
[2022-05-20 18:02:15] [INFO ] After 188ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 18:02:16] [INFO ] [Nat]Absence check using 192 positive place invariants in 33 ms returned sat
[2022-05-20 18:02:16] [INFO ] After 756ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 18:02:17] [INFO ] After 1668ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 590 ms.
[2022-05-20 18:02:18] [INFO ] After 2428ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 62 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=31 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), true, (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1))]
Knowledge based reduction with 10 factoid took 366 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:02:19] [INFO ] Computed 192 place invariants in 4 ms
[2022-05-20 18:02:20] [INFO ] [Real]Absence check using 192 positive place invariants in 54 ms returned sat
[2022-05-20 18:02:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 18:02:21] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2022-05-20 18:02:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 18:02:23] [INFO ] [Nat]Absence check using 192 positive place invariants in 480 ms returned sat
[2022-05-20 18:02:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 18:02:24] [INFO ] [Nat]Absence check using state equation in 1208 ms returned sat
[2022-05-20 18:02:24] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 20 ms.
[2022-05-20 18:02:24] [INFO ] Added : 0 causal constraints over 0 iterations in 82 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 1795 reset in 4257 ms.
Product exploration explored 100000 steps with 1799 reset in 4301 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 18 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2022-05-20 18:02:33] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:02:33] [INFO ] Computed 192 place invariants in 2 ms
[2022-05-20 18:02:33] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 704/704 places, 512/512 transitions.
Entered a terminal (fully accepting) state of product in 50006 steps with 899 reset in 2193 ms.
FORMULA Sudoku-COL-AN08-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN08-LTLCardinality-06 finished in 54850 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(p0))))'
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 14 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:02:35] [INFO ] Computed 192 place invariants in 2 ms
[2022-05-20 18:02:36] [INFO ] Implicit Places using invariants in 222 ms returned []
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:02:36] [INFO ] Computed 192 place invariants in 1 ms
[2022-05-20 18:02:36] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 671 ms to find 0 implicit places.
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:02:36] [INFO ] Computed 192 place invariants in 2 ms
[2022-05-20 18:02:36] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 33 steps with 0 reset in 4 ms.
FORMULA Sudoku-COL-AN08-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN08-LTLCardinality-07 finished in 1044 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U F(G((X(G(p1))||F(!p2)))))))'
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 18 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:02:36] [INFO ] Computed 192 place invariants in 2 ms
[2022-05-20 18:02:37] [INFO ] Implicit Places using invariants in 235 ms returned []
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:02:37] [INFO ] Computed 192 place invariants in 3 ms
[2022-05-20 18:02:37] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
[2022-05-20 18:02:37] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:02:37] [INFO ] Computed 192 place invariants in 4 ms
[2022-05-20 18:02:37] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9710 reset in 5958 ms.
Product exploration explored 100000 steps with 9895 reset in 5960 ms.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p2), (X (AND (NOT p1) p2)), (X (NOT (AND p1 p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 250 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 179 resets, run finished after 442 ms. (steps per millisecond=22 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:02:58] [INFO ] Computed 192 place invariants in 4 ms
[2022-05-20 18:02:58] [INFO ] [Real]Absence check using 192 positive place invariants in 33 ms returned sat
[2022-05-20 18:02:58] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2), (X (AND (NOT p1) p2)), (X (NOT (AND p1 p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p1 p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 8 factoid took 344 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 55 ms :[p2, p2]
Stuttering acceptance computed with spot in 61 ms :[p2, p2]
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:02:59] [INFO ] Computed 192 place invariants in 5 ms
[2022-05-20 18:03:00] [INFO ] [Real]Absence check using 192 positive place invariants in 50 ms returned sat
[2022-05-20 18:03:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 18:03:00] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2022-05-20 18:03:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 18:03:02] [INFO ] [Nat]Absence check using 192 positive place invariants in 65 ms returned sat
[2022-05-20 18:03:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 18:03:02] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2022-05-20 18:03:02] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 20 ms.
[2022-05-20 18:03:02] [INFO ] Added : 0 causal constraints over 0 iterations in 70 ms. Result :sat
Could not prove EG p2
Support contains 512 out of 704 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 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 11 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:03:02] [INFO ] Computed 192 place invariants in 1 ms
[2022-05-20 18:03:02] [INFO ] Implicit Places using invariants in 230 ms returned []
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:03:02] [INFO ] Computed 192 place invariants in 2 ms
[2022-05-20 18:03:03] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
[2022-05-20 18:03:03] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:03:03] [INFO ] Computed 192 place invariants in 2 ms
[2022-05-20 18:03:03] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 704/704 places, 512/512 transitions.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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 : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 130 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 69 ms :[p2, p2]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [p2, (X p2), (X (X p2)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 4 factoid took 145 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 :[p2, p2]
Stuttering acceptance computed with spot in 74 ms :[p2, p2]
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:03:07] [INFO ] Computed 192 place invariants in 4 ms
[2022-05-20 18:03:08] [INFO ] [Real]Absence check using 192 positive place invariants in 50 ms returned sat
[2022-05-20 18:03:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 18:03:08] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2022-05-20 18:03:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 18:03:09] [INFO ] [Nat]Absence check using 192 positive place invariants in 68 ms returned sat
[2022-05-20 18:03:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 18:03:10] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2022-05-20 18:03:10] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 21 ms.
[2022-05-20 18:03:10] [INFO ] Added : 0 causal constraints over 0 iterations in 88 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 62 ms :[p2, p2]
Product exploration explored 100000 steps with 9610 reset in 4781 ms.
Product exploration explored 100000 steps with 9499 reset in 4713 ms.
Built C files in :
/tmp/ltsmin10785165337672934819
[2022-05-20 18:03:19] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2022-05-20 18:03:19] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:03:19] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2022-05-20 18:03:19] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:03:19] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2022-05-20 18:03:19] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:03:19] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10785165337672934819
Running compilation step : cd /tmp/ltsmin10785165337672934819;'/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 1397 ms.
Running link step : cd /tmp/ltsmin10785165337672934819;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin10785165337672934819;'/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/stateBased4175479789695997730.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 512 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 13 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:03:34] [INFO ] Computed 192 place invariants in 1 ms
[2022-05-20 18:03:35] [INFO ] Implicit Places using invariants in 282 ms returned []
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:03:35] [INFO ] Computed 192 place invariants in 4 ms
[2022-05-20 18:03:35] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 821 ms to find 0 implicit places.
[2022-05-20 18:03:35] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:03:35] [INFO ] Computed 192 place invariants in 4 ms
[2022-05-20 18:03:35] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 704/704 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin640581999054290294
[2022-05-20 18:03:35] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2022-05-20 18:03:35] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:03:35] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2022-05-20 18:03:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:03:36] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2022-05-20 18:03:36] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:03:36] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin640581999054290294
Running compilation step : cd /tmp/ltsmin640581999054290294;'/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 1278 ms.
Running link step : cd /tmp/ltsmin640581999054290294;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin640581999054290294;'/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/stateBased6351103121497540383.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 18:03:51] [INFO ] Flatten gal took : 43 ms
[2022-05-20 18:03:51] [INFO ] Flatten gal took : 41 ms
[2022-05-20 18:03:51] [INFO ] Time to serialize gal into /tmp/LTL7335976868441394118.gal : 5 ms
[2022-05-20 18:03:51] [INFO ] Time to serialize properties into /tmp/LTL6649829380044264402.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/LTL7335976868441394118.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6649829380044264402.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/LTL7335976...266
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows...13394
Formula 0 simplified : !X(G"(((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows_1...13377
Detected timeout of ITS tools.
[2022-05-20 18:04:06] [INFO ] Flatten gal took : 34 ms
[2022-05-20 18:04:06] [INFO ] Applying decomposition
[2022-05-20 18:04:06] [INFO ] Flatten gal took : 30 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/graph9263246085353050925.txt' '-o' '/tmp/graph9263246085353050925.bin' '-w' '/tmp/graph9263246085353050925.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9263246085353050925.bin' '-l' '-1' '-v' '-w' '/tmp/graph9263246085353050925.weights' '-q' '0' '-e' '0.001'
[2022-05-20 18:04:07] [INFO ] Decomposing Gal with order
[2022-05-20 18:04:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 18:04:07] [INFO ] Removed a total of 448 redundant transitions.
[2022-05-20 18:04:07] [INFO ] Flatten gal took : 443 ms
[2022-05-20 18:04:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 512 labels/synchronizations in 24 ms.
[2022-05-20 18:04:07] [INFO ] Time to serialize gal into /tmp/LTL15205203230187468663.gal : 5 ms
[2022-05-20 18:04:07] [INFO ] Time to serialize properties into /tmp/LTL14954857031108329599.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/LTL15205203230187468663.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14954857031108329599.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/LTL1520520...268
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((((gu0.Rows_0+gu0.Rows_1)+(gu0.Rows_2+gu0.Rows_3))+((gu0.Rows_4+gu0.Rows_5)+(gu0.Rows_6+gu0.Rows_7)))+(((gu0.Rows_8+gu0.R...18002
Formula 0 simplified : !X(G"(((((((gu0.Rows_0+gu0.Rows_1)+(gu0.Rows_2+gu0.Rows_3))+((gu0.Rows_4+gu0.Rows_5)+(gu0.Rows_6+gu0.Rows_7)))+(((gu0.Rows_8+gu0.Row...17985
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18087824172022505157
[2022-05-20 18:04:22] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18087824172022505157
Running compilation step : cd /tmp/ltsmin18087824172022505157;'/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 995 ms.
Running link step : cd /tmp/ltsmin18087824172022505157;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin18087824172022505157;'/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)) U <>([]((X([]((LTLAPp1==true)))||<>(!(LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN08-LTLCardinality-08 finished in 120843 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 64 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Graph (complete) has 1536 edges and 704 vertex of which 192 are kept as prefixes of interest. Removing 512 places using SCC suffix rule.4 ms
Discarding 512 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 33 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:04:37] [INFO ] Computed 23 place invariants in 27 ms
[2022-05-20 18:04:37] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:04:37] [INFO ] Computed 23 place invariants in 11 ms
[2022-05-20 18:04:38] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2022-05-20 18:04:38] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:04:38] [INFO ] Computed 23 place invariants in 24 ms
[2022-05-20 18:04:38] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 192/704 places, 512/512 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-09 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 2 (ADD s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155...], 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 1799 reset in 2751 ms.
Product exploration explored 100000 steps with 1797 reset in 2782 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 192 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 126 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 56 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 179 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Finished probabilistic random walk after 110901 steps, run visited all 1 properties in 362 ms. (steps per millisecond=306 )
Probabilistic random walk after 110901 steps, saw 34411 distinct states, run finished after 362 ms. (steps per millisecond=306 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Support contains 64 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 15 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:04:46] [INFO ] Computed 23 place invariants in 18 ms
[2022-05-20 18:04:46] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:04:46] [INFO ] Computed 23 place invariants in 12 ms
[2022-05-20 18:04:46] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2022-05-20 18:04:46] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:04:46] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-20 18:04:46] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 512/512 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 192 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 126 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 58 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 180 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Finished probabilistic random walk after 110901 steps, run visited all 1 properties in 344 ms. (steps per millisecond=322 )
Probabilistic random walk after 110901 steps, saw 34411 distinct states, run finished after 344 ms. (steps per millisecond=322 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 150 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1797 reset in 2732 ms.
Product exploration explored 100000 steps with 1797 reset in 2793 ms.
Built C files in :
/tmp/ltsmin6226357152829455913
[2022-05-20 18:04:54] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2022-05-20 18:04:54] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:04:54] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2022-05-20 18:04:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:04:54] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2022-05-20 18:04:54] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:04:54] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6226357152829455913
Running compilation step : cd /tmp/ltsmin6226357152829455913;'/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 1089 ms.
Running link step : cd /tmp/ltsmin6226357152829455913;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6226357152829455913;'/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/stateBased1834485152085539837.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 64 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 15 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:05:09] [INFO ] Computed 23 place invariants in 12 ms
[2022-05-20 18:05:10] [INFO ] Implicit Places using invariants in 129 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:05:10] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-20 18:05:10] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2022-05-20 18:05:10] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:05:10] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-20 18:05:10] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin9240717709682387305
[2022-05-20 18:05:10] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2022-05-20 18:05:10] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:05:10] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2022-05-20 18:05:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:05:10] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2022-05-20 18:05:10] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:05:10] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9240717709682387305
Running compilation step : cd /tmp/ltsmin9240717709682387305;'/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 1100 ms.
Running link step : cd /tmp/ltsmin9240717709682387305;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin9240717709682387305;'/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/stateBased2779770743484268177.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 18:05:25] [INFO ] Flatten gal took : 23 ms
[2022-05-20 18:05:25] [INFO ] Flatten gal took : 22 ms
[2022-05-20 18:05:25] [INFO ] Time to serialize gal into /tmp/LTL10113184120741886112.gal : 2 ms
[2022-05-20 18:05:25] [INFO ] Time to serialize properties into /tmp/LTL15518824397582551689.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/LTL10113184120741886112.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15518824397582551689.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/LTL1011318...268
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(Col...858
Formula 0 simplified : !GF"(((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(Colum...852
Detected timeout of ITS tools.
[2022-05-20 18:05:40] [INFO ] Flatten gal took : 22 ms
[2022-05-20 18:05:40] [INFO ] Applying decomposition
[2022-05-20 18:05:40] [INFO ] Flatten gal took : 22 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/graph16099748893994569361.txt' '-o' '/tmp/graph16099748893994569361.bin' '-w' '/tmp/graph16099748893994569361.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16099748893994569361.bin' '-l' '-1' '-v' '-w' '/tmp/graph16099748893994569361.weights' '-q' '0' '-e' '0.001'
[2022-05-20 18:05:40] [INFO ] Decomposing Gal with order
[2022-05-20 18:05:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 18:05:40] [INFO ] Removed a total of 1344 redundant transitions.
[2022-05-20 18:05:41] [INFO ] Flatten gal took : 66 ms
[2022-05-20 18:05:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-20 18:05:41] [INFO ] Time to serialize gal into /tmp/LTL13015248836921315401.gal : 3 ms
[2022-05-20 18:05:41] [INFO ] Time to serialize properties into /tmp/LTL10676506354214014649.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/LTL13015248836921315401.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10676506354214014649.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/LTL1301524...268
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((gu128.Columns_0+gu128.Columns_1)+(gu128.Columns_2+gu128.Columns_3))+((gu128.Columns_4+gu128.Columns_5)+(gu128.Columns_6...1242
Formula 0 simplified : !GF"(((((((gu128.Columns_0+gu128.Columns_1)+(gu128.Columns_2+gu128.Columns_3))+((gu128.Columns_4+gu128.Columns_5)+(gu128.Columns_6+g...1236
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2159549240572912324
[2022-05-20 18:05:56] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2159549240572912324
Running compilation step : cd /tmp/ltsmin2159549240572912324;'/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 777 ms.
Running link step : cd /tmp/ltsmin2159549240572912324;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2159549240572912324;'/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-AN08-LTLCardinality-09 finished in 93411 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p1)&&p0)))'
Support contains 640 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 15 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:06:11] [INFO ] Computed 192 place invariants in 4 ms
[2022-05-20 18:06:11] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:06:11] [INFO ] Computed 192 place invariants in 2 ms
[2022-05-20 18:06:11] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
[2022-05-20 18:06:11] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:06:11] [INFO ] Computed 192 place invariants in 1 ms
[2022-05-20 18:06:12] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3030 reset in 6492 ms.
Product exploration explored 100000 steps with 3030 reset in 6627 ms.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 287 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 178 resets, run finished after 456 ms. (steps per millisecond=21 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:06:34] [INFO ] Computed 192 place invariants in 4 ms
[2022-05-20 18:06:34] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 10 factoid took 390 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:06:35] [INFO ] Computed 192 place invariants in 4 ms
[2022-05-20 18:06:37] [INFO ] [Real]Absence check using 192 positive place invariants in 54 ms returned sat
[2022-05-20 18:06:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 18:06:37] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2022-05-20 18:06:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 18:06:39] [INFO ] [Nat]Absence check using 192 positive place invariants in 509 ms returned sat
[2022-05-20 18:06:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 18:06:41] [INFO ] [Nat]Absence check using state equation in 1560 ms returned sat
[2022-05-20 18:06:41] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 23 ms.
[2022-05-20 18:06:41] [INFO ] Added : 0 causal constraints over 0 iterations in 94 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 640 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 14 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:06:41] [INFO ] Computed 192 place invariants in 2 ms
[2022-05-20 18:06:41] [INFO ] Implicit Places using invariants in 167 ms returned []
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:06:41] [INFO ] Computed 192 place invariants in 1 ms
[2022-05-20 18:06:41] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2022-05-20 18:06:41] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:06:41] [INFO ] Computed 192 place invariants in 2 ms
[2022-05-20 18:06:42] [INFO ] Dead Transitions using invariants and state equation in 253 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 704/704 places, 512/512 transitions.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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 131 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 28 ms :[(NOT p0)]
Finished random walk after 32 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=10 )
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 155 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 29 ms :[(NOT p0)]
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:06:45] [INFO ] Computed 192 place invariants in 4 ms
[2022-05-20 18:06:47] [INFO ] [Real]Absence check using 192 positive place invariants in 52 ms returned sat
[2022-05-20 18:06:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 18:06:48] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2022-05-20 18:06:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 18:06:50] [INFO ] [Nat]Absence check using 192 positive place invariants in 510 ms returned sat
[2022-05-20 18:06:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 18:06:51] [INFO ] [Nat]Absence check using state equation in 1546 ms returned sat
[2022-05-20 18:06:51] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 22 ms.
[2022-05-20 18:06:51] [INFO ] Added : 0 causal constraints over 0 iterations in 92 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3030 reset in 5363 ms.
Product exploration explored 100000 steps with 3030 reset in 5439 ms.
Built C files in :
/tmp/ltsmin13819890013849005616
[2022-05-20 18:07:02] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2022-05-20 18:07:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:07:02] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2022-05-20 18:07:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:07:02] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2022-05-20 18:07:02] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:07:02] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13819890013849005616
Running compilation step : cd /tmp/ltsmin13819890013849005616;'/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 1315 ms.
Running link step : cd /tmp/ltsmin13819890013849005616;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin13819890013849005616;'/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/stateBased490737408755523081.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 640 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 15 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:07:17] [INFO ] Computed 192 place invariants in 2 ms
[2022-05-20 18:07:18] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:07:18] [INFO ] Computed 192 place invariants in 2 ms
[2022-05-20 18:07:18] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2022-05-20 18:07:18] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 512 rows 704 cols
[2022-05-20 18:07:18] [INFO ] Computed 192 place invariants in 1 ms
[2022-05-20 18:07:18] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 704/704 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin18424077719560881163
[2022-05-20 18:07:18] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2022-05-20 18:07:18] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:07:18] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2022-05-20 18:07:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:07:18] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2022-05-20 18:07:18] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:07:18] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18424077719560881163
Running compilation step : cd /tmp/ltsmin18424077719560881163;'/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 1830 ms.
Running link step : cd /tmp/ltsmin18424077719560881163;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin18424077719560881163;'/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/stateBased3967433406628155043.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 18:07:33] [INFO ] Flatten gal took : 24 ms
[2022-05-20 18:07:33] [INFO ] Flatten gal took : 23 ms
[2022-05-20 18:07:33] [INFO ] Time to serialize gal into /tmp/LTL415120773656073308.gal : 3 ms
[2022-05-20 18:07:33] [INFO ] Time to serialize properties into /tmp/LTL15084200629285993211.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/LTL415120773656073308.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15084200629285993211.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/LTL4151207...266
Read 1 LTL properties
Checking formula 0 : !((F(((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+Row...14070
Formula 0 simplified : !F("(((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((Cel...14060
Detected timeout of ITS tools.
[2022-05-20 18:07:48] [INFO ] Flatten gal took : 23 ms
[2022-05-20 18:07:48] [INFO ] Applying decomposition
[2022-05-20 18:07:48] [INFO ] Flatten gal took : 23 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/graph3295301238267755353.txt' '-o' '/tmp/graph3295301238267755353.bin' '-w' '/tmp/graph3295301238267755353.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3295301238267755353.bin' '-l' '-1' '-v' '-w' '/tmp/graph3295301238267755353.weights' '-q' '0' '-e' '0.001'
[2022-05-20 18:07:49] [INFO ] Decomposing Gal with order
[2022-05-20 18:07:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 18:07:49] [INFO ] Removed a total of 448 redundant transitions.
[2022-05-20 18:07:49] [INFO ] Flatten gal took : 304 ms
[2022-05-20 18:07:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 512 labels/synchronizations in 19 ms.
[2022-05-20 18:07:49] [INFO ] Time to serialize gal into /tmp/LTL3804096847451777445.gal : 3 ms
[2022-05-20 18:07:49] [INFO ] Time to serialize properties into /tmp/LTL17001244643677035078.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/LTL3804096847451777445.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17001244643677035078.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/LTL3804096...267
Read 1 LTL properties
Checking formula 0 : !((F(((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+gu0....18934
Formula 0 simplified : !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+gu0.Rows...18924
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16621363623921840959
[2022-05-20 18:08:04] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16621363623921840959
Running compilation step : cd /tmp/ltsmin16621363623921840959;'/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 1017 ms.
Running link step : cd /tmp/ltsmin16621363623921840959;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16621363623921840959;'/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' '<>((<>((LTLAPp1==true))&&(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN08-LTLCardinality-10 finished in 128879 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(X(F(X((F(p0)||p1))))))))'
Support contains 128 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Reduce places removed 512 places and 0 transitions.
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 192 transition count 512
Applied a total of 512 rules in 4 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:08:20] [INFO ] Computed 23 place invariants in 14 ms
[2022-05-20 18:08:20] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:08:20] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-20 18:08:20] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:08:20] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-20 18:08:20] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 192/704 places, 512/512 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 6069 ms.
Product exploration explored 100000 steps with 20000 reset in 6103 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 192 transition count 512
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), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 154 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 180 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Finished probabilistic random walk after 110901 steps, run visited all 1 properties in 336 ms. (steps per millisecond=330 )
Probabilistic random walk after 110901 steps, saw 34411 distinct states, run finished after 336 ms. (steps per millisecond=330 ) properties seen :1
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 128 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 3 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:08:35] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-20 18:08:35] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:08:35] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-20 18:08:35] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:08:35] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-20 18:08:35] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 512/512 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 192 transition count 512
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), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 122 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 179 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Finished probabilistic random walk after 110901 steps, run visited all 1 properties in 337 ms. (steps per millisecond=329 )
Probabilistic random walk after 110901 steps, saw 34411 distinct states, run finished after 338 ms. (steps per millisecond=328 ) properties seen :1
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 173 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20000 reset in 6016 ms.
Product exploration explored 100000 steps with 20000 reset in 6078 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 128 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 3 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2022-05-20 18:08:50] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:08:50] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-20 18:08:50] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 512/512 transitions.
Product exploration explored 100000 steps with 20000 reset in 6620 ms.
Product exploration explored 100000 steps with 20000 reset in 6690 ms.
Built C files in :
/tmp/ltsmin5803046421415617954
[2022-05-20 18:09:04] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5803046421415617954
Running compilation step : cd /tmp/ltsmin5803046421415617954;'/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 782 ms.
Running link step : cd /tmp/ltsmin5803046421415617954;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5803046421415617954;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16986900076542712308.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 128 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 2 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:09:19] [INFO ] Computed 23 place invariants in 11 ms
[2022-05-20 18:09:19] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:09:19] [INFO ] Computed 23 place invariants in 16 ms
[2022-05-20 18:09:19] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:09:19] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-20 18:09:19] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin13034471862387694473
[2022-05-20 18:09:19] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13034471862387694473
Running compilation step : cd /tmp/ltsmin13034471862387694473;'/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 777 ms.
Running link step : cd /tmp/ltsmin13034471862387694473;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13034471862387694473;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8220581844429470824.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 18:09:34] [INFO ] Flatten gal took : 18 ms
[2022-05-20 18:09:34] [INFO ] Flatten gal took : 18 ms
[2022-05-20 18:09:34] [INFO ] Time to serialize gal into /tmp/LTL1651008790170374377.gal : 2 ms
[2022-05-20 18:09:34] [INFO ] Time to serialize properties into /tmp/LTL15899486036961342080.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/LTL1651008790170374377.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15899486036961342080.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/LTL1651008...267
Read 1 LTL properties
Checking formula 0 : !((F(X(X(X(F(X((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))+((Ro...1513
Formula 0 simplified : !FXXXFX("(((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(...1496
Detected timeout of ITS tools.
[2022-05-20 18:09:49] [INFO ] Flatten gal took : 19 ms
[2022-05-20 18:09:49] [INFO ] Applying decomposition
[2022-05-20 18:09:49] [INFO ] Flatten gal took : 17 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/graph6856239581154776837.txt' '-o' '/tmp/graph6856239581154776837.bin' '-w' '/tmp/graph6856239581154776837.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6856239581154776837.bin' '-l' '-1' '-v' '-w' '/tmp/graph6856239581154776837.weights' '-q' '0' '-e' '0.001'
[2022-05-20 18:09:49] [INFO ] Decomposing Gal with order
[2022-05-20 18:09:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 18:09:50] [INFO ] Removed a total of 1344 redundant transitions.
[2022-05-20 18:09:50] [INFO ] Flatten gal took : 79 ms
[2022-05-20 18:09:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-20 18:09:50] [INFO ] Time to serialize gal into /tmp/LTL7734620960663710180.gal : 1 ms
[2022-05-20 18:09:50] [INFO ] Time to serialize properties into /tmp/LTL8055674332180608637.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/LTL7734620960663710180.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8055674332180608637.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/LTL7734620...266
Read 1 LTL properties
Checking formula 0 : !((F(X(X(X(F(X((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.Ro...2089
Formula 0 simplified : !FXXXFX("(((((((gu65.Columns_0+gu65.Columns_1)+(gu65.Columns_2+gu65.Columns_3))+((gu65.Columns_4+gu65.Columns_5)+(gu65.Columns_6+gu6...2072
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15452091224015033715
[2022-05-20 18:10:05] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15452091224015033715
Running compilation step : cd /tmp/ltsmin15452091224015033715;'/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 793 ms.
Running link step : cd /tmp/ltsmin15452091224015033715;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin15452091224015033715;'/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(X(X(<>(X((<>((LTLAPp0==true))||(LTLAPp1==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN08-LTLCardinality-14 finished in 120208 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U F(G((X(G(p1))||F(!p2)))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p1)&&p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(X(F(X((F(p0)||p1))))))))'
Found a CL insensitive property : Sudoku-COL-AN08-LTLCardinality-14
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 128 out of 704 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Graph (complete) has 1536 edges and 704 vertex of which 192 are kept as prefixes of interest. Removing 512 places using SCC suffix rule.2 ms
Discarding 512 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:10:20] [INFO ] Computed 23 place invariants in 16 ms
[2022-05-20 18:10:20] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:10:20] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-20 18:10:21] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:10:21] [INFO ] Computed 23 place invariants in 14 ms
[2022-05-20 18:10:21] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 192/704 places, 512/512 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/704 places, 512/512 transitions.
Running random walk in product with property : Sudoku-COL-AN08-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 6026 ms.
Product exploration explored 100000 steps with 20000 reset in 6101 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 192 transition count 512
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), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 189 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 180 resets, run finished after 296 ms. (steps per millisecond=33 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Finished probabilistic random walk after 110901 steps, run visited all 1 properties in 339 ms. (steps per millisecond=327 )
Probabilistic random walk after 110901 steps, saw 34411 distinct states, run finished after 339 ms. (steps per millisecond=327 ) properties seen :1
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 191 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 128 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 1 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:10:35] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-20 18:10:36] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:10:36] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-20 18:10:36] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:10:36] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-20 18:10:36] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 512/512 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 192 transition count 512
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), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 179 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Finished probabilistic random walk after 110901 steps, run visited all 1 properties in 348 ms. (steps per millisecond=318 )
Probabilistic random walk after 110901 steps, saw 34411 distinct states, run finished after 349 ms. (steps per millisecond=317 ) properties seen :1
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 176 ms. Reduced automaton from 5 states, 5 edges and 2 AP to 5 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20000 reset in 6082 ms.
Product exploration explored 100000 steps with 20000 reset in 6129 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 128 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2022-05-20 18:10:51] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:10:51] [INFO ] Computed 23 place invariants in 9 ms
[2022-05-20 18:10:51] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 512/512 transitions.
Product exploration explored 100000 steps with 20000 reset in 6700 ms.
Product exploration explored 100000 steps with 20000 reset in 6741 ms.
Built C files in :
/tmp/ltsmin3390450429091287267
[2022-05-20 18:11:05] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3390450429091287267
Running compilation step : cd /tmp/ltsmin3390450429091287267;'/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 805 ms.
Running link step : cd /tmp/ltsmin3390450429091287267;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3390450429091287267;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10306539474756655876.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 128 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 512/512 transitions.
Applied a total of 0 rules in 4 ms. Remains 192 /192 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:11:20] [INFO ] Computed 23 place invariants in 13 ms
[2022-05-20 18:11:20] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:11:20] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-20 18:11:20] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
// Phase 1: matrix 512 rows 192 cols
[2022-05-20 18:11:20] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-20 18:11:20] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 192/192 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin18095482048152496694
[2022-05-20 18:11:20] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18095482048152496694
Running compilation step : cd /tmp/ltsmin18095482048152496694;'/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 796 ms.
Running link step : cd /tmp/ltsmin18095482048152496694;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin18095482048152496694;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8405198987915035721.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 18:11:35] [INFO ] Flatten gal took : 17 ms
[2022-05-20 18:11:36] [INFO ] Flatten gal took : 17 ms
[2022-05-20 18:11:36] [INFO ] Time to serialize gal into /tmp/LTL7788984278564151485.gal : 2 ms
[2022-05-20 18:11:36] [INFO ] Time to serialize properties into /tmp/LTL469352322711363871.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/LTL7788984278564151485.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL469352322711363871.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/LTL7788984...265
Read 1 LTL properties
Checking formula 0 : !((F(X(X(X(F(X((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))+((Ro...1513
Formula 0 simplified : !FXXXFX("(((((((Columns_0+Columns_1)+(Columns_2+Columns_3))+((Columns_4+Columns_5)+(Columns_6+Columns_7)))+(((Columns_8+Columns_9)+(...1496
Detected timeout of ITS tools.
[2022-05-20 18:11:51] [INFO ] Flatten gal took : 19 ms
[2022-05-20 18:11:51] [INFO ] Applying decomposition
[2022-05-20 18:11:51] [INFO ] Flatten gal took : 17 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/graph5017085636900289870.txt' '-o' '/tmp/graph5017085636900289870.bin' '-w' '/tmp/graph5017085636900289870.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5017085636900289870.bin' '-l' '-1' '-v' '-w' '/tmp/graph5017085636900289870.weights' '-q' '0' '-e' '0.001'
[2022-05-20 18:11:51] [INFO ] Decomposing Gal with order
[2022-05-20 18:11:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 18:11:51] [INFO ] Removed a total of 1344 redundant transitions.
[2022-05-20 18:11:51] [INFO ] Flatten gal took : 79 ms
[2022-05-20 18:11:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-20 18:11:51] [INFO ] Time to serialize gal into /tmp/LTL15906282542824610656.gal : 2 ms
[2022-05-20 18:11:51] [INFO ] Time to serialize properties into /tmp/LTL15976925170391710932.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/LTL15906282542824610656.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15976925170391710932.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/LTL1590628...268
Read 1 LTL properties
Checking formula 0 : !((F(X(X(X(F(X((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.Ro...2089
Formula 0 simplified : !FXXXFX("(((((((gu65.Columns_0+gu65.Columns_1)+(gu65.Columns_2+gu65.Columns_3))+((gu65.Columns_4+gu65.Columns_5)+(gu65.Columns_6+gu6...2072
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8462490184856480272
[2022-05-20 18:12:06] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8462490184856480272
Running compilation step : cd /tmp/ltsmin8462490184856480272;'/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 790 ms.
Running link step : cd /tmp/ltsmin8462490184856480272;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8462490184856480272;'/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(X(X(<>(X((<>((LTLAPp0==true))||(LTLAPp1==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN08-LTLCardinality-14 finished in 120876 ms.
[2022-05-20 18:12:21] [INFO ] Flatten gal took : 23 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin18072932422337998069
[2022-05-20 18:12:21] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2022-05-20 18:12:21] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:12:21] [INFO ] Applying decomposition
[2022-05-20 18:12:21] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2022-05-20 18:12:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:12:21] [INFO ] Flatten gal took : 22 ms
[2022-05-20 18:12:21] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2022-05-20 18:12:21] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 18:12:21] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18072932422337998069
Running compilation step : cd /tmp/ltsmin18072932422337998069;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '180' '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'
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/graph8648165980396350299.txt' '-o' '/tmp/graph8648165980396350299.bin' '-w' '/tmp/graph8648165980396350299.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8648165980396350299.bin' '-l' '-1' '-v' '-w' '/tmp/graph8648165980396350299.weights' '-q' '0' '-e' '0.001'
[2022-05-20 18:12:22] [INFO ] Decomposing Gal with order
[2022-05-20 18:12:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 18:12:22] [INFO ] Removed a total of 1344 redundant transitions.
[2022-05-20 18:12:23] [INFO ] Flatten gal took : 347 ms
[2022-05-20 18:12:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-20 18:12:23] [INFO ] Time to serialize gal into /tmp/LTLCardinality14610462997480658763.gal : 3 ms
[2022-05-20 18:12:23] [INFO ] Time to serialize properties into /tmp/LTLCardinality16144937834126351963.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/LTLCardinality14610462997480658763.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16144937834126351963.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...290
Read 4 LTL properties
Checking formula 0 : !((X((G("(((((((gu0.Rows_0+gu0.Rows_1)+(gu0.Rows_2+gu0.Rows_3))+((gu0.Rows_4+gu0.Rows_5)+(gu0.Rows_6+gu0.Rows_7)))+(((gu0.Rows_8+gu0.R...18002
Formula 0 simplified : !X(G"(((((((gu0.Rows_0+gu0.Rows_1)+(gu0.Rows_2+gu0.Rows_3))+((gu0.Rows_4+gu0.Rows_5)+(gu0.Rows_6+gu0.Rows_7)))+(((gu0.Rows_8+gu0.Row...17985
Compilation finished in 1664 ms.
Running link step : cd /tmp/ltsmin18072932422337998069;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin18072932422337998069;'/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)) U <>([]((X([]((LTLAPp1==true)))||<>(!(LTLAPp2==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: LTL layer: formula: X(([]((LTLAPp0==true)) U <>([]((X([]((LTLAPp1==true)))||<>(!(LTLAPp2==true)))))))
pins2lts-mc-linux64( 5/ 8), 0.009: "X(([]((LTLAPp0==true)) U <>([]((X([]((LTLAPp1==true)))||<>(!(LTLAPp2==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.009: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.033: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.088: There are 519 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.088: State length is 705, there are 518 groups
pins2lts-mc-linux64( 0/ 8), 0.088: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.088: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.088: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.088: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.278: [Blue] ~4 levels ~960 states ~15856 transitions
pins2lts-mc-linux64( 5/ 8), 0.311: [Blue] ~4 levels ~1920 states ~15856 transitions
pins2lts-mc-linux64( 5/ 8), 0.386: [Blue] ~4 levels ~3840 states ~19600 transitions
pins2lts-mc-linux64( 4/ 8), 0.537: [Blue] ~4 levels ~7680 states ~23344 transitions
pins2lts-mc-linux64( 4/ 8), 0.824: [Blue] ~4 levels ~15360 states ~30832 transitions
pins2lts-mc-linux64( 4/ 8), 1.370: [Blue] ~4 levels ~30720 states ~45824 transitions
pins2lts-mc-linux64( 1/ 8), 2.378: [Blue] ~4 levels ~61440 states ~75872 transitions
pins2lts-mc-linux64( 1/ 8), 4.292: [Blue] ~4 levels ~122880 states ~143392 transitions
pins2lts-mc-linux64( 1/ 8), 8.097: [Blue] ~4 levels ~245760 states ~282096 transitions
pins2lts-mc-linux64( 1/ 8), 15.465: [Blue] ~4 levels ~491520 states ~604512 transitions
pins2lts-mc-linux64( 4/ 8), 29.800: [Blue] ~58 levels ~983040 states ~2310792 transitions
pins2lts-mc-linux64( 1/ 8), 49.912: [Blue] ~58 levels ~1966080 states ~9107760 transitions
pins2lts-mc-linux64( 1/ 8), 91.355: [Blue] ~59 levels ~3932160 states ~24495488 transitions
pins2lts-mc-linux64( 1/ 8), 176.393: [Blue] ~59 levels ~7864320 states ~55661456 transitions
pins2lts-mc-linux64( 1/ 8), 271.929: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 271.984:
pins2lts-mc-linux64( 0/ 8), 271.984: Explored 9634264 states 73465352 transitions, fanout: 7.625
pins2lts-mc-linux64( 0/ 8), 271.984: Total exploration time 271.870 sec (271.830 sec minimum, 271.847 sec on average)
pins2lts-mc-linux64( 0/ 8), 271.984: States per second: 35437, Transitions per second: 270222
pins2lts-mc-linux64( 0/ 8), 271.984:
pins2lts-mc-linux64( 0/ 8), 271.984: State space has 9700679 states, 909296 are accepting
pins2lts-mc-linux64( 0/ 8), 271.984: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 271.984: blue states: 9634264 (99.32%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 271.984: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 271.984: all-red states: 909296 (9.37%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 271.984:
pins2lts-mc-linux64( 0/ 8), 271.984: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 271.984:
pins2lts-mc-linux64( 0/ 8), 271.984: Queue width: 8B, total height: 464, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 271.984: Tree memory: 330.0MB, 35.7 B/state, compr.: 1.3%
pins2lts-mc-linux64( 0/ 8), 271.984: Tree fill ratio (roots/leafs): 7.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 271.984: Stored 518 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 271.984: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 271.984: Est. total memory use: 330.0MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin18072932422337998069;'/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)) U <>([]((X([]((LTLAPp1==true)))||<>(!(LTLAPp2==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin18072932422337998069;'/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)) U <>([]((X([]((LTLAPp1==true)))||<>(!(LTLAPp2==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 18:36:04] [INFO ] Applying decomposition
[2022-05-20 18:36:24] [INFO ] Flatten gal took : 19347 ms
[2022-05-20 18:36:24] [INFO ] Decomposing Gal with order
[2022-05-20 18:36:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 18:36:24] [INFO ] Removed a total of 1096 redundant transitions.
[2022-05-20 18:36:24] [INFO ] Flatten gal took : 313 ms
[2022-05-20 18:36:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 26 ms.
[2022-05-20 18:36:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality12507956538116658433.gal : 33 ms
[2022-05-20 18:36:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality15011141716587839850.ltl : 12 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/LTLCardinality12507956538116658433.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15011141716587839850.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...290
Read 4 LTL properties
Checking formula 0 : !((X((G("(((((((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.Row...22114
Formula 0 simplified : !X(G"(((((((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_...22097
Detected timeout of ITS tools.
[2022-05-20 19:00:14] [INFO ] Flatten gal took : 318 ms
[2022-05-20 19:00:15] [INFO ] Input system was already deterministic with 512 transitions.
[2022-05-20 19:00:15] [INFO ] Transformed 704 places.
[2022-05-20 19:00:15] [INFO ] Transformed 512 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 19:00:15] [INFO ] Time to serialize gal into /tmp/LTLCardinality14528537855497571608.gal : 9 ms
[2022-05-20 19:00:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality14277958877439706339.ltl : 16 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/LTLCardinality14528537855497571608.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14277958877439706339.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...335
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((G("(((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows...13394
Formula 0 simplified : !X(G"(((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows_1...13377

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-AN08"
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-AN08, 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-165303545300099"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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