About the Execution of ITS-Tools for Sudoku-PT-AN05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 453.371 | 21181.00 | 32630.00 | 235.60 | TTFFTTTTTFFTFFFF | 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-165303545400236.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-AN05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545400236
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 58K Apr 30 11:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 321K Apr 30 11:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 72K Apr 30 11:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 357K Apr 30 11:35 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 28K May 9 09:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 9 09:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 67K May 9 09:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 242K May 9 09:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 9 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 24K 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 80K 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-AN05-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN05-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1653094950589
Running Version 202205111006
[2022-05-21 01:02:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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 01:02:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 01:02:31] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2022-05-21 01:02:31] [INFO ] Transformed 200 places.
[2022-05-21 01:02:31] [INFO ] Transformed 125 transitions.
[2022-05-21 01:02:31] [INFO ] Parsed PT model containing 200 places and 125 transitions in 187 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-AN05-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN05-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 75 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 75 transition count 125
Applied a total of 125 rules in 11 ms. Remains 75 /200 variables (removed 125) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:32] [INFO ] Computed 14 place invariants in 16 ms
[2022-05-21 01:02:32] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:32] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-21 01:02:32] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:32] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-21 01:02:32] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 75/200 places, 125/125 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/200 places, 125/125 transitions.
Support contains 75 out of 75 places after structural reductions.
[2022-05-21 01:02:32] [INFO ] Flatten gal took : 62 ms
[2022-05-21 01:02:33] [INFO ] Flatten gal took : 50 ms
[2022-05-21 01:02:33] [INFO ] Input system was already deterministic with 125 transitions.
Incomplete random walk after 10000 steps, including 456 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 17) seen :16
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:34] [INFO ] Computed 14 place invariants in 13 ms
[2022-05-21 01:02:34] [INFO ] After 35ms 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.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p0)||G(G(!p0))||G(X(p0))))||X(p0)))'
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:34] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 01:02:34] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:34] [INFO ] Computed 14 place invariants in 7 ms
[2022-05-21 01:02:34] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:34] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 01:02:34] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 256 ms :[true, (NOT p0), false, false, p0]
Running random walk in product with property : Sudoku-PT-AN05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (AND (GEQ s13 1) (GEQ s36 1) (GEQ s58 1)) (AND (GEQ s18 1) (GEQ s41 1) (GEQ s58 1)) (AND (GEQ s21 1) (GEQ s47 1) (GEQ s61 1)) (AND (GEQ s3 1) (GEQ ...], 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1014 ms.
Product exploration explored 100000 steps with 50000 reset in 964 ms.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 100 ms. Reduced automaton from 5 states, 7 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN05-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN05-LTLFireability-00 finished in 2665 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p0)))'
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:37] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 01:02:37] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:37] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-21 01:02:37] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2022-05-21 01:02:37] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:37] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-21 01:02:37] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s13 1) (LT s36 1) (LT s58 1)) (OR (LT s18 1) (LT s41 1) (LT s58 1)) (OR (LT s21 1) (LT s47 1) (LT s61 1)) (OR (LT s3 1) (LT s26 1) (LT s58...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4551 reset in 778 ms.
Product exploration explored 100000 steps with 4539 reset in 827 ms.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
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 (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN05-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN05-LTLFireability-01 finished in 1993 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&X(p0)))'
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:39] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 01:02:39] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:39] [INFO ] Computed 14 place invariants in 5 ms
[2022-05-21 01:02:39] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:39] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 01:02:39] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN05-LTLFireability-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:(OR (AND (GEQ s13 1) (GEQ s36 1) (GEQ s58 1)) (AND (GEQ s18 1) (GEQ s41 1) (GEQ s58 1)) (AND (GEQ s21 1) (GEQ s47 1) (GEQ s61 1)) (AND (GEQ s3 1) (GEQ ...], 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 22 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN05-LTLFireability-02 finished in 224 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((F(p0) U p1)&&G(!p0)&&F(!p0)))))'
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:39] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 01:02:39] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:39] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-21 01:02:39] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2022-05-21 01:02:39] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:39] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 01:02:39] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s13 1) (GEQ s36 1) (GEQ s58 1)) (AND (GEQ s18 1) (GEQ s41 1) (GEQ s58 1)) (AND (GEQ s21 1) (GEQ s47 1) (GEQ s61 1)) (AND (GEQ s3 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN05-LTLFireability-03 finished in 339 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||(G(G(!p0))&&(p0 U p0)))))'
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 0 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:39] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 01:02:39] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:39] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 01:02:39] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:39] [INFO ] Computed 14 place invariants in 4 ms
[2022-05-21 01:02:39] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN05-LTLFireability-04 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}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(OR (AND (GEQ s13 1) (GEQ s36 1) (GEQ s58 1)) (AND (GEQ s18 1) (GEQ s41 1) (GEQ s58 1)) (AND (GEQ s21 1) (GEQ s47 1) (GEQ s61 1)) (AND (GEQ s3 1) (GEQ ...], 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1202 ms.
Product exploration explored 100000 steps with 33333 reset in 1231 ms.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN05-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN05-LTLFireability-04 finished in 2804 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p1)&&p0)))'
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 0 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:42] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 01:02:42] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:42] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 01:02:42] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:42] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 01:02:42] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s13 1) (LT s36 1) (LT s58 1)) (OR (LT s18 1) (LT s41 1) (LT s58 1)) (OR (LT s21 1) (LT s47 1) (LT s61 1)) (OR (LT s3 1) (LT s26 1) (LT s58...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4542 reset in 896 ms.
Product exploration explored 100000 steps with 4547 reset in 925 ms.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
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) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p1))
Knowledge based reduction with 9 factoid took 310 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN05-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN05-LTLFireability-05 finished in 2487 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 0 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:45] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-21 01:02:45] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:45] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-21 01:02:45] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:45] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 01:02:45] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s13 1) (LT s36 1) (LT s58 1)) (OR (LT s18 1) (LT s41 1) (LT s58 1)) (OR (LT s21 1) (LT s47 1) (LT s61 1)) (OR (LT s3 1) (LT s26 1) (LT s58...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4549 reset in 779 ms.
Product exploration explored 100000 steps with 4542 reset in 803 ms.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
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 (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 81 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN05-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN05-LTLFireability-06 finished in 1959 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&!p0)))'
Support contains 75 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 0 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:47] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 01:02:47] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:47] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 01:02:47] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:47] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 01:02:47] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), true, true, true]
Running random walk in product with property : Sudoku-PT-AN05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (OR (LT s13 1) (LT s36 1) (LT s58 1)) (OR (LT s18 1) (LT s41 1) (LT s58 1)) (OR (LT s21 1) (LT s47 1) (LT s61 1)) (OR (LT s3 1) (LT s26 1) (LT s58...], 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 4548 reset in 810 ms.
Product exploration explored 100000 steps with 4541 reset in 806 ms.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
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))), true, (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 5 factoid took 108 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN05-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN05-LTLFireability-07 finished in 2057 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(X(F(p1))))))'
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 22 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:49] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 01:02:49] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:49] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 01:02:49] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2022-05-21 01:02:49] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:49] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-21 01:02:49] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s17 1) (GEQ s42 1) (GEQ s62 1)), p1:(AND (GEQ s20 1) (GEQ s48 1) (GEQ s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN05-LTLFireability-09 finished in 402 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(G(p0)))))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 8 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:49] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-21 01:02:49] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:49] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 01:02:49] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2022-05-21 01:02:49] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:49] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 01:02:49] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s9 1) (GEQ s32 1) (GEQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN05-LTLFireability-10 finished in 312 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(!(!((!X(p1) U p2)&&p0) U p1))))'
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 9 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:49] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 01:02:49] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:49] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-21 01:02:49] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:50] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 01:02:50] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 190 ms :[true, p1, p1, p1, p1]
Running random walk in product with property : Sudoku-PT-AN05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (GEQ s14 1) (GEQ s39 1) (GEQ s74 1)), p2:(AND (GEQ s14 1) (GEQ s37 1) (GEQ s64 1)), p0:(AND (GEQ s14 1) (GEQ s37 1) (GEQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN05-LTLFireability-12 finished in 446 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((!(p0 U p1)&&X(p2))))))'
Support contains 6 out of 75 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 11 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:50] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-21 01:02:50] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:50] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 01:02:50] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2022-05-21 01:02:50] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:50] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-21 01:02:50] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 38 ms :[(OR (NOT p2) p1)]
Running random walk in product with property : Sudoku-PT-AN05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(OR p1 (NOT p2)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s10 1) (GEQ s39 1) (GEQ s70 1)), p2:(AND (GEQ s17 1) (GEQ s40 1) (GEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN05-LTLFireability-13 finished in 296 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(X(p0))&&G(p0)&&X(p1))))'
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:50] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 01:02:50] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:50] [INFO ] Computed 14 place invariants in 3 ms
[2022-05-21 01:02:50] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:50] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 01:02:50] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s31 1) (GEQ s57 1)), p1:(AND (GEQ s8 1) (GEQ s30 1) (GEQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 22 steps with 1 reset in 0 ms.
FORMULA Sudoku-PT-AN05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN05-LTLFireability-14 finished in 376 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(!p0) U p1))))'
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:50] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 01:02:51] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:51] [INFO ] Computed 14 place invariants in 9 ms
[2022-05-21 01:02:51] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2022-05-21 01:02:51] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 125 rows 75 cols
[2022-05-21 01:02:51] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-21 01:02:51] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 75/75 places, 125/125 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s9 1) (GEQ s34 1) (GEQ s74 1)), p0:(AND (GEQ s13 1) (GEQ s38 1) (GEQ s68 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 807 steps with 36 reset in 12 ms.
FORMULA Sudoku-PT-AN05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN05-LTLFireability-15 finished in 427 ms.
All properties solved by simple procedures.
Total runtime 19629 ms.
BK_STOP 1653094971770
--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-AN05"
export BK_EXAMINATION="LTLFireability"
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-AN05, examination is LTLFireability"
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-165303545400236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN05.tgz
mv Sudoku-PT-AN05 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;