About the Execution of LoLa+red for Sudoku-COL-AN12
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3030.296 | 3047910.00 | 3178529.00 | 12350.90 | FT??FFFFTT?FFFT? | 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.r487-tall-167912702600091.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 lolaxred
Input is Sudoku-COL-AN12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912702600091
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 8.4K Feb 26 09:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 09:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 08:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 08:47 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.7K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 10:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 09:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 09:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:16 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-AN12-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN12-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679164031087
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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN12
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 18:27:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 18:27:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 18:27:12] [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-18 18:27:12] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 18:27:13] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 579 ms
[2023-03-18 18:27:13] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 2160 PT places and 1728.0 transition bindings in 10 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 18:27:13] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2023-03-18 18:27:13] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-COL-AN12-LTLCardinality-09 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).
Remains 15 properties that can be checked using skeleton over-approximation.
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).
Incomplete random walk after 10073 steps, including 68 resets, run finished after 32 ms. (steps per millisecond=314 ) properties (out of 18) seen :14
Incomplete Best-First random walk after 10073 steps, including 68 resets, run finished after 13 ms. (steps per millisecond=774 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10073 steps, including 68 resets, run finished after 9 ms. (steps per millisecond=1119 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10073 steps, including 68 resets, run finished after 9 ms. (steps per millisecond=1119 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10073 steps, including 68 resets, run finished after 8 ms. (steps per millisecond=1259 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1 rows 4 cols
[2023-03-18 18:27:13] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-18 18:27:13] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 18:27:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 18:27:13] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
FORMULA Sudoku-COL-AN12-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN12-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN12-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 18:27:13] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-18 18:27:13] [INFO ] Flatten gal took : 12 ms
FORMULA Sudoku-COL-AN12-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 18:27:13] [INFO ] Flatten gal took : 1 ms
Domain [N(12), N(12)] of place Rows breaks symmetries in sort N
[2023-03-18 18:27:13] [INFO ] Unfolded HLPN to a Petri net with 2160 places and 1728 transitions 6912 arcs in 32 ms.
[2023-03-18 18:27:13] [INFO ] Unfolded 11 HLPN properties in 8 ms.
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 31 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 2160 cols
[2023-03-18 18:27:13] [INFO ] Computed 432 place invariants in 29 ms
[2023-03-18 18:27:14] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-03-18 18:27:14] [INFO ] Invariant cache hit.
[2023-03-18 18:27:15] [INFO ] Implicit Places using invariants and state equation in 1034 ms returned []
Implicit Place search using SMT with State Equation took 1472 ms to find 0 implicit places.
[2023-03-18 18:27:15] [INFO ] Invariant cache hit.
[2023-03-18 18:27:16] [INFO ] Dead Transitions using invariants and state equation in 987 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2494 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Support contains 2160 out of 2160 places after structural reductions.
[2023-03-18 18:27:16] [INFO ] Flatten gal took : 189 ms
[2023-03-18 18:27:16] [INFO ] Flatten gal took : 142 ms
[2023-03-18 18:27:17] [INFO ] Input system was already deterministic with 1728 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1846 ms. (steps per millisecond=5 ) properties (out of 14) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-18 18:27:19] [INFO ] Invariant cache hit.
[2023-03-18 18:27:20] [INFO ] [Real]Absence check using 432 positive place invariants in 112 ms returned sat
[2023-03-18 18:27:21] [INFO ] After 1632ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 18:27:22] [INFO ] [Nat]Absence check using 432 positive place invariants in 102 ms returned sat
[2023-03-18 18:27:25] [INFO ] After 1226ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-18 18:27:25] [INFO ] After 1685ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 255 ms.
[2023-03-18 18:27:26] [INFO ] After 4271ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 1 different solutions.
Finished Parikh walk after 144 steps, including 0 resets, run visited all 4 properties in 14 ms. (steps per millisecond=10 )
Parikh walk visited 4 properties in 14 ms.
FORMULA Sudoku-COL-AN12-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
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' '!((p0 U (G((p0||G(p1)))||((p0||G(p1))&&G((G(!p0) U !p1))))))'
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 86 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-18 18:27:26] [INFO ] Invariant cache hit.
[2023-03-18 18:27:27] [INFO ] Implicit Places using invariants in 802 ms returned []
[2023-03-18 18:27:27] [INFO ] Invariant cache hit.
[2023-03-18 18:27:29] [INFO ] Implicit Places using invariants and state equation in 1975 ms returned []
Implicit Place search using SMT with State Equation took 2787 ms to find 0 implicit places.
[2023-03-18 18:27:29] [INFO ] Redundant transitions in 103 ms returned []
[2023-03-18 18:27:29] [INFO ] Invariant cache hit.
[2023-03-18 18:27:30] [INFO ] Dead Transitions using invariants and state equation in 925 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3912 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 413 ms :[(AND (NOT p0) (NOT p1)), true, (NOT p1), false, p0, (AND (NOT p1) p0), p1, p1]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 p1), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND p0 p1), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 4}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 7}], [{ cond=(AND p0 p1), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(GT 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 5 ms.
FORMULA Sudoku-COL-AN12-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN12-LTLCardinality-00 finished in 4429 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)||X(X(p1))))))'
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 19 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-18 18:27:30] [INFO ] Invariant cache hit.
[2023-03-18 18:27:31] [INFO ] Implicit Places using invariants in 703 ms returned []
[2023-03-18 18:27:31] [INFO ] Invariant cache hit.
[2023-03-18 18:27:33] [INFO ] Implicit Places using invariants and state equation in 1867 ms returned []
Implicit Place search using SMT with State Equation took 2573 ms to find 0 implicit places.
[2023-03-18 18:27:33] [INFO ] Invariant cache hit.
[2023-03-18 18:27:34] [INFO ] Dead Transitions using invariants and state equation in 962 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3557 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 311 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=p0, acceptance={} source=7 dest: 1}, { cond=(NOT p0), acceptance={} source=7 dest: 3}], [{ cond=(NOT p0), acceptance={} source=8 dest: 4}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=5, aps=[p1:(LEQ 3 (ADD s2016 s2017 s2018 s2019 s2020 s2021 s2022 s2023 s2024 s2025 s2026 s2027 s2028 s2029 s2030 s2031 s2032 s2033 s2034 s2035 s2036 s2037 s2038 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 34750 steps with 6950 reset in 10003 ms.
Product exploration timeout after 35000 steps with 7000 reset in 10002 ms.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
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 (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 9 states, 13 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1325 ms. (steps per millisecond=7 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-18 18:29:27] [INFO ] Invariant cache hit.
[2023-03-18 18:29:28] [INFO ] [Real]Absence check using 432 positive place invariants in 105 ms returned sat
[2023-03-18 18:29:30] [INFO ] After 3049ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-18 18:29:30] [INFO ] [Nat]Absence check using 432 positive place invariants in 96 ms returned sat
[2023-03-18 18:29:32] [INFO ] After 1006ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-18 18:29:33] [INFO ] After 1306ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 170 ms.
[2023-03-18 18:29:33] [INFO ] After 2751ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 142 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=17 )
Parikh walk visited 2 properties in 8 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 261 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 266 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 28 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-18 18:29:34] [INFO ] Invariant cache hit.
[2023-03-18 18:29:34] [INFO ] Implicit Places using invariants in 707 ms returned []
[2023-03-18 18:29:34] [INFO ] Invariant cache hit.
[2023-03-18 18:29:36] [INFO ] Implicit Places using invariants and state equation in 1817 ms returned []
Implicit Place search using SMT with State Equation took 2528 ms to find 0 implicit places.
[2023-03-18 18:29:36] [INFO ] Invariant cache hit.
[2023-03-18 18:29:37] [INFO ] Dead Transitions using invariants and state equation in 895 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3453 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
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)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 196 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1115 ms. (steps per millisecond=8 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 18:29:57] [INFO ] Invariant cache hit.
[2023-03-18 18:29:58] [INFO ] [Real]Absence check using 432 positive place invariants in 112 ms returned sat
[2023-03-18 18:29:58] [INFO ] After 1035ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:29:59] [INFO ] [Nat]Absence check using 432 positive place invariants in 99 ms returned sat
[2023-03-18 18:30:23] [INFO ] After 25009ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 144 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 432 are kept as prefixes of interest. Removing 1728 places using SCC suffix rule.8 ms
Discarding 1728 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 60 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 432/2160 places, 1728/1728 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1083 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 254809 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 254809 steps, saw 172287 distinct states, run finished after 3006 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1728 rows 432 cols
[2023-03-18 18:30:28] [INFO ] Computed 35 place invariants in 87 ms
[2023-03-18 18:30:28] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 25 ms returned sat
[2023-03-18 18:30:29] [INFO ] After 1014ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-18 18:30:29] [INFO ] After 1085ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-18 18:30:29] [INFO ] After 1223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 142 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [(AND p1 (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 4 factoid took 189 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 317 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration timeout after 38000 steps with 7600 reset in 10003 ms.
Product exploration timeout after 37870 steps with 7574 reset in 10002 ms.
Applying partial POR strategy [true, true, false, true, false, false, false, false]
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 155 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-18 18:30:51] [INFO ] Redundant transitions in 97 ms returned []
// Phase 1: matrix 1728 rows 2160 cols
[2023-03-18 18:30:51] [INFO ] Computed 432 place invariants in 13 ms
[2023-03-18 18:30:52] [INFO ] Dead Transitions using invariants and state equation in 965 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1242 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 14 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-18 18:30:52] [INFO ] Invariant cache hit.
[2023-03-18 18:30:52] [INFO ] Implicit Places using invariants in 680 ms returned []
[2023-03-18 18:30:52] [INFO ] Invariant cache hit.
[2023-03-18 18:30:54] [INFO ] Implicit Places using invariants and state equation in 1872 ms returned []
Implicit Place search using SMT with State Equation took 2568 ms to find 0 implicit places.
[2023-03-18 18:30:54] [INFO ] Invariant cache hit.
[2023-03-18 18:30:55] [INFO ] Dead Transitions using invariants and state equation in 996 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3581 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Treatment of property Sudoku-COL-AN12-LTLCardinality-01 finished in 205290 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' '!((p0 U X(X(X(X((X(G(p0))||(X(p0)&&F(p1)))))))))'
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 20 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-18 18:30:56] [INFO ] Invariant cache hit.
[2023-03-18 18:30:56] [INFO ] Implicit Places using invariants in 903 ms returned []
[2023-03-18 18:30:56] [INFO ] Invariant cache hit.
[2023-03-18 18:30:58] [INFO ] Implicit Places using invariants and state equation in 1937 ms returned []
Implicit Place search using SMT with State Equation took 2843 ms to find 0 implicit places.
[2023-03-18 18:30:58] [INFO ] Invariant cache hit.
[2023-03-18 18:30:59] [INFO ] Dead Transitions using invariants and state equation in 970 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3835 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 1121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true, (NOT p1), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 8}, { cond=p0, acceptance={} source=2 dest: 9}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 6}, { cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={} source=6 dest: 10}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 11}], [{ cond=true, acceptance={} source=8 dest: 12}], [{ cond=(NOT p0), acceptance={} source=9 dest: 13}, { cond=p0, acceptance={} source=9 dest: 14}], [{ cond=true, acceptance={0} source=10 dest: 10}], [{ cond=(NOT p1), acceptance={0} source=11 dest: 11}], [{ cond=true, acceptance={} source=12 dest: 15}], [{ cond=true, acceptance={} source=13 dest: 16}], [{ cond=(NOT p0), acceptance={} source=14 dest: 17}, { cond=p0, acceptance={} source=14 dest: 18}], [{ cond=true, acceptance={} source=15 dest: 19}, { cond=(NOT p1), acceptance={} source=15 dest: 20}], [{ cond=true, acceptance={} source=16 dest: 21}, { cond=(NOT p1), acceptance={} source=16 dest: 22}], [{ cond=true, acceptance={} source=17 dest: 23}, { cond=(NOT p1), acceptance={} source=17 dest: 24}], [{ cond=(NOT p0), acceptance={} source=18 dest: 25}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=18 dest: 26}, { cond=p0, acceptance={} source=18 dest: 27}, { cond=(AND p0 (NOT p1)), acceptance={} source=18 dest: 28}], [{ cond=(NOT p0), acceptance={} source=19 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=19 dest: 7}], [{ cond=(NOT p1), acceptance={} source=20 dest: 7}], [{ cond=(NOT p0), acceptance={} source=21 dest: 19}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=21 dest: 20}], [{ cond=(NOT p1), acceptance={} source=22 dest: 20}], [{ cond=(NOT p0), acceptance={} source=23 dest: 21}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=23 dest: 22}], [{ cond=(NOT p1), acceptance={} source=24 dest: 22}], [{ cond=(NOT p0), acceptance={} source=25 dest: 23}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=25 dest: 24}], [{ cond=(NOT p1), acceptance={} source=26 dest: 24}], [{ cond=(NOT p0), acceptance={} source=27 dest: 25}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=27 dest: 26}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=28 dest: 26}, { cond=(AND p0 (NOT p1)), acceptance={} source=28 dest: 28}]], initial=0, aps=[p0:(LEQ 3 (ADD s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 38170 steps with 974 reset in 10001 ms.
Product exploration timeout after 38020 steps with 932 reset in 10002 ms.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 333 ms. Reduced automaton from 29 states, 47 edges and 2 AP (stutter sensitive) to 9 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Finished random walk after 73 steps, including 0 resets, run visited all 4 properties in 22 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p0 (NOT p1))), (F p0)]
Knowledge based reduction with 6 factoid took 337 ms. Reduced automaton from 9 states, 11 edges and 2 AP (stutter sensitive) to 9 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 259 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
[2023-03-18 18:32:52] [INFO ] Invariant cache hit.
[2023-03-18 18:33:06] [INFO ] [Real]Absence check using 432 positive place invariants in 275 ms returned sat
[2023-03-18 18:33:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 18:33:07] [INFO ] [Real]Absence check using state equation in 1689 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 69 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-18 18:33:07] [INFO ] Invariant cache hit.
[2023-03-18 18:33:08] [INFO ] Implicit Places using invariants in 817 ms returned []
[2023-03-18 18:33:08] [INFO ] Invariant cache hit.
[2023-03-18 18:33:10] [INFO ] Implicit Places using invariants and state equation in 1855 ms returned []
Implicit Place search using SMT with State Equation took 2695 ms to find 0 implicit places.
[2023-03-18 18:33:10] [INFO ] Invariant cache hit.
[2023-03-18 18:33:11] [INFO ] Dead Transitions using invariants and state equation in 926 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3709 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 9 states, 11 edges and 2 AP (stutter sensitive) to 9 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 354 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Finished random walk after 73 steps, including 0 resets, run visited all 4 properties in 18 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F (AND (NOT p1) p0)), (F p0)]
Knowledge based reduction with 4 factoid took 278 ms. Reduced automaton from 9 states, 11 edges and 2 AP (stutter sensitive) to 9 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 291 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
[2023-03-18 18:33:30] [INFO ] Invariant cache hit.
[2023-03-18 18:33:44] [INFO ] [Real]Absence check using 432 positive place invariants in 187 ms returned sat
[2023-03-18 18:33:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 18:33:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 275 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Product exploration timeout after 33930 steps with 848 reset in 10001 ms.
Product exploration timeout after 33850 steps with 868 reset in 10004 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 321 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 25 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-18 18:34:06] [INFO ] Redundant transitions in 41 ms returned []
[2023-03-18 18:34:06] [INFO ] Invariant cache hit.
[2023-03-18 18:34:07] [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 1166 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 14 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-18 18:34:07] [INFO ] Invariant cache hit.
[2023-03-18 18:34:08] [INFO ] Implicit Places using invariants in 728 ms returned []
[2023-03-18 18:34:08] [INFO ] Invariant cache hit.
[2023-03-18 18:34:10] [INFO ] Implicit Places using invariants and state equation in 1894 ms returned []
Implicit Place search using SMT with State Equation took 2641 ms to find 0 implicit places.
[2023-03-18 18:34:10] [INFO ] Invariant cache hit.
[2023-03-18 18:34:11] [INFO ] Dead Transitions using invariants and state equation in 999 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3654 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Treatment of property Sudoku-COL-AN12-LTLCardinality-02 finished in 195773 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 1728 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 43 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-18 18:34:11] [INFO ] Invariant cache hit.
[2023-03-18 18:34:12] [INFO ] Implicit Places using invariants in 989 ms returned []
[2023-03-18 18:34:12] [INFO ] Invariant cache hit.
[2023-03-18 18:34:15] [INFO ] Implicit Places using invariants and state equation in 2342 ms returned []
Implicit Place search using SMT with State Equation took 3335 ms to find 0 implicit places.
[2023-03-18 18:34:15] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-18 18:34:15] [INFO ] Invariant cache hit.
[2023-03-18 18:34:16] [INFO ] Dead Transitions using invariants and state equation in 950 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4375 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171...], 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 61050 steps with 484 reset in 10001 ms.
Product exploration timeout after 60860 steps with 482 reset in 10001 ms.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
[2023-03-18 18:36:07] [INFO ] Invariant cache hit.
[2023-03-18 18:36:21] [INFO ] [Real]Absence check using 432 positive place invariants in 197 ms returned sat
[2023-03-18 18:36:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 18:36:22] [INFO ] [Real]Absence check using state equation in 1452 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1728 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 38 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-18 18:36:23] [INFO ] Invariant cache hit.
[2023-03-18 18:36:24] [INFO ] Implicit Places using invariants in 1089 ms returned []
[2023-03-18 18:36:24] [INFO ] Invariant cache hit.
[2023-03-18 18:36:26] [INFO ] Implicit Places using invariants and state equation in 2224 ms returned []
Implicit Place search using SMT with State Equation took 3350 ms to find 0 implicit places.
[2023-03-18 18:36:26] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-18 18:36:26] [INFO ] Invariant cache hit.
[2023-03-18 18:36:27] [INFO ] Dead Transitions using invariants and state equation in 949 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4374 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2023-03-18 18:37:58] [INFO ] Invariant cache hit.
[2023-03-18 18:38:12] [INFO ] [Real]Absence check using 432 positive place invariants in 173 ms returned sat
[2023-03-18 18:38:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 18:38:13] [INFO ] [Real]Absence check using state equation in 1468 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration timeout after 61170 steps with 484 reset in 10001 ms.
Product exploration timeout after 61120 steps with 485 reset in 10001 ms.
Support contains 1728 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 34 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-18 18:38:33] [INFO ] Invariant cache hit.
[2023-03-18 18:38:34] [INFO ] Implicit Places using invariants in 1154 ms returned []
[2023-03-18 18:38:34] [INFO ] Invariant cache hit.
[2023-03-18 18:38:37] [INFO ] Implicit Places using invariants and state equation in 2271 ms returned []
Implicit Place search using SMT with State Equation took 3467 ms to find 0 implicit places.
[2023-03-18 18:38:37] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-18 18:38:37] [INFO ] Invariant cache hit.
[2023-03-18 18:38:38] [INFO ] Dead Transitions using invariants and state equation in 942 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4501 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Treatment of property Sudoku-COL-AN12-LTLCardinality-03 finished in 266439 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(!p0)))'
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 17 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-18 18:38:38] [INFO ] Invariant cache hit.
[2023-03-18 18:38:38] [INFO ] Implicit Places using invariants in 735 ms returned []
[2023-03-18 18:38:38] [INFO ] Invariant cache hit.
[2023-03-18 18:38:40] [INFO ] Implicit Places using invariants and state equation in 1868 ms returned []
Implicit Place search using SMT with State Equation took 2630 ms to find 0 implicit places.
[2023-03-18 18:38:40] [INFO ] Invariant cache hit.
[2023-03-18 18:38:42] [INFO ] Dead Transitions using invariants and state equation in 1221 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3872 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), true]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN12-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN12-LTLCardinality-06 finished in 3973 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(F(p0))))'
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 12 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-18 18:38:42] [INFO ] Invariant cache hit.
[2023-03-18 18:38:42] [INFO ] Implicit Places using invariants in 717 ms returned []
[2023-03-18 18:38:42] [INFO ] Invariant cache hit.
[2023-03-18 18:38:44] [INFO ] Implicit Places using invariants and state equation in 1827 ms returned []
Implicit Place search using SMT with State Equation took 2584 ms to find 0 implicit places.
[2023-03-18 18:38:44] [INFO ] Invariant cache hit.
[2023-03-18 18:38:45] [INFO ] Dead Transitions using invariants and state equation in 957 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3572 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (LEQ 1 (ADD s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 43350 steps with 14450 reset in 10002 ms.
Product exploration timeout after 43090 steps with 14363 reset in 10002 ms.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 57 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-AN12-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN12-LTLCardinality-08 finished in 121340 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((X(X(F(p1)))||p0)))'
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 7 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-18 18:40:43] [INFO ] Invariant cache hit.
[2023-03-18 18:40:43] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-18 18:40:43] [INFO ] Invariant cache hit.
[2023-03-18 18:40:44] [INFO ] Implicit Places using invariants and state equation in 975 ms returned []
Implicit Place search using SMT with State Equation took 1403 ms to find 0 implicit places.
[2023-03-18 18:40:44] [INFO ] Invariant cache hit.
[2023-03-18 18:40:46] [INFO ] Dead Transitions using invariants and state equation in 1089 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2500 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (GT (ADD s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s17...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 37690 steps with 509 reset in 10002 ms.
Product exploration timeout after 37450 steps with 506 reset in 10002 ms.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 178 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 73 steps, including 0 resets, run visited all 1 properties in 20 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 212 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-18 18:45:28] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 7 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-18 18:45:43] [INFO ] Invariant cache hit.
[2023-03-18 18:45:44] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-18 18:45:44] [INFO ] Invariant cache hit.
[2023-03-18 18:45:45] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned []
Implicit Place search using SMT with State Equation took 1311 ms to find 0 implicit places.
[2023-03-18 18:45:45] [INFO ] Invariant cache hit.
[2023-03-18 18:45:45] [INFO ] Dead Transitions using invariants and state equation in 913 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2248 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 73 steps, including 0 resets, run visited all 1 properties in 19 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-18 18:50:11] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 37430 steps with 505 reset in 10002 ms.
Product exploration timeout after 37490 steps with 506 reset in 10002 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 19 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-18 18:50:46] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-18 18:50:46] [INFO ] Invariant cache hit.
[2023-03-18 18:50:47] [INFO ] Dead Transitions using invariants and state equation in 947 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1008 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 10 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-18 18:50:47] [INFO ] Invariant cache hit.
[2023-03-18 18:50:47] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-18 18:50:47] [INFO ] Invariant cache hit.
[2023-03-18 18:50:48] [INFO ] Implicit Places using invariants and state equation in 1070 ms returned []
Implicit Place search using SMT with State Equation took 1388 ms to find 0 implicit places.
[2023-03-18 18:50:48] [INFO ] Invariant cache hit.
[2023-03-18 18:50:49] [INFO ] Dead Transitions using invariants and state equation in 965 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2365 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Treatment of property Sudoku-COL-AN12-LTLCardinality-10 finished in 606400 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 144 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 432 are kept as prefixes of interest. Removing 1728 places using SCC suffix rule.4 ms
Discarding 1728 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 30 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 432 cols
[2023-03-18 18:50:50] [INFO ] Computed 35 place invariants in 67 ms
[2023-03-18 18:50:50] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-18 18:50:50] [INFO ] Invariant cache hit.
[2023-03-18 18:50:51] [INFO ] Implicit Places using invariants and state equation in 1327 ms returned []
Implicit Place search using SMT with State Equation took 1710 ms to find 0 implicit places.
[2023-03-18 18:50:51] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-18 18:50:51] [INFO ] Invariant cache hit.
[2023-03-18 18:50:52] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 432/2160 places, 1728/1728 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2336 ms. Remains : 432/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 42 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s288 s289 s290 s291 s292 s293 s294 s295 s296 s297 s298 s299 s300 s301 s302 s303 s304 s305 s306 s307 s308 s309 s310 s311 s312 s313 s314 s315...], 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 122 steps with 0 reset in 14 ms.
FORMULA Sudoku-COL-AN12-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN12-LTLCardinality-13 finished in 2409 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)||G(F(p1))||G(p2))))'
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 23 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 2160 cols
[2023-03-18 18:50:52] [INFO ] Computed 432 place invariants in 14 ms
[2023-03-18 18:50:53] [INFO ] Implicit Places using invariants in 710 ms returned []
[2023-03-18 18:50:53] [INFO ] Invariant cache hit.
[2023-03-18 18:50:54] [INFO ] Implicit Places using invariants and state equation in 1847 ms returned []
Implicit Place search using SMT with State Equation took 2571 ms to find 0 implicit places.
[2023-03-18 18:50:54] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-18 18:50:54] [INFO ] Invariant cache hit.
[2023-03-18 18:50:55] [INFO ] Dead Transitions using invariants and state equation in 941 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3592 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 53760 steps with 426 reset in 10001 ms.
Product exploration timeout after 53810 steps with 427 reset in 10001 ms.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 515 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 79 resets, run finished after 2049 ms. (steps per millisecond=4 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1196 ms. (steps per millisecond=8 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 812 ms. (steps per millisecond=12 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 798 ms. (steps per millisecond=12 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 798 ms. (steps per millisecond=12 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-18 18:59:43] [INFO ] Invariant cache hit.
[2023-03-18 18:59:45] [INFO ] After 380ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 18:59:45] [INFO ] [Nat]Absence check using 432 positive place invariants in 107 ms returned sat
[2023-03-18 18:59:52] [INFO ] After 2062ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-18 18:59:58] [INFO ] After 7799ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 1923 ms.
[2023-03-18 19:00:00] [INFO ] After 14640ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 144 steps, including 0 resets, run visited all 2 properties in 17 ms. (steps per millisecond=8 )
Parikh walk visited 2 properties in 17 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p0) p2 (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p2) (NOT p1))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1)))), (F (AND p0 p2 (NOT p1)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) p2 (NOT p1))))
Knowledge based reduction with 14 factoid took 441 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN12-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN12-LTLCardinality-14 finished in 548245 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 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 32 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-18 19:00:00] [INFO ] Invariant cache hit.
[2023-03-18 19:00:01] [INFO ] Implicit Places using invariants in 759 ms returned []
[2023-03-18 19:00:01] [INFO ] Invariant cache hit.
[2023-03-18 19:00:03] [INFO ] Implicit Places using invariants and state equation in 1959 ms returned []
Implicit Place search using SMT with State Equation took 2730 ms to find 0 implicit places.
[2023-03-18 19:00:03] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-18 19:00:03] [INFO ] Invariant cache hit.
[2023-03-18 19:00:04] [INFO ] Dead Transitions using invariants and state equation in 956 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3766 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], 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 56260 steps with 445 reset in 10001 ms.
Product exploration timeout after 55540 steps with 440 reset in 10001 ms.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 72 steps, including 0 resets, run visited all 1 properties in 16 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 185 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2023-03-18 19:02:02] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 33 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-18 19:02:17] [INFO ] Invariant cache hit.
[2023-03-18 19:02:18] [INFO ] Implicit Places using invariants in 752 ms returned []
[2023-03-18 19:02:18] [INFO ] Invariant cache hit.
[2023-03-18 19:02:20] [INFO ] Implicit Places using invariants and state equation in 2086 ms returned []
Implicit Place search using SMT with State Equation took 2843 ms to find 0 implicit places.
[2023-03-18 19:02:20] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-18 19:02:20] [INFO ] Invariant cache hit.
[2023-03-18 19:02:21] [INFO ] Dead Transitions using invariants and state equation in 983 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3898 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 72 steps, including 0 resets, run visited all 1 properties in 16 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2023-03-18 19:04:00] [INFO ] Invariant cache hit.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:876)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:517)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 19:04:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration timeout after 56530 steps with 448 reset in 10001 ms.
Product exploration timeout after 55990 steps with 443 reset in 10001 ms.
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 21 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-18 19:04:36] [INFO ] Invariant cache hit.
[2023-03-18 19:04:36] [INFO ] Implicit Places using invariants in 781 ms returned []
[2023-03-18 19:04:36] [INFO ] Invariant cache hit.
[2023-03-18 19:04:38] [INFO ] Implicit Places using invariants and state equation in 1885 ms returned []
Implicit Place search using SMT with State Equation took 2706 ms to find 0 implicit places.
[2023-03-18 19:04:38] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-18 19:04:38] [INFO ] Invariant cache hit.
[2023-03-18 19:04:39] [INFO ] Dead Transitions using invariants and state equation in 967 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3731 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Treatment of property Sudoku-COL-AN12-LTLCardinality-15 finished in 279489 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)||X(X(p1))))))'
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' '!((p0 U X(X(X(X((X(G(p0))||(X(p0)&&F(p1)))))))))'
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)))'
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((X(X(F(p1)))||p0)))'
Found a Shortening insensitive property : Sudoku-COL-AN12-LTLCardinality-10
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 18 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-18 19:04:40] [INFO ] Invariant cache hit.
[2023-03-18 19:04:40] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-18 19:04:40] [INFO ] Invariant cache hit.
[2023-03-18 19:04:41] [INFO ] Implicit Places using invariants and state equation in 987 ms returned []
Implicit Place search using SMT with State Equation took 1307 ms to find 0 implicit places.
[2023-03-18 19:04:41] [INFO ] Invariant cache hit.
[2023-03-18 19:04:42] [INFO ] Dead Transitions using invariants and state equation in 960 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2296 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Running random walk in product with property : Sudoku-COL-AN12-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (GT (ADD s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s17...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 36980 steps with 499 reset in 10001 ms.
Product exploration timeout after 36580 steps with 494 reset in 10003 ms.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 227 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 73 steps, including 0 resets, run visited all 1 properties in 19 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 239 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-18 19:09:39] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 6 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-18 19:09:54] [INFO ] Invariant cache hit.
[2023-03-18 19:09:55] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-03-18 19:09:55] [INFO ] Invariant cache hit.
[2023-03-18 19:09:56] [INFO ] Implicit Places using invariants and state equation in 1115 ms returned []
Implicit Place search using SMT with State Equation took 1448 ms to find 0 implicit places.
[2023-03-18 19:09:56] [INFO ] Invariant cache hit.
[2023-03-18 19:09:57] [INFO ] Dead Transitions using invariants and state equation in 1002 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2456 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 73 steps, including 0 resets, run visited all 1 properties in 19 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-18 19:14:31] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 36820 steps with 497 reset in 10001 ms.
Product exploration timeout after 38050 steps with 514 reset in 10002 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 15 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-18 19:15:07] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-18 19:15:07] [INFO ] Invariant cache hit.
[2023-03-18 19:15:08] [INFO ] Dead Transitions using invariants and state equation in 915 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 984 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 4 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-18 19:15:08] [INFO ] Invariant cache hit.
[2023-03-18 19:15:08] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-03-18 19:15:08] [INFO ] Invariant cache hit.
[2023-03-18 19:15:09] [INFO ] Implicit Places using invariants and state equation in 1093 ms returned []
Implicit Place search using SMT with State Equation took 1399 ms to find 0 implicit places.
[2023-03-18 19:15:09] [INFO ] Invariant cache hit.
[2023-03-18 19:15:10] [INFO ] Dead Transitions using invariants and state equation in 929 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2332 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Treatment of property Sudoku-COL-AN12-LTLCardinality-10 finished in 630352 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)))'
[2023-03-18 19:15:10] [INFO ] Flatten gal took : 88 ms
[2023-03-18 19:15:10] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 7 ms.
[2023-03-18 19:15:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2160 places, 1728 transitions and 6912 arcs took 8 ms.
Total runtime 2878477 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Sudoku-COL-AN12
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality
FORMULA Sudoku-COL-AN12-LTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1679167078997
--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 15 (type SKEL/SRCH) for 0 Sudoku-COL-AN12-LTLCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 15 (type SKEL/SRCH) for Sudoku-COL-AN12-LTLCardinality-01
lola: result : true
lola: markings : 5
lola: fired transitions : 4
lola: time used : 0.000000
lola: memory pages used : 1
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Rule S: 0 transitions removed,0 places removed
lola: planning for Sudoku-COL-AN12-LTLCardinality-01 stopped (result already fixed).
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 10 (type EXCL) for 9 Sudoku-COL-AN12-LTLCardinality-10
lola: time limit : 899 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 4/899 8/32 Sudoku-COL-AN12-LTLCardinality-10 187194 m, 37438 m/sec, 341509 t fired, .
Time elapsed: 6 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 9/899 16/32 Sudoku-COL-AN12-LTLCardinality-10 369925 m, 36546 m/sec, 733734 t fired, .
Time elapsed: 11 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 14/899 24/32 Sudoku-COL-AN12-LTLCardinality-10 572496 m, 40514 m/sec, 1110754 t fired, .
Time elapsed: 16 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 19/899 32/32 Sudoku-COL-AN12-LTLCardinality-10 759427 m, 37386 m/sec, 1496578 t fired, .
Time elapsed: 21 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 10 (type EXCL) for Sudoku-COL-AN12-LTLCardinality-10 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 26 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 4 (type EXCL) for 3 Sudoku-COL-AN12-LTLCardinality-02
lola: time limit : 1191 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1191 9/32 Sudoku-COL-AN12-LTLCardinality-02 199963 m, 39992 m/sec, 360633 t fired, .
Time elapsed: 31 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1191 16/32 Sudoku-COL-AN12-LTLCardinality-02 373970 m, 34801 m/sec, 741945 t fired, .
Time elapsed: 36 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1191 24/32 Sudoku-COL-AN12-LTLCardinality-02 569060 m, 39018 m/sec, 1101447 t fired, .
Time elapsed: 41 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1191 31/32 Sudoku-COL-AN12-LTLCardinality-02 741406 m, 34469 m/sec, 1474775 t fired, .
Time elapsed: 46 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 4 (type EXCL) for Sudoku-COL-AN12-LTLCardinality-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 51 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 7 (type EXCL) for 6 Sudoku-COL-AN12-LTLCardinality-03
lola: time limit : 1774 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1774 4/32 Sudoku-COL-AN12-LTLCardinality-03 88202 m, 17640 m/sec, 517215 t fired, .
Time elapsed: 56 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1774 7/32 Sudoku-COL-AN12-LTLCardinality-03 158163 m, 13992 m/sec, 1042020 t fired, .
Time elapsed: 61 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/1774 10/32 Sudoku-COL-AN12-LTLCardinality-03 241237 m, 16614 m/sec, 1558054 t fired, .
Time elapsed: 66 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/1774 13/32 Sudoku-COL-AN12-LTLCardinality-03 313624 m, 14477 m/sec, 2076153 t fired, .
Time elapsed: 71 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 25/1774 16/32 Sudoku-COL-AN12-LTLCardinality-03 385855 m, 14446 m/sec, 2593194 t fired, .
Time elapsed: 76 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 30/1774 19/32 Sudoku-COL-AN12-LTLCardinality-03 457896 m, 14408 m/sec, 3112957 t fired, .
Time elapsed: 81 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 35/1774 22/32 Sudoku-COL-AN12-LTLCardinality-03 525477 m, 13516 m/sec, 3630677 t fired, .
Time elapsed: 86 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 40/1774 24/32 Sudoku-COL-AN12-LTLCardinality-03 579082 m, 10721 m/sec, 4157140 t fired, .
Time elapsed: 91 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 45/1774 26/32 Sudoku-COL-AN12-LTLCardinality-03 646043 m, 13392 m/sec, 4676579 t fired, .
Time elapsed: 96 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 50/1774 30/32 Sudoku-COL-AN12-LTLCardinality-03 724356 m, 15662 m/sec, 5196416 t fired, .
Time elapsed: 101 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 7 (type EXCL) for Sudoku-COL-AN12-LTLCardinality-03 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 106 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 13 (type EXCL) for 12 Sudoku-COL-AN12-LTLCardinality-15
lola: time limit : 3494 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 5/3494 4/32 Sudoku-COL-AN12-LTLCardinality-15 86152 m, 17230 m/sec, 505042 t fired, .
Time elapsed: 111 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 10/3494 7/32 Sudoku-COL-AN12-LTLCardinality-15 155523 m, 13874 m/sec, 1018750 t fired, .
Time elapsed: 116 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 15/3494 10/32 Sudoku-COL-AN12-LTLCardinality-15 236849 m, 16265 m/sec, 1535045 t fired, .
Time elapsed: 121 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 20/3494 13/32 Sudoku-COL-AN12-LTLCardinality-15 309423 m, 14514 m/sec, 2043251 t fired, .
Time elapsed: 126 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 25/3494 16/32 Sudoku-COL-AN12-LTLCardinality-15 381497 m, 14414 m/sec, 2559665 t fired, .
Time elapsed: 131 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 30/3494 19/32 Sudoku-COL-AN12-LTLCardinality-15 454496 m, 14599 m/sec, 3075476 t fired, .
Time elapsed: 136 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 35/3494 21/32 Sudoku-COL-AN12-LTLCardinality-15 522646 m, 13630 m/sec, 3598946 t fired, .
Time elapsed: 141 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 40/3494 24/32 Sudoku-COL-AN12-LTLCardinality-15 576420 m, 10754 m/sec, 4131058 t fired, .
Time elapsed: 146 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 45/3494 26/32 Sudoku-COL-AN12-LTLCardinality-15 643908 m, 13497 m/sec, 4665407 t fired, .
Time elapsed: 151 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 50/3494 30/32 Sudoku-COL-AN12-LTLCardinality-15 722787 m, 15775 m/sec, 5186242 t fired, .
Time elapsed: 156 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
13 LTL EXCL 55/3494 32/32 Sudoku-COL-AN12-LTLCardinality-15 796541 m, 14750 m/sec, 5698143 t fired, .
Time elapsed: 161 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 13 (type EXCL) for Sudoku-COL-AN12-LTLCardinality-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN12-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-10: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN12-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 166 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: Portfolio finished: no open tasks 5
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN12-LTLCardinality-01: LTL true skeleton: LTL model checker
Sudoku-COL-AN12-LTLCardinality-02: LTL unknown AGGR
Sudoku-COL-AN12-LTLCardinality-03: LTL unknown AGGR
Sudoku-COL-AN12-LTLCardinality-10: LTL unknown AGGR
Sudoku-COL-AN12-LTLCardinality-15: LTL unknown AGGR
Time elapsed: 166 secs. Pages in use: 32
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-AN12"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is Sudoku-COL-AN12, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r487-tall-167912702600091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN12.tgz
mv Sudoku-COL-AN12 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;