About the Execution of LTSMin+red for Sudoku-COL-AN15
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14269.287 | 3600000.00 | 13758235.00 | 1090.80 | FFTFTFTTFFT?TFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r489-tall-167912706300116.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Sudoku-COL-AN15, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912706300116
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 8.8K Feb 26 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 10:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 10:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 10:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 10:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.5K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-00
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-01
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-02
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-03
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-04
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-05
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-06
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-07
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-08
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-09
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-10
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-11
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-12
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-13
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-14
FORMULA_NAME Sudoku-COL-AN15-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679191954814
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN15
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 02:12:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 02:12:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 02:12:36] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-19 02:12:36] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-19 02:12:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 384 ms
[2023-03-19 02:12:36] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 4050 PT places and 3375.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-19 02:12:37] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 5 ms.
[2023-03-19 02:12:37] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 2 properties that can be checked using skeleton over-approximation.
FORMULA Sudoku-COL-AN15-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN15-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2023-03-19 02:12:37] [INFO ] Flatten gal took : 11 ms
[2023-03-19 02:12:37] [INFO ] Flatten gal took : 1 ms
Domain [N(15), N(15)] of place Rows breaks symmetries in sort N
[2023-03-19 02:12:37] [INFO ] Unfolded HLPN to a Petri net with 4050 places and 3375 transitions 13500 arcs in 61 ms.
[2023-03-19 02:12:37] [INFO ] Unfolded 14 HLPN properties in 12 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-COL-AN15-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN15-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 675 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3375 places and 0 transitions.
Iterating post reduction 0 with 3375 rules applied. Total rules applied 3375 place count 675 transition count 3375
Applied a total of 3375 rules in 64 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2023-03-19 02:12:42] [INFO ] Computed 44 place invariants in 172 ms
[2023-03-19 02:12:42] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-19 02:12:42] [INFO ] Invariant cache hit.
[2023-03-19 02:12:43] [INFO ] Implicit Places using invariants and state equation in 1161 ms returned []
Implicit Place search using SMT with State Equation took 1599 ms to find 0 implicit places.
[2023-03-19 02:12:43] [INFO ] Invariant cache hit.
[2023-03-19 02:12:44] [INFO ] Dead Transitions using invariants and state equation in 1135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 675/4050 places, 3375/3375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2810 ms. Remains : 675/4050 places, 3375/3375 transitions.
Support contains 675 out of 675 places after structural reductions.
[2023-03-19 02:12:46] [INFO ] Flatten gal took : 697 ms
[2023-03-19 02:12:50] [INFO ] Flatten gal took : 675 ms
[2023-03-19 02:12:55] [INFO ] Input system was already deterministic with 3375 transitions.
Finished random walk after 194 steps, including 0 resets, run visited all 3 properties in 133 ms. (steps per millisecond=1 )
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
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 : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 25 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 02:12:56] [INFO ] Invariant cache hit.
[2023-03-19 02:12:56] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-19 02:12:56] [INFO ] Invariant cache hit.
[2023-03-19 02:12:57] [INFO ] Implicit Places using invariants and state equation in 1038 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
[2023-03-19 02:12:57] [INFO ] Redundant transitions in 202 ms returned []
[2023-03-19 02:12:57] [INFO ] Invariant cache hit.
[2023-03-19 02:12:58] [INFO ] Dead Transitions using invariants and state equation in 1035 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2432 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN15-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], 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 194 steps with 0 reset in 41 ms.
FORMULA Sudoku-COL-AN15-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN15-LTLFireability-01 finished in 2812 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G(!p0)))))'
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 9 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 02:12:59] [INFO ] Invariant cache hit.
[2023-03-19 02:12:59] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-19 02:12:59] [INFO ] Invariant cache hit.
[2023-03-19 02:13:00] [INFO ] Implicit Places using invariants and state equation in 1176 ms returned []
Implicit Place search using SMT with State Equation took 1289 ms to find 0 implicit places.
[2023-03-19 02:13:00] [INFO ] Invariant cache hit.
[2023-03-19 02:13:01] [INFO ] Dead Transitions using invariants and state equation in 988 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2290 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 112 ms :[false, p0, false]
Running random walk in product with property : Sudoku-COL-AN15-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (AND (GEQ s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 48760 steps with 245 reset in 10001 ms.
Product exploration timeout after 47870 steps with 241 reset in 10001 ms.
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
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 87 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN15-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN15-LTLFireability-02 finished in 25606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 39 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 02:13:24] [INFO ] Invariant cache hit.
[2023-03-19 02:13:25] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-19 02:13:25] [INFO ] Invariant cache hit.
[2023-03-19 02:13:26] [INFO ] Implicit Places using invariants and state equation in 1066 ms returned []
Implicit Place search using SMT with State Equation took 1184 ms to find 0 implicit places.
[2023-03-19 02:13:26] [INFO ] Redundant transitions in 191 ms returned []
[2023-03-19 02:13:26] [INFO ] Invariant cache hit.
[2023-03-19 02:13:27] [INFO ] Dead Transitions using invariants and state equation in 1016 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2438 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN15-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 s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], 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 195 steps with 0 reset in 44 ms.
FORMULA Sudoku-COL-AN15-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN15-LTLFireability-03 finished in 2603 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 9 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 02:13:27] [INFO ] Invariant cache hit.
[2023-03-19 02:13:27] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-19 02:13:27] [INFO ] Invariant cache hit.
[2023-03-19 02:13:28] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 1156 ms to find 0 implicit places.
[2023-03-19 02:13:28] [INFO ] Invariant cache hit.
[2023-03-19 02:13:29] [INFO ] Dead Transitions using invariants and state equation in 1061 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2228 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-COL-AN15-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}]], initial=1, aps=[p0:(OR (AND (GEQ s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], 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]]
Product exploration timeout after 31680 steps with 15840 reset in 10002 ms.
Product exploration timeout after 31630 steps with 15815 reset in 10002 ms.
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
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 :(X p0)
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN15-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN15-LTLFireability-04 finished in 25446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p1))&&p0)))'
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 17 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 02:13:52] [INFO ] Invariant cache hit.
[2023-03-19 02:13:53] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-19 02:13:53] [INFO ] Invariant cache hit.
[2023-03-19 02:13:54] [INFO ] Implicit Places using invariants and state equation in 1080 ms returned []
Implicit Place search using SMT with State Equation took 1205 ms to find 0 implicit places.
[2023-03-19 02:13:54] [INFO ] Redundant transitions in 91 ms returned []
[2023-03-19 02:13:54] [INFO ] Invariant cache hit.
[2023-03-19 02:13:55] [INFO ] Dead Transitions using invariants and state equation in 985 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2310 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN15-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 401 steps with 1 reset in 82 ms.
FORMULA Sudoku-COL-AN15-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN15-LTLFireability-05 finished in 2644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 16 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 02:13:55] [INFO ] Invariant cache hit.
[2023-03-19 02:13:55] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-19 02:13:55] [INFO ] Invariant cache hit.
[2023-03-19 02:13:56] [INFO ] Implicit Places using invariants and state equation in 1062 ms returned []
Implicit Place search using SMT with State Equation took 1185 ms to find 0 implicit places.
[2023-03-19 02:13:56] [INFO ] Redundant transitions in 88 ms returned []
[2023-03-19 02:13:56] [INFO ] Invariant cache hit.
[2023-03-19 02:13:57] [INFO ] Dead Transitions using invariants and state equation in 978 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2277 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 33 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN15-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 48590 steps with 245 reset in 10004 ms.
Product exploration timeout after 47890 steps with 241 reset in 10003 ms.
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
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 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN15-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN15-LTLFireability-06 finished in 25503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(!p0))))'
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 5 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 02:14:21] [INFO ] Invariant cache hit.
[2023-03-19 02:14:21] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-19 02:14:21] [INFO ] Invariant cache hit.
[2023-03-19 02:14:22] [INFO ] Implicit Places using invariants and state equation in 1094 ms returned []
Implicit Place search using SMT with State Equation took 1202 ms to find 0 implicit places.
[2023-03-19 02:14:22] [INFO ] Invariant cache hit.
[2023-03-19 02:14:23] [INFO ] Dead Transitions using invariants and state equation in 1057 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2266 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, p0, p0, p0]
Running random walk in product with property : Sudoku-COL-AN15-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA Sudoku-COL-AN15-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN15-LTLFireability-08 finished in 2493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 6 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 02:14:23] [INFO ] Invariant cache hit.
[2023-03-19 02:14:23] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-19 02:14:23] [INFO ] Invariant cache hit.
[2023-03-19 02:14:24] [INFO ] Implicit Places using invariants and state equation in 1061 ms returned []
Implicit Place search using SMT with State Equation took 1167 ms to find 0 implicit places.
[2023-03-19 02:14:24] [INFO ] Invariant cache hit.
[2023-03-19 02:14:25] [INFO ] Dead Transitions using invariants and state equation in 993 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2168 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, p0, p0]
Running random walk in product with property : Sudoku-COL-AN15-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN15-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN15-LTLFireability-09 finished in 2288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 4 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 02:14:25] [INFO ] Invariant cache hit.
[2023-03-19 02:14:25] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-19 02:14:25] [INFO ] Invariant cache hit.
[2023-03-19 02:14:27] [INFO ] Implicit Places using invariants and state equation in 1034 ms returned []
Implicit Place search using SMT with State Equation took 1145 ms to find 0 implicit places.
[2023-03-19 02:14:27] [INFO ] Invariant cache hit.
[2023-03-19 02:14:28] [INFO ] Dead Transitions using invariants and state equation in 984 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2135 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-COL-AN15-LTLFireability-10 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:(OR (AND (GEQ s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], 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]]
Product exploration timeout after 31940 steps with 15970 reset in 10001 ms.
Product exploration timeout after 32070 steps with 16035 reset in 10002 ms.
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
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 :(X p0)
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN15-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN15-LTLFireability-10 finished in 25266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 7 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 02:14:51] [INFO ] Invariant cache hit.
[2023-03-19 02:14:51] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-19 02:14:51] [INFO ] Invariant cache hit.
[2023-03-19 02:14:52] [INFO ] Implicit Places using invariants and state equation in 1023 ms returned []
Implicit Place search using SMT with State Equation took 1137 ms to find 0 implicit places.
[2023-03-19 02:14:52] [INFO ] Invariant cache hit.
[2023-03-19 02:14:53] [INFO ] Dead Transitions using invariants and state equation in 957 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2103 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN15-LTLFireability-11 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 s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], 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 timeout after 24460 steps with 8153 reset in 10005 ms.
Product exploration timeout after 24340 steps with 8113 reset in 10001 ms.
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
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, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Finished random walk after 197 steps, including 0 resets, run visited all 1 properties in 44 ms. (steps per millisecond=4 )
Knowledge obtained : [p0, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 5 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 02:15:17] [INFO ] Invariant cache hit.
[2023-03-19 02:15:17] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-19 02:15:17] [INFO ] Invariant cache hit.
[2023-03-19 02:15:18] [INFO ] Implicit Places using invariants and state equation in 1053 ms returned []
Implicit Place search using SMT with State Equation took 1165 ms to find 0 implicit places.
[2023-03-19 02:15:18] [INFO ] Invariant cache hit.
[2023-03-19 02:15:19] [INFO ] Dead Transitions using invariants and state equation in 986 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2158 ms. Remains : 675/675 places, 3375/3375 transitions.
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
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, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Finished random walk after 193 steps, including 0 resets, run visited all 1 properties in 41 ms. (steps per millisecond=4 )
Knowledge obtained : [p0, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Product exploration timeout after 24780 steps with 8260 reset in 10007 ms.
Product exploration timeout after 24550 steps with 8183 reset in 10001 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 15 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 02:15:43] [INFO ] Redundant transitions in 90 ms returned []
[2023-03-19 02:15:43] [INFO ] Invariant cache hit.
[2023-03-19 02:15:44] [INFO ] Dead Transitions using invariants and state equation in 1006 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1117 ms. Remains : 675/675 places, 3375/3375 transitions.
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 4 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 02:15:44] [INFO ] Invariant cache hit.
[2023-03-19 02:15:44] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-19 02:15:44] [INFO ] Invariant cache hit.
[2023-03-19 02:15:45] [INFO ] Implicit Places using invariants and state equation in 1065 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
[2023-03-19 02:15:45] [INFO ] Invariant cache hit.
[2023-03-19 02:15:46] [INFO ] Dead Transitions using invariants and state equation in 1002 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2179 ms. Remains : 675/675 places, 3375/3375 transitions.
Treatment of property Sudoku-COL-AN15-LTLFireability-11 finished in 56767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p1)||p0) U G(p1)))'
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 5 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 02:15:47] [INFO ] Invariant cache hit.
[2023-03-19 02:15:48] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-19 02:15:48] [INFO ] Invariant cache hit.
[2023-03-19 02:15:49] [INFO ] Implicit Places using invariants and state equation in 1041 ms returned []
Implicit Place search using SMT with State Equation took 1148 ms to find 0 implicit places.
[2023-03-19 02:15:49] [INFO ] Invariant cache hit.
[2023-03-19 02:15:50] [INFO ] Dead Transitions using invariants and state equation in 1207 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2362 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : Sudoku-COL-AN15-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], 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 197 steps with 0 reset in 45 ms.
FORMULA Sudoku-COL-AN15-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN15-LTLFireability-13 finished in 2654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 17 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 02:15:50] [INFO ] Invariant cache hit.
[2023-03-19 02:15:50] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-19 02:15:50] [INFO ] Invariant cache hit.
[2023-03-19 02:15:51] [INFO ] Implicit Places using invariants and state equation in 1076 ms returned []
Implicit Place search using SMT with State Equation took 1190 ms to find 0 implicit places.
[2023-03-19 02:15:51] [INFO ] Redundant transitions in 93 ms returned []
[2023-03-19 02:15:51] [INFO ] Invariant cache hit.
[2023-03-19 02:15:52] [INFO ] Dead Transitions using invariants and state equation in 1055 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2363 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 36 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN15-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], 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 timeout after 49850 steps with 251 reset in 10001 ms.
Product exploration timeout after 50140 steps with 253 reset in 10003 ms.
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
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 69 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN15-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN15-LTLFireability-15 finished in 25468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
[2023-03-19 02:16:16] [INFO ] Flatten gal took : 149 ms
[2023-03-19 02:16:16] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 21 ms.
[2023-03-19 02:16:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 675 places, 3375 transitions and 10125 arcs took 11 ms.
Total runtime 220115 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1001/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 2174728 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16057144 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-COL-AN15"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is Sudoku-COL-AN15, 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 r489-tall-167912706300116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN15.tgz
mv Sudoku-COL-AN15 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 ;