About the Execution of ITS-Tools for Sudoku-PT-AN04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16208.216 | 3600000.00 | 3860341.00 | 78835.90 | TFF?FFTFFFFFFTFT | normal |
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-165303545400227.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-AN04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545400227
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 55K Apr 30 11:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 317K Apr 30 11:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 73K Apr 30 11:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 373K Apr 30 11:34 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 21K May 9 09:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 9 09:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 30K May 9 09:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 116K May 9 09:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K May 9 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K May 9 09:10 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 44K 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-AN04-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN04-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1653093009674
Running Version 202205111006
[2022-05-21 00:30:10] [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 00:30:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 00:30:11] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2022-05-21 00:30:11] [INFO ] Transformed 112 places.
[2022-05-21 00:30:11] [INFO ] Transformed 64 transitions.
[2022-05-21 00:30:11] [INFO ] Parsed PT model containing 112 places and 64 transitions in 164 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-AN04-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 112 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 12 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2022-05-21 00:30:11] [INFO ] Computed 48 place invariants in 11 ms
[2022-05-21 00:30:11] [INFO ] Implicit Places using invariants in 145 ms returned []
// Phase 1: matrix 64 rows 112 cols
[2022-05-21 00:30:11] [INFO ] Computed 48 place invariants in 3 ms
[2022-05-21 00:30:11] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 112 cols
[2022-05-21 00:30:11] [INFO ] Computed 48 place invariants in 2 ms
[2022-05-21 00:30:11] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/112 places, 64/64 transitions.
Support contains 112 out of 112 places after structural reductions.
[2022-05-21 00:30:11] [INFO ] Flatten gal took : 47 ms
[2022-05-21 00:30:11] [INFO ] Flatten gal took : 14 ms
[2022-05-21 00:30:11] [INFO ] Input system was already deterministic with 64 transitions.
Incomplete random walk after 10000 steps, including 693 resets, run finished after 559 ms. (steps per millisecond=17 ) properties (out of 29) seen :19
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 64 rows 112 cols
[2022-05-21 00:30:12] [INFO ] Computed 48 place invariants in 1 ms
[2022-05-21 00:30:12] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-05-21 00:30:12] [INFO ] [Nat]Absence check using 48 positive place invariants in 11 ms returned sat
[2022-05-21 00:30:12] [INFO ] After 114ms SMT Verify possible using all constraints in natural domain returned unsat :10 sat :0
Fused 10 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA Sudoku-PT-AN04-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 10 atomic propositions for a total of 14 simplifications.
FORMULA Sudoku-PT-AN04-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN04-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p0)||p0))||G(p1))))'
Support contains 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2022-05-21 00:30:13] [INFO ] Computed 48 place invariants in 0 ms
[2022-05-21 00:30:13] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 64 rows 112 cols
[2022-05-21 00:30:13] [INFO ] Computed 48 place invariants in 8 ms
[2022-05-21 00:30:13] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 112 cols
[2022-05-21 00:30:13] [INFO ] Computed 48 place invariants in 1 ms
[2022-05-21 00:30:13] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ (ADD s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95) (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 11111 reset in 955 ms.
Product exploration explored 100000 steps with 11111 reset in 956 ms.
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 267 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 694 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 64 rows 112 cols
[2022-05-21 00:30:16] [INFO ] Computed 48 place invariants in 2 ms
[2022-05-21 00:30:16] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 8 factoid took 243 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN04-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN04-LTLCardinality-00 finished in 3623 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(X(p0)))))'
Support contains 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 9 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2022-05-21 00:30:16] [INFO ] Computed 48 place invariants in 0 ms
[2022-05-21 00:30:16] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 64 rows 112 cols
[2022-05-21 00:30:17] [INFO ] Computed 48 place invariants in 1 ms
[2022-05-21 00:30:17] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2022-05-21 00:30:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 112 cols
[2022-05-21 00:30:17] [INFO ] Computed 48 place invariants in 3 ms
[2022-05-21 00:30:17] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN04-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLCardinality-01 finished in 444 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||G(p0)))'
Support contains 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2022-05-21 00:30:17] [INFO ] Computed 48 place invariants in 0 ms
[2022-05-21 00:30:17] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 64 rows 112 cols
[2022-05-21 00:30:17] [INFO ] Computed 48 place invariants in 1 ms
[2022-05-21 00:30:17] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 112 cols
[2022-05-21 00:30:17] [INFO ] Computed 48 place invariants in 2 ms
[2022-05-21 00:30:17] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-02 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 s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15) (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN04-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLCardinality-02 finished in 333 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((true U G(X(F(p0)))))))'
Support contains 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 6 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2022-05-21 00:30:17] [INFO ] Computed 48 place invariants in 1 ms
[2022-05-21 00:30:17] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 64 rows 112 cols
[2022-05-21 00:30:17] [INFO ] Computed 48 place invariants in 1 ms
[2022-05-21 00:30:17] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2022-05-21 00:30:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 112 cols
[2022-05-21 00:30:17] [INFO ] Computed 48 place invariants in 1 ms
[2022-05-21 00:30:17] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111) (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 11087 reset in 707 ms.
Product exploration explored 100000 steps with 11088 reset in 731 ms.
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 64 rows 112 cols
[2022-05-21 00:30:19] [INFO ] Computed 48 place invariants in 1 ms
[2022-05-21 00:30:20] [INFO ] [Real]Absence check using 48 positive place invariants in 9 ms returned sat
[2022-05-21 00:30:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 00:30:20] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-05-21 00:30:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 00:30:20] [INFO ] [Nat]Absence check using 48 positive place invariants in 13 ms returned sat
[2022-05-21 00:30:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 00:30:20] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2022-05-21 00:30:20] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-21 00:30:20] [INFO ] Added : 0 causal constraints over 0 iterations in 30 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2022-05-21 00:30:20] [INFO ] Computed 48 place invariants in 0 ms
[2022-05-21 00:30:20] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 64 rows 112 cols
[2022-05-21 00:30:20] [INFO ] Computed 48 place invariants in 6 ms
[2022-05-21 00:30:20] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2022-05-21 00:30:20] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 112 cols
[2022-05-21 00:30:20] [INFO ] Computed 48 place invariants in 1 ms
[2022-05-21 00:30:20] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/112 places, 64/64 transitions.
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 64 rows 112 cols
[2022-05-21 00:30:21] [INFO ] Computed 48 place invariants in 1 ms
[2022-05-21 00:30:21] [INFO ] [Real]Absence check using 48 positive place invariants in 9 ms returned sat
[2022-05-21 00:30:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 00:30:21] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2022-05-21 00:30:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 00:30:21] [INFO ] [Nat]Absence check using 48 positive place invariants in 13 ms returned sat
[2022-05-21 00:30:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 00:30:21] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2022-05-21 00:30:21] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-21 00:30:21] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11089 reset in 674 ms.
Product exploration explored 100000 steps with 11079 reset in 711 ms.
Built C files in :
/tmp/ltsmin11462570117846410713
[2022-05-21 00:30:23] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2022-05-21 00:30:23] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 00:30:23] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2022-05-21 00:30:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 00:30:23] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2022-05-21 00:30:23] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 00:30:23] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11462570117846410713
Running compilation step : cd /tmp/ltsmin11462570117846410713;'/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 265 ms.
Running link step : cd /tmp/ltsmin11462570117846410713;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin11462570117846410713;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1981113968748838885.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 80 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2022-05-21 00:30:38] [INFO ] Computed 48 place invariants in 1 ms
[2022-05-21 00:30:38] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 64 rows 112 cols
[2022-05-21 00:30:38] [INFO ] Computed 48 place invariants in 0 ms
[2022-05-21 00:30:38] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2022-05-21 00:30:38] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 112 cols
[2022-05-21 00:30:38] [INFO ] Computed 48 place invariants in 0 ms
[2022-05-21 00:30:38] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/112 places, 64/64 transitions.
Built C files in :
/tmp/ltsmin14136550317512948318
[2022-05-21 00:30:38] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2022-05-21 00:30:38] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 00:30:38] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2022-05-21 00:30:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 00:30:38] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2022-05-21 00:30:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 00:30:38] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14136550317512948318
Running compilation step : cd /tmp/ltsmin14136550317512948318;'/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 164 ms.
Running link step : cd /tmp/ltsmin14136550317512948318;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin14136550317512948318;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8995492731025610710.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 00:30:53] [INFO ] Flatten gal took : 7 ms
[2022-05-21 00:30:53] [INFO ] Flatten gal took : 7 ms
[2022-05-21 00:30:53] [INFO ] Time to serialize gal into /tmp/LTL13473012182945114704.gal : 2 ms
[2022-05-21 00:30:53] [INFO ] Time to serialize properties into /tmp/LTL6454480248626303812.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/LTL13473012182945114704.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6454480248626303812.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/LTL1347301...267
Read 1 LTL properties
Checking formula 0 : !((F(X(F(G(X(F("(((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_1_0+Columns_1_1)+(Columns_1_2+Columns_1_3)))+(((Col...1164
Formula 0 simplified : !FXFGXF"(((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_1_0+Columns_1_1)+(Columns_1_2+Columns_1_3)))+(((Columns_2...1150
Detected timeout of ITS tools.
[2022-05-21 00:31:08] [INFO ] Flatten gal took : 9 ms
[2022-05-21 00:31:08] [INFO ] Applying decomposition
[2022-05-21 00:31:08] [INFO ] Flatten gal took : 7 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/graph7656163055677252684.txt' '-o' '/tmp/graph7656163055677252684.bin' '-w' '/tmp/graph7656163055677252684.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7656163055677252684.bin' '-l' '-1' '-v' '-w' '/tmp/graph7656163055677252684.weights' '-q' '0' '-e' '0.001'
[2022-05-21 00:31:08] [INFO ] Decomposing Gal with order
[2022-05-21 00:31:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 00:31:08] [INFO ] Removed a total of 56 redundant transitions.
[2022-05-21 00:31:08] [INFO ] Flatten gal took : 40 ms
[2022-05-21 00:31:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 3 ms.
[2022-05-21 00:31:08] [INFO ] Time to serialize gal into /tmp/LTL6066389249599722087.gal : 2 ms
[2022-05-21 00:31:08] [INFO ] Time to serialize properties into /tmp/LTL15234488943478789484.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/LTL6066389249599722087.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15234488943478789484.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/LTL6066389...267
Read 1 LTL properties
Checking formula 0 : !((F(X(F(G(X(F("(((((gu18.Columns_0_0+gu18.Columns_0_1)+(gu18.Columns_0_2+gu18.Columns_0_3))+((gu18.Columns_1_0+gu18.Columns_1_1)+(gu1...1564
Formula 0 simplified : !FXFGXF"(((((gu18.Columns_0_0+gu18.Columns_0_1)+(gu18.Columns_0_2+gu18.Columns_0_3))+((gu18.Columns_1_0+gu18.Columns_1_1)+(gu18.Colu...1550
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9937505418142718314
[2022-05-21 00:31:24] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9937505418142718314
Running compilation step : cd /tmp/ltsmin9937505418142718314;'/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 166 ms.
Running link step : cd /tmp/ltsmin9937505418142718314;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin9937505418142718314;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X((true U [](X(<>((LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-PT-AN04-LTLCardinality-03 finished in 81442 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 64 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2022-05-21 00:31:39] [INFO ] Computed 48 place invariants in 0 ms
[2022-05-21 00:31:39] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 64 rows 112 cols
[2022-05-21 00:31:39] [INFO ] Computed 48 place invariants in 1 ms
[2022-05-21 00:31:39] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 112 cols
[2022-05-21 00:31:39] [INFO ] Computed 48 place invariants in 1 ms
[2022-05-21 00:31:39] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 112/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 (ADD s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN04-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLCardinality-05 finished in 343 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 16 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Graph (complete) has 192 edges and 112 vertex of which 48 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.2 ms
Discarding 64 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2022-05-21 00:31:39] [INFO ] Computed 11 place invariants in 6 ms
[2022-05-21 00:31:39] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-21 00:31:39] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-21 00:31:39] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2022-05-21 00:31:39] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-21 00:31:39] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-21 00:31:39] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 (ADD s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47))], 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 14 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN04-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLCardinality-07 finished in 255 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((false U G(!X(F(p0)))))'
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 49 transition count 64
Applied a total of 63 rules in 2 ms. Remains 49 /112 variables (removed 63) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 49 cols
[2022-05-21 00:31:39] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-21 00:31:39] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 64 rows 49 cols
[2022-05-21 00:31:39] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-21 00:31:39] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 49 cols
[2022-05-21 00:31:39] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-21 00:31:39] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/112 places, 64/64 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, p0, p0]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s48 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN04-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLCardinality-08 finished in 289 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!(!F(p0) U p1)) U !(G(p2)||p3))))'
Support contains 7 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 5 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2022-05-21 00:31:40] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-21 00:31:40] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-21 00:31:40] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-21 00:31:40] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 48 cols
[2022-05-21 00:31:40] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-21 00:31:40] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 258 ms :[(OR p3 p2), (OR p3 p2), p1, p2, (AND p1 (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p3, acceptance={0} source=1 dest: 1}, { cond=(AND p3 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 3}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(LEQ s30 s45), p1:(LEQ s34 s14), p2:(LEQ s18 s46), p0:(LEQ s31 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN04-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLCardinality-09 finished in 474 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 2 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2022-05-21 00:31:40] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-21 00:31:40] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-21 00:31:40] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-21 00:31:40] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 48 cols
[2022-05-21 00:31:40] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-21 00:31:40] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-10 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 s8 s39)], 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 15 steps with 1 reset in 0 ms.
FORMULA Sudoku-PT-AN04-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLCardinality-10 finished in 323 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(p1)))'
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 2 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2022-05-21 00:31:40] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-21 00:31:40] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-21 00:31:40] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-21 00:31:40] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 48 cols
[2022-05-21 00:31:40] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-21 00:31:40] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 s31), p1:(LEQ s1 s34)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 37 steps with 9 reset in 1 ms.
FORMULA Sudoku-PT-AN04-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLCardinality-11 finished in 288 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(false U (true U false)))'
Support contains 0 out of 112 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Graph (complete) has 192 edges and 112 vertex of which 0 are kept as prefixes of interest. Removing 112 places using SCC suffix rule.0 ms
Discarding 112 places :
Also discarding 64 output transitions
Drop transitions removed 64 transitions
Applied a total of 1 rules in 1 ms. Remains 0 /112 variables (removed 112) and now considering 0/64 (removed 64) transitions.
[2022-05-21 00:31:41] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-21 00:31:41] [INFO ] Implicit Places using invariants in 6 ms returned []
[2022-05-21 00:31:41] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-21 00:31:41] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2022-05-21 00:31:41] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-21 00:31:41] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-21 00:31:41] [INFO ] Dead Transitions using invariants and state equation in 4 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 0/112 places, 0/64 transitions.
Finished structural reductions, in 1 iterations. Remains : 0/112 places, 0/64 transitions.
Stuttering acceptance computed with spot in 11 ms :[false]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-13 automaton TGBA Formula[mat=[[]], initial=0, aps=[], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN04-LTLCardinality-13 TRUE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLCardinality-13 finished in 66 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(X(p0))&&p1) U G(p2))))'
Support contains 6 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 51 transition count 64
Applied a total of 61 rules in 2 ms. Remains 51 /112 variables (removed 61) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 51 cols
[2022-05-21 00:31:41] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-21 00:31:41] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 64 rows 51 cols
[2022-05-21 00:31:41] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-21 00:31:41] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 51 cols
[2022-05-21 00:31:41] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-21 00:31:41] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/112 places, 64/64 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/112 places, 64/64 transitions.
Stuttering acceptance computed with spot in 358 ms :[(NOT p2), (NOT p2), true, (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN04-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}, { cond=(AND p2 p1), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (LEQ s28 s48) (LEQ s1 s17)), p1:(LEQ 1 s18), p0:(LEQ 1 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN04-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN04-LTLCardinality-14 finished in 569 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((true U G(X(F(p0)))))))'
[2022-05-21 00:31:41] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9835985661973065905
[2022-05-21 00:31:41] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2022-05-21 00:31:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 00:31:41] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2022-05-21 00:31:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 00:31:41] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2022-05-21 00:31:41] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 00:31:41] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9835985661973065905
Running compilation step : cd /tmp/ltsmin9835985661973065905;'/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'
[2022-05-21 00:31:41] [INFO ] Applying decomposition
[2022-05-21 00:31:41] [INFO ] Flatten gal took : 6 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/graph13604343636548865762.txt' '-o' '/tmp/graph13604343636548865762.bin' '-w' '/tmp/graph13604343636548865762.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13604343636548865762.bin' '-l' '-1' '-v' '-w' '/tmp/graph13604343636548865762.weights' '-q' '0' '-e' '0.001'
[2022-05-21 00:31:41] [INFO ] Decomposing Gal with order
[2022-05-21 00:31:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 00:31:42] [INFO ] Removed a total of 74 redundant transitions.
[2022-05-21 00:31:42] [INFO ] Flatten gal took : 23 ms
[2022-05-21 00:31:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2022-05-21 00:31:42] [INFO ] Time to serialize gal into /tmp/LTLCardinality6557703519110929992.gal : 23 ms
[2022-05-21 00:31:42] [INFO ] Time to serialize properties into /tmp/LTLCardinality947534379681974554.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/LTLCardinality6557703519110929992.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality947534379681974554.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...287
Read 1 LTL properties
Checking formula 0 : !((F(X(F(G(X(F("(((((gu24.Columns_0_0+gu24.Columns_0_1)+(gu24.Columns_0_2+gu24.Columns_0_3))+((gu24.Columns_1_0+gu24.Columns_1_1)+(gu2...1564
Formula 0 simplified : !FXFGXF"(((((gu24.Columns_0_0+gu24.Columns_0_1)+(gu24.Columns_0_2+gu24.Columns_0_3))+((gu24.Columns_1_0+gu24.Columns_1_1)+(gu24.Colu...1550
Compilation finished in 209 ms.
Running link step : cd /tmp/ltsmin9835985661973065905;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin9835985661973065905;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X((true U [](X(<>((LTLAPp0==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: LTL layer: formula: <>(X((true U [](X(<>((LTLAPp0==true)))))))
pins2lts-mc-linux64( 3/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: "<>(X((true U [](X(<>((LTLAPp0==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.019: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.076: DFS-FIFO for weak LTL, using special progress label 66
pins2lts-mc-linux64( 0/ 8), 0.076: There are 67 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.076: State length is 113, there are 67 groups
pins2lts-mc-linux64( 0/ 8), 0.076: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.076: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.076: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.076: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.222: ~9 levels ~960 states ~4168 transitions
pins2lts-mc-linux64( 0/ 8), 0.259: ~9 levels ~1920 states ~5584 transitions
pins2lts-mc-linux64( 0/ 8), 0.312: ~9 levels ~3840 states ~9944 transitions
pins2lts-mc-linux64( 0/ 8), 0.469: ~9 levels ~7680 states ~20792 transitions
pins2lts-mc-linux64( 0/ 8), 0.733: ~9 levels ~15360 states ~41584 transitions
pins2lts-mc-linux64( 0/ 8), 1.205: ~9 levels ~30720 states ~91536 transitions
pins2lts-mc-linux64( 0/ 8), 2.188: ~9 levels ~61440 states ~210424 transitions
pins2lts-mc-linux64( 0/ 8), 3.053: ~9 levels ~122880 states ~452304 transitions
pins2lts-mc-linux64( 0/ 8), 5.102: ~9 levels ~245760 states ~944064 transitions
pins2lts-mc-linux64( 6/ 8), 6.247: ~9 levels ~491520 states ~1991480 transitions
pins2lts-mc-linux64( 3/ 8), 7.991: ~9 levels ~983040 states ~4401088 transitions
pins2lts-mc-linux64( 6/ 8), 10.925: ~9 levels ~1966080 states ~9054288 transitions
pins2lts-mc-linux64( 6/ 8), 17.125: ~9 levels ~3932160 states ~19312608 transitions
pins2lts-mc-linux64( 1/ 8), 30.730: ~9 levels ~7864320 states ~41879072 transitions
pins2lts-mc-linux64( 3/ 8), 61.451: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 61.687:
pins2lts-mc-linux64( 0/ 8), 61.687: mean standard work distribution: 1.0% (states) 0.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 61.687:
pins2lts-mc-linux64( 0/ 8), 61.687: Explored 13800108 states 79156083 transitions, fanout: 5.736
pins2lts-mc-linux64( 0/ 8), 61.687: Total exploration time 61.610 sec (61.380 sec minimum, 61.475 sec on average)
pins2lts-mc-linux64( 0/ 8), 61.687: States per second: 223991, Transitions per second: 1284793
pins2lts-mc-linux64( 0/ 8), 61.687:
pins2lts-mc-linux64( 0/ 8), 61.687: Progress states detected: 6
pins2lts-mc-linux64( 0/ 8), 61.687: Redundant explorations: -0.0081
pins2lts-mc-linux64( 0/ 8), 61.687:
pins2lts-mc-linux64( 0/ 8), 61.688: Queue width: 8B, total height: 144, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 61.688: Tree memory: 361.3MB, 27.5 B/state, compr.: 6.0%
pins2lts-mc-linux64( 0/ 8), 61.688: Tree fill ratio (roots/leafs): 10.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 61.688: Stored 64 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 61.688: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 61.688: Est. total memory use: 361.3MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9835985661973065905;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X((true U [](X(<>((LTLAPp0==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9835985661973065905;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X((true U [](X(<>((LTLAPp0==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 409584 deadlock states
Detected timeout of ITS tools.
[2022-05-21 00:52:12] [INFO ] Flatten gal took : 11 ms
[2022-05-21 00:52:12] [INFO ] Time to serialize gal into /tmp/LTLCardinality1357070413474068459.gal : 12 ms
[2022-05-21 00:52:12] [INFO ] Time to serialize properties into /tmp/LTLCardinality10073548773340223845.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/LTLCardinality1357070413474068459.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10073548773340223845.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !((F(X(F(G(X(F("(((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_1_0+Columns_1_1)+(Columns_1_2+Columns_1_3)))+(((Col...1164
Formula 0 simplified : !FXFGXF"(((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_1_0+Columns_1_1)+(Columns_1_2+Columns_1_3)))+(((Columns_2...1150
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 409584 deadlock states
Detected timeout of ITS tools.
[2022-05-21 01:12:42] [INFO ] Flatten gal took : 9 ms
[2022-05-21 01:12:42] [INFO ] Input system was already deterministic with 64 transitions.
[2022-05-21 01:12:42] [INFO ] Transformed 112 places.
[2022-05-21 01:12:42] [INFO ] Transformed 64 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 01:12:42] [INFO ] Time to serialize gal into /tmp/LTLCardinality12613250315300756286.gal : 1 ms
[2022-05-21 01:12:42] [INFO ] Time to serialize properties into /tmp/LTLCardinality4382764327867388288.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/LTLCardinality12613250315300756286.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4382764327867388288.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 : !((F(X(F(G(X(F("(((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_1_0+Columns_1_1)+(Columns_1_2+Columns_1_3)))+(((Col...1164
Formula 0 simplified : !FXFGXF"(((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_1_0+Columns_1_1)+(Columns_1_2+Columns_1_3)))+(((Columns_2...1150
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-AN04"
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-AN04, 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-165303545400227"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN04.tgz
mv Sudoku-PT-AN04 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 '
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 ;