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-167912702800243.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-AN11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912702800243
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 41M
-rw-r--r-- 1 mcc users 275K Feb 26 09:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Feb 26 09:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Feb 26 09:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 8.1M Feb 26 09:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 297K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 510K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.8M Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 755K Feb 26 09:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.5M Feb 26 09:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5M Feb 26 09:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17M Feb 26 09:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 65K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 161K Feb 25 17:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 746K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679178014085

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-AN11
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 22:20:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 22:20:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 22:20:15] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2023-03-18 22:20:15] [INFO ] Transformed 1694 places.
[2023-03-18 22:20:15] [INFO ] Transformed 1331 transitions.
[2023-03-18 22:20:15] [INFO ] Parsed PT model containing 1694 places and 1331 transitions and 5324 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 116 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-AN11-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1694 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 23 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2023-03-18 22:20:16] [INFO ] Computed 363 place invariants in 31 ms
[2023-03-18 22:20:16] [INFO ] Implicit Places using invariants in 681 ms returned []
[2023-03-18 22:20:16] [INFO ] Invariant cache hit.
[2023-03-18 22:20:17] [INFO ] Implicit Places using invariants and state equation in 905 ms returned []
Implicit Place search using SMT with State Equation took 1612 ms to find 0 implicit places.
[2023-03-18 22:20:17] [INFO ] Invariant cache hit.
[2023-03-18 22:20:18] [INFO ] Dead Transitions using invariants and state equation in 740 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2377 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Support contains 1694 out of 1694 places after structural reductions.
[2023-03-18 22:20:18] [INFO ] Flatten gal took : 155 ms
[2023-03-18 22:20:19] [INFO ] Flatten gal took : 104 ms
[2023-03-18 22:20:19] [INFO ] Input system was already deterministic with 1331 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1556 ms. (steps per millisecond=6 ) properties (out of 27) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-18 22:20:22] [INFO ] Invariant cache hit.
[2023-03-18 22:20:23] [INFO ] [Real]Absence check using 363 positive place invariants in 83 ms returned sat
[2023-03-18 22:20:23] [INFO ] After 1068ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-18 22:20:24] [INFO ] [Nat]Absence check using 363 positive place invariants in 76 ms returned sat
[2023-03-18 22:20:28] [INFO ] After 2249ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :6
[2023-03-18 22:20:28] [INFO ] After 2827ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :6
Attempting to minimize the solution found.
Minimization took 331 ms.
[2023-03-18 22:20:28] [INFO ] After 5231ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :6
Fused 13 Parikh solutions to 1 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 6 properties in 15 ms. (steps per millisecond=8 )
Parikh walk visited 6 properties in 25 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 7 atomic propositions for a total of 13 simplifications.
FORMULA Sudoku-PT-AN11-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA Sudoku-PT-AN11-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1331 places and 0 transitions.
Iterating post reduction 0 with 1331 rules applied. Total rules applied 1331 place count 363 transition count 1331
Applied a total of 1331 rules in 50 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2023-03-18 22:20:29] [INFO ] Computed 32 place invariants in 64 ms
[2023-03-18 22:20:29] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-03-18 22:20:29] [INFO ] Invariant cache hit.
[2023-03-18 22:20:30] [INFO ] Implicit Places using invariants and state equation in 990 ms returned []
Implicit Place search using SMT with State Equation took 1323 ms to find 0 implicit places.
[2023-03-18 22:20:30] [INFO ] Invariant cache hit.
[2023-03-18 22:20:31] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1786 ms. Remains : 363/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 234 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 2 (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 947 reset in 7899 ms.
Product exploration explored 100000 steps with 946 reset in 7961 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 764 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 276376 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 276376 steps, saw 131725 distinct states, run finished after 3002 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 22:21:05] [INFO ] Invariant cache hit.
[2023-03-18 22:21:05] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 18 ms returned sat
[2023-03-18 22:21:06] [INFO ] After 968ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:21:06] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 18 ms returned sat
[2023-03-18 22:21:06] [INFO ] After 674ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:21:06] [INFO ] After 740ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-18 22:21:06] [INFO ] After 852ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 120 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 25 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-18 22:21:07] [INFO ] Invariant cache hit.
[2023-03-18 22:21:07] [INFO ] Implicit Places using invariants in 264 ms returned []
[2023-03-18 22:21:07] [INFO ] Invariant cache hit.
[2023-03-18 22:21:08] [INFO ] Implicit Places using invariants and state equation in 1089 ms returned []
Implicit Place search using SMT with State Equation took 1381 ms to find 0 implicit places.
[2023-03-18 22:21:08] [INFO ] Invariant cache hit.
[2023-03-18 22:21:09] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1934 ms. Remains : 363/363 places, 1331/1331 transitions.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 243 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 774 ms. (steps per millisecond=12 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 286351 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 286351 steps, saw 133970 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 22:21:27] [INFO ] Invariant cache hit.
[2023-03-18 22:21:27] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 25 ms returned sat
[2023-03-18 22:21:28] [INFO ] After 1033ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:21:28] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 17 ms returned sat
[2023-03-18 22:21:28] [INFO ] After 663ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:21:28] [INFO ] After 708ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-18 22:21:28] [INFO ] After 810ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 120 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 946 reset in 7803 ms.
Product exploration explored 100000 steps with 945 reset in 7926 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 38 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-18 22:21:45] [INFO ] Redundant transitions in 112 ms returned []
[2023-03-18 22:21:45] [INFO ] Invariant cache hit.
[2023-03-18 22:21:46] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 658 ms. Remains : 363/363 places, 1331/1331 transitions.
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 12 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-18 22:21:46] [INFO ] Invariant cache hit.
[2023-03-18 22:21:46] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-03-18 22:21:46] [INFO ] Invariant cache hit.
[2023-03-18 22:21:47] [INFO ] Implicit Places using invariants and state equation in 974 ms returned []
Implicit Place search using SMT with State Equation took 1299 ms to find 0 implicit places.
[2023-03-18 22:21:47] [INFO ] Invariant cache hit.
[2023-03-18 22:21:47] [INFO ] Dead Transitions using invariants and state equation in 431 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1755 ms. Remains : 363/363 places, 1331/1331 transitions.
Treatment of property Sudoku-PT-AN11-LTLCardinality-01 finished in 79209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||F(p1))))'
Support contains 1694 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 7 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2023-03-18 22:21:48] [INFO ] Computed 363 place invariants in 6 ms
[2023-03-18 22:21:48] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-03-18 22:21:49] [INFO ] Invariant cache hit.
[2023-03-18 22:21:49] [INFO ] Implicit Places using invariants and state equation in 743 ms returned []
Implicit Place search using SMT with State Equation took 1181 ms to find 0 implicit places.
[2023-03-18 22:21:49] [INFO ] Invariant cache hit.
[2023-03-18 22:21:50] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1900 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 3 (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 53770 steps with 17923 reset in 10001 ms.
Product exploration timeout after 53650 steps with 17883 reset in 10001 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) (NOT p0)))))
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN11-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN11-LTLCardinality-03 finished in 139639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 37 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-18 22:24:08] [INFO ] Invariant cache hit.
[2023-03-18 22:24:08] [INFO ] Implicit Places using invariants in 607 ms returned []
[2023-03-18 22:24:08] [INFO ] Invariant cache hit.
[2023-03-18 22:24:10] [INFO ] Implicit Places using invariants and state equation in 1378 ms returned []
Implicit Place search using SMT with State Equation took 2013 ms to find 0 implicit places.
[2023-03-18 22:24:10] [INFO ] Invariant cache hit.
[2023-03-18 22:24:10] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2780 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 68540 steps with 1105 reset in 10001 ms.
Product exploration timeout after 67500 steps with 1088 reset in 10001 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-18 22:25:27] [INFO ] Invariant cache hit.
[2023-03-18 22:25:38] [INFO ] [Real]Absence check using 363 positive place invariants in 205 ms returned sat
[2023-03-18 22:25:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:25:39] [INFO ] [Real]Absence check using state equation in 1534 ms returned sat
[2023-03-18 22:25:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:25:54] [INFO ] [Nat]Absence check using 363 positive place invariants in 5299 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 33 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-18 22:25:54] [INFO ] Invariant cache hit.
[2023-03-18 22:25:55] [INFO ] Implicit Places using invariants in 649 ms returned []
[2023-03-18 22:25:55] [INFO ] Invariant cache hit.
[2023-03-18 22:25:56] [INFO ] Implicit Places using invariants and state equation in 1350 ms returned []
Implicit Place search using SMT with State Equation took 2026 ms to find 0 implicit places.
[2023-03-18 22:25:56] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-18 22:25:56] [INFO ] Invariant cache hit.
[2023-03-18 22:25:57] [INFO ] Dead Transitions using invariants and state equation in 719 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2862 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 187 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2023-03-18 22:26:54] [INFO ] Invariant cache hit.
[2023-03-18 22:27:05] [INFO ] [Real]Absence check using 363 positive place invariants in 143 ms returned sat
[2023-03-18 22:27:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:27:06] [INFO ] [Real]Absence check using state equation in 1489 ms returned sat
[2023-03-18 22:27:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:27:21] [INFO ] [Nat]Absence check using 363 positive place invariants in 5359 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration timeout after 69780 steps with 1125 reset in 10002 ms.
Product exploration timeout after 69070 steps with 1114 reset in 10001 ms.
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 25 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-18 22:27:42] [INFO ] Invariant cache hit.
[2023-03-18 22:27:42] [INFO ] Implicit Places using invariants in 577 ms returned []
[2023-03-18 22:27:42] [INFO ] Invariant cache hit.
[2023-03-18 22:27:43] [INFO ] Implicit Places using invariants and state equation in 1361 ms returned []
Implicit Place search using SMT with State Equation took 1964 ms to find 0 implicit places.
[2023-03-18 22:27:44] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-18 22:27:44] [INFO ] Invariant cache hit.
[2023-03-18 22:27:44] [INFO ] Dead Transitions using invariants and state equation in 685 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2759 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Treatment of property Sudoku-PT-AN11-LTLCardinality-04 finished in 216779 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 34 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-18 22:27:44] [INFO ] Invariant cache hit.
[2023-03-18 22:27:45] [INFO ] Implicit Places using invariants in 576 ms returned []
[2023-03-18 22:27:45] [INFO ] Invariant cache hit.
[2023-03-18 22:27:46] [INFO ] Implicit Places using invariants and state equation in 1305 ms returned []
Implicit Place search using SMT with State Equation took 1897 ms to find 0 implicit places.
[2023-03-18 22:27:46] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-18 22:27:46] [INFO ] Invariant cache hit.
[2023-03-18 22:27:47] [INFO ] Dead Transitions using invariants and state equation in 690 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2656 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 92510 steps with 1797 reset in 10002 ms.
Product exploration timeout after 91500 steps with 1704 reset in 10002 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 252 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 798 ms. (steps per millisecond=12 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 22:29:04] [INFO ] Invariant cache hit.
[2023-03-18 22:29:05] [INFO ] [Real]Absence check using 363 positive place invariants in 75 ms returned sat
[2023-03-18 22:29:05] [INFO ] After 911ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:29:06] [INFO ] [Nat]Absence check using 363 positive place invariants in 89 ms returned sat
[2023-03-18 22:29:07] [INFO ] After 693ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:29:07] [INFO ] After 782ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-18 22:29:07] [INFO ] After 1569ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 120 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 289 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-18 22:29:08] [INFO ] Invariant cache hit.
[2023-03-18 22:29:16] [INFO ] [Real]Absence check using 363 positive place invariants in 138 ms returned sat
[2023-03-18 22:29:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:29:17] [INFO ] [Real]Absence check using state equation in 1220 ms returned sat
[2023-03-18 22:29:17] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 61 ms.
[2023-03-18 22:29:17] [INFO ] Added : 0 causal constraints over 0 iterations in 175 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 20 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-18 22:29:17] [INFO ] Invariant cache hit.
[2023-03-18 22:29:18] [INFO ] Implicit Places using invariants in 613 ms returned []
[2023-03-18 22:29:18] [INFO ] Invariant cache hit.
[2023-03-18 22:29:19] [INFO ] Implicit Places using invariants and state equation in 1316 ms returned []
Implicit Place search using SMT with State Equation took 1962 ms to find 0 implicit places.
[2023-03-18 22:29:19] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-18 22:29:19] [INFO ] Invariant cache hit.
[2023-03-18 22:29:20] [INFO ] Dead Transitions using invariants and state equation in 713 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2726 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 218 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 762 ms. (steps per millisecond=13 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 22:30:17] [INFO ] Invariant cache hit.
[2023-03-18 22:30:17] [INFO ] [Real]Absence check using 363 positive place invariants in 69 ms returned sat
[2023-03-18 22:30:18] [INFO ] After 866ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:30:18] [INFO ] [Nat]Absence check using 363 positive place invariants in 72 ms returned sat
[2023-03-18 22:30:19] [INFO ] After 810ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:30:20] [INFO ] After 926ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-18 22:30:20] [INFO ] After 1676ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 120 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 275 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-18 22:30:20] [INFO ] Invariant cache hit.
[2023-03-18 22:30:28] [INFO ] [Real]Absence check using 363 positive place invariants in 131 ms returned sat
[2023-03-18 22:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:29] [INFO ] [Real]Absence check using state equation in 1102 ms returned sat
[2023-03-18 22:30:29] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 61 ms.
[2023-03-18 22:30:30] [INFO ] Added : 0 causal constraints over 0 iterations in 178 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration timeout after 92650 steps with 1711 reset in 10001 ms.
Product exploration timeout after 91320 steps with 1721 reset in 10001 ms.
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 20 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-18 22:30:50] [INFO ] Invariant cache hit.
[2023-03-18 22:30:50] [INFO ] Implicit Places using invariants in 598 ms returned []
[2023-03-18 22:30:50] [INFO ] Invariant cache hit.
[2023-03-18 22:30:52] [INFO ] Implicit Places using invariants and state equation in 1332 ms returned []
Implicit Place search using SMT with State Equation took 1952 ms to find 0 implicit places.
[2023-03-18 22:30:52] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-18 22:30:52] [INFO ] Invariant cache hit.
[2023-03-18 22:30:53] [INFO ] Dead Transitions using invariants and state equation in 763 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2775 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Treatment of property Sudoku-PT-AN11-LTLCardinality-05 finished in 188208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.10 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 34 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2023-03-18 22:30:53] [INFO ] Computed 32 place invariants in 28 ms
[2023-03-18 22:30:53] [INFO ] Implicit Places using invariants in 350 ms returned []
[2023-03-18 22:30:53] [INFO ] Invariant cache hit.
[2023-03-18 22:30:54] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1276 ms to find 0 implicit places.
[2023-03-18 22:30:54] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-18 22:30:54] [INFO ] Invariant cache hit.
[2023-03-18 22:30:55] [INFO ] Dead Transitions using invariants and state equation in 485 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1846 ms. Remains : 363/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 947 reset in 7731 ms.
Product exploration explored 100000 steps with 945 reset in 7948 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 771 ms. (steps per millisecond=12 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 291209 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 291209 steps, saw 135003 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 22:31:27] [INFO ] Invariant cache hit.
[2023-03-18 22:31:28] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 18 ms returned sat
[2023-03-18 22:31:28] [INFO ] After 896ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:31:28] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 17 ms returned sat
[2023-03-18 22:31:29] [INFO ] After 592ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:31:29] [INFO ] After 668ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-18 22:31:29] [INFO ] After 796ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 119 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 17 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-18 22:31:29] [INFO ] Invariant cache hit.
[2023-03-18 22:31:30] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-03-18 22:31:30] [INFO ] Invariant cache hit.
[2023-03-18 22:31:31] [INFO ] Implicit Places using invariants and state equation in 922 ms returned []
Implicit Place search using SMT with State Equation took 1196 ms to find 0 implicit places.
[2023-03-18 22:31:31] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-18 22:31:31] [INFO ] Invariant cache hit.
[2023-03-18 22:31:31] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1652 ms. Remains : 363/363 places, 1331/1331 transitions.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 768 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 292613 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 292613 steps, saw 135199 distinct states, run finished after 3002 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 22:31:48] [INFO ] Invariant cache hit.
[2023-03-18 22:31:48] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 18 ms returned sat
[2023-03-18 22:31:49] [INFO ] After 908ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:31:49] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 17 ms returned sat
[2023-03-18 22:31:50] [INFO ] After 644ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:31:50] [INFO ] After 689ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-18 22:31:50] [INFO ] After 821ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 119 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=17 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 946 reset in 7897 ms.
Product exploration explored 100000 steps with 945 reset in 7968 ms.
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 13 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-18 22:32:06] [INFO ] Invariant cache hit.
[2023-03-18 22:32:07] [INFO ] Implicit Places using invariants in 258 ms returned []
[2023-03-18 22:32:07] [INFO ] Invariant cache hit.
[2023-03-18 22:32:07] [INFO ] Implicit Places using invariants and state equation in 936 ms returned []
Implicit Place search using SMT with State Equation took 1218 ms to find 0 implicit places.
[2023-03-18 22:32:08] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-18 22:32:08] [INFO ] Invariant cache hit.
[2023-03-18 22:32:08] [INFO ] Dead Transitions using invariants and state equation in 431 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1716 ms. Remains : 363/363 places, 1331/1331 transitions.
Treatment of property Sudoku-PT-AN11-LTLCardinality-07 finished in 75427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1330 places and 0 transitions.
Iterating post reduction 0 with 1330 rules applied. Total rules applied 1330 place count 364 transition count 1331
Applied a total of 1330 rules in 29 ms. Remains 364 /1694 variables (removed 1330) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 364 cols
[2023-03-18 22:32:08] [INFO ] Computed 32 place invariants in 47 ms
[2023-03-18 22:32:08] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-03-18 22:32:08] [INFO ] Invariant cache hit.
[2023-03-18 22:32:10] [INFO ] Implicit Places using invariants and state equation in 1127 ms returned []
Implicit Place search using SMT with State Equation took 1532 ms to find 0 implicit places.
[2023-03-18 22:32:10] [INFO ] Invariant cache hit.
[2023-03-18 22:32:10] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 364/1694 places, 1331/1331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1998 ms. Remains : 364/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s121 s41)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1463 steps with 13 reset in 111 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-09 finished in 2190 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.5 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 30 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2023-03-18 22:32:10] [INFO ] Computed 32 place invariants in 25 ms
[2023-03-18 22:32:11] [INFO ] Implicit Places using invariants in 384 ms returned []
[2023-03-18 22:32:11] [INFO ] Invariant cache hit.
[2023-03-18 22:32:12] [INFO ] Implicit Places using invariants and state equation in 1108 ms returned []
Implicit Place search using SMT with State Equation took 1529 ms to find 0 implicit places.
[2023-03-18 22:32:12] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-18 22:32:12] [INFO ] Invariant cache hit.
[2023-03-18 22:32:12] [INFO ] Dead Transitions using invariants and state equation in 455 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2043 ms. Remains : 363/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s219 s74)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 106 steps with 0 reset in 9 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-10 finished in 2106 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0))) U (p1&&X(F(p2)))))'
Support contains 3 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1329 places and 0 transitions.
Iterating post reduction 0 with 1329 rules applied. Total rules applied 1329 place count 365 transition count 1331
Applied a total of 1329 rules in 33 ms. Remains 365 /1694 variables (removed 1329) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 365 cols
[2023-03-18 22:32:12] [INFO ] Computed 32 place invariants in 31 ms
[2023-03-18 22:32:13] [INFO ] Implicit Places using invariants in 384 ms returned []
[2023-03-18 22:32:13] [INFO ] Invariant cache hit.
[2023-03-18 22:32:14] [INFO ] Implicit Places using invariants and state equation in 995 ms returned []
Implicit Place search using SMT with State Equation took 1424 ms to find 0 implicit places.
[2023-03-18 22:32:14] [INFO ] Invariant cache hit.
[2023-03-18 22:32:14] [INFO ] Dead Transitions using invariants and state equation in 416 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 365/1694 places, 1331/1331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1884 ms. Remains : 365/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (NOT p0), true]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=p1, acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GT 1 s301), p2:(GT 1 s122), p0:(AND (LEQ 1 s301) (GT 3 s121))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 133 steps with 1 reset in 12 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-11 finished in 2050 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 364 are kept as prefixes of interest. Removing 1330 places using SCC suffix rule.3 ms
Discarding 1330 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 27 ms. Remains 364 /1694 variables (removed 1330) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 364 cols
[2023-03-18 22:32:14] [INFO ] Computed 32 place invariants in 40 ms
[2023-03-18 22:32:15] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-03-18 22:32:15] [INFO ] Invariant cache hit.
[2023-03-18 22:32:16] [INFO ] Implicit Places using invariants and state equation in 916 ms returned []
Implicit Place search using SMT with State Equation took 1254 ms to find 0 implicit places.
[2023-03-18 22:32:16] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-18 22:32:16] [INFO ] Invariant cache hit.
[2023-03-18 22:32:16] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 364/1694 places, 1331/1331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1721 ms. Remains : 364/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s121 s78)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 103 steps with 0 reset in 9 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-12 finished in 1778 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 347 are kept as prefixes of interest. Removing 1347 places using SCC suffix rule.3 ms
Discarding 1347 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 109 ms. Remains 347 /1694 variables (removed 1347) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 347 cols
[2023-03-18 22:32:16] [INFO ] Computed 22 place invariants in 53 ms
[2023-03-18 22:32:17] [INFO ] Implicit Places using invariants in 362 ms returned []
[2023-03-18 22:32:17] [INFO ] Invariant cache hit.
[2023-03-18 22:32:18] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 1279 ms to find 0 implicit places.
[2023-03-18 22:32:18] [INFO ] Redundant transitions in 92 ms returned []
[2023-03-18 22:32:18] [INFO ] Invariant cache hit.
[2023-03-18 22:32:18] [INFO ] Dead Transitions using invariants and state equation in 601 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 347/1694 places, 1331/1331 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2107 ms. Remains : 347/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT 3 s122) (GT s121 s335))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 8 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-13 finished in 2152 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : Sudoku-PT-AN11-LTLCardinality-01
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 121 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.3 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 22 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2023-03-18 22:32:19] [INFO ] Computed 32 place invariants in 24 ms
[2023-03-18 22:32:19] [INFO ] Implicit Places using invariants in 298 ms returned []
[2023-03-18 22:32:19] [INFO ] Invariant cache hit.
[2023-03-18 22:32:20] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1244 ms to find 0 implicit places.
[2023-03-18 22:32:20] [INFO ] Invariant cache hit.
[2023-03-18 22:32:20] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1957 ms. Remains : 363/1694 places, 1331/1331 transitions.
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 2 (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 947 reset in 7815 ms.
Product exploration explored 100000 steps with 946 reset in 7926 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 759 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 291083 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 291083 steps, saw 134965 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 22:32:54] [INFO ] Invariant cache hit.
[2023-03-18 22:32:54] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 18 ms returned sat
[2023-03-18 22:32:55] [INFO ] After 959ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:32:55] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 16 ms returned sat
[2023-03-18 22:32:55] [INFO ] After 640ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:32:55] [INFO ] After 686ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-18 22:32:55] [INFO ] After 777ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 120 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 14 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-18 22:32:56] [INFO ] Invariant cache hit.
[2023-03-18 22:32:56] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-18 22:32:56] [INFO ] Invariant cache hit.
[2023-03-18 22:32:57] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1214 ms to find 0 implicit places.
[2023-03-18 22:32:57] [INFO ] Invariant cache hit.
[2023-03-18 22:32:57] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1640 ms. Remains : 363/363 places, 1331/1331 transitions.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 766 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 291679 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 291679 steps, saw 135066 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 22:33:15] [INFO ] Invariant cache hit.
[2023-03-18 22:33:15] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 18 ms returned sat
[2023-03-18 22:33:16] [INFO ] After 923ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 22:33:16] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 17 ms returned sat
[2023-03-18 22:33:16] [INFO ] After 650ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 22:33:16] [INFO ] After 689ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-18 22:33:16] [INFO ] After 820ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 120 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 12 ms.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 946 reset in 7788 ms.
Product exploration explored 100000 steps with 946 reset in 7758 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 18 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-18 22:33:33] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-18 22:33:33] [INFO ] Invariant cache hit.
[2023-03-18 22:33:33] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 687 ms. Remains : 363/363 places, 1331/1331 transitions.
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 14 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-18 22:33:33] [INFO ] Invariant cache hit.
[2023-03-18 22:33:34] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-03-18 22:33:34] [INFO ] Invariant cache hit.
[2023-03-18 22:33:35] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 1264 ms to find 0 implicit places.
[2023-03-18 22:33:35] [INFO ] Invariant cache hit.
[2023-03-18 22:33:35] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1725 ms. Remains : 363/363 places, 1331/1331 transitions.
Treatment of property Sudoku-PT-AN11-LTLCardinality-01 finished in 76827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Found a Shortening insensitive property : Sudoku-PT-AN11-LTLCardinality-04
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 25 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2023-03-18 22:33:35] [INFO ] Computed 363 place invariants in 4 ms
[2023-03-18 22:33:36] [INFO ] Implicit Places using invariants in 548 ms returned []
[2023-03-18 22:33:36] [INFO ] Invariant cache hit.
[2023-03-18 22:33:37] [INFO ] Implicit Places using invariants and state equation in 1338 ms returned []
Implicit Place search using SMT with State Equation took 1919 ms to find 0 implicit places.
[2023-03-18 22:33:37] [INFO ] Invariant cache hit.
[2023-03-18 22:33:38] [INFO ] Dead Transitions using invariants and state equation in 696 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2651 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration timeout after 68840 steps with 1110 reset in 10001 ms.
Product exploration timeout after 68950 steps with 1112 reset in 10001 ms.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
[2023-03-18 22:34:55] [INFO ] Invariant cache hit.
[2023-03-18 22:35:06] [INFO ] [Real]Absence check using 363 positive place invariants in 133 ms returned sat
[2023-03-18 22:35:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:35:07] [INFO ] [Real]Absence check using state equation in 1467 ms returned sat
[2023-03-18 22:35:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:35:22] [INFO ] [Nat]Absence check using 363 positive place invariants in 5539 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 20 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-18 22:35:22] [INFO ] Invariant cache hit.
[2023-03-18 22:35:23] [INFO ] Implicit Places using invariants in 559 ms returned []
[2023-03-18 22:35:23] [INFO ] Invariant cache hit.
[2023-03-18 22:35:24] [INFO ] Implicit Places using invariants and state equation in 1356 ms returned []
Implicit Place search using SMT with State Equation took 1949 ms to find 0 implicit places.
[2023-03-18 22:35:24] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-18 22:35:24] [INFO ] Invariant cache hit.
[2023-03-18 22:35:25] [INFO ] Dead Transitions using invariants and state equation in 712 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2712 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
[2023-03-18 22:36:22] [INFO ] Invariant cache hit.
[2023-03-18 22:36:34] [INFO ] [Real]Absence check using 363 positive place invariants in 187 ms returned sat
[2023-03-18 22:36:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:36:35] [INFO ] [Real]Absence check using state equation in 1490 ms returned sat
[2023-03-18 22:36:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:36:50] [INFO ] [Nat]Absence check using 363 positive place invariants in 5332 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration timeout after 67900 steps with 1095 reset in 10003 ms.
Product exploration timeout after 67090 steps with 1082 reset in 10001 ms.
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 17 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2023-03-18 22:37:10] [INFO ] Invariant cache hit.
[2023-03-18 22:37:11] [INFO ] Implicit Places using invariants in 605 ms returned []
[2023-03-18 22:37:11] [INFO ] Invariant cache hit.
[2023-03-18 22:37:12] [INFO ] Implicit Places using invariants and state equation in 1340 ms returned []
Implicit Place search using SMT with State Equation took 1963 ms to find 0 implicit places.
[2023-03-18 22:37:12] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-18 22:37:12] [INFO ] Invariant cache hit.
[2023-03-18 22:37:13] [INFO ] Dead Transitions using invariants and state equation in 696 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2705 ms. Remains : 1694/1694 places, 1331/1331 transitions.
Treatment of property Sudoku-PT-AN11-LTLCardinality-04 finished in 217830 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-18 22:37:13] [INFO ] Flatten gal took : 85 ms
[2023-03-18 22:37:13] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-18 22:37:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1694 places, 1331 transitions and 5324 arcs took 7 ms.
Total runtime 1018266 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Sudoku-PT-AN11
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

BK_STOP 1679179425849

--------------------
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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:373
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 16 (type SKEL/SRCH) for 0 Sudoku-PT-AN11-LTLCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: NOTDEADLOCKFREE
lola: FINISHED task # 16 (type SKEL/SRCH) for Sudoku-PT-AN11-LTLCardinality-01
lola: result : false
lola: markings : 122
lola: fired transitions : 122
lola: time used : 0.000000
lola: memory pages used : 1
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 Sudoku-PT-AN11-LTLCardinality-01
lola: time limit : 720 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-AN11-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/720 4/32 Sudoku-PT-AN11-LTLCardinality-01 316166 m, 63233 m/sec, 2052075 t fired, .

Time elapsed: 5 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/720 7/32 Sudoku-PT-AN11-LTLCardinality-01 615951 m, 59957 m/sec, 4268905 t fired, .

Time elapsed: 10 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/720 10/32 Sudoku-PT-AN11-LTLCardinality-01 941816 m, 65173 m/sec, 6463055 t fired, .

Time elapsed: 15 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/720 13/32 Sudoku-PT-AN11-LTLCardinality-01 1193693 m, 50375 m/sec, 8666424 t fired, .

Time elapsed: 20 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/720 16/32 Sudoku-PT-AN11-LTLCardinality-01 1461614 m, 53584 m/sec, 10821119 t fired, .

Time elapsed: 25 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/720 19/32 Sudoku-PT-AN11-LTLCardinality-01 1769093 m, 61495 m/sec, 12968269 t fired, .

Time elapsed: 30 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/720 22/32 Sudoku-PT-AN11-LTLCardinality-01 2065052 m, 59191 m/sec, 15104700 t fired, .

Time elapsed: 35 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/720 24/32 Sudoku-PT-AN11-LTLCardinality-01 2356902 m, 58370 m/sec, 17237542 t fired, .

Time elapsed: 40 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/720 27/32 Sudoku-PT-AN11-LTLCardinality-01 2594922 m, 47604 m/sec, 19310433 t fired, .

Time elapsed: 45 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/720 29/32 Sudoku-PT-AN11-LTLCardinality-01 2834091 m, 47833 m/sec, 21383002 t fired, .

Time elapsed: 50 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/720 32/32 Sudoku-PT-AN11-LTLCardinality-01 3085523 m, 50286 m/sec, 23528637 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 1 (type EXCL) for Sudoku-PT-AN11-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-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 1 0 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 4 (type EXCL) for 3 Sudoku-PT-AN11-LTLCardinality-04
lola: time limit : 885 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-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/885 4/32 Sudoku-PT-AN11-LTLCardinality-04 239432 m, 47886 m/sec, 456277 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/885 8/32 Sudoku-PT-AN11-LTLCardinality-04 469071 m, 45927 m/sec, 929314 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/885 11/32 Sudoku-PT-AN11-LTLCardinality-04 688922 m, 43970 m/sec, 1384121 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/885 13/32 Sudoku-PT-AN11-LTLCardinality-04 891330 m, 40481 m/sec, 1812194 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/885 15/32 Sudoku-PT-AN11-LTLCardinality-04 1098482 m, 41430 m/sec, 2251527 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/885 18/32 Sudoku-PT-AN11-LTLCardinality-04 1305839 m, 41471 m/sec, 2698872 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/885 22/32 Sudoku-PT-AN11-LTLCardinality-04 1510418 m, 40915 m/sec, 3155693 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/885 25/32 Sudoku-PT-AN11-LTLCardinality-04 1711399 m, 40196 m/sec, 3632458 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/885 29/32 Sudoku-PT-AN11-LTLCardinality-04 1922147 m, 42149 m/sec, 4108032 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 1 0 1 0 0 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/885 31/32 Sudoku-PT-AN11-LTLCardinality-04 2110373 m, 37645 m/sec, 4572192 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 4 (type EXCL) for Sudoku-PT-AN11-LTLCardinality-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 14 (type EXCL) for 13 Sudoku-PT-AN11-LTLCardinality-07
lola: time limit : 1161 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-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 5/1161 4/32 Sudoku-PT-AN11-LTLCardinality-07 307295 m, 61459 m/sec, 1987061 t fired, .

Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 10/1161 7/32 Sudoku-PT-AN11-LTLCardinality-07 573092 m, 53159 m/sec, 3967820 t fired, .

Time elapsed: 125 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 15/1161 10/32 Sudoku-PT-AN11-LTLCardinality-07 864949 m, 58371 m/sec, 5936023 t fired, .

Time elapsed: 130 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 20/1161 12/32 Sudoku-PT-AN11-LTLCardinality-07 1110060 m, 49022 m/sec, 7939597 t fired, .

Time elapsed: 135 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 25/1161 14/32 Sudoku-PT-AN11-LTLCardinality-07 1326463 m, 43280 m/sec, 9930581 t fired, .

Time elapsed: 140 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 30/1161 17/32 Sudoku-PT-AN11-LTLCardinality-07 1614796 m, 57666 m/sec, 11873105 t fired, .

Time elapsed: 145 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 35/1161 20/32 Sudoku-PT-AN11-LTLCardinality-07 1874030 m, 51846 m/sec, 13795352 t fired, .

Time elapsed: 150 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 40/1161 22/32 Sudoku-PT-AN11-LTLCardinality-07 2154762 m, 56146 m/sec, 15694132 t fired, .

Time elapsed: 155 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 45/1161 25/32 Sudoku-PT-AN11-LTLCardinality-07 2400203 m, 49088 m/sec, 17586491 t fired, .

Time elapsed: 160 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 50/1161 27/32 Sudoku-PT-AN11-LTLCardinality-07 2613648 m, 42689 m/sec, 19487818 t fired, .

Time elapsed: 165 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 55/1161 29/32 Sudoku-PT-AN11-LTLCardinality-07 2837999 m, 44870 m/sec, 21418117 t fired, .

Time elapsed: 170 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 60/1161 31/32 Sudoku-PT-AN11-LTLCardinality-07 3070254 m, 46451 m/sec, 23393915 t fired, .

Time elapsed: 175 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 14 (type EXCL) for Sudoku-PT-AN11-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-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 2 0 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 180 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 11 (type EXCL) for 6 Sudoku-PT-AN11-LTLCardinality-05
lola: time limit : 1710 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-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 1 1 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 5/1710 4/32 Sudoku-PT-AN11-LTLCardinality-05 313395 m, 62679 m/sec, 2034054 t fired, .

Time elapsed: 185 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 1 1 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 10/1710 7/32 Sudoku-PT-AN11-LTLCardinality-05 588619 m, 55044 m/sec, 4072617 t fired, .

Time elapsed: 190 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 1 1 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 15/1710 10/32 Sudoku-PT-AN11-LTLCardinality-05 881191 m, 58514 m/sec, 6066352 t fired, .

Time elapsed: 195 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 1 1 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 20/1710 12/32 Sudoku-PT-AN11-LTLCardinality-05 1130320 m, 49825 m/sec, 8082859 t fired, .

Time elapsed: 200 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 1 1 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 25/1710 15/32 Sudoku-PT-AN11-LTLCardinality-05 1340405 m, 42017 m/sec, 10104072 t fired, .

Time elapsed: 205 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 1 1 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 30/1710 17/32 Sudoku-PT-AN11-LTLCardinality-05 1645856 m, 61090 m/sec, 12086702 t fired, .

Time elapsed: 210 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 1 1 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 35/1710 20/32 Sudoku-PT-AN11-LTLCardinality-05 1909459 m, 52720 m/sec, 14049396 t fired, .

Time elapsed: 215 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 1 1 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 40/1710 23/32 Sudoku-PT-AN11-LTLCardinality-05 2198004 m, 57709 m/sec, 15994994 t fired, .

Time elapsed: 220 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 1 1 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 45/1710 25/32 Sudoku-PT-AN11-LTLCardinality-05 2438048 m, 48008 m/sec, 17956339 t fired, .

Time elapsed: 225 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 1 1 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 50/1710 27/32 Sudoku-PT-AN11-LTLCardinality-05 2654024 m, 43195 m/sec, 19887827 t fired, .

Time elapsed: 230 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 1 1 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 55/1710 29/32 Sudoku-PT-AN11-LTLCardinality-05 2890963 m, 47387 m/sec, 21897522 t fired, .

Time elapsed: 235 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 1 1 0 2 0 0 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 60/1710 32/32 Sudoku-PT-AN11-LTLCardinality-05 3124908 m, 46789 m/sec, 23880151 t fired, .

Time elapsed: 240 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 11 (type EXCL) for Sudoku-PT-AN11-LTLCardinality-05 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 1 0 0 2 0 1 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 245 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 9 (type EXCL) for 6 Sudoku-PT-AN11-LTLCardinality-05
lola: time limit : 3355 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-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 0 1 0 2 0 1 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 5/3355 2/32 Sudoku-PT-AN11-LTLCardinality-05 111730 m, 22346 m/sec, 651259 t fired, .

Time elapsed: 250 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 0 1 0 2 0 1 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 10/3355 3/32 Sudoku-PT-AN11-LTLCardinality-05 210474 m, 19748 m/sec, 1312500 t fired, .

Time elapsed: 255 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 0 1 0 2 0 1 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 15/3355 5/32 Sudoku-PT-AN11-LTLCardinality-05 307670 m, 19439 m/sec, 1976948 t fired, .

Time elapsed: 260 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 0 1 0 2 0 1 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 20/3355 6/32 Sudoku-PT-AN11-LTLCardinality-05 400392 m, 18544 m/sec, 2639595 t fired, .

Time elapsed: 265 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 0 1 0 2 0 1 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 25/3355 7/32 Sudoku-PT-AN11-LTLCardinality-05 478685 m, 15658 m/sec, 3313784 t fired, .

Time elapsed: 270 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 0 1 0 2 0 1 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 30/3355 8/32 Sudoku-PT-AN11-LTLCardinality-05 577091 m, 19681 m/sec, 3982955 t fired, .

Time elapsed: 275 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 0 1 0 2 0 1 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 35/3355 9/32 Sudoku-PT-AN11-LTLCardinality-05 669314 m, 18444 m/sec, 4656021 t fired, .

Time elapsed: 280 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 0 1 0 2 0 1 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 40/3355 10/32 Sudoku-PT-AN11-LTLCardinality-05 775372 m, 21211 m/sec, 5324568 t fired, .

Time elapsed: 285 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 0 1 0 2 0 1 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 45/3355 12/32 Sudoku-PT-AN11-LTLCardinality-05 875521 m, 20029 m/sec, 5992801 t fired, .

Time elapsed: 290 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 0 1 0 2 0 1 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 50/3355 13/32 Sudoku-PT-AN11-LTLCardinality-05 965259 m, 17947 m/sec, 6663911 t fired, .

Time elapsed: 295 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 0 1 0 2 0 1 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 55/3355 14/32 Sudoku-PT-AN11-LTLCardinality-05 1045910 m, 16130 m/sec, 7331334 t fired, .

Time elapsed: 300 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 0 1 0 2 0 1 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 60/3355 15/32 Sudoku-PT-AN11-LTLCardinality-05 1121818 m, 15181 m/sec, 7999518 t fired, .

Time elapsed: 305 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 0 1 0 2 0 1 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 65/3355 16/32 Sudoku-PT-AN11-LTLCardinality-05 1199422 m, 15520 m/sec, 8676361 t fired, .

Time elapsed: 310 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 0 1 0 2 0 1 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 70/3355 17/32 Sudoku-PT-AN11-LTLCardinality-05 1277300 m, 15575 m/sec, 9358393 t fired, .

Time elapsed: 315 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 0 1 0 2 0 1 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 75/3355 17/32 Sudoku-PT-AN11-LTLCardinality-05 1339422 m, 12424 m/sec, 10021671 t fired, .

Time elapsed: 320 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 0 1 0 2 0 1 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 80/3355 19/32 Sudoku-PT-AN11-LTLCardinality-05 1440452 m, 20206 m/sec, 10677927 t fired, .

Time elapsed: 325 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 0 1 0 2 0 1 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 85/3355 20/32 Sudoku-PT-AN11-LTLCardinality-05 1539045 m, 19718 m/sec, 11335881 t fired, .

Time elapsed: 330 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 0 1 0 2 0 1 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 90/3355 21/32 Sudoku-PT-AN11-LTLCardinality-05 1638249 m, 19840 m/sec, 11992604 t fired, .

Time elapsed: 335 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 0 1 0 2 0 1 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 95/3355 22/32 Sudoku-PT-AN11-LTLCardinality-05 1728061 m, 17962 m/sec, 12652795 t fired, .

Time elapsed: 340 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 0 1 0 2 0 1 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 100/3355 24/32 Sudoku-PT-AN11-LTLCardinality-05 1809524 m, 16292 m/sec, 13314558 t fired, .

Time elapsed: 345 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 0 1 0 2 0 1 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 105/3355 25/32 Sudoku-PT-AN11-LTLCardinality-05 1903730 m, 18841 m/sec, 13971833 t fired, .

Time elapsed: 350 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 0 1 0 2 0 1 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 110/3355 26/32 Sudoku-PT-AN11-LTLCardinality-05 1988241 m, 16902 m/sec, 14631782 t fired, .

Time elapsed: 355 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 0 1 0 2 0 1 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 115/3355 27/32 Sudoku-PT-AN11-LTLCardinality-05 2093020 m, 20955 m/sec, 15285671 t fired, .

Time elapsed: 360 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 0 1 0 2 0 1 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 120/3355 28/32 Sudoku-PT-AN11-LTLCardinality-05 2194989 m, 20393 m/sec, 15940442 t fired, .

Time elapsed: 365 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 0 1 0 2 0 1 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 125/3355 30/32 Sudoku-PT-AN11-LTLCardinality-05 2291778 m, 19357 m/sec, 16594445 t fired, .

Time elapsed: 370 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 0 1 0 2 0 1 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 130/3355 30/32 Sudoku-PT-AN11-LTLCardinality-05 2367396 m, 15123 m/sec, 17270842 t fired, .

Time elapsed: 375 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 0 1 0 2 0 1 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 135/3355 31/32 Sudoku-PT-AN11-LTLCardinality-05 2443761 m, 15273 m/sec, 17949640 t fired, .

Time elapsed: 380 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 0 1 0 2 0 1 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 LTL EXCL 140/3355 32/32 Sudoku-PT-AN11-LTLCardinality-05 2526872 m, 16622 m/sec, 18625666 t fired, .

Time elapsed: 385 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 9 (type EXCL) for Sudoku-PT-AN11-LTLCardinality-05 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-PT-AN11-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-04: LTL 0 0 0 0 1 0 1 0
Sudoku-PT-AN11-LTLCardinality-05: CONJ 0 0 0 0 2 0 2 0
Sudoku-PT-AN11-LTLCardinality-07: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 390 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: Portfolio finished: no open tasks 4

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-PT-AN11-LTLCardinality-01: LTL unknown AGGR
Sudoku-PT-AN11-LTLCardinality-04: LTL unknown AGGR
Sudoku-PT-AN11-LTLCardinality-05: CONJ unknown CONJ
Sudoku-PT-AN11-LTLCardinality-07: LTL unknown AGGR


Time elapsed: 390 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-AN11"
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-AN11, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r487-tall-167912702800243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN11.tgz
mv Sudoku-PT-AN11 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;