Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r489-tall-167912706500243.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Sudoku-PT-AN11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912706500243
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 41M
-rw-r--r-- 1 mcc users 275K Feb 26 09:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Feb 26 09:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Feb 26 09:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 8.1M Feb 26 09:06 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 297K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 510K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.8M Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 755K Feb 26 09:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.5M Feb 26 09:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5M Feb 26 09:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17M Feb 26 09:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 65K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 161K Feb 25 17:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 746K 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-PT-AN11-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679217787098

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN11
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 09:23:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 09:23:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 09:23:08] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2023-03-19 09:23:08] [INFO ] Transformed 1694 places.
[2023-03-19 09:23:08] [INFO ] Transformed 1331 transitions.
[2023-03-19 09:23:08] [INFO ] Parsed PT model containing 1694 places and 1331 transitions and 5324 arcs in 327 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 139 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-AN11-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1694 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 25 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2023-03-19 09:23:09] [INFO ] Computed 363 place invariants in 42 ms
[2023-03-19 09:23:09] [INFO ] Implicit Places using invariants in 516 ms returned []
[2023-03-19 09:23:09] [INFO ] Invariant cache hit.
[2023-03-19 09:23:10] [INFO ] Implicit Places using invariants and state equation in 953 ms returned []
Implicit Place search using SMT with State Equation took 1497 ms to find 0 implicit places.
[2023-03-19 09:23:10] [INFO ] Invariant cache hit.
[2023-03-19 09:23:11] [INFO ] Dead Transitions using invariants and state equation in 770 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2296 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Support contains 1694 out of 1694 places after structural reductions.
[2023-03-19 09:23:12] [INFO ] Flatten gal took : 186 ms
[2023-03-19 09:23:12] [INFO ] Flatten gal took : 116 ms
[2023-03-19 09:23:12] [INFO ] Input system was already deterministic with 1331 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1568 ms. (steps per millisecond=6 ) properties (out of 27) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-19 09:23:15] [INFO ] Invariant cache hit.
[2023-03-19 09:23:16] [INFO ] [Real]Absence check using 363 positive place invariants in 86 ms returned sat
[2023-03-19 09:23:17] [INFO ] After 1143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-19 09:23:17] [INFO ] [Nat]Absence check using 363 positive place invariants in 86 ms returned sat
[2023-03-19 09:23:22] [INFO ] After 2468ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :6
[2023-03-19 09:23:22] [INFO ] After 3073ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :6
Attempting to minimize the solution found.
Minimization took 365 ms.
[2023-03-19 09:23:22] [INFO ] After 5834ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :6
Fused 13 Parikh solutions to 1 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 6 properties in 14 ms. (steps per millisecond=8 )
Parikh walk visited 6 properties in 15 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 7 atomic propositions for a total of 13 simplifications.
FORMULA Sudoku-PT-AN11-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA Sudoku-PT-AN11-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1331 places and 0 transitions.
Iterating post reduction 0 with 1331 rules applied. Total rules applied 1331 place count 363 transition count 1331
Applied a total of 1331 rules in 58 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2023-03-19 09:23:23] [INFO ] Computed 32 place invariants in 66 ms
[2023-03-19 09:23:23] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-19 09:23:23] [INFO ] Invariant cache hit.
[2023-03-19 09:23:24] [INFO ] Implicit Places using invariants and state equation in 1091 ms returned []
Implicit Place search using SMT with State Equation took 1485 ms to find 0 implicit places.
[2023-03-19 09:23:24] [INFO ] Invariant cache hit.
[2023-03-19 09:23:25] [INFO ] Dead Transitions using invariants and state equation in 447 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1992 ms. Remains : 363/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 243 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 2 (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 945 reset in 9431 ms.
Product exploration explored 100000 steps with 946 reset in 9476 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 901 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 253948 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 253948 steps, saw 128426 distinct states, run finished after 3003 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 09:24:02] [INFO ] Invariant cache hit.
[2023-03-19 09:24:02] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 20 ms returned sat
[2023-03-19 09:24:03] [INFO ] After 974ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:24:03] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 19 ms returned sat
[2023-03-19 09:24:04] [INFO ] After 686ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:24:04] [INFO ] After 758ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-19 09:24:04] [INFO ] After 869ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 120 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 13 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 09:24:04] [INFO ] Invariant cache hit.
[2023-03-19 09:24:04] [INFO ] Implicit Places using invariants in 264 ms returned []
[2023-03-19 09:24:04] [INFO ] Invariant cache hit.
[2023-03-19 09:24:06] [INFO ] Implicit Places using invariants and state equation in 1037 ms returned []
Implicit Place search using SMT with State Equation took 1311 ms to find 0 implicit places.
[2023-03-19 09:24:06] [INFO ] Invariant cache hit.
[2023-03-19 09:24:06] [INFO ] Dead Transitions using invariants and state equation in 438 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1767 ms. Remains : 363/363 places, 1331/1331 transitions.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 871 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 253869 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 253869 steps, saw 128408 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 09:24:24] [INFO ] Invariant cache hit.
[2023-03-19 09:24:24] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 19 ms returned sat
[2023-03-19 09:24:25] [INFO ] After 1017ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:24:25] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 18 ms returned sat
[2023-03-19 09:24:25] [INFO ] After 696ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:24:25] [INFO ] After 749ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-19 09:24:26] [INFO ] After 864ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 120 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 945 reset in 9009 ms.
Product exploration explored 100000 steps with 945 reset in 9104 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 50 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 09:24:45] [INFO ] Redundant transitions in 79 ms returned []
[2023-03-19 09:24:45] [INFO ] Invariant cache hit.
[2023-03-19 09:24:45] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 579 ms. Remains : 363/363 places, 1331/1331 transitions.
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 12 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 09:24:45] [INFO ] Invariant cache hit.
[2023-03-19 09:24:45] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-19 09:24:45] [INFO ] Invariant cache hit.
[2023-03-19 09:24:46] [INFO ] Implicit Places using invariants and state equation in 1048 ms returned []
Implicit Place search using SMT with State Equation took 1322 ms to find 0 implicit places.
[2023-03-19 09:24:46] [INFO ] Invariant cache hit.
[2023-03-19 09:24:47] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1747 ms. Remains : 363/363 places, 1331/1331 transitions.
Treatment of property Sudoku-PT-AN11-LTLCardinality-01 finished in 84197 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||F(p1))))'
Support contains 1694 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 6 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2023-03-19 09:24:47] [INFO ] Computed 363 place invariants in 6 ms
[2023-03-19 09:24:47] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-19 09:24:47] [INFO ] Invariant cache hit.
[2023-03-19 09:24:48] [INFO ] Implicit Places using invariants and state equation in 804 ms returned []
Implicit Place search using SMT with State Equation took 1089 ms to find 0 implicit places.
[2023-03-19 09:24:48] [INFO ] Invariant cache hit.
[2023-03-19 09:24:49] [INFO ] Dead Transitions using invariants and state equation in 707 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1806 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 3 (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 46800 steps with 15600 reset in 10002 ms.
Product exploration timeout after 46510 steps with 15503 reset in 10002 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
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) p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) (NOT p0)))))
Knowledge based reduction with 5 factoid took 181 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN11-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN11-LTLCardinality-03 finished in 139566 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(F(p0)))'
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 50 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 09:27:07] [INFO ] Invariant cache hit.
[2023-03-19 09:27:07] [INFO ] Implicit Places using invariants in 618 ms returned []
[2023-03-19 09:27:07] [INFO ] Invariant cache hit.
[2023-03-19 09:27:09] [INFO ] Implicit Places using invariants and state equation in 1441 ms returned []
Implicit Place search using SMT with State Equation took 2065 ms to find 0 implicit places.
[2023-03-19 09:27:09] [INFO ] Invariant cache hit.
[2023-03-19 09:27:09] [INFO ] Dead Transitions using invariants and state equation in 694 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2812 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], 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, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 59100 steps with 953 reset in 10002 ms.
Product exploration timeout after 58270 steps with 939 reset in 10001 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
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 144 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=5 )
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 154 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
[2023-03-19 09:28:34] [INFO ] Invariant cache hit.
[2023-03-19 09:28:46] [INFO ] [Real]Absence check using 363 positive place invariants in 165 ms returned sat
[2023-03-19 09:28:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 09:28:48] [INFO ] [Real]Absence check using state equation in 1586 ms returned sat
[2023-03-19 09:28:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 09:29:03] [INFO ] [Nat]Absence check using 363 positive place invariants in 4688 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 54 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 09:29:03] [INFO ] Invariant cache hit.
[2023-03-19 09:29:03] [INFO ] Implicit Places using invariants in 574 ms returned []
[2023-03-19 09:29:03] [INFO ] Invariant cache hit.
[2023-03-19 09:29:05] [INFO ] Implicit Places using invariants and state equation in 1536 ms returned []
Implicit Place search using SMT with State Equation took 2119 ms to find 0 implicit places.
[2023-03-19 09:29:05] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-19 09:29:05] [INFO ] Invariant cache hit.
[2023-03-19 09:29:06] [INFO ] Dead Transitions using invariants and state equation in 786 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2989 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
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 144 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 13 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 146 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2023-03-19 09:30:08] [INFO ] Invariant cache hit.
[2023-03-19 09:30:20] [INFO ] [Real]Absence check using 363 positive place invariants in 158 ms returned sat
[2023-03-19 09:30:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 09:30:21] [INFO ] [Real]Absence check using state equation in 1582 ms returned sat
[2023-03-19 09:30:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 09:30:37] [INFO ] [Nat]Absence check using 363 positive place invariants in 4768 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration timeout after 61080 steps with 985 reset in 10002 ms.
Product exploration timeout after 60680 steps with 978 reset in 10001 ms.
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 41 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 09:30:57] [INFO ] Invariant cache hit.
[2023-03-19 09:30:57] [INFO ] Implicit Places using invariants in 587 ms returned []
[2023-03-19 09:30:57] [INFO ] Invariant cache hit.
[2023-03-19 09:30:59] [INFO ] Implicit Places using invariants and state equation in 1502 ms returned []
Implicit Place search using SMT with State Equation took 2091 ms to find 0 implicit places.
[2023-03-19 09:30:59] [INFO ] Redundant transitions in 72 ms returned []
[2023-03-19 09:30:59] [INFO ] Invariant cache hit.
[2023-03-19 09:31:00] [INFO ] Dead Transitions using invariants and state equation in 701 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2926 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Treatment of property Sudoku-PT-AN11-LTLCardinality-04 finished in 233125 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 34 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 09:31:00] [INFO ] Invariant cache hit.
[2023-03-19 09:31:00] [INFO ] Implicit Places using invariants in 594 ms returned []
[2023-03-19 09:31:00] [INFO ] Invariant cache hit.
[2023-03-19 09:31:02] [INFO ] Implicit Places using invariants and state equation in 1460 ms returned []
Implicit Place search using SMT with State Equation took 2056 ms to find 0 implicit places.
[2023-03-19 09:31:02] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-19 09:31:02] [INFO ] Invariant cache hit.
[2023-03-19 09:31:03] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2842 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 84360 steps with 1554 reset in 10001 ms.
Product exploration timeout after 83900 steps with 1548 reset in 10002 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 301 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 900 ms. (steps per millisecond=11 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 09:32:28] [INFO ] Invariant cache hit.
[2023-03-19 09:32:28] [INFO ] [Real]Absence check using 363 positive place invariants in 82 ms returned sat
[2023-03-19 09:32:29] [INFO ] After 961ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:32:29] [INFO ] [Nat]Absence check using 363 positive place invariants in 80 ms returned sat
[2023-03-19 09:32:31] [INFO ] After 770ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:32:31] [INFO ] After 870ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-19 09:32:31] [INFO ] After 1696ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 120 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=10 )
Parikh walk visited 1 properties in 12 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 361 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-19 09:32:32] [INFO ] Invariant cache hit.
[2023-03-19 09:32:40] [INFO ] [Real]Absence check using 363 positive place invariants in 151 ms returned sat
[2023-03-19 09:32:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 09:32:42] [INFO ] [Real]Absence check using state equation in 1263 ms returned sat
[2023-03-19 09:32:42] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 50 ms.
[2023-03-19 09:32:42] [INFO ] Added : 0 causal constraints over 0 iterations in 177 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 29 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 09:32:42] [INFO ] Invariant cache hit.
[2023-03-19 09:32:43] [INFO ] Implicit Places using invariants in 583 ms returned []
[2023-03-19 09:32:43] [INFO ] Invariant cache hit.
[2023-03-19 09:32:44] [INFO ] Implicit Places using invariants and state equation in 1433 ms returned []
Implicit Place search using SMT with State Equation took 2020 ms to find 0 implicit places.
[2023-03-19 09:32:44] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-19 09:32:44] [INFO ] Invariant cache hit.
[2023-03-19 09:32:45] [INFO ] Dead Transitions using invariants and state equation in 705 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2778 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 313 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 890 ms. (steps per millisecond=11 ) properties (out of 2) seen :1
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
Running SMT prover for 1 properties.
[2023-03-19 09:33:51] [INFO ] Invariant cache hit.
[2023-03-19 09:33:51] [INFO ] [Real]Absence check using 363 positive place invariants in 80 ms returned sat
[2023-03-19 09:33:52] [INFO ] After 940ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:33:52] [INFO ] [Nat]Absence check using 363 positive place invariants in 82 ms returned sat
[2023-03-19 09:33:53] [INFO ] After 726ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:33:54] [INFO ] After 828ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-19 09:33:54] [INFO ] After 1637ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 120 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 408 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-19 09:33:54] [INFO ] Invariant cache hit.
[2023-03-19 09:34:03] [INFO ] [Real]Absence check using 363 positive place invariants in 140 ms returned sat
[2023-03-19 09:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 09:34:04] [INFO ] [Real]Absence check using state equation in 1162 ms returned sat
[2023-03-19 09:34:04] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 50 ms.
[2023-03-19 09:34:05] [INFO ] Added : 0 causal constraints over 0 iterations in 174 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration timeout after 81250 steps with 1461 reset in 10001 ms.
Product exploration timeout after 80220 steps with 1452 reset in 10002 ms.
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 28 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 09:34:25] [INFO ] Invariant cache hit.
[2023-03-19 09:34:25] [INFO ] Implicit Places using invariants in 566 ms returned []
[2023-03-19 09:34:25] [INFO ] Invariant cache hit.
[2023-03-19 09:34:27] [INFO ] Implicit Places using invariants and state equation in 1425 ms returned []
Implicit Place search using SMT with State Equation took 1993 ms to find 0 implicit places.
[2023-03-19 09:34:27] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-19 09:34:27] [INFO ] Invariant cache hit.
[2023-03-19 09:34:28] [INFO ] Dead Transitions using invariants and state equation in 782 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2828 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Treatment of property Sudoku-PT-AN11-LTLCardinality-05 finished in 207967 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 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.8 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 31 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2023-03-19 09:34:28] [INFO ] Computed 32 place invariants in 30 ms
[2023-03-19 09:34:28] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-19 09:34:28] [INFO ] Invariant cache hit.
[2023-03-19 09:34:29] [INFO ] Implicit Places using invariants and state equation in 1096 ms returned []
Implicit Place search using SMT with State Equation took 1393 ms to find 0 implicit places.
[2023-03-19 09:34:29] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-19 09:34:29] [INFO ] Invariant cache hit.
[2023-03-19 09:34:30] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1874 ms. Remains : 363/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-07 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 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 945 reset in 9053 ms.
Product exploration explored 100000 steps with 946 reset in 9169 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 211 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 33 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 891 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 249519 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 249519 steps, saw 127487 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 09:35:06] [INFO ] Invariant cache hit.
[2023-03-19 09:35:06] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 21 ms returned sat
[2023-03-19 09:35:07] [INFO ] After 992ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:35:07] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 18 ms returned sat
[2023-03-19 09:35:07] [INFO ] After 663ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:35:08] [INFO ] After 718ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-19 09:35:08] [INFO ] After 819ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 119 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 148 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)]
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 18 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 09:35:08] [INFO ] Invariant cache hit.
[2023-03-19 09:35:08] [INFO ] Implicit Places using invariants in 243 ms returned []
[2023-03-19 09:35:08] [INFO ] Invariant cache hit.
[2023-03-19 09:35:09] [INFO ] Implicit Places using invariants and state equation in 1028 ms returned []
Implicit Place search using SMT with State Equation took 1277 ms to find 0 implicit places.
[2023-03-19 09:35:09] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-19 09:35:09] [INFO ] Invariant cache hit.
[2023-03-19 09:35:10] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1728 ms. Remains : 363/363 places, 1331/1331 transitions.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 130 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 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 95 resets, run finished after 891 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 244824 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 244824 steps, saw 126509 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 09:35:28] [INFO ] Invariant cache hit.
[2023-03-19 09:35:28] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 19 ms returned sat
[2023-03-19 09:35:29] [INFO ] After 1002ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:35:29] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 19 ms returned sat
[2023-03-19 09:35:30] [INFO ] After 677ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:35:30] [INFO ] After 729ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-19 09:35:30] [INFO ] After 836ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 119 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 157 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 946 reset in 9055 ms.
Product exploration explored 100000 steps with 945 reset in 9161 ms.
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 14 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 09:35:48] [INFO ] Invariant cache hit.
[2023-03-19 09:35:48] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-19 09:35:48] [INFO ] Invariant cache hit.
[2023-03-19 09:35:49] [INFO ] Implicit Places using invariants and state equation in 997 ms returned []
Implicit Place search using SMT with State Equation took 1247 ms to find 0 implicit places.
[2023-03-19 09:35:50] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-19 09:35:50] [INFO ] Invariant cache hit.
[2023-03-19 09:35:50] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1692 ms. Remains : 363/363 places, 1331/1331 transitions.
Treatment of property Sudoku-PT-AN11-LTLCardinality-07 finished in 82368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1330 places and 0 transitions.
Iterating post reduction 0 with 1330 rules applied. Total rules applied 1330 place count 364 transition count 1331
Applied a total of 1330 rules in 41 ms. Remains 364 /1694 variables (removed 1330) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 364 cols
[2023-03-19 09:35:50] [INFO ] Computed 32 place invariants in 80 ms
[2023-03-19 09:35:51] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-19 09:35:51] [INFO ] Invariant cache hit.
[2023-03-19 09:35:52] [INFO ] Implicit Places using invariants and state equation in 1145 ms returned []
Implicit Place search using SMT with State Equation took 1586 ms to find 0 implicit places.
[2023-03-19 09:35:52] [INFO ] Invariant cache hit.
[2023-03-19 09:35:52] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 364/1694 places, 1331/1331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2028 ms. Remains : 364/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s121 s41)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1239 steps with 11 reset in 111 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-09 finished in 2289 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 2 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.5 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 32 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2023-03-19 09:35:52] [INFO ] Computed 32 place invariants in 33 ms
[2023-03-19 09:35:53] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-19 09:35:53] [INFO ] Invariant cache hit.
[2023-03-19 09:35:54] [INFO ] Implicit Places using invariants and state equation in 1182 ms returned []
Implicit Place search using SMT with State Equation took 1550 ms to find 0 implicit places.
[2023-03-19 09:35:54] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-19 09:35:54] [INFO ] Invariant cache hit.
[2023-03-19 09:35:54] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2003 ms. Remains : 363/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s219 s74)], 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 105 steps with 0 reset in 12 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-10 finished in 2075 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))) U (p1&&X(F(p2)))))'
Support contains 3 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1329 places and 0 transitions.
Iterating post reduction 0 with 1329 rules applied. Total rules applied 1329 place count 365 transition count 1331
Applied a total of 1329 rules in 25 ms. Remains 365 /1694 variables (removed 1329) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 365 cols
[2023-03-19 09:35:54] [INFO ] Computed 32 place invariants in 43 ms
[2023-03-19 09:35:55] [INFO ] Implicit Places using invariants in 390 ms returned []
[2023-03-19 09:35:55] [INFO ] Invariant cache hit.
[2023-03-19 09:35:56] [INFO ] Implicit Places using invariants and state equation in 1113 ms returned []
Implicit Place search using SMT with State Equation took 1510 ms to find 0 implicit places.
[2023-03-19 09:35:56] [INFO ] Invariant cache hit.
[2023-03-19 09:35:56] [INFO ] Dead Transitions using invariants and state equation in 407 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 365/1694 places, 1331/1331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1943 ms. Remains : 365/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (NOT p0), true]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=p1, acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GT 1 s301), p2:(GT 1 s122), p0:(AND (LEQ 1 s301) (GT 3 s121))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 100 steps with 0 reset in 12 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-11 finished in 2123 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 364 are kept as prefixes of interest. Removing 1330 places using SCC suffix rule.2 ms
Discarding 1330 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 31 ms. Remains 364 /1694 variables (removed 1330) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 364 cols
[2023-03-19 09:35:57] [INFO ] Computed 32 place invariants in 30 ms
[2023-03-19 09:35:57] [INFO ] Implicit Places using invariants in 361 ms returned []
[2023-03-19 09:35:57] [INFO ] Invariant cache hit.
[2023-03-19 09:35:58] [INFO ] Implicit Places using invariants and state equation in 1059 ms returned []
Implicit Place search using SMT with State Equation took 1422 ms to find 0 implicit places.
[2023-03-19 09:35:58] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-19 09:35:58] [INFO ] Invariant cache hit.
[2023-03-19 09:35:58] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 364/1694 places, 1331/1331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1881 ms. Remains : 364/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s121 s78)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 106 steps with 0 reset in 14 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-12 finished in 1943 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 3 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 347 are kept as prefixes of interest. Removing 1347 places using SCC suffix rule.4 ms
Discarding 1347 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 86 ms. Remains 347 /1694 variables (removed 1347) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 347 cols
[2023-03-19 09:35:59] [INFO ] Computed 22 place invariants in 57 ms
[2023-03-19 09:35:59] [INFO ] Implicit Places using invariants in 342 ms returned []
[2023-03-19 09:35:59] [INFO ] Invariant cache hit.
[2023-03-19 09:36:00] [INFO ] Implicit Places using invariants and state equation in 961 ms returned []
Implicit Place search using SMT with State Equation took 1306 ms to find 0 implicit places.
[2023-03-19 09:36:00] [INFO ] Redundant transitions in 88 ms returned []
[2023-03-19 09:36:00] [INFO ] Invariant cache hit.
[2023-03-19 09:36:00] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 347/1694 places, 1331/1331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1909 ms. Remains : 347/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT 3 s122) (GT s121 s335))], 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 109 steps with 0 reset in 16 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-13 finished in 1977 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))))'
Found a Lengthening insensitive property : Sudoku-PT-AN11-LTLCardinality-01
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.6 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 41 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2023-03-19 09:36:01] [INFO ] Computed 32 place invariants in 32 ms
[2023-03-19 09:36:01] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-19 09:36:01] [INFO ] Invariant cache hit.
[2023-03-19 09:36:02] [INFO ] Implicit Places using invariants and state equation in 1046 ms returned []
Implicit Place search using SMT with State Equation took 1331 ms to find 0 implicit places.
[2023-03-19 09:36:02] [INFO ] Invariant cache hit.
[2023-03-19 09:36:02] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1799 ms. Remains : 363/1694 places, 1331/1331 transitions.
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 2 (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 946 reset in 9084 ms.
Product exploration explored 100000 steps with 946 reset in 9160 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 894 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 246447 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 246447 steps, saw 126947 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 09:36:39] [INFO ] Invariant cache hit.
[2023-03-19 09:36:39] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 19 ms returned sat
[2023-03-19 09:36:40] [INFO ] After 1039ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:36:40] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 19 ms returned sat
[2023-03-19 09:36:41] [INFO ] After 712ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:36:41] [INFO ] After 770ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-19 09:36:41] [INFO ] After 871ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 120 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 18 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 09:36:41] [INFO ] Invariant cache hit.
[2023-03-19 09:36:41] [INFO ] Implicit Places using invariants in 248 ms returned []
[2023-03-19 09:36:41] [INFO ] Invariant cache hit.
[2023-03-19 09:36:42] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1244 ms to find 0 implicit places.
[2023-03-19 09:36:42] [INFO ] Invariant cache hit.
[2023-03-19 09:36:43] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1667 ms. Remains : 363/363 places, 1331/1331 transitions.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 880 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 246465 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 246465 steps, saw 126953 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 09:37:01] [INFO ] Invariant cache hit.
[2023-03-19 09:37:01] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 19 ms returned sat
[2023-03-19 09:37:02] [INFO ] After 1040ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 09:37:02] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 18 ms returned sat
[2023-03-19 09:37:03] [INFO ] After 731ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 09:37:03] [INFO ] After 785ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-19 09:37:03] [INFO ] After 891ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 120 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 945 reset in 9155 ms.
Product exploration explored 100000 steps with 945 reset in 9216 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 16 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 09:37:22] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-19 09:37:22] [INFO ] Invariant cache hit.
[2023-03-19 09:37:23] [INFO ] Dead Transitions using invariants and state equation in 458 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 505 ms. Remains : 363/363 places, 1331/1331 transitions.
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 11 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 09:37:23] [INFO ] Invariant cache hit.
[2023-03-19 09:37:23] [INFO ] Implicit Places using invariants in 243 ms returned []
[2023-03-19 09:37:23] [INFO ] Invariant cache hit.
[2023-03-19 09:37:24] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 1255 ms to find 0 implicit places.
[2023-03-19 09:37:24] [INFO ] Invariant cache hit.
[2023-03-19 09:37:24] [INFO ] Dead Transitions using invariants and state equation in 404 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1682 ms. Remains : 363/363 places, 1331/1331 transitions.
Treatment of property Sudoku-PT-AN11-LTLCardinality-01 finished in 84013 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(F(p0)))'
Found a Shortening insensitive property : Sudoku-PT-AN11-LTLCardinality-04
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 24 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2023-03-19 09:37:25] [INFO ] Computed 363 place invariants in 11 ms
[2023-03-19 09:37:25] [INFO ] Implicit Places using invariants in 597 ms returned []
[2023-03-19 09:37:25] [INFO ] Invariant cache hit.
[2023-03-19 09:37:27] [INFO ] Implicit Places using invariants and state equation in 1476 ms returned []
Implicit Place search using SMT with State Equation took 2077 ms to find 0 implicit places.
[2023-03-19 09:37:27] [INFO ] Invariant cache hit.
[2023-03-19 09:37:27] [INFO ] Dead Transitions using invariants and state equation in 697 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2799 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], 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, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration timeout after 59030 steps with 952 reset in 10001 ms.
Product exploration timeout after 58660 steps with 946 reset in 10003 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
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 240 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=5 )
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 196 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2023-03-19 09:38:52] [INFO ] Invariant cache hit.
[2023-03-19 09:39:04] [INFO ] [Real]Absence check using 363 positive place invariants in 156 ms returned sat
[2023-03-19 09:39:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 09:39:06] [INFO ] [Real]Absence check using state equation in 1590 ms returned sat
[2023-03-19 09:39:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 09:39:21] [INFO ] [Nat]Absence check using 363 positive place invariants in 4629 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 18 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 09:39:21] [INFO ] Invariant cache hit.
[2023-03-19 09:39:21] [INFO ] Implicit Places using invariants in 570 ms returned []
[2023-03-19 09:39:21] [INFO ] Invariant cache hit.
[2023-03-19 09:39:23] [INFO ] Implicit Places using invariants and state equation in 1520 ms returned []
Implicit Place search using SMT with State Equation took 2092 ms to find 0 implicit places.
[2023-03-19 09:39:23] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-19 09:39:23] [INFO ] Invariant cache hit.
[2023-03-19 09:39:23] [INFO ] Dead Transitions using invariants and state equation in 694 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2834 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
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 150 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0)]
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=5 )
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 165 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2023-03-19 09:40:26] [INFO ] Invariant cache hit.
[2023-03-19 09:40:38] [INFO ] [Real]Absence check using 363 positive place invariants in 164 ms returned sat
[2023-03-19 09:40:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 09:40:39] [INFO ] [Real]Absence check using state equation in 1680 ms returned sat
[2023-03-19 09:40:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 09:40:54] [INFO ] [Nat]Absence check using 363 positive place invariants in 4878 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration timeout after 60590 steps with 977 reset in 10002 ms.
Product exploration timeout after 59910 steps with 966 reset in 10002 ms.
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 18 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-19 09:41:14] [INFO ] Invariant cache hit.
[2023-03-19 09:41:15] [INFO ] Implicit Places using invariants in 582 ms returned []
[2023-03-19 09:41:15] [INFO ] Invariant cache hit.
[2023-03-19 09:41:16] [INFO ] Implicit Places using invariants and state equation in 1437 ms returned []
Implicit Place search using SMT with State Equation took 2023 ms to find 0 implicit places.
[2023-03-19 09:41:16] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-19 09:41:16] [INFO ] Invariant cache hit.
[2023-03-19 09:41:17] [INFO ] Dead Transitions using invariants and state equation in 688 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2755 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Treatment of property Sudoku-PT-AN11-LTLCardinality-04 finished in 232820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(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)))'
[2023-03-19 09:41:18] [INFO ] Flatten gal took : 71 ms
[2023-03-19 09:41:18] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-19 09:41:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1694 places, 1331 transitions and 5324 arcs took 7 ms.
Total runtime 1089476 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1882/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 892 seconds
MemTotal: 16393216 kB
MemFree: 16015292 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16074548 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1882/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 892 seconds
MemTotal: 16393216 kB
MemFree: 15988412 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16067192 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1882/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15942796 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16025468 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-PT-AN11"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is Sudoku-PT-AN11, 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 r489-tall-167912706500243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN11.tgz
mv Sudoku-PT-AN11 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;