About the Execution of ITS-Tools for Sudoku-PT-AN16
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8900.575 | 205448.00 | 266300.00 | 937.10 | TFTFTFTTFTFFFTFF | 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-165303545600324.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-AN16, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545600324
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 61M
-rw-r--r-- 1 mcc users 1.2M Apr 30 12:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 5.4M Apr 30 12:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0M Apr 30 11:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 33M Apr 30 11:41 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 445K May 9 09:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.5M May 9 09:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1M May 9 09:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.3M May 9 09:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 199K May 9 09:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 480K May 9 09:12 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 2.3M 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-AN16-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN16-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1653116694011
Running Version 202205111006
[2022-05-21 07:04:55] [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 07:04:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 07:04:55] [INFO ] Load time of PNML (sax parser for PT used): 300 ms
[2022-05-21 07:04:55] [INFO ] Transformed 4864 places.
[2022-05-21 07:04:55] [INFO ] Transformed 4096 transitions.
[2022-05-21 07:04:55] [INFO ] Parsed PT model containing 4864 places and 4096 transitions in 433 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 316 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-PT-AN16-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 768 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Reduce places removed 4096 places and 0 transitions.
Iterating post reduction 0 with 4096 rules applied. Total rules applied 4096 place count 768 transition count 4096
Applied a total of 4096 rules in 75 ms. Remains 768 /4864 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:05:08] [INFO ] Computed 47 place invariants in 380 ms
[2022-05-21 07:05:09] [INFO ] Implicit Places using invariants in 647 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:05:09] [INFO ] Computed 47 place invariants in 296 ms
[2022-05-21 07:05:10] [INFO ] Implicit Places using invariants and state equation in 1351 ms returned []
Implicit Place search using SMT with State Equation took 2025 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:05:10] [INFO ] Computed 47 place invariants in 275 ms
[2022-05-21 07:05:11] [INFO ] Dead Transitions using invariants and state equation in 1553 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 768/4864 places, 4096/4096 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/4864 places, 4096/4096 transitions.
Support contains 768 out of 768 places after structural reductions.
[2022-05-21 07:05:13] [INFO ] Flatten gal took : 796 ms
[2022-05-21 07:05:19] [INFO ] Flatten gal took : 915 ms
[2022-05-21 07:05:24] [INFO ] Input system was already deterministic with 4096 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 2878 ms. (steps per millisecond=3 ) properties (out of 17) seen :16
Interrupted Best-First random walk after 3001 steps, including 0 resets, run timeout after 6150 ms. (steps per millisecond=0 ) properties seen 0
Running SMT prover for 1 properties.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:05:33] [INFO ] Computed 47 place invariants in 295 ms
[2022-05-21 07:05:50] [INFO ] After 2418ms 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 1 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA Sudoku-PT-AN16-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
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' '!(F((p0 U F(G((p0 U p0))))))'
Support contains 768 out of 768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 33 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:05:51] [INFO ] Computed 47 place invariants in 374 ms
[2022-05-21 07:05:51] [INFO ] Implicit Places using invariants in 493 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:05:51] [INFO ] Computed 47 place invariants in 271 ms
[2022-05-21 07:05:52] [INFO ] Implicit Places using invariants and state equation in 1196 ms returned []
Implicit Place search using SMT with State Equation took 1691 ms to find 0 implicit places.
[2022-05-21 07:05:53] [INFO ] Redundant transitions in 274 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:05:53] [INFO ] Computed 47 place invariants in 290 ms
[2022-05-21 07:05:54] [INFO ] Dead Transitions using invariants and state equation in 1513 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN16-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s208 1) (GEQ s469 1) (GEQ s592 1)) (AND (GEQ s177 1) (GEQ s446 1) (GEQ s737 1)) (AND (GEQ s100 1) (GEQ s362 1) (GEQ s676 1)) (AND (GEQ s1...], 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 223 steps with 0 reset in 94 ms.
FORMULA Sudoku-PT-AN16-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLFireability-01 finished in 3891 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G((!X(p0)&&p0)))||F(!p0)) U !X(p0)))'
Support contains 768 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 8 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:05:55] [INFO ] Computed 47 place invariants in 291 ms
[2022-05-21 07:05:55] [INFO ] Implicit Places using invariants in 418 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:05:55] [INFO ] Computed 47 place invariants in 266 ms
[2022-05-21 07:05:56] [INFO ] Implicit Places using invariants and state equation in 1211 ms returned []
Implicit Place search using SMT with State Equation took 1631 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:05:56] [INFO ] Computed 47 place invariants in 258 ms
[2022-05-21 07:05:58] [INFO ] Dead Transitions using invariants and state equation in 1540 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 72 ms :[p0, p0]
Running random walk in product with property : Sudoku-PT-AN16-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s208 1) (GEQ s469 1) (GEQ s592 1)) (AND (GEQ s177 1) (GEQ s446 1) (GEQ s737 1)) (AND (GEQ s100 1) (GEQ s362 1) (GEQ s676 1)) (AND (GEQ s1...], 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 timeout after 38950 steps with 172 reset in 10002 ms.
Product exploration timeout after 38440 steps with 170 reset in 10005 ms.
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
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), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN16-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN16-LTLFireability-02 finished in 27850 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)||(G(F(X(p0)))&&G(F(p0)))))))'
Support contains 768 out of 768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 33 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:06:23] [INFO ] Computed 47 place invariants in 265 ms
[2022-05-21 07:06:23] [INFO ] Implicit Places using invariants in 394 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:06:23] [INFO ] Computed 47 place invariants in 267 ms
[2022-05-21 07:06:24] [INFO ] Implicit Places using invariants and state equation in 1195 ms returned []
Implicit Place search using SMT with State Equation took 1594 ms to find 0 implicit places.
[2022-05-21 07:06:24] [INFO ] Redundant transitions in 255 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:06:25] [INFO ] Computed 47 place invariants in 263 ms
[2022-05-21 07:06:26] [INFO ] Dead Transitions using invariants and state equation in 1571 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN16-LTLFireability-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:(OR (AND (GEQ s208 1) (GEQ s469 1) (GEQ s592 1)) (AND (GEQ s177 1) (GEQ s446 1) (GEQ s737 1)) (AND (GEQ s100 1) (GEQ s362 1) (GEQ s676 1)) (AND (GEQ s1...], 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 224 steps with 0 reset in 61 ms.
FORMULA Sudoku-PT-AN16-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLFireability-03 finished in 3688 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&!((G(!p0)&&!p0) U X((G(!p0)&&!p0)))))'
Support contains 768 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 8 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:06:26] [INFO ] Computed 47 place invariants in 261 ms
[2022-05-21 07:06:26] [INFO ] Implicit Places using invariants in 376 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:06:27] [INFO ] Computed 47 place invariants in 271 ms
[2022-05-21 07:06:28] [INFO ] Implicit Places using invariants and state equation in 1164 ms returned []
Implicit Place search using SMT with State Equation took 1542 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:06:28] [INFO ] Computed 47 place invariants in 261 ms
[2022-05-21 07:06:29] [INFO ] Dead Transitions using invariants and state equation in 1532 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-PT-AN16-LTLFireability-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:(AND (OR (LT s208 1) (LT s469 1) (LT s592 1)) (OR (LT s177 1) (LT s446 1) (LT s737 1)) (OR (LT s100 1) (LT s362 1) (LT s676 1)) (OR (LT s131 1) (LT s38...], 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 3 ms.
FORMULA Sudoku-PT-AN16-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLFireability-05 finished in 3279 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 193 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:06:30] [INFO ] Computed 47 place invariants in 300 ms
[2022-05-21 07:06:31] [INFO ] Implicit Places using invariants in 1141 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:06:31] [INFO ] Computed 47 place invariants in 255 ms
[2022-05-21 07:06:35] [INFO ] Implicit Places using invariants and state equation in 4188 ms returned []
Implicit Place search using SMT with State Equation took 5331 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:06:35] [INFO ] Computed 47 place invariants in 271 ms
[2022-05-21 07:06:36] [INFO ] Dead Transitions using invariants and state equation in 1533 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN16-LTLFireability-08 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 (GEQ s117 1) (GEQ s371 1) (GEQ s565 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][false, false]]
Stuttering criterion allowed to conclude after 318 steps with 45 reset in 99 ms.
FORMULA Sudoku-PT-AN16-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLFireability-08 finished in 7315 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((G(p0)||p1) U !p2))))'
Support contains 9 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 249 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:06:37] [INFO ] Computed 47 place invariants in 277 ms
[2022-05-21 07:06:38] [INFO ] Implicit Places using invariants in 1131 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:06:38] [INFO ] Computed 47 place invariants in 285 ms
[2022-05-21 07:06:43] [INFO ] Implicit Places using invariants and state equation in 4814 ms returned []
Implicit Place search using SMT with State Equation took 5957 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:06:43] [INFO ] Computed 47 place invariants in 272 ms
[2022-05-21 07:06:44] [INFO ] Dead Transitions using invariants and state equation in 1482 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 177 ms :[p2, p2, p2, true, (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN16-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s79 1) (GEQ s332 1) (GEQ s719 1)), p1:(AND (GEQ s95 1) (GEQ s340 1) (GEQ s591 1)), p0:(AND (GEQ s89 1) (GEQ s349 1) (GEQ s729 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 133 steps with 1 reset in 58 ms.
FORMULA Sudoku-PT-AN16-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLFireability-10 finished in 7960 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U ((G(p2) U F(!p3))&&X(p2)&&p1)))'
Support contains 9 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 136 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:06:45] [INFO ] Computed 47 place invariants in 260 ms
[2022-05-21 07:06:46] [INFO ] Implicit Places using invariants in 1061 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:06:46] [INFO ] Computed 47 place invariants in 269 ms
[2022-05-21 07:06:50] [INFO ] Implicit Places using invariants and state equation in 4327 ms returned []
Implicit Place search using SMT with State Equation took 5392 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:06:50] [INFO ] Computed 47 place invariants in 269 ms
[2022-05-21 07:06:52] [INFO ] Dead Transitions using invariants and state equation in 1508 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p1) (NOT p2) p3), true, (NOT p2), p3, (NOT p2)]
Running random walk in product with property : Sudoku-PT-AN16-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p3), acceptance={} source=0 dest: 3}, { cond=(AND p1 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}], [{ cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p1 p3 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s150 1) (GEQ s410 1) (GEQ s678 1)), p0:(AND (GEQ s150 1) (GEQ s410 1) (GEQ s678 1)), p3:(AND (GEQ s76 1) (GEQ s334 1) (GEQ s748 1)), p2:(AND ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 21280 steps with 643 reset in 10003 ms.
Product exploration timeout after 21660 steps with 616 reset in 10002 ms.
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0 p3 p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p2)))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT p2)), (X p2), (X (AND p1 p3 (NOT p2))), (X (NOT (AND p1 p3 (NOT p2)))), (X (AND p1 p3)), (X (NOT (AND p1 p3))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 10 factoid took 796 ms. Reduced automaton from 5 states, 13 edges and 4 AP to 4 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 112 ms :[true, (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 2788 ms. (steps per millisecond=3 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:07:17] [INFO ] Computed 47 place invariants in 272 ms
[2022-05-21 07:07:17] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p3 p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p3))), (F (G (NOT p2))), (G (NOT (AND (NOT p1) (NOT p2) p0))), (G (NOT (AND p1 (NOT p0)))), (G (NOT (AND (NOT p1) p0))), (G (NOT (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND p1 p0 (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT p2)), (X p2), (X (AND p1 p3 (NOT p2))), (X (NOT (AND p1 p3 (NOT p2)))), (X (AND p1 p3)), (X (NOT (AND p1 p3))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (F (NOT p2)), (F (NOT (AND p1 p0))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p2) p0))]
Knowledge based reduction with 14 factoid took 908 ms. Reduced automaton from 4 states, 10 edges and 3 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 91 ms :[(NOT p2), true, (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(NOT p2), true, (OR (NOT p2) (NOT p1))]
Support contains 6 out of 768 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 126 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:07:19] [INFO ] Computed 47 place invariants in 272 ms
[2022-05-21 07:07:19] [INFO ] Implicit Places using invariants in 1080 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:07:20] [INFO ] Computed 47 place invariants in 270 ms
[2022-05-21 07:07:24] [INFO ] Implicit Places using invariants and state equation in 4684 ms returned []
Implicit Place search using SMT with State Equation took 5770 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:07:24] [INFO ] Computed 47 place invariants in 267 ms
[2022-05-21 07:07:26] [INFO ] Dead Transitions using invariants and state equation in 1555 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 4 factoid took 205 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 83 ms :[(NOT p2), (NOT p2), true]
Finished random walk after 689 steps, including 3 resets, run visited all 2 properties in 184 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 227 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 92 ms :[(NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 93 ms :[(NOT p2), (NOT p2), true]
Stuttering acceptance computed with spot in 75 ms :[(NOT p2), (NOT p2), true]
Entered a terminal (fully accepting) state of product in 143 steps with 12 reset in 66 ms.
FORMULA Sudoku-PT-AN16-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLFireability-11 finished in 42819 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(F(p0))||F(p1)))))'
Support contains 6 out of 768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 149 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:07:28] [INFO ] Computed 47 place invariants in 257 ms
[2022-05-21 07:07:29] [INFO ] Implicit Places using invariants in 1126 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:07:29] [INFO ] Computed 47 place invariants in 263 ms
[2022-05-21 07:07:33] [INFO ] Implicit Places using invariants and state equation in 4428 ms returned []
Implicit Place search using SMT with State Equation took 5556 ms to find 0 implicit places.
[2022-05-21 07:07:33] [INFO ] Redundant transitions in 116 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:07:33] [INFO ] Computed 47 place invariants in 262 ms
[2022-05-21 07:07:35] [INFO ] Dead Transitions using invariants and state equation in 1519 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN16-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s85 1) (GEQ s350 1) (GEQ s741 1)), p1:(AND (GEQ s191 1) (GEQ s445 1) (GEQ s735 1))], 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 225 steps with 0 reset in 64 ms.
FORMULA Sudoku-PT-AN16-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLFireability-12 finished in 7515 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(G(X(p0)))||X(G(p1)))))'
Support contains 6 out of 768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 146 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:07:35] [INFO ] Computed 47 place invariants in 276 ms
[2022-05-21 07:07:36] [INFO ] Implicit Places using invariants in 1059 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:07:36] [INFO ] Computed 47 place invariants in 263 ms
[2022-05-21 07:07:40] [INFO ] Implicit Places using invariants and state equation in 4276 ms returned []
Implicit Place search using SMT with State Equation took 5338 ms to find 0 implicit places.
[2022-05-21 07:07:41] [INFO ] Redundant transitions in 120 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:07:41] [INFO ] Computed 47 place invariants in 263 ms
[2022-05-21 07:07:42] [INFO ] Dead Transitions using invariants and state equation in 1570 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN16-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s128 1) (GEQ s386 1) (GEQ s544 1)), p0:(OR (LT s125 1) (LT s376 1) (LT s653 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 39430 steps with 174 reset in 10001 ms.
Product exploration timeout after 39830 steps with 176 reset in 10005 ms.
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 233 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN16-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN16-LTLFireability-13 finished in 28234 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(G(p1))&&p0))))'
Support contains 9 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 135 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:08:04] [INFO ] Computed 47 place invariants in 275 ms
[2022-05-21 07:08:04] [INFO ] Implicit Places using invariants in 1114 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:08:05] [INFO ] Computed 47 place invariants in 267 ms
[2022-05-21 07:08:09] [INFO ] Implicit Places using invariants and state equation in 4507 ms returned []
Implicit Place search using SMT with State Equation took 5633 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:08:09] [INFO ] Computed 47 place invariants in 273 ms
[2022-05-21 07:08:10] [INFO ] Dead Transitions using invariants and state equation in 1550 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN16-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s118 1) (GEQ s372 1) (GEQ s582 1)), p1:(AND (GEQ s168 1) (GEQ s420 1) (GEQ s584 1) (OR (AND (GEQ s168 1) (GEQ s420 1) (GEQ s584 1)) (AND (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 226 steps with 0 reset in 64 ms.
FORMULA Sudoku-PT-AN16-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLFireability-14 finished in 7563 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 113 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:08:11] [INFO ] Computed 47 place invariants in 264 ms
[2022-05-21 07:08:12] [INFO ] Implicit Places using invariants in 1055 ms returned []
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:08:12] [INFO ] Computed 47 place invariants in 263 ms
[2022-05-21 07:08:17] [INFO ] Implicit Places using invariants and state equation in 5101 ms returned []
Implicit Place search using SMT with State Equation took 6161 ms to find 0 implicit places.
// Phase 1: matrix 4096 rows 768 cols
[2022-05-21 07:08:17] [INFO ] Computed 47 place invariants in 257 ms
[2022-05-21 07:08:18] [INFO ] Dead Transitions using invariants and state equation in 1432 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN16-LTLFireability-15 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:(AND (GEQ s67 1) (GEQ s324 1) (GEQ s579 1))], 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 23 steps with 0 reset in 24 ms.
FORMULA Sudoku-PT-AN16-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN16-LTLFireability-15 finished in 7847 ms.
All properties solved by simple procedures.
Total runtime 203879 ms.
BK_STOP 1653116899459
--------------------
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-AN16"
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-AN16, 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-165303545600324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN16.tgz
mv Sudoku-PT-AN16 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 ;