About the Execution of LoLa+red for Sudoku-PT-BN16
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16111.336 | 2271162.00 | 3284559.00 | 27645.90 | T?TFTTT?FFFFTTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r487-tall-167912702900315.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Sudoku-PT-BN16, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912702900315
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 104M
-rw-r--r-- 1 mcc users 1.3M Feb 26 09:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 5.7M Feb 26 09:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5M Feb 26 08:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 23M Feb 26 08:50 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 473K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.6M Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4M Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.6M Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.6M Feb 26 11:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 12M Feb 26 11:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8M Feb 26 09:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33M Feb 26 09:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 29K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 73K Feb 25 17:17 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 2.7M 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-BN16-LTLCardinality-00
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-01
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-02
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-03
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-04
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-05
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-06
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-07
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-08
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-09
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-10
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-11
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-12
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-13
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-14
FORMULA_NAME Sudoku-PT-BN16-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679184395574
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-BN16
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 00:06:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 00:06:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 00:06:37] [INFO ] Load time of PNML (sax parser for PT used): 238 ms
[2023-03-19 00:06:37] [INFO ] Transformed 5120 places.
[2023-03-19 00:06:37] [INFO ] Transformed 4096 transitions.
[2023-03-19 00:06:37] [INFO ] Parsed PT model containing 5120 places and 4096 transitions and 20480 arcs in 335 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 341 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA Sudoku-PT-BN16-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN16-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN16-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN16-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN16-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN16-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN16-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5120 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 43 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 5120 cols
[2023-03-19 00:06:38] [INFO ] Computed 1024 place invariants in 66 ms
[2023-03-19 00:06:38] [INFO ] Implicit Places using invariants in 724 ms returned []
[2023-03-19 00:06:38] [INFO ] Invariant cache hit.
[2023-03-19 00:06:39] [INFO ] Implicit Places using invariants and state equation in 572 ms returned []
Implicit Place search using SMT with State Equation took 1321 ms to find 0 implicit places.
[2023-03-19 00:06:39] [INFO ] Invariant cache hit.
[2023-03-19 00:06:42] [INFO ] Dead Transitions using invariants and state equation in 2690 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4057 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Support contains 5120 out of 5120 places after structural reductions.
[2023-03-19 00:06:42] [INFO ] Flatten gal took : 468 ms
[2023-03-19 00:06:43] [INFO ] Flatten gal took : 252 ms
[2023-03-19 00:06:44] [INFO ] Input system was already deterministic with 4096 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 4912 ms. (steps per millisecond=2 ) properties (out of 20) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-19 00:06:50] [INFO ] Invariant cache hit.
[2023-03-19 00:06:52] [INFO ] [Real]Absence check using 1024 positive place invariants in 365 ms returned sat
[2023-03-19 00:07:15] [INFO ] After 25034ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 00:07:17] [INFO ] [Nat]Absence check using 1024 positive place invariants in 351 ms returned sat
[2023-03-19 00:07:40] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 768 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Graph (complete) has 16384 edges and 5120 vertex of which 1024 are kept as prefixes of interest. Removing 4096 places using SCC suffix rule.10 ms
Discarding 4096 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 143 ms. Remains 1024 /5120 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 1024/5120 places, 4096/4096 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 4565 ms. (steps per millisecond=2 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 173743 steps, run timeout after 15008 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 173743 steps, saw 173688 distinct states, run finished after 15011 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 4096 rows 1024 cols
[2023-03-19 00:08:02] [INFO ] Computed 168 place invariants in 831 ms
[2023-03-19 00:08:03] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 136 ms returned sat
[2023-03-19 00:08:03] [INFO ] After 419ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 00:08:03] [INFO ] [Nat]Absence check using 0 positive and 168 generalized place invariants in 138 ms returned sat
[2023-03-19 00:08:15] [INFO ] After 12297ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 256 out of 1024 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 281 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 281 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 3512 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Probabilistic random walk after 365728 steps, saw 365585 distinct states, run finished after 9007 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 00:08:28] [INFO ] Invariant cache hit.
[2023-03-19 00:08:29] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 128 ms returned sat
[2023-03-19 00:08:38] [INFO ] After 9210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 00:08:38] [INFO ] [Nat]Absence check using 0 positive and 168 generalized place invariants in 129 ms returned sat
[2023-03-19 00:08:44] [INFO ] After 6506ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 00:08:44] [INFO ] After 6652ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-19 00:08:45] [INFO ] After 7005ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 254 steps, including 0 resets, run visited all 1 properties in 22 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 24 ms.
Successfully simplified 5 atomic propositions for a total of 9 simplifications.
FORMULA Sudoku-PT-BN16-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN16-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/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(((X((p0||X(p1)))&&G(p2))||G((p0||X(p1)))))))'
Support contains 4864 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 46 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 5120 cols
[2023-03-19 00:08:45] [INFO ] Computed 1024 place invariants in 22 ms
[2023-03-19 00:08:46] [INFO ] Implicit Places using invariants in 875 ms returned []
[2023-03-19 00:08:46] [INFO ] Invariant cache hit.
[2023-03-19 00:08:47] [INFO ] Implicit Places using invariants and state equation in 900 ms returned []
Implicit Place search using SMT with State Equation took 1777 ms to find 0 implicit places.
[2023-03-19 00:08:47] [INFO ] Invariant cache hit.
[2023-03-19 00:08:50] [INFO ] Dead Transitions using invariants and state equation in 2914 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4738 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 625 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-BN16-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p2 p0), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 p0), acceptance={0} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 4}, { cond=(AND p2 p0), acceptance={} source=1 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p2 p0 p1), acceptance={0} source=2 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=2 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 4}, { cond=(AND p2 p0 p1), acceptance={} source=2 dest: 5}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=2 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=2 dest: 6}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 7}, { cond=(AND p2 (NOT p0)), acceptance={0} source=3 dest: 8}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=4 dest: 7}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 7}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=4 dest: 8}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 8}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=4 dest: 9}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=4 dest: 9}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND p2 p0 p1), acceptance={} source=6 dest: 5}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=6 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=6 dest: 6}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=6 dest: 6}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=7 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=7 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={0, 1} source=7 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0, 1} source=7 dest: 4}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=7 dest: 5}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=7 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=8 dest: 7}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0, 1} source=8 dest: 8}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=8 dest: 9}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=9 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=9 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=9 dest: 5}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=9 dest: 6}]], initial=0, aps=[p2:(GT (ADD s4352 s4353 s4354 s4355 s4356 s4357 s4358 s4359 s4360 s4361 s4362 s4363 s4364 s4365 s4366 s4367 s4368 s4369 s4370 s4371 s4372 s4373 s4374 s437...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 5860 steps with 27 reset in 10014 ms.
Product exploration timeout after 5820 steps with 27 reset in 10018 ms.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (AND p2 (NOT p0) (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 1168 ms. Reduced automaton from 10 states, 57 edges and 3 AP (stutter sensitive) to 15 states, 83 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 672 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
Incomplete random walk after 10000 steps, including 47 resets, run finished after 9274 ms. (steps per millisecond=1 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1446 ms. (steps per millisecond=6 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2702 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1440 ms. (steps per millisecond=6 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2710 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2693 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2711 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2686 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2531 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-19 00:09:49] [INFO ] Invariant cache hit.
[2023-03-19 00:09:57] [INFO ] [Real]Absence check using 1024 positive place invariants in 350 ms returned sat
[2023-03-19 00:10:20] [INFO ] After 25023ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 00:10:22] [INFO ] [Nat]Absence check using 1024 positive place invariants in 344 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 00:10:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 00:10:46] [INFO ] After 25057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4864 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 58 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 9109 ms. (steps per millisecond=1 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1487 ms. (steps per millisecond=6 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2706 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1437 ms. (steps per millisecond=6 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2692 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2689 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2661 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2649 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2488 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Probabilistic random walk after 182733 steps, saw 182680 distinct states, run finished after 81146 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-19 00:12:35] [INFO ] Invariant cache hit.
[2023-03-19 00:12:43] [INFO ] [Real]Absence check using 1024 positive place invariants in 339 ms returned sat
[2023-03-19 00:13:06] [INFO ] After 25024ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 00:13:08] [INFO ] [Nat]Absence check using 1024 positive place invariants in 341 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 00:13:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 00:13:31] [INFO ] After 25051ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4864 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 44 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 42 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 00:13:31] [INFO ] Invariant cache hit.
[2023-03-19 00:13:32] [INFO ] Implicit Places using invariants in 823 ms returned []
[2023-03-19 00:13:32] [INFO ] Invariant cache hit.
[2023-03-19 00:13:33] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 1721 ms to find 0 implicit places.
[2023-03-19 00:13:33] [INFO ] Redundant transitions in 293 ms returned []
[2023-03-19 00:13:33] [INFO ] Invariant cache hit.
[2023-03-19 00:13:36] [INFO ] Dead Transitions using invariants and state equation in 2915 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4978 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (AND p2 (NOT p0) (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1) (NOT p0)))), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND (NOT p2) p1 (NOT p0))), (F (NOT p2)), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 16 factoid took 1246 ms. Reduced automaton from 15 states, 83 edges and 3 AP (stutter insensitive) to 15 states, 83 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 751 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 690 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
[2023-03-19 00:13:41] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4864 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 73 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 00:13:56] [INFO ] Invariant cache hit.
[2023-03-19 00:13:57] [INFO ] Implicit Places using invariants in 815 ms returned []
[2023-03-19 00:13:57] [INFO ] Invariant cache hit.
[2023-03-19 00:13:58] [INFO ] Implicit Places using invariants and state equation in 890 ms returned []
Implicit Place search using SMT with State Equation took 1710 ms to find 0 implicit places.
[2023-03-19 00:13:58] [INFO ] Redundant transitions in 235 ms returned []
[2023-03-19 00:13:58] [INFO ] Invariant cache hit.
[2023-03-19 00:14:01] [INFO ] Dead Transitions using invariants and state equation in 2673 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4709 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X p2), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 p1 p0))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1079 ms. Reduced automaton from 15 states, 83 edges and 3 AP (stutter insensitive) to 15 states, 83 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 625 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
Incomplete random walk after 10000 steps, including 47 resets, run finished after 9029 ms. (steps per millisecond=1 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1451 ms. (steps per millisecond=6 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2693 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1445 ms. (steps per millisecond=6 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2745 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2686 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2691 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2693 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2543 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-19 00:14:41] [INFO ] Invariant cache hit.
[2023-03-19 00:14:49] [INFO ] [Real]Absence check using 1024 positive place invariants in 345 ms returned sat
[2023-03-19 00:15:13] [INFO ] After 25016ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 00:15:14] [INFO ] [Nat]Absence check using 1024 positive place invariants in 343 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 00:15:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 00:15:38] [INFO ] After 25053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4864 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 52 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 11820 ms. (steps per millisecond=0 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1441 ms. (steps per millisecond=6 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2686 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1443 ms. (steps per millisecond=6 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2708 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2702 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2691 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2690 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2533 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Probabilistic random walk after 205075 steps, saw 205015 distinct states, run finished after 90073 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-19 00:17:39] [INFO ] Invariant cache hit.
[2023-03-19 00:17:47] [INFO ] [Real]Absence check using 1024 positive place invariants in 354 ms returned sat
[2023-03-19 00:18:10] [INFO ] After 25033ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 00:18:12] [INFO ] [Nat]Absence check using 1024 positive place invariants in 363 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 00:18:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 00:18:35] [INFO ] After 25042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4864 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 46 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 42 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 00:18:35] [INFO ] Invariant cache hit.
[2023-03-19 00:18:36] [INFO ] Implicit Places using invariants in 789 ms returned []
[2023-03-19 00:18:36] [INFO ] Invariant cache hit.
[2023-03-19 00:18:37] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 1655 ms to find 0 implicit places.
[2023-03-19 00:18:37] [INFO ] Redundant transitions in 127 ms returned []
[2023-03-19 00:18:37] [INFO ] Invariant cache hit.
[2023-03-19 00:18:40] [INFO ] Dead Transitions using invariants and state equation in 2759 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4588 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X p2), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 p1 p0))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1) (NOT p0)))), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND (NOT p2) p1 (NOT p0))), (F (NOT p2)), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 17 factoid took 1293 ms. Reduced automaton from 15 states, 83 edges and 3 AP (stutter insensitive) to 15 states, 83 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 633 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 698 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
[2023-03-19 00:18:45] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 684 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
Product exploration timeout after 4860 steps with 23 reset in 10002 ms.
Product exploration timeout after 4800 steps with 22 reset in 10017 ms.
Support contains 4864 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 40 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 00:19:21] [INFO ] Invariant cache hit.
[2023-03-19 00:19:21] [INFO ] Implicit Places using invariants in 911 ms returned []
[2023-03-19 00:19:21] [INFO ] Invariant cache hit.
[2023-03-19 00:19:22] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1712 ms to find 0 implicit places.
[2023-03-19 00:19:22] [INFO ] Redundant transitions in 123 ms returned []
[2023-03-19 00:19:22] [INFO ] Invariant cache hit.
[2023-03-19 00:19:25] [INFO ] Dead Transitions using invariants and state equation in 2777 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4660 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Treatment of property Sudoku-PT-BN16-LTLCardinality-01 finished in 640751 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 164 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 00:19:26] [INFO ] Invariant cache hit.
[2023-03-19 00:19:27] [INFO ] Implicit Places using invariants in 1701 ms returned []
[2023-03-19 00:19:28] [INFO ] Invariant cache hit.
[2023-03-19 00:19:29] [INFO ] Implicit Places using invariants and state equation in 1796 ms returned []
Implicit Place search using SMT with State Equation took 3499 ms to find 0 implicit places.
[2023-03-19 00:19:29] [INFO ] Redundant transitions in 130 ms returned []
[2023-03-19 00:19:29] [INFO ] Invariant cache hit.
[2023-03-19 00:19:32] [INFO ] Dead Transitions using invariants and state equation in 2852 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6655 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN16-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 (ADD s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 s280 s281 s282 s283...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 20910 steps with 702 reset in 10001 ms.
Product exploration timeout after 20870 steps with 696 reset in 10002 ms.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2023-03-19 00:19:56] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 164 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 00:20:12] [INFO ] Invariant cache hit.
[2023-03-19 00:20:13] [INFO ] Implicit Places using invariants in 1754 ms returned []
[2023-03-19 00:20:13] [INFO ] Invariant cache hit.
[2023-03-19 00:20:15] [INFO ] Implicit Places using invariants and state equation in 1806 ms returned []
Implicit Place search using SMT with State Equation took 3562 ms to find 0 implicit places.
[2023-03-19 00:20:15] [INFO ] Redundant transitions in 126 ms returned []
[2023-03-19 00:20:15] [INFO ] Invariant cache hit.
[2023-03-19 00:20:18] [INFO ] Dead Transitions using invariants and state equation in 2704 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6566 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2023-03-19 00:20:22] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 21130 steps with 652 reset in 10004 ms.
Product exploration timeout after 21120 steps with 659 reset in 10003 ms.
Support contains 4096 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 158 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 00:20:58] [INFO ] Invariant cache hit.
[2023-03-19 00:20:59] [INFO ] Implicit Places using invariants in 1755 ms returned []
[2023-03-19 00:20:59] [INFO ] Invariant cache hit.
[2023-03-19 00:21:01] [INFO ] Implicit Places using invariants and state equation in 1834 ms returned []
Implicit Place search using SMT with State Equation took 3592 ms to find 0 implicit places.
[2023-03-19 00:21:01] [INFO ] Redundant transitions in 127 ms returned []
[2023-03-19 00:21:01] [INFO ] Invariant cache hit.
[2023-03-19 00:21:04] [INFO ] Dead Transitions using invariants and state equation in 2887 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6770 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Treatment of property Sudoku-PT-BN16-LTLCardinality-07 finished in 98918 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(F(p1))&&p0)))'
Support contains 5 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Reduce places removed 4095 places and 0 transitions.
Iterating post reduction 0 with 4095 rules applied. Total rules applied 4095 place count 1025 transition count 4096
Applied a total of 4095 rules in 301 ms. Remains 1025 /5120 variables (removed 4095) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 1025 cols
[2023-03-19 00:21:05] [INFO ] Computed 168 place invariants in 481 ms
[2023-03-19 00:21:07] [INFO ] Implicit Places using invariants in 1780 ms returned []
[2023-03-19 00:21:07] [INFO ] Invariant cache hit.
[2023-03-19 00:21:13] [INFO ] Implicit Places using invariants and state equation in 6218 ms returned []
Implicit Place search using SMT with State Equation took 8000 ms to find 0 implicit places.
[2023-03-19 00:21:13] [INFO ] Invariant cache hit.
[2023-03-19 00:21:14] [INFO ] Dead Transitions using invariants and state equation in 1387 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1025/5120 places, 4096/4096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9689 ms. Remains : 1025/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-PT-BN16-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GT 1 s1014) (GT s769 s39)), p1:(LEQ s256 s427)], 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 1 steps with 0 reset in 4 ms.
FORMULA Sudoku-PT-BN16-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLCardinality-08 finished in 9895 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((p0&&X(p0))))'
Support contains 1 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Graph (complete) has 16384 edges and 5120 vertex of which 1016 are kept as prefixes of interest. Removing 4104 places using SCC suffix rule.9 ms
Discarding 4104 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 324 ms. Remains 1016 /5120 variables (removed 4104) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 1016 cols
[2023-03-19 00:21:15] [INFO ] Computed 163 place invariants in 362 ms
[2023-03-19 00:21:16] [INFO ] Implicit Places using invariants in 1618 ms returned []
[2023-03-19 00:21:16] [INFO ] Invariant cache hit.
[2023-03-19 00:21:28] [INFO ] Implicit Places using invariants and state equation in 12022 ms returned []
Implicit Place search using SMT with State Equation took 13643 ms to find 0 implicit places.
[2023-03-19 00:21:29] [INFO ] Redundant transitions in 307 ms returned []
[2023-03-19 00:21:29] [INFO ] Invariant cache hit.
[2023-03-19 00:21:30] [INFO ] Dead Transitions using invariants and state equation in 1402 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1016/5120 places, 4096/4096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15697 ms. Remains : 1016/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN16-LTLCardinality-09 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}]], initial=1, aps=[p0:(LEQ 1 s543)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 107 steps with 0 reset in 65 ms.
FORMULA Sudoku-PT-BN16-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLCardinality-09 finished in 15835 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))&&G(p1))))'
Support contains 3 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Reduce places removed 4096 places and 0 transitions.
Iterating post reduction 0 with 4096 rules applied. Total rules applied 4096 place count 1024 transition count 4096
Applied a total of 4096 rules in 231 ms. Remains 1024 /5120 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 1024 cols
[2023-03-19 00:21:31] [INFO ] Computed 168 place invariants in 656 ms
[2023-03-19 00:21:32] [INFO ] Implicit Places using invariants in 1987 ms returned []
[2023-03-19 00:21:33] [INFO ] Invariant cache hit.
[2023-03-19 00:21:37] [INFO ] Implicit Places using invariants and state equation in 4799 ms returned []
Implicit Place search using SMT with State Equation took 6789 ms to find 0 implicit places.
[2023-03-19 00:21:37] [INFO ] Invariant cache hit.
[2023-03-19 00:21:39] [INFO ] Dead Transitions using invariants and state equation in 1465 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1024/5120 places, 4096/4096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8485 ms. Remains : 1024/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-BN16-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(GT s11 s544), p0:(LEQ 1 s917)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 7 ms.
FORMULA Sudoku-PT-BN16-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLCardinality-11 finished in 8652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!X(!p0) U p1))'
Support contains 3 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Reduce places removed 4095 places and 0 transitions.
Iterating post reduction 0 with 4095 rules applied. Total rules applied 4095 place count 1025 transition count 4096
Applied a total of 4095 rules in 239 ms. Remains 1025 /5120 variables (removed 4095) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 1025 cols
[2023-03-19 00:21:39] [INFO ] Computed 168 place invariants in 321 ms
[2023-03-19 00:21:41] [INFO ] Implicit Places using invariants in 1663 ms returned []
[2023-03-19 00:21:41] [INFO ] Invariant cache hit.
[2023-03-19 00:21:45] [INFO ] Implicit Places using invariants and state equation in 4465 ms returned []
Implicit Place search using SMT with State Equation took 6134 ms to find 0 implicit places.
[2023-03-19 00:21:45] [INFO ] Invariant cache hit.
[2023-03-19 00:21:47] [INFO ] Dead Transitions using invariants and state equation in 1423 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1025/5120 places, 4096/4096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7798 ms. Remains : 1025/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-BN16-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GT 1 s945), p0:(LEQ s14 s256)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 6 ms.
FORMULA Sudoku-PT-BN16-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLCardinality-14 finished in 7921 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G((p1 U p2)))))))'
Support contains 5 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Reduce places removed 4096 places and 0 transitions.
Iterating post reduction 0 with 4096 rules applied. Total rules applied 4096 place count 1024 transition count 4096
Applied a total of 4096 rules in 231 ms. Remains 1024 /5120 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 1024 cols
[2023-03-19 00:21:48] [INFO ] Computed 168 place invariants in 639 ms
[2023-03-19 00:21:49] [INFO ] Implicit Places using invariants in 1970 ms returned []
[2023-03-19 00:21:49] [INFO ] Invariant cache hit.
[2023-03-19 00:21:53] [INFO ] Implicit Places using invariants and state equation in 4099 ms returned []
Implicit Place search using SMT with State Equation took 6071 ms to find 0 implicit places.
[2023-03-19 00:21:53] [INFO ] Invariant cache hit.
[2023-03-19 00:21:55] [INFO ] Dead Transitions using invariants and state equation in 1477 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1024/5120 places, 4096/4096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7781 ms. Remains : 1024/5120 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Sudoku-PT-BN16-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT s556 s383), p2:(LEQ 1 s890), p1:(LEQ s423 s684)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 207 steps with 0 reset in 72 ms.
FORMULA Sudoku-PT-BN16-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLCardinality-15 finished in 8048 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(((X((p0||X(p1)))&&G(p2))||G((p0||X(p1)))))))'
Found a Lengthening insensitive property : Sudoku-PT-BN16-LTLCardinality-01
Stuttering acceptance computed with spot in 457 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 4864 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 54 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 5120 cols
[2023-03-19 00:21:56] [INFO ] Computed 1024 place invariants in 26 ms
[2023-03-19 00:21:56] [INFO ] Implicit Places using invariants in 844 ms returned []
[2023-03-19 00:21:56] [INFO ] Invariant cache hit.
[2023-03-19 00:21:57] [INFO ] Implicit Places using invariants and state equation in 808 ms returned []
Implicit Place search using SMT with State Equation took 1652 ms to find 0 implicit places.
[2023-03-19 00:21:57] [INFO ] Invariant cache hit.
[2023-03-19 00:22:00] [INFO ] Dead Transitions using invariants and state equation in 2762 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4468 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Running random walk in product with property : Sudoku-PT-BN16-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p2 p0), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 p0), acceptance={0} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 4}, { cond=(AND p2 p0), acceptance={} source=1 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p2 p0 p1), acceptance={0} source=2 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=2 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 4}, { cond=(AND p2 p0 p1), acceptance={} source=2 dest: 5}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=2 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=2 dest: 6}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 7}, { cond=(AND p2 (NOT p0)), acceptance={0} source=3 dest: 8}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=4 dest: 7}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 7}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=4 dest: 8}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 8}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=4 dest: 9}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=4 dest: 9}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND p2 p0 p1), acceptance={} source=6 dest: 5}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=6 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=6 dest: 6}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=6 dest: 6}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=7 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=7 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={0, 1} source=7 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0, 1} source=7 dest: 4}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=7 dest: 5}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=7 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=8 dest: 7}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0, 1} source=8 dest: 8}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=8 dest: 9}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=9 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=9 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=9 dest: 5}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=9 dest: 6}]], initial=0, aps=[p2:(GT (ADD s4352 s4353 s4354 s4355 s4356 s4357 s4358 s4359 s4360 s4361 s4362 s4363 s4364 s4365 s4366 s4367 s4368 s4369 s4370 s4371 s4372 s4373 s4374 s437...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 5880 steps with 27 reset in 10010 ms.
Product exploration timeout after 5880 steps with 27 reset in 10004 ms.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (AND p2 (NOT p0) (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 1195 ms. Reduced automaton from 10 states, 57 edges and 3 AP (stutter sensitive) to 15 states, 83 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 657 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
Incomplete random walk after 10000 steps, including 47 resets, run finished after 9194 ms. (steps per millisecond=1 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1416 ms. (steps per millisecond=7 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2637 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1421 ms. (steps per millisecond=7 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2661 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2679 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2661 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2665 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2530 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-19 00:22:58] [INFO ] Invariant cache hit.
[2023-03-19 00:23:07] [INFO ] [Real]Absence check using 1024 positive place invariants in 334 ms returned sat
[2023-03-19 00:23:30] [INFO ] After 25017ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 00:23:32] [INFO ] [Nat]Absence check using 1024 positive place invariants in 343 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 00:23:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 00:23:55] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4864 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 37 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 8937 ms. (steps per millisecond=1 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1386 ms. (steps per millisecond=7 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2639 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1420 ms. (steps per millisecond=7 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2644 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2658 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2634 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2628 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2498 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Probabilistic random walk after 193977 steps, saw 193921 distinct states, run finished after 81118 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-19 00:25:44] [INFO ] Invariant cache hit.
[2023-03-19 00:25:52] [INFO ] [Real]Absence check using 1024 positive place invariants in 344 ms returned sat
[2023-03-19 00:26:15] [INFO ] After 25033ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 00:26:17] [INFO ] [Nat]Absence check using 1024 positive place invariants in 347 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:621)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 00:26:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 00:26:40] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4864 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 37 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 35 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 00:26:40] [INFO ] Invariant cache hit.
[2023-03-19 00:26:41] [INFO ] Implicit Places using invariants in 846 ms returned []
[2023-03-19 00:26:41] [INFO ] Invariant cache hit.
[2023-03-19 00:26:42] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1725 ms to find 0 implicit places.
[2023-03-19 00:26:42] [INFO ] Redundant transitions in 152 ms returned []
[2023-03-19 00:26:42] [INFO ] Invariant cache hit.
[2023-03-19 00:26:45] [INFO ] Dead Transitions using invariants and state equation in 2915 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4837 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (AND p2 (NOT p0) (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1) (NOT p0)))), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND (NOT p2) p1 (NOT p0))), (F (NOT p2)), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 16 factoid took 1156 ms. Reduced automaton from 15 states, 83 edges and 3 AP (stutter insensitive) to 15 states, 83 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 667 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 650 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
[2023-03-19 00:26:49] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4864 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 45 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 00:27:04] [INFO ] Invariant cache hit.
[2023-03-19 00:27:05] [INFO ] Implicit Places using invariants in 861 ms returned []
[2023-03-19 00:27:05] [INFO ] Invariant cache hit.
[2023-03-19 00:27:06] [INFO ] Implicit Places using invariants and state equation in 813 ms returned []
Implicit Place search using SMT with State Equation took 1676 ms to find 0 implicit places.
[2023-03-19 00:27:06] [INFO ] Redundant transitions in 155 ms returned []
[2023-03-19 00:27:06] [INFO ] Invariant cache hit.
[2023-03-19 00:27:09] [INFO ] Dead Transitions using invariants and state equation in 2685 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4569 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Computed a total of 5120 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5120 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X p2), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 p1 p0))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1049 ms. Reduced automaton from 15 states, 83 edges and 3 AP (stutter insensitive) to 15 states, 83 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 651 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
Incomplete random walk after 10000 steps, including 47 resets, run finished after 8957 ms. (steps per millisecond=1 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1482 ms. (steps per millisecond=6 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2623 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1411 ms. (steps per millisecond=7 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2651 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2624 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2632 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2630 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2491 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-19 00:27:49] [INFO ] Invariant cache hit.
[2023-03-19 00:27:56] [INFO ] [Real]Absence check using 1024 positive place invariants in 340 ms returned sat
[2023-03-19 00:28:19] [INFO ] After 25029ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 00:28:21] [INFO ] [Nat]Absence check using 1024 positive place invariants in 344 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 00:28:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 00:28:44] [INFO ] After 25042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4864 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 40 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Incomplete random walk after 10000 steps, including 47 resets, run finished after 9048 ms. (steps per millisecond=1 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1409 ms. (steps per millisecond=7 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2638 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1409 ms. (steps per millisecond=7 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2631 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2624 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2630 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2634 ms. (steps per millisecond=3 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2492 ms. (steps per millisecond=4 ) properties (out of 8) seen :0
Probabilistic random walk after 195311 steps, saw 195254 distinct states, run finished after 81135 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-19 00:30:33] [INFO ] Invariant cache hit.
[2023-03-19 00:30:39] [INFO ] [Real]Absence check using 1024 positive place invariants in 351 ms returned sat
[2023-03-19 00:31:03] [INFO ] After 25031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 00:31:04] [INFO ] [Nat]Absence check using 1024 positive place invariants in 333 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 00:31:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 00:31:28] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4864 out of 5120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 33 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 32 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 00:31:28] [INFO ] Invariant cache hit.
[2023-03-19 00:31:29] [INFO ] Implicit Places using invariants in 804 ms returned []
[2023-03-19 00:31:29] [INFO ] Invariant cache hit.
[2023-03-19 00:31:29] [INFO ] Implicit Places using invariants and state equation in 801 ms returned []
Implicit Place search using SMT with State Equation took 1628 ms to find 0 implicit places.
[2023-03-19 00:31:30] [INFO ] Redundant transitions in 149 ms returned []
[2023-03-19 00:31:30] [INFO ] Invariant cache hit.
[2023-03-19 00:31:32] [INFO ] Dead Transitions using invariants and state equation in 2696 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4517 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X p2), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p1 (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 p1 p0))), (X (AND p2 (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1) (NOT p0)))), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p2) (NOT p1) (NOT p0))), (F (AND (NOT p2) p1 (NOT p0))), (F (NOT p2)), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 17 factoid took 1204 ms. Reduced automaton from 15 states, 83 edges and 3 AP (stutter insensitive) to 15 states, 83 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 624 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 616 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
[2023-03-19 00:32:16] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 2258 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), false, false, (AND p2 (NOT p0) (NOT p1)), false, false, false]
Product exploration timeout after 4860 steps with 23 reset in 10018 ms.
Product exploration timeout after 4860 steps with 22 reset in 10002 ms.
Support contains 4864 out of 5120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Applied a total of 0 rules in 46 ms. Remains 5120 /5120 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2023-03-19 00:32:54] [INFO ] Invariant cache hit.
[2023-03-19 00:32:55] [INFO ] Implicit Places using invariants in 1407 ms returned []
[2023-03-19 00:32:55] [INFO ] Invariant cache hit.
[2023-03-19 00:32:56] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 2256 ms to find 0 implicit places.
[2023-03-19 00:32:56] [INFO ] Redundant transitions in 149 ms returned []
[2023-03-19 00:32:56] [INFO ] Invariant cache hit.
[2023-03-19 00:32:59] [INFO ] Dead Transitions using invariants and state equation in 2644 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5123 ms. Remains : 5120/5120 places, 4096/4096 transitions.
Treatment of property Sudoku-PT-BN16-LTLCardinality-01 finished in 664067 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)))'
[2023-03-19 00:33:00] [INFO ] Flatten gal took : 401 ms
[2023-03-19 00:33:00] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 14 ms.
[2023-03-19 00:33:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5120 places, 4096 transitions and 20480 arcs took 27 ms.
Total runtime 1583301 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Sudoku-PT-BN16
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
LTLCardinality
BK_STOP 1679186666736
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 Sudoku-PT-BN16-LTLCardinality-01
lola: time limit : 1796 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 2/1796 1/32 Sudoku-PT-BN16-LTLCardinality-01 12644 m, 2528 m/sec, 73898 t fired, .
Time elapsed: 9 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 7/1796 1/32 Sudoku-PT-BN16-LTLCardinality-01 39933 m, 5457 m/sec, 275485 t fired, .
Time elapsed: 14 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 12/1796 1/32 Sudoku-PT-BN16-LTLCardinality-01 65565 m, 5126 m/sec, 478907 t fired, .
Time elapsed: 19 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 17/1796 2/32 Sudoku-PT-BN16-LTLCardinality-01 88210 m, 4529 m/sec, 686709 t fired, .
Time elapsed: 24 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 22/1796 2/32 Sudoku-PT-BN16-LTLCardinality-01 114107 m, 5179 m/sec, 889876 t fired, .
Time elapsed: 29 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 27/1796 2/32 Sudoku-PT-BN16-LTLCardinality-01 136110 m, 4400 m/sec, 1098531 t fired, .
Time elapsed: 34 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 32/1796 3/32 Sudoku-PT-BN16-LTLCardinality-01 158119 m, 4401 m/sec, 1305727 t fired, .
Time elapsed: 39 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 37/1796 3/32 Sudoku-PT-BN16-LTLCardinality-01 179496 m, 4275 m/sec, 1515139 t fired, .
Time elapsed: 44 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 42/1796 3/32 Sudoku-PT-BN16-LTLCardinality-01 204449 m, 4990 m/sec, 1719742 t fired, .
Time elapsed: 49 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 47/1796 3/32 Sudoku-PT-BN16-LTLCardinality-01 226781 m, 4466 m/sec, 1931208 t fired, .
Time elapsed: 54 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 52/1796 4/32 Sudoku-PT-BN16-LTLCardinality-01 248601 m, 4364 m/sec, 2143597 t fired, .
Time elapsed: 59 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 57/1796 4/32 Sudoku-PT-BN16-LTLCardinality-01 269914 m, 4262 m/sec, 2355971 t fired, .
Time elapsed: 64 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 62/1796 4/32 Sudoku-PT-BN16-LTLCardinality-01 291659 m, 4349 m/sec, 2567270 t fired, .
Time elapsed: 69 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 67/1796 4/32 Sudoku-PT-BN16-LTLCardinality-01 311458 m, 3959 m/sec, 2780856 t fired, .
Time elapsed: 74 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 72/1796 5/32 Sudoku-PT-BN16-LTLCardinality-01 331136 m, 3935 m/sec, 2990957 t fired, .
Time elapsed: 79 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 77/1796 5/32 Sudoku-PT-BN16-LTLCardinality-01 350460 m, 3864 m/sec, 3202003 t fired, .
Time elapsed: 84 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 82/1796 5/32 Sudoku-PT-BN16-LTLCardinality-01 375624 m, 5032 m/sec, 3407134 t fired, .
Time elapsed: 89 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 87/1796 6/32 Sudoku-PT-BN16-LTLCardinality-01 397236 m, 4322 m/sec, 3613479 t fired, .
Time elapsed: 94 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 92/1796 6/32 Sudoku-PT-BN16-LTLCardinality-01 418794 m, 4311 m/sec, 3820750 t fired, .
Time elapsed: 99 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 97/1796 6/32 Sudoku-PT-BN16-LTLCardinality-01 439163 m, 4073 m/sec, 4029430 t fired, .
Time elapsed: 104 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 102/1796 6/32 Sudoku-PT-BN16-LTLCardinality-01 461558 m, 4479 m/sec, 4239294 t fired, .
Time elapsed: 109 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 107/1796 7/32 Sudoku-PT-BN16-LTLCardinality-01 481183 m, 3925 m/sec, 4451228 t fired, .
Time elapsed: 114 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 112/1796 7/32 Sudoku-PT-BN16-LTLCardinality-01 500959 m, 3955 m/sec, 4662018 t fired, .
Time elapsed: 119 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 117/1796 7/32 Sudoku-PT-BN16-LTLCardinality-01 518982 m, 3604 m/sec, 4877702 t fired, .
Time elapsed: 124 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 122/1796 7/32 Sudoku-PT-BN16-LTLCardinality-01 541582 m, 4520 m/sec, 5085951 t fired, .
Time elapsed: 129 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 127/1796 8/32 Sudoku-PT-BN16-LTLCardinality-01 560858 m, 3855 m/sec, 5295083 t fired, .
Time elapsed: 134 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 132/1796 8/32 Sudoku-PT-BN16-LTLCardinality-01 581402 m, 4108 m/sec, 5510053 t fired, .
Time elapsed: 139 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 137/1796 8/32 Sudoku-PT-BN16-LTLCardinality-01 599667 m, 3653 m/sec, 5724544 t fired, .
Time elapsed: 144 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 142/1796 8/32 Sudoku-PT-BN16-LTLCardinality-01 618886 m, 3843 m/sec, 5937894 t fired, .
Time elapsed: 149 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 147/1796 9/32 Sudoku-PT-BN16-LTLCardinality-01 638265 m, 3875 m/sec, 6151765 t fired, .
Time elapsed: 154 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 152/1796 9/32 Sudoku-PT-BN16-LTLCardinality-01 655892 m, 3525 m/sec, 6365157 t fired, .
Time elapsed: 159 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 157/1796 9/32 Sudoku-PT-BN16-LTLCardinality-01 673481 m, 3517 m/sec, 6578423 t fired, .
Time elapsed: 164 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 162/1796 9/32 Sudoku-PT-BN16-LTLCardinality-01 690102 m, 3324 m/sec, 6792096 t fired, .
Time elapsed: 169 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 167/1796 10/32 Sudoku-PT-BN16-LTLCardinality-01 715872 m, 5154 m/sec, 6993277 t fired, .
Time elapsed: 174 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 172/1796 10/32 Sudoku-PT-BN16-LTLCardinality-01 737859 m, 4397 m/sec, 7201024 t fired, .
Time elapsed: 179 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 177/1796 10/32 Sudoku-PT-BN16-LTLCardinality-01 759918 m, 4411 m/sec, 7408664 t fired, .
Time elapsed: 184 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 182/1796 10/32 Sudoku-PT-BN16-LTLCardinality-01 780219 m, 4060 m/sec, 7618949 t fired, .
Time elapsed: 189 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 187/1796 11/32 Sudoku-PT-BN16-LTLCardinality-01 802165 m, 4389 m/sec, 7826589 t fired, .
Time elapsed: 194 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 192/1796 11/32 Sudoku-PT-BN16-LTLCardinality-01 822415 m, 4050 m/sec, 8042745 t fired, .
Time elapsed: 199 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 197/1796 11/32 Sudoku-PT-BN16-LTLCardinality-01 842571 m, 4031 m/sec, 8255779 t fired, .
Time elapsed: 204 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 202/1796 11/32 Sudoku-PT-BN16-LTLCardinality-01 860109 m, 3507 m/sec, 8471925 t fired, .
Time elapsed: 209 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 207/1796 12/32 Sudoku-PT-BN16-LTLCardinality-01 882836 m, 4545 m/sec, 8680694 t fired, .
Time elapsed: 214 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 212/1796 12/32 Sudoku-PT-BN16-LTLCardinality-01 902544 m, 3941 m/sec, 8894678 t fired, .
Time elapsed: 219 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 217/1796 12/32 Sudoku-PT-BN16-LTLCardinality-01 922721 m, 4035 m/sec, 9104298 t fired, .
Time elapsed: 224 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 222/1796 12/32 Sudoku-PT-BN16-LTLCardinality-01 941485 m, 3752 m/sec, 9315603 t fired, .
Time elapsed: 229 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 227/1796 13/32 Sudoku-PT-BN16-LTLCardinality-01 960353 m, 3773 m/sec, 9526285 t fired, .
Time elapsed: 234 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 232/1796 13/32 Sudoku-PT-BN16-LTLCardinality-01 979389 m, 3807 m/sec, 9736345 t fired, .
Time elapsed: 239 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 237/1796 13/32 Sudoku-PT-BN16-LTLCardinality-01 997097 m, 3541 m/sec, 9951834 t fired, .
Time elapsed: 244 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 242/1796 13/32 Sudoku-PT-BN16-LTLCardinality-01 1015084 m, 3597 m/sec, 10166697 t fired, .
Time elapsed: 249 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 247/1796 14/32 Sudoku-PT-BN16-LTLCardinality-01 1030838 m, 3150 m/sec, 10384315 t fired, .
Time elapsed: 254 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 252/1796 14/32 Sudoku-PT-BN16-LTLCardinality-01 1053535 m, 4539 m/sec, 10594178 t fired, .
Time elapsed: 259 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 257/1796 14/32 Sudoku-PT-BN16-LTLCardinality-01 1073638 m, 4020 m/sec, 10805962 t fired, .
Time elapsed: 264 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 262/1796 14/32 Sudoku-PT-BN16-LTLCardinality-01 1093353 m, 3943 m/sec, 11017086 t fired, .
Time elapsed: 269 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 267/1796 15/32 Sudoku-PT-BN16-LTLCardinality-01 1112518 m, 3833 m/sec, 11229445 t fired, .
Time elapsed: 274 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 272/1796 15/32 Sudoku-PT-BN16-LTLCardinality-01 1131592 m, 3814 m/sec, 11442040 t fired, .
Time elapsed: 279 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 277/1796 15/32 Sudoku-PT-BN16-LTLCardinality-01 1151088 m, 3899 m/sec, 11654912 t fired, .
Time elapsed: 284 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 282/1796 15/32 Sudoku-PT-BN16-LTLCardinality-01 1168729 m, 3528 m/sec, 11870795 t fired, .
Time elapsed: 289 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 287/1796 16/32 Sudoku-PT-BN16-LTLCardinality-01 1186779 m, 3610 m/sec, 12086838 t fired, .
Time elapsed: 294 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 292/1796 16/32 Sudoku-PT-BN16-LTLCardinality-01 1202902 m, 3224 m/sec, 12308389 t fired, .
Time elapsed: 299 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 297/1796 16/32 Sudoku-PT-BN16-LTLCardinality-01 1222725 m, 3964 m/sec, 12523207 t fired, .
Time elapsed: 304 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 302/1796 16/32 Sudoku-PT-BN16-LTLCardinality-01 1242157 m, 3886 m/sec, 12736469 t fired, .
Time elapsed: 309 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 307/1796 17/32 Sudoku-PT-BN16-LTLCardinality-01 1259749 m, 3518 m/sec, 12949855 t fired, .
Time elapsed: 314 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 312/1796 17/32 Sudoku-PT-BN16-LTLCardinality-01 1277562 m, 3562 m/sec, 13165056 t fired, .
Time elapsed: 319 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 317/1796 17/32 Sudoku-PT-BN16-LTLCardinality-01 1293725 m, 3232 m/sec, 13381358 t fired, .
Time elapsed: 324 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 322/1796 17/32 Sudoku-PT-BN16-LTLCardinality-01 1311662 m, 3587 m/sec, 13596645 t fired, .
Time elapsed: 329 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 327/1796 17/32 Sudoku-PT-BN16-LTLCardinality-01 1328358 m, 3339 m/sec, 13812661 t fired, .
Time elapsed: 334 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 332/1796 18/32 Sudoku-PT-BN16-LTLCardinality-01 1344663 m, 3261 m/sec, 14026962 t fired, .
Time elapsed: 339 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 337/1796 18/32 Sudoku-PT-BN16-LTLCardinality-01 1360526 m, 3172 m/sec, 14237391 t fired, .
Time elapsed: 344 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 342/1796 18/32 Sudoku-PT-BN16-LTLCardinality-01 1374657 m, 2826 m/sec, 14450269 t fired, .
Time elapsed: 349 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 347/1796 18/32 Sudoku-PT-BN16-LTLCardinality-01 1398627 m, 4794 m/sec, 14652526 t fired, .
Time elapsed: 354 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 352/1796 19/32 Sudoku-PT-BN16-LTLCardinality-01 1420460 m, 4366 m/sec, 14857530 t fired, .
Time elapsed: 359 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 357/1796 19/32 Sudoku-PT-BN16-LTLCardinality-01 1443046 m, 4517 m/sec, 15062015 t fired, .
Time elapsed: 364 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 362/1796 19/32 Sudoku-PT-BN16-LTLCardinality-01 1462029 m, 3796 m/sec, 15273206 t fired, .
Time elapsed: 369 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 367/1796 19/32 Sudoku-PT-BN16-LTLCardinality-01 1485541 m, 4702 m/sec, 15480516 t fired, .
Time elapsed: 374 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 372/1796 20/32 Sudoku-PT-BN16-LTLCardinality-01 1504819 m, 3855 m/sec, 15693027 t fired, .
Time elapsed: 379 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 377/1796 20/32 Sudoku-PT-BN16-LTLCardinality-01 1525708 m, 4177 m/sec, 15907273 t fired, .
Time elapsed: 384 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 382/1796 20/32 Sudoku-PT-BN16-LTLCardinality-01 1544516 m, 3761 m/sec, 16124746 t fired, .
Time elapsed: 389 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 387/1796 20/32 Sudoku-PT-BN16-LTLCardinality-01 1565755 m, 4247 m/sec, 16336034 t fired, .
Time elapsed: 394 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 392/1796 21/32 Sudoku-PT-BN16-LTLCardinality-01 1586671 m, 4183 m/sec, 16545924 t fired, .
Time elapsed: 399 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 397/1796 21/32 Sudoku-PT-BN16-LTLCardinality-01 1606634 m, 3992 m/sec, 16759062 t fired, .
Time elapsed: 404 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 402/1796 21/32 Sudoku-PT-BN16-LTLCardinality-01 1626074 m, 3888 m/sec, 16973814 t fired, .
Time elapsed: 409 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 407/1796 21/32 Sudoku-PT-BN16-LTLCardinality-01 1644894 m, 3764 m/sec, 17188396 t fired, .
Time elapsed: 414 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 412/1796 22/32 Sudoku-PT-BN16-LTLCardinality-01 1664705 m, 3962 m/sec, 17401525 t fired, .
Time elapsed: 419 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 417/1796 22/32 Sudoku-PT-BN16-LTLCardinality-01 1682192 m, 3497 m/sec, 17617055 t fired, .
Time elapsed: 424 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 422/1796 22/32 Sudoku-PT-BN16-LTLCardinality-01 1700113 m, 3584 m/sec, 17831558 t fired, .
Time elapsed: 429 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 427/1796 22/32 Sudoku-PT-BN16-LTLCardinality-01 1716477 m, 3272 m/sec, 18048748 t fired, .
Time elapsed: 434 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 432/1796 23/32 Sudoku-PT-BN16-LTLCardinality-01 1737799 m, 4264 m/sec, 18259974 t fired, .
Time elapsed: 439 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 437/1796 23/32 Sudoku-PT-BN16-LTLCardinality-01 1758634 m, 4167 m/sec, 18469290 t fired, .
Time elapsed: 444 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 442/1796 23/32 Sudoku-PT-BN16-LTLCardinality-01 1778326 m, 3938 m/sec, 18679094 t fired, .
Time elapsed: 449 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 447/1796 23/32 Sudoku-PT-BN16-LTLCardinality-01 1797327 m, 3800 m/sec, 18889900 t fired, .
Time elapsed: 454 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 452/1796 24/32 Sudoku-PT-BN16-LTLCardinality-01 1816058 m, 3746 m/sec, 19104099 t fired, .
Time elapsed: 459 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 457/1796 24/32 Sudoku-PT-BN16-LTLCardinality-01 1835944 m, 3977 m/sec, 19316447 t fired, .
Time elapsed: 464 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 462/1796 24/32 Sudoku-PT-BN16-LTLCardinality-01 1853520 m, 3515 m/sec, 19533983 t fired, .
Time elapsed: 469 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 467/1796 24/32 Sudoku-PT-BN16-LTLCardinality-01 1871299 m, 3555 m/sec, 19746141 t fired, .
Time elapsed: 474 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 472/1796 25/32 Sudoku-PT-BN16-LTLCardinality-01 1887735 m, 3287 m/sec, 19962089 t fired, .
Time elapsed: 479 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 477/1796 25/32 Sudoku-PT-BN16-LTLCardinality-01 1906749 m, 3802 m/sec, 20173584 t fired, .
Time elapsed: 484 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 482/1796 25/32 Sudoku-PT-BN16-LTLCardinality-01 1925757 m, 3801 m/sec, 20384400 t fired, .
Time elapsed: 489 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 487/1796 25/32 Sudoku-PT-BN16-LTLCardinality-01 1943297 m, 3508 m/sec, 20596599 t fired, .
Time elapsed: 494 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 492/1796 25/32 Sudoku-PT-BN16-LTLCardinality-01 1960961 m, 3532 m/sec, 20808228 t fired, .
Time elapsed: 499 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 497/1796 26/32 Sudoku-PT-BN16-LTLCardinality-01 1976887 m, 3185 m/sec, 21027263 t fired, .
Time elapsed: 504 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 502/1796 26/32 Sudoku-PT-BN16-LTLCardinality-01 1994845 m, 3591 m/sec, 21238783 t fired, .
Time elapsed: 509 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 507/1796 26/32 Sudoku-PT-BN16-LTLCardinality-01 2011962 m, 3423 m/sec, 21451407 t fired, .
Time elapsed: 514 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 512/1796 26/32 Sudoku-PT-BN16-LTLCardinality-01 2028110 m, 3229 m/sec, 21666205 t fired, .
Time elapsed: 519 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 517/1796 27/32 Sudoku-PT-BN16-LTLCardinality-01 2044094 m, 3196 m/sec, 21880054 t fired, .
Time elapsed: 524 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 522/1796 27/32 Sudoku-PT-BN16-LTLCardinality-01 2059199 m, 3021 m/sec, 22096064 t fired, .
Time elapsed: 529 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 527/1796 27/32 Sudoku-PT-BN16-LTLCardinality-01 2078706 m, 3901 m/sec, 22308645 t fired, .
Time elapsed: 534 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 532/1796 27/32 Sudoku-PT-BN16-LTLCardinality-01 2099914 m, 4241 m/sec, 22517497 t fired, .
Time elapsed: 539 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 537/1796 27/32 Sudoku-PT-BN16-LTLCardinality-01 2119469 m, 3911 m/sec, 22727325 t fired, .
Time elapsed: 544 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 542/1796 28/32 Sudoku-PT-BN16-LTLCardinality-01 2139107 m, 3927 m/sec, 22940355 t fired, .
Time elapsed: 549 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 547/1796 28/32 Sudoku-PT-BN16-LTLCardinality-01 2158133 m, 3805 m/sec, 23161908 t fired, .
Time elapsed: 554 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 552/1796 28/32 Sudoku-PT-BN16-LTLCardinality-01 2178066 m, 3986 m/sec, 23374740 t fired, .
Time elapsed: 559 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 557/1796 28/32 Sudoku-PT-BN16-LTLCardinality-01 2195173 m, 3421 m/sec, 23587430 t fired, .
Time elapsed: 564 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 562/1796 29/32 Sudoku-PT-BN16-LTLCardinality-01 2213110 m, 3587 m/sec, 23802881 t fired, .
Time elapsed: 569 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 567/1796 29/32 Sudoku-PT-BN16-LTLCardinality-01 2230046 m, 3387 m/sec, 24017922 t fired, .
Time elapsed: 574 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 572/1796 29/32 Sudoku-PT-BN16-LTLCardinality-01 2248716 m, 3734 m/sec, 24230192 t fired, .
Time elapsed: 579 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 577/1796 29/32 Sudoku-PT-BN16-LTLCardinality-01 2268135 m, 3883 m/sec, 24441747 t fired, .
Time elapsed: 584 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 582/1796 30/32 Sudoku-PT-BN16-LTLCardinality-01 2285512 m, 3475 m/sec, 24654999 t fired, .
Time elapsed: 589 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 587/1796 30/32 Sudoku-PT-BN16-LTLCardinality-01 2303281 m, 3553 m/sec, 24867997 t fired, .
Time elapsed: 594 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 592/1796 30/32 Sudoku-PT-BN16-LTLCardinality-01 2319371 m, 3218 m/sec, 25082730 t fired, .
Time elapsed: 599 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 597/1796 30/32 Sudoku-PT-BN16-LTLCardinality-01 2336982 m, 3522 m/sec, 25295860 t fired, .
Time elapsed: 604 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 602/1796 30/32 Sudoku-PT-BN16-LTLCardinality-01 2354627 m, 3529 m/sec, 25510930 t fired, .
Time elapsed: 609 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 607/1796 31/32 Sudoku-PT-BN16-LTLCardinality-01 2370501 m, 3174 m/sec, 25726700 t fired, .
Time elapsed: 614 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 612/1796 31/32 Sudoku-PT-BN16-LTLCardinality-01 2386727 m, 3245 m/sec, 25942434 t fired, .
Time elapsed: 619 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 617/1796 31/32 Sudoku-PT-BN16-LTLCardinality-01 2402167 m, 3088 m/sec, 26160849 t fired, .
Time elapsed: 624 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 622/1796 31/32 Sudoku-PT-BN16-LTLCardinality-01 2419738 m, 3514 m/sec, 26375479 t fired, .
Time elapsed: 629 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 627/1796 32/32 Sudoku-PT-BN16-LTLCardinality-01 2439391 m, 3930 m/sec, 26586812 t fired, .
Time elapsed: 634 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 632/1796 32/32 Sudoku-PT-BN16-LTLCardinality-01 2456723 m, 3466 m/sec, 26801452 t fired, .
Time elapsed: 639 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 637/1796 32/32 Sudoku-PT-BN16-LTLCardinality-01 2474476 m, 3550 m/sec, 27013584 t fired, .
Time elapsed: 644 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 642/1796 32/32 Sudoku-PT-BN16-LTLCardinality-01 2490594 m, 3223 m/sec, 27227770 t fired, .
Time elapsed: 649 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 647/1796 32/32 Sudoku-PT-BN16-LTLCardinality-01 2508253 m, 3531 m/sec, 27440512 t fired, .
Time elapsed: 654 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for Sudoku-PT-BN16-LTLCardinality-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 659 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 Sudoku-PT-BN16-LTLCardinality-07
lola: time limit : 2941 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/2941 8/32 Sudoku-PT-BN16-LTLCardinality-07 96933 m, 19386 m/sec, 97083 t fired, .
Time elapsed: 664 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/2941 16/32 Sudoku-PT-BN16-LTLCardinality-07 196073 m, 19828 m/sec, 196928 t fired, .
Time elapsed: 669 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/2941 23/32 Sudoku-PT-BN16-LTLCardinality-07 295653 m, 19916 m/sec, 297839 t fired, .
Time elapsed: 674 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/2941 31/32 Sudoku-PT-BN16-LTLCardinality-07 394831 m, 19835 m/sec, 399095 t fired, .
Time elapsed: 679 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for Sudoku-PT-BN16-LTLCardinality-07 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-BN16-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-BN16-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 684 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-BN16-LTLCardinality-01: LTL unknown AGGR
Sudoku-PT-BN16-LTLCardinality-07: LTL unknown AGGR
Time elapsed: 684 secs. Pages in use: 32
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-PT-BN16"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is Sudoku-PT-BN16, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r487-tall-167912702900315"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-BN16.tgz
mv Sudoku-PT-BN16 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;