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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 122K Apr 30 12:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 597K Apr 30 12:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 261K Apr 30 12:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M 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 119K May 9 09:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 405K May 9 09:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 219K May 9 09:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 818K May 9 09:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 9 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 36K May 9 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 298K 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-PT-AN08-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653100243782

Running Version 202205111006
[2022-05-21 02:30:44] [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-21 02:30:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 02:30:45] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2022-05-21 02:30:45] [INFO ] Transformed 704 places.
[2022-05-21 02:30:45] [INFO ] Transformed 512 transitions.
[2022-05-21 02:30:45] [INFO ] Parsed PT model containing 704 places and 512 transitions in 216 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 54 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-PT-AN08-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN08-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN08-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN08-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN08-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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-21 02:30:45] [INFO ] Computed 192 place invariants in 30 ms
[2022-05-21 02:30:45] [INFO ] Implicit Places using invariants in 270 ms returned []
// Phase 1: matrix 512 rows 704 cols
[2022-05-21 02:30:45] [INFO ] Computed 192 place invariants in 6 ms
[2022-05-21 02:30:46] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
// Phase 1: matrix 512 rows 704 cols
[2022-05-21 02:30:46] [INFO ] Computed 192 place invariants in 4 ms
[2022-05-21 02:30:46] [INFO ] Dead Transitions using invariants and state equation in 316 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-21 02:30:46] [INFO ] Flatten gal took : 82 ms
[2022-05-21 02:30:46] [INFO ] Flatten gal took : 52 ms
[2022-05-21 02:30:46] [INFO ] Input system was already deterministic with 512 transitions.
Incomplete random walk after 10000 steps, including 180 resets, run finished after 991 ms. (steps per millisecond=10 ) properties (out of 17) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 512 rows 704 cols
[2022-05-21 02:30:48] [INFO ] Computed 192 place invariants in 7 ms
[2022-05-21 02:30:49] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-05-21 02:30:49] [INFO ] [Nat]Absence check using 192 positive place invariants in 39 ms returned sat
[2022-05-21 02:30:51] [INFO ] After 2111ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :2
[2022-05-21 02:30:53] [INFO ] After 4292ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :2
Attempting to minimize the solution found.
Minimization took 2205 ms.
[2022-05-21 02:30:55] [INFO ] After 6812ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :2
Fused 8 Parikh solutions to 2 different solutions.
Finished Parikh walk after 64 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=16 )
Parikh walk visited 2 properties in 4 ms.
Successfully simplified 6 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-AN08-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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-PT-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 48 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2022-05-21 02:30:56] [INFO ] Computed 192 place invariants in 7 ms
[2022-05-21 02:30:56] [INFO ] Implicit Places using invariants in 314 ms returned []
// Phase 1: matrix 512 rows 704 cols
[2022-05-21 02:30:56] [INFO ] Computed 192 place invariants in 3 ms
[2022-05-21 02:30:57] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 888 ms to find 0 implicit places.
[2022-05-21 02:30:57] [INFO ] Redundant transitions in 37 ms returned []
// Phase 1: matrix 512 rows 704 cols
[2022-05-21 02:30:57] [INFO ] Computed 192 place invariants in 2 ms
[2022-05-21 02:30:57] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0)]
Running random walk in product with property : Sudoku-PT-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 2 ms.
FORMULA Sudoku-PT-AN08-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN08-LTLCardinality-00 finished in 1486 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 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-21 02:30:57] [INFO ] Computed 192 place invariants in 6 ms
[2022-05-21 02:30:57] [INFO ] Implicit Places using invariants in 239 ms returned []
// Phase 1: matrix 512 rows 704 cols
[2022-05-21 02:30:57] [INFO ] Computed 192 place invariants in 11 ms
[2022-05-21 02:30:58] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
// Phase 1: matrix 512 rows 704 cols
[2022-05-21 02:30:58] [INFO ] Computed 192 place invariants in 2 ms
[2022-05-21 02:30:58] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 161 ms :[false, false, (NOT p0)]
Running random walk in product with property : Sudoku-PT-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 54 steps with 0 reset in 7 ms.
FORMULA Sudoku-PT-AN08-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN08-LTLCardinality-04 finished in 1221 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-21 02:30:58] [INFO ] Computed 192 place invariants in 5 ms
[2022-05-21 02:30:59] [INFO ] Implicit Places using invariants in 225 ms returned []
// Phase 1: matrix 512 rows 704 cols
[2022-05-21 02:30:59] [INFO ] Computed 192 place invariants in 6 ms
[2022-05-21 02:30:59] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
// Phase 1: matrix 512 rows 704 cols
[2022-05-21 02:30:59] [INFO ] Computed 192 place invariants in 2 ms
[2022-05-21 02:30:59] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 181 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-PT-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 1799 reset in 4588 ms.
Product exploration explored 100000 steps with 1798 reset in 4578 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 (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X p0), (X (AND p0 (NOT p1))), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 435 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 128 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 323 ms. (steps per millisecond=30 ) 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-21 02:31:16] [INFO ] Computed 192 place invariants in 2 ms
[2022-05-21 02:31:16] [INFO ] [Real]Absence check using 192 positive place invariants in 40 ms returned sat
[2022-05-21 02:31:16] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-21 02:31:16] [INFO ] [Nat]Absence check using 192 positive place invariants in 33 ms returned sat
[2022-05-21 02:31:17] [INFO ] After 797ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-21 02:31:18] [INFO ] After 1669ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 952 ms.
[2022-05-21 02:31:19] [INFO ] After 2777ms 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 3 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (OR (NOT p0) (NOT p1))), (X p0), (X (AND p0 (NOT p1))), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (AND p0 (NOT 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 418 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 116 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
// Phase 1: matrix 512 rows 704 cols
[2022-05-21 02:31:19] [INFO ] Computed 192 place invariants in 2 ms
[2022-05-21 02:31:21] [INFO ] [Real]Absence check using 192 positive place invariants in 58 ms returned sat
[2022-05-21 02:31:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 02:31:21] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2022-05-21 02:31:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 02:31:24] [INFO ] [Nat]Absence check using 192 positive place invariants in 446 ms returned sat
[2022-05-21 02:31:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 02:31:25] [INFO ] [Nat]Absence check using state equation in 1146 ms returned sat
[2022-05-21 02:31:25] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 25 ms.
[2022-05-21 02:31:25] [INFO ] Added : 0 causal constraints over 0 iterations in 98 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 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-21 02:31:25] [INFO ] Computed 192 place invariants in 6 ms
[2022-05-21 02:31:25] [INFO ] Implicit Places using invariants in 245 ms returned []
// Phase 1: matrix 512 rows 704 cols
[2022-05-21 02:31:25] [INFO ] Computed 192 place invariants in 3 ms
[2022-05-21 02:31:26] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
// Phase 1: matrix 512 rows 704 cols
[2022-05-21 02:31:26] [INFO ] Computed 192 place invariants in 2 ms
[2022-05-21 02:31:26] [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.
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 p0), (X (AND p0 (NOT p1))), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 325 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 116 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 346 ms. (steps per millisecond=28 ) 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-21 02:31:33] [INFO ] Computed 192 place invariants in 5 ms
[2022-05-21 02:31:33] [INFO ] [Real]Absence check using 192 positive place invariants in 36 ms returned sat
[2022-05-21 02:31:33] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-21 02:31:33] [INFO ] [Nat]Absence check using 192 positive place invariants in 32 ms returned sat
[2022-05-21 02:31:34] [INFO ] After 791ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-21 02:31:35] [INFO ] After 1649ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 967 ms.
[2022-05-21 02:31:36] [INFO ] After 2786ms 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 p0), (X (AND p0 (NOT p1))), true, (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (AND p0 (NOT 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 10 factoid took 341 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 117 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
// Phase 1: matrix 512 rows 704 cols
[2022-05-21 02:31:36] [INFO ] Computed 192 place invariants in 5 ms
[2022-05-21 02:31:38] [INFO ] [Real]Absence check using 192 positive place invariants in 56 ms returned sat
[2022-05-21 02:31:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 02:31:38] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2022-05-21 02:31:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 02:31:41] [INFO ] [Nat]Absence check using 192 positive place invariants in 415 ms returned sat
[2022-05-21 02:31:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 02:31:42] [INFO ] [Nat]Absence check using state equation in 1154 ms returned sat
[2022-05-21 02:31:43] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 22 ms.
[2022-05-21 02:31:43] [INFO ] Added : 0 causal constraints over 0 iterations in 93 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 1797 reset in 4482 ms.
Product exploration explored 100000 steps with 1798 reset in 4431 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 142 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 30 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2022-05-21 02:31:52] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 512 rows 704 cols
[2022-05-21 02:31:52] [INFO ] Computed 192 place invariants in 2 ms
[2022-05-21 02:31:52] [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.
Product exploration explored 100000 steps with 1800 reset in 4549 ms.
Product exploration explored 100000 steps with 1798 reset in 4572 ms.
Built C files in :
/tmp/ltsmin9314745966671169804
[2022-05-21 02:32:01] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9314745966671169804
Running compilation step : cd /tmp/ltsmin9314745966671169804;'/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 1086 ms.
Running link step : cd /tmp/ltsmin9314745966671169804;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin9314745966671169804;'/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/stateBased14942962526782572999.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 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-21 02:32:17] [INFO ] Computed 192 place invariants in 4 ms
[2022-05-21 02:32:17] [INFO ] Implicit Places using invariants in 250 ms returned []
// Phase 1: matrix 512 rows 704 cols
[2022-05-21 02:32:17] [INFO ] Computed 192 place invariants in 4 ms
[2022-05-21 02:32:17] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
// Phase 1: matrix 512 rows 704 cols
[2022-05-21 02:32:17] [INFO ] Computed 192 place invariants in 4 ms
[2022-05-21 02:32:17] [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/ltsmin18382831719688907732
[2022-05-21 02:32:18] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18382831719688907732
Running compilation step : cd /tmp/ltsmin18382831719688907732;'/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 984 ms.
Running link step : cd /tmp/ltsmin18382831719688907732;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin18382831719688907732;'/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/stateBased14587841635513425978.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 02:32:33] [INFO ] Flatten gal took : 36 ms
[2022-05-21 02:32:33] [INFO ] Flatten gal took : 37 ms
[2022-05-21 02:32:33] [INFO ] Time to serialize gal into /tmp/LTL6142557587166997565.gal : 7 ms
[2022-05-21 02:32:33] [INFO ] Time to serialize properties into /tmp/LTL2737146403723212317.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/LTL6142557587166997565.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2737146403723212317.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/LTL6142557...266
Read 1 LTL properties
Checking formula 0 : !(((G("(((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_1_0+Rows_1_1)+(Rows_1_2+Rows_...9334
Formula 0 simplified : !(G"(((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_1_0+Rows_1_1)+(Rows_1_2+Rows_1...9325
Detected timeout of ITS tools.
[2022-05-21 02:32:48] [INFO ] Flatten gal took : 33 ms
[2022-05-21 02:32:48] [INFO ] Applying decomposition
[2022-05-21 02:32:48] [INFO ] Flatten gal took : 29 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/graph12949156107975093267.txt' '-o' '/tmp/graph12949156107975093267.bin' '-w' '/tmp/graph12949156107975093267.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12949156107975093267.bin' '-l' '-1' '-v' '-w' '/tmp/graph12949156107975093267.weights' '-q' '0' '-e' '0.001'
[2022-05-21 02:32:48] [INFO ] Decomposing Gal with order
[2022-05-21 02:32:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 02:32:49] [INFO ] Removed a total of 448 redundant transitions.
[2022-05-21 02:32:49] [INFO ] Flatten gal took : 509 ms
[2022-05-21 02:32:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 512 labels/synchronizations in 26 ms.
[2022-05-21 02:32:49] [INFO ] Time to serialize gal into /tmp/LTL8269931485320624157.gal : 4 ms
[2022-05-21 02:32:49] [INFO ] Time to serialize properties into /tmp/LTL2687450745251133255.ltl : 17 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/LTL8269931485320624157.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2687450745251133255.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/LTL8269931...266
Read 1 LTL properties
Checking formula 0 : !(((G("(((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_0_6+gu0.Rows_0_7)))+(((gu...12150
Formula 0 simplified : !(G"(((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_0_6+gu0.Rows_0_7)))+(((gu0...12141
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16312656176425824924
[2022-05-21 02:33:04] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16312656176425824924
Running compilation step : cd /tmp/ltsmin16312656176425824924;'/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 987 ms.
Running link step : cd /tmp/ltsmin16312656176425824924;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin16312656176425824924;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true)) U X(([]((LTLAPp0==true))&&(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-PT-AN08-LTLCardinality-06 finished in 140867 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 20 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2022-05-21 02:33:19] [INFO ] Computed 192 place invariants in 2 ms
[2022-05-21 02:33:19] [INFO ] Implicit Places using invariants in 212 ms returned []
// Phase 1: matrix 512 rows 704 cols
[2022-05-21 02:33:19] [INFO ] Computed 192 place invariants in 8 ms
[2022-05-21 02:33:20] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
// Phase 1: matrix 512 rows 704 cols
[2022-05-21 02:33:20] [INFO ] Computed 192 place invariants in 1 ms
[2022-05-21 02:33:20] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-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 8 ms.
FORMULA Sudoku-PT-AN08-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN08-LTLCardinality-07 finished in 1079 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X((F(p0)&&p1)))))'
Support contains 4 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 185 are kept as prefixes of interest. Removing 519 places using SCC suffix rule.4 ms
Discarding 519 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 25 ms. Remains 185 /704 variables (removed 519) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 185 cols
[2022-05-21 02:33:20] [INFO ] Computed 18 place invariants in 29 ms
[2022-05-21 02:33:21] [INFO ] Implicit Places using invariants in 174 ms returned []
// Phase 1: matrix 512 rows 185 cols
[2022-05-21 02:33:21] [INFO ] Computed 18 place invariants in 22 ms
[2022-05-21 02:33:21] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
[2022-05-21 02:33:21] [INFO ] Redundant transitions in 48 ms returned []
// Phase 1: matrix 512 rows 185 cols
[2022-05-21 02:33:21] [INFO ] Computed 18 place invariants in 23 ms
[2022-05-21 02:33:21] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 185/704 places, 512/512 transitions.
Finished structural reductions, in 1 iterations. Remains : 185/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s64 s148), p1:(LEQ s65 s150)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 169 steps with 2 reset in 9 ms.
FORMULA Sudoku-PT-AN08-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN08-LTLCardinality-09 finished in 992 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((F(G(F(p0)))||X(p0))))))'
Support contains 2 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.3 ms
Discarding 512 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2022-05-21 02:33:21] [INFO ] Computed 23 place invariants in 11 ms
[2022-05-21 02:33:21] [INFO ] Implicit Places using invariants in 155 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-21 02:33:21] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-21 02:33:22] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2022-05-21 02:33:22] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-21 02:33:22] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-21 02:33:22] [INFO ] Dead Transitions using invariants and state equation in 199 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 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s174 s56)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 70 steps with 1 reset in 7 ms.
FORMULA Sudoku-PT-AN08-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN08-LTLCardinality-11 finished in 849 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((true U !X(p0)))'
Support contains 2 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Reduce places removed 511 places and 0 transitions.
Iterating post reduction 0 with 511 rules applied. Total rules applied 511 place count 193 transition count 512
Applied a total of 511 rules in 10 ms. Remains 193 /704 variables (removed 511) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 193 cols
[2022-05-21 02:33:22] [INFO ] Computed 23 place invariants in 14 ms
[2022-05-21 02:33:22] [INFO ] Implicit Places using invariants in 161 ms returned []
// Phase 1: matrix 512 rows 193 cols
[2022-05-21 02:33:22] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-21 02:33:23] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
// Phase 1: matrix 512 rows 193 cols
[2022-05-21 02:33:23] [INFO ] Computed 23 place invariants in 17 ms
[2022-05-21 02:33:23] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 193/704 places, 512/512 transitions.
Finished structural reductions, in 1 iterations. Remains : 193/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 64 ms :[p0, p0]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s64 s121)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 4720 ms.
Product exploration explored 100000 steps with 50000 reset in 4804 ms.
Computed a total of 193 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 193 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)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN08-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN08-LTLCardinality-12 finished in 11261 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 2 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 11 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2022-05-21 02:33:33] [INFO ] Computed 23 place invariants in 14 ms
[2022-05-21 02:33:34] [INFO ] Implicit Places using invariants in 150 ms returned []
// Phase 1: matrix 512 rows 192 cols
[2022-05-21 02:33:34] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-21 02:33:34] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
// Phase 1: matrix 512 rows 192 cols
[2022-05-21 02:33:34] [INFO ] Computed 23 place invariants in 13 ms
[2022-05-21 02:33:34] [INFO ] Dead Transitions using invariants and state equation in 191 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 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s27 s133)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 962 steps with 387 reset in 50 ms.
FORMULA Sudoku-PT-AN08-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN08-LTLCardinality-14 finished in 855 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 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 193 are kept as prefixes of interest. Removing 511 places using SCC suffix rule.4 ms
Discarding 511 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 193 /704 variables (removed 511) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 193 cols
[2022-05-21 02:33:34] [INFO ] Computed 23 place invariants in 14 ms
[2022-05-21 02:33:34] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 512 rows 193 cols
[2022-05-21 02:33:34] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-21 02:33:35] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
[2022-05-21 02:33:35] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 512 rows 193 cols
[2022-05-21 02:33:35] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-21 02:33:35] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 193/704 places, 512/512 transitions.
Finished structural reductions, in 1 iterations. Remains : 193/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s2 s64)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 197 steps with 3 reset in 11 ms.
FORMULA Sudoku-PT-AN08-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN08-LTLCardinality-15 finished in 795 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((G(p0)&&p1))))'
[2022-05-21 02:33:35] [INFO ] Flatten gal took : 30 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10597393916341865189
[2022-05-21 02:33:35] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2022-05-21 02:33:35] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 02:33:35] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2022-05-21 02:33:35] [INFO ] Applying decomposition
[2022-05-21 02:33:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 02:33:35] [INFO ] Flatten gal took : 32 ms
[2022-05-21 02:33:35] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2022-05-21 02:33:35] [INFO ] Computation of Completed DNA matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 02:33:35] [INFO ] Built C files in 123ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10597393916341865189
Running compilation step : cd /tmp/ltsmin10597393916341865189;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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/graph12695115663781978759.txt' '-o' '/tmp/graph12695115663781978759.bin' '-w' '/tmp/graph12695115663781978759.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12695115663781978759.bin' '-l' '-1' '-v' '-w' '/tmp/graph12695115663781978759.weights' '-q' '0' '-e' '0.001'
[2022-05-21 02:33:36] [INFO ] Decomposing Gal with order
[2022-05-21 02:33:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 02:33:36] [INFO ] Removed a total of 448 redundant transitions.
[2022-05-21 02:33:36] [INFO ] Flatten gal took : 276 ms
[2022-05-21 02:33:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 512 labels/synchronizations in 22 ms.
[2022-05-21 02:33:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality1256942981127697557.gal : 4 ms
[2022-05-21 02:33:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality1205921130256493368.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/LTLCardinality1256942981127697557.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1205921130256493368.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...288
Read 1 LTL properties
Checking formula 0 : !(((G("(((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_0_6+gu0.Rows_0_7)))+(((gu...12150
Formula 0 simplified : !(G"(((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_0_6+gu0.Rows_0_7)))+(((gu0...12141
Compilation finished in 1392 ms.
Running link step : cd /tmp/ltsmin10597393916341865189;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin10597393916341865189;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true)) U X(([]((LTLAPp0==true))&&(LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.295: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.295: LTL layer: formula: ([]((LTLAPp0==true)) U X(([]((LTLAPp0==true))&&(LTLAPp1==true))))
pins2lts-mc-linux64( 2/ 8), 0.295: "([]((LTLAPp0==true)) U X(([]((LTLAPp0==true))&&(LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.295: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.307: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.314: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.318: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.322: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.324: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.323: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.324: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.337: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.436: DFS-FIFO for weak LTL, using special progress label 515
pins2lts-mc-linux64( 0/ 8), 0.436: There are 516 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.436: State length is 705, there are 523 groups
pins2lts-mc-linux64( 0/ 8), 0.436: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.436: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.436: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.436: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 1.292: ~33 levels ~960 states ~116152 transitions
pins2lts-mc-linux64( 0/ 8), 1.569: ~33 levels ~1920 states ~188328 transitions
pins2lts-mc-linux64( 0/ 8), 2.026: ~33 levels ~3840 states ~332584 transitions
pins2lts-mc-linux64( 2/ 8), 2.801: ~33 levels ~7680 states ~611320 transitions
pins2lts-mc-linux64( 7/ 8), 4.197: ~33 levels ~15360 states ~1155248 transitions
pins2lts-mc-linux64( 7/ 8), 6.610: ~33 levels ~30720 states ~2257744 transitions
pins2lts-mc-linux64( 7/ 8), 10.810: ~33 levels ~61440 states ~4474952 transitions
pins2lts-mc-linux64( 1/ 8), 19.367: ~33 levels ~122880 states ~8696136 transitions
pins2lts-mc-linux64( 1/ 8), 36.561: ~33 levels ~245760 states ~17397600 transitions
pins2lts-mc-linux64( 2/ 8), 73.398: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 74.096:
pins2lts-mc-linux64( 0/ 8), 74.097: mean standard work distribution: 3.1% (states) 0.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 74.097:
pins2lts-mc-linux64( 0/ 8), 74.097: Explored 456048 states 33727527 transitions, fanout: 73.956
pins2lts-mc-linux64( 0/ 8), 74.097: Total exploration time 73.650 sec (73.130 sec minimum, 73.345 sec on average)
pins2lts-mc-linux64( 0/ 8), 74.097: States per second: 6192, Transitions per second: 457943
pins2lts-mc-linux64( 0/ 8), 74.097:
pins2lts-mc-linux64( 0/ 8), 74.097: Progress states detected: 9894832
pins2lts-mc-linux64( 0/ 8), 74.097: Redundant explorations: -95.6198
pins2lts-mc-linux64( 0/ 8), 74.097:
pins2lts-mc-linux64( 0/ 8), 74.097: Queue width: 8B, total height: 9894594, memory: 75.49MB
pins2lts-mc-linux64( 0/ 8), 74.097: Tree memory: 335.4MB, 33.8 B/state, compr.: 1.2%
pins2lts-mc-linux64( 0/ 8), 74.097: Tree fill ratio (roots/leafs): 7.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 74.097: Stored 518 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 74.097: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 74.097: Est. total memory use: 410.9MB (~1099.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10597393916341865189;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true)) U X(([]((LTLAPp0==true))&&(LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10597393916341865189;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true)) U X(([]((LTLAPp0==true))&&(LTLAPp1==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-21 02:54:35] [INFO ] Flatten gal took : 291 ms
[2022-05-21 02:54:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality93862351675470167.gal : 53 ms
[2022-05-21 02:54:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality7117756841234162428.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/LTLCardinality93862351675470167.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7117756841234162428.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...286
Read 1 LTL properties
Checking formula 0 : !(((G("(((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_1_0+Rows_1_1)+(Rows_1_2+Rows_...9334
Formula 0 simplified : !(G"(((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_1_0+Rows_1_1)+(Rows_1_2+Rows_1...9325
Detected timeout of ITS tools.
[2022-05-21 03:15:47] [INFO ] Flatten gal took : 278 ms
[2022-05-21 03:15:48] [INFO ] Input system was already deterministic with 512 transitions.
[2022-05-21 03:15:48] [INFO ] Transformed 704 places.
[2022-05-21 03:15:48] [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-21 03:15:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality11510925875183198318.gal : 26 ms
[2022-05-21 03:15:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality9838272358217996651.ltl : 8 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/LTLCardinality11510925875183198318.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9838272358217996651.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...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G("(((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_1_0+Rows_1_1)+(Rows_1_2+Rows_...9334
Formula 0 simplified : !(G"(((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_1_0+Rows_1_1)+(Rows_1_2+Rows_1...9325

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-PT-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-PT-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-165303545500259"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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