About the Execution of LoLa+red for Sudoku-COL-AN09
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12889.439 | 496650.00 | 517808.00 | 2006.50 | FFFTFT?FF?T?FTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r487-tall-167912702600067.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Sudoku-COL-AN09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912702600067
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.6K Feb 26 09:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 09:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 08:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 08:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 09:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 26 09:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 09:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 09:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.5K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN09-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679160744109
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN09
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 17:32:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 17:32:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 17:32:26] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-18 17:32:26] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 17:32:26] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 380 ms
[2023-03-18 17:32:26] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 972 PT places and 729.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 17:32:26] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 5 ms.
[2023-03-18 17:32:26] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-COL-AN09-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10042 steps, including 120 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 22) seen :14
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 22 ms. (steps per millisecond=456 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 19 ms. (steps per millisecond=528 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 19 ms. (steps per millisecond=528 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 25 ms. (steps per millisecond=401 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 17 ms. (steps per millisecond=590 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 14 ms. (steps per millisecond=717 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 23 ms. (steps per millisecond=436 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 11 ms. (steps per millisecond=912 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1 rows 4 cols
[2023-03-18 17:32:27] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-18 17:32:27] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 17:32:27] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:6
[2023-03-18 17:32:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 17:32:27] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 8 atomic propositions for a total of 14 simplifications.
FORMULA Sudoku-COL-AN09-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 17:32:27] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2023-03-18 17:32:27] [INFO ] Flatten gal took : 12 ms
[2023-03-18 17:32:27] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA Sudoku-COL-AN09-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 17:32:27] [INFO ] Flatten gal took : 1 ms
Domain [N(9), N(9)] of place Rows breaks symmetries in sort N
[2023-03-18 17:32:27] [INFO ] Unfolded HLPN to a Petri net with 972 places and 729 transitions 2916 arcs in 20 ms.
[2023-03-18 17:32:27] [INFO ] Unfolded 9 HLPN properties in 2 ms.
Support contains 972 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 972 cols
[2023-03-18 17:32:27] [INFO ] Computed 243 place invariants in 22 ms
[2023-03-18 17:32:27] [INFO ] Implicit Places using invariants in 232 ms returned []
[2023-03-18 17:32:27] [INFO ] Invariant cache hit.
[2023-03-18 17:32:28] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
[2023-03-18 17:32:28] [INFO ] Invariant cache hit.
[2023-03-18 17:32:28] [INFO ] Dead Transitions using invariants and state equation in 408 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1092 ms. Remains : 972/972 places, 729/729 transitions.
Support contains 972 out of 972 places after structural reductions.
[2023-03-18 17:32:28] [INFO ] Flatten gal took : 81 ms
[2023-03-18 17:32:28] [INFO ] Flatten gal took : 73 ms
[2023-03-18 17:32:28] [INFO ] Input system was already deterministic with 729 transitions.
Incomplete random walk after 10000 steps, including 141 resets, run finished after 1027 ms. (steps per millisecond=9 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-18 17:32:30] [INFO ] Invariant cache hit.
[2023-03-18 17:32:31] [INFO ] [Real]Absence check using 243 positive place invariants in 58 ms returned sat
[2023-03-18 17:32:31] [INFO ] After 420ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-18 17:32:31] [INFO ] [Nat]Absence check using 243 positive place invariants in 41 ms returned sat
[2023-03-18 17:32:56] [INFO ] After 24565ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :4
[2023-03-18 17:32:56] [INFO ] After 24568ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-18 17:32:56] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
Fused 9 Parikh solutions to 5 different solutions.
Finished Parikh walk after 81 steps, including 0 resets, run visited all 2 properties in 17 ms. (steps per millisecond=4 )
Parikh walk visited 6 properties in 32 ms.
FORMULA Sudoku-COL-AN09-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 8 simplifications.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 891 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 32 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 17:32:56] [INFO ] Invariant cache hit.
[2023-03-18 17:32:57] [INFO ] Implicit Places using invariants in 324 ms returned []
[2023-03-18 17:32:57] [INFO ] Invariant cache hit.
[2023-03-18 17:32:57] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
[2023-03-18 17:32:57] [INFO ] Invariant cache hit.
[2023-03-18 17:32:58] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1394 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 236 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN09-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(LEQ (ADD s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 41 steps with 0 reset in 8 ms.
FORMULA Sudoku-COL-AN09-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN09-LTLCardinality-00 finished in 1703 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&&X(p1)))))'
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 24 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 17:32:58] [INFO ] Invariant cache hit.
[2023-03-18 17:32:58] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-03-18 17:32:58] [INFO ] Invariant cache hit.
[2023-03-18 17:32:59] [INFO ] Implicit Places using invariants and state equation in 720 ms returned []
Implicit Place search using SMT with State Equation took 1029 ms to find 0 implicit places.
[2023-03-18 17:32:59] [INFO ] Invariant cache hit.
[2023-03-18 17:32:59] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1419 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN09-LTLCardinality-02 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: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA Sudoku-COL-AN09-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN09-LTLCardinality-02 finished in 1585 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 81 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Reduce places removed 729 places and 0 transitions.
Iterating post reduction 0 with 729 rules applied. Total rules applied 729 place count 243 transition count 729
Applied a total of 729 rules in 22 ms. Remains 243 /972 variables (removed 729) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 243 cols
[2023-03-18 17:33:00] [INFO ] Computed 26 place invariants in 27 ms
[2023-03-18 17:33:00] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-18 17:33:00] [INFO ] Invariant cache hit.
[2023-03-18 17:33:00] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
[2023-03-18 17:33:00] [INFO ] Invariant cache hit.
[2023-03-18 17:33:00] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 243/972 places, 729/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 843 ms. Remains : 243/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN09-LTLCardinality-04 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:(GT 3 (ADD s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN09-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN09-LTLCardinality-04 finished in 939 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 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 27 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 972 cols
[2023-03-18 17:33:00] [INFO ] Computed 243 place invariants in 11 ms
[2023-03-18 17:33:01] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-18 17:33:01] [INFO ] Invariant cache hit.
[2023-03-18 17:33:02] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 1031 ms to find 0 implicit places.
[2023-03-18 17:33:02] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-18 17:33:02] [INFO ] Invariant cache hit.
[2023-03-18 17:33:02] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1470 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN09-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s810 s811 s812 s813 s814 s815 s816 s817 s818 s819 s820 s821 s822 s823 s824 s825 s826 s827 s828 s829 s830 s831 s832 s833 s834 s835 s836 s837 s...], 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 1418 reset in 7012 ms.
Product exploration explored 100000 steps with 1420 reset in 6962 ms.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
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 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 41 steps, including 0 resets, run visited all 1 properties in 7 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 145 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2023-03-18 17:33:25] [INFO ] Invariant cache hit.
[2023-03-18 17:33:27] [INFO ] [Real]Absence check using 243 positive place invariants in 77 ms returned sat
[2023-03-18 17:33:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:33:28] [INFO ] [Real]Absence check using state equation in 538 ms returned sat
[2023-03-18 17:33:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:33:33] [INFO ] [Nat]Absence check using 243 positive place invariants in 1749 ms returned sat
[2023-03-18 17:33:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:33:34] [INFO ] [Nat]Absence check using state equation in 1332 ms returned sat
[2023-03-18 17:33:34] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 33 ms.
[2023-03-18 17:33:34] [INFO ] Added : 0 causal constraints over 0 iterations in 125 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 16 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 17:33:34] [INFO ] Invariant cache hit.
[2023-03-18 17:33:34] [INFO ] Implicit Places using invariants in 331 ms returned []
[2023-03-18 17:33:34] [INFO ] Invariant cache hit.
[2023-03-18 17:33:35] [INFO ] Implicit Places using invariants and state equation in 672 ms returned []
Implicit Place search using SMT with State Equation took 1005 ms to find 0 implicit places.
[2023-03-18 17:33:35] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-18 17:33:35] [INFO ] Invariant cache hit.
[2023-03-18 17:33:35] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1428 ms. Remains : 972/972 places, 729/729 transitions.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
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 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 41 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=10 )
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 130 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2023-03-18 17:33:44] [INFO ] Invariant cache hit.
[2023-03-18 17:33:47] [INFO ] [Real]Absence check using 243 positive place invariants in 75 ms returned sat
[2023-03-18 17:33:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:33:47] [INFO ] [Real]Absence check using state equation in 536 ms returned sat
[2023-03-18 17:33:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:33:52] [INFO ] [Nat]Absence check using 243 positive place invariants in 1789 ms returned sat
[2023-03-18 17:33:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:33:53] [INFO ] [Nat]Absence check using state equation in 1417 ms returned sat
[2023-03-18 17:33:53] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 27 ms.
[2023-03-18 17:33:53] [INFO ] Added : 0 causal constraints over 0 iterations in 103 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1417 reset in 6867 ms.
Product exploration explored 100000 steps with 1418 reset in 6942 ms.
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 26 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 17:34:07] [INFO ] Invariant cache hit.
[2023-03-18 17:34:08] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-03-18 17:34:08] [INFO ] Invariant cache hit.
[2023-03-18 17:34:08] [INFO ] Implicit Places using invariants and state equation in 690 ms returned []
Implicit Place search using SMT with State Equation took 1020 ms to find 0 implicit places.
[2023-03-18 17:34:08] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-18 17:34:08] [INFO ] Invariant cache hit.
[2023-03-18 17:34:09] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1406 ms. Remains : 972/972 places, 729/729 transitions.
Treatment of property Sudoku-COL-AN09-LTLCardinality-06 finished in 68380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&(X(!p0) U (X(G(!p0))||(X(!p0)&&G(p1))))))'
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 8 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 17:34:09] [INFO ] Invariant cache hit.
[2023-03-18 17:34:09] [INFO ] Implicit Places using invariants in 294 ms returned []
[2023-03-18 17:34:09] [INFO ] Invariant cache hit.
[2023-03-18 17:34:10] [INFO ] Implicit Places using invariants and state equation in 686 ms returned []
Implicit Place search using SMT with State Equation took 989 ms to find 0 implicit places.
[2023-03-18 17:34:10] [INFO ] Invariant cache hit.
[2023-03-18 17:34:10] [INFO ] Dead Transitions using invariants and state equation in 389 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1388 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 247 ms :[true, (OR (NOT p1) p0), (OR (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), p0, p0]
Running random walk in product with property : Sudoku-COL-AN09-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 6}], [{ cond=(OR (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}]], initial=1, aps=[p1:(LEQ 1 (ADD s891 s892 s893 s894 s895 s896 s897 s898 s899 s900 s901 s902 s903 s904 s905 s906 s907 s908 s909 s910 s911 s912 s913 s914 s915 s916 s917 s918...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN09-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN09-LTLCardinality-08 finished in 1675 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||G(p1))))'
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 19 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 17:34:11] [INFO ] Invariant cache hit.
[2023-03-18 17:34:11] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-18 17:34:11] [INFO ] Invariant cache hit.
[2023-03-18 17:34:12] [INFO ] Implicit Places using invariants and state equation in 694 ms returned []
Implicit Place search using SMT with State Equation took 1006 ms to find 0 implicit places.
[2023-03-18 17:34:12] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-18 17:34:12] [INFO ] Invariant cache hit.
[2023-03-18 17:34:12] [INFO ] Dead Transitions using invariants and state equation in 341 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1380 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN09-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(LEQ 3 (ADD s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s11...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2380 reset in 9749 ms.
Product exploration explored 100000 steps with 2380 reset in 9808 ms.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 251 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p1) (NOT p0))]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 256 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p1) (NOT p0))]
[2023-03-18 17:34:51] [INFO ] Invariant cache hit.
[2023-03-18 17:34:56] [INFO ] [Real]Absence check using 243 positive place invariants in 73 ms returned sat
[2023-03-18 17:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:34:56] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2023-03-18 17:34:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:35:01] [INFO ] [Nat]Absence check using 243 positive place invariants in 109 ms returned sat
[2023-03-18 17:35:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:35:01] [INFO ] [Nat]Absence check using state equation in 680 ms returned sat
[2023-03-18 17:35:01] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 27 ms.
[2023-03-18 17:35:02] [INFO ] Added : 0 causal constraints over 0 iterations in 108 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 17:35:02] [INFO ] Invariant cache hit.
[2023-03-18 17:35:02] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-18 17:35:02] [INFO ] Invariant cache hit.
[2023-03-18 17:35:03] [INFO ] Implicit Places using invariants and state equation in 653 ms returned []
Implicit Place search using SMT with State Equation took 959 ms to find 0 implicit places.
[2023-03-18 17:35:03] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-18 17:35:03] [INFO ] Invariant cache hit.
[2023-03-18 17:35:03] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1343 ms. Remains : 972/972 places, 729/729 transitions.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 273 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p1) (NOT p0))]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 254 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p1) (NOT p0))]
[2023-03-18 17:35:22] [INFO ] Invariant cache hit.
[2023-03-18 17:35:27] [INFO ] [Real]Absence check using 243 positive place invariants in 76 ms returned sat
[2023-03-18 17:35:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 17:35:27] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2023-03-18 17:35:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 17:35:32] [INFO ] [Nat]Absence check using 243 positive place invariants in 113 ms returned sat
[2023-03-18 17:35:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 17:35:32] [INFO ] [Nat]Absence check using state equation in 701 ms returned sat
[2023-03-18 17:35:32] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 28 ms.
[2023-03-18 17:35:32] [INFO ] Added : 0 causal constraints over 0 iterations in 92 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2380 reset in 9277 ms.
Product exploration explored 100000 steps with 2380 reset in 9338 ms.
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 17 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 17:35:51] [INFO ] Invariant cache hit.
[2023-03-18 17:35:51] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-18 17:35:51] [INFO ] Invariant cache hit.
[2023-03-18 17:35:52] [INFO ] Implicit Places using invariants and state equation in 616 ms returned []
Implicit Place search using SMT with State Equation took 922 ms to find 0 implicit places.
[2023-03-18 17:35:52] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-18 17:35:52] [INFO ] Invariant cache hit.
[2023-03-18 17:35:52] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1299 ms. Remains : 972/972 places, 729/729 transitions.
Treatment of property Sudoku-COL-AN09-LTLCardinality-09 finished in 101889 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(X(X(F(p0))))))'
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 4 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 17:35:52] [INFO ] Invariant cache hit.
[2023-03-18 17:35:53] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-18 17:35:53] [INFO ] Invariant cache hit.
[2023-03-18 17:35:53] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 953 ms to find 0 implicit places.
[2023-03-18 17:35:53] [INFO ] Invariant cache hit.
[2023-03-18 17:35:54] [INFO ] Dead Transitions using invariants and state equation in 338 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1296 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN09-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(LEQ (ADD s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 ...], 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 9158 ms.
Product exploration explored 100000 steps with 20000 reset in 9241 ms.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
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, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 41 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=5 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 12 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 17:36:15] [INFO ] Invariant cache hit.
[2023-03-18 17:36:15] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-18 17:36:15] [INFO ] Invariant cache hit.
[2023-03-18 17:36:16] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 926 ms to find 0 implicit places.
[2023-03-18 17:36:16] [INFO ] Invariant cache hit.
[2023-03-18 17:36:16] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1287 ms. Remains : 972/972 places, 729/729 transitions.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
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, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 41 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=8 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 9141 ms.
Product exploration explored 100000 steps with 20000 reset in 9225 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 40 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 17:36:38] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-18 17:36:38] [INFO ] Invariant cache hit.
[2023-03-18 17:36:38] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 419 ms. Remains : 972/972 places, 729/729 transitions.
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 14 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 17:36:38] [INFO ] Invariant cache hit.
[2023-03-18 17:36:39] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-03-18 17:36:39] [INFO ] Invariant cache hit.
[2023-03-18 17:36:39] [INFO ] Implicit Places using invariants and state equation in 659 ms returned []
Implicit Place search using SMT with State Equation took 967 ms to find 0 implicit places.
[2023-03-18 17:36:39] [INFO ] Invariant cache hit.
[2023-03-18 17:36:40] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1309 ms. Remains : 972/972 places, 729/729 transitions.
Treatment of property Sudoku-COL-AN09-LTLCardinality-11 finished in 47218 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 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 11 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 17:36:40] [INFO ] Invariant cache hit.
[2023-03-18 17:36:40] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-18 17:36:40] [INFO ] Invariant cache hit.
[2023-03-18 17:36:41] [INFO ] Implicit Places using invariants and state equation in 652 ms returned []
Implicit Place search using SMT with State Equation took 958 ms to find 0 implicit places.
[2023-03-18 17:36:41] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-18 17:36:41] [INFO ] Invariant cache hit.
[2023-03-18 17:36:41] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1332 ms. Remains : 972/972 places, 729/729 transitions.
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN09-LTLCardinality-14 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:(GT 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 68 steps with 0 reset in 7 ms.
FORMULA Sudoku-COL-AN09-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN09-LTLCardinality-14 finished in 1446 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)))'
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||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' '!(X(X(X(X(F(p0))))))'
Found a Shortening insensitive property : Sudoku-COL-AN09-LTLCardinality-11
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 8 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 17:36:41] [INFO ] Invariant cache hit.
[2023-03-18 17:36:42] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-18 17:36:42] [INFO ] Invariant cache hit.
[2023-03-18 17:36:42] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 1000 ms to find 0 implicit places.
[2023-03-18 17:36:42] [INFO ] Invariant cache hit.
[2023-03-18 17:36:43] [INFO ] Dead Transitions using invariants and state equation in 352 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1363 ms. Remains : 972/972 places, 729/729 transitions.
Running random walk in product with property : Sudoku-COL-AN09-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(LEQ (ADD s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s99 s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 9143 ms.
Product exploration explored 100000 steps with 20000 reset in 9250 ms.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
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, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 41 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=5 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 6 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 17:37:04] [INFO ] Invariant cache hit.
[2023-03-18 17:37:04] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-18 17:37:04] [INFO ] Invariant cache hit.
[2023-03-18 17:37:05] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 943 ms to find 0 implicit places.
[2023-03-18 17:37:05] [INFO ] Invariant cache hit.
[2023-03-18 17:37:05] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1284 ms. Remains : 972/972 places, 729/729 transitions.
Computed a total of 972 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 972 transition count 729
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, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 41 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=5 )
Knowledge obtained : [p0, true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 9154 ms.
Product exploration explored 100000 steps with 20000 reset in 9250 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 13 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 17:37:27] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-18 17:37:27] [INFO ] Invariant cache hit.
[2023-03-18 17:37:27] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 378 ms. Remains : 972/972 places, 729/729 transitions.
Support contains 810 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Applied a total of 0 rules in 5 ms. Remains 972 /972 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 17:37:27] [INFO ] Invariant cache hit.
[2023-03-18 17:37:27] [INFO ] Implicit Places using invariants in 281 ms returned []
[2023-03-18 17:37:27] [INFO ] Invariant cache hit.
[2023-03-18 17:37:28] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 922 ms to find 0 implicit places.
[2023-03-18 17:37:28] [INFO ] Invariant cache hit.
[2023-03-18 17:37:28] [INFO ] Dead Transitions using invariants and state equation in 360 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1288 ms. Remains : 972/972 places, 729/729 transitions.
Treatment of property Sudoku-COL-AN09-LTLCardinality-11 finished in 47066 ms.
[2023-03-18 17:37:28] [INFO ] Flatten gal took : 53 ms
[2023-03-18 17:37:28] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-18 17:37:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 972 places, 729 transitions and 2916 arcs took 4 ms.
Total runtime 302673 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Sudoku-COL-AN09
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
LTLCardinality
BK_STOP 1679161240759
--------------------
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/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 7 (type EXCL) for 6 Sudoku-COL-AN09-LTLCardinality-11
lola: time limit : 1200 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-COL-AN09-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1200 4/32 Sudoku-COL-AN09-LTLCardinality-11 301092 m, 60218 m/sec, 531975 t fired, .
Time elapsed: 5 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1200 5/32 Sudoku-COL-AN09-LTLCardinality-11 528962 m, 45574 m/sec, 984321 t fired, .
Time elapsed: 10 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/1200 7/32 Sudoku-COL-AN09-LTLCardinality-11 756209 m, 45449 m/sec, 1436020 t fired, .
Time elapsed: 15 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/1200 9/32 Sudoku-COL-AN09-LTLCardinality-11 982179 m, 45194 m/sec, 1886025 t fired, .
Time elapsed: 20 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 25/1200 10/32 Sudoku-COL-AN09-LTLCardinality-11 1209486 m, 45461 m/sec, 2337875 t fired, .
Time elapsed: 25 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 30/1200 12/32 Sudoku-COL-AN09-LTLCardinality-11 1436738 m, 45450 m/sec, 2789693 t fired, .
Time elapsed: 30 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 35/1200 13/32 Sudoku-COL-AN09-LTLCardinality-11 1663174 m, 45287 m/sec, 3240435 t fired, .
Time elapsed: 35 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 40/1200 15/32 Sudoku-COL-AN09-LTLCardinality-11 1891802 m, 45725 m/sec, 3695447 t fired, .
Time elapsed: 40 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 45/1200 16/32 Sudoku-COL-AN09-LTLCardinality-11 2120280 m, 45695 m/sec, 4150742 t fired, .
Time elapsed: 45 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 50/1200 18/32 Sudoku-COL-AN09-LTLCardinality-11 2348895 m, 45723 m/sec, 4606698 t fired, .
Time elapsed: 50 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 55/1200 20/32 Sudoku-COL-AN09-LTLCardinality-11 2577122 m, 45645 m/sec, 5062704 t fired, .
Time elapsed: 55 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 60/1200 21/32 Sudoku-COL-AN09-LTLCardinality-11 2805650 m, 45705 m/sec, 5519807 t fired, .
Time elapsed: 60 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 65/1200 23/32 Sudoku-COL-AN09-LTLCardinality-11 3034318 m, 45733 m/sec, 5977439 t fired, .
Time elapsed: 65 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 70/1200 24/32 Sudoku-COL-AN09-LTLCardinality-11 3262221 m, 45580 m/sec, 6434759 t fired, .
Time elapsed: 70 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 75/1200 26/32 Sudoku-COL-AN09-LTLCardinality-11 3489588 m, 45473 m/sec, 6892053 t fired, .
Time elapsed: 75 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 80/1200 28/32 Sudoku-COL-AN09-LTLCardinality-11 3717580 m, 45598 m/sec, 7356261 t fired, .
Time elapsed: 80 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 85/1200 29/32 Sudoku-COL-AN09-LTLCardinality-11 3946416 m, 45767 m/sec, 7825592 t fired, .
Time elapsed: 85 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 90/1200 31/32 Sudoku-COL-AN09-LTLCardinality-11 4172195 m, 45155 m/sec, 8292112 t fired, .
Time elapsed: 90 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 7 (type EXCL) for Sudoku-COL-AN09-LTLCardinality-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 4 (type EXCL) for 3 Sudoku-COL-AN09-LTLCardinality-09
lola: time limit : 1752 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-COL-AN09-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1752 6/32 Sudoku-COL-AN09-LTLCardinality-09 372975 m, 74595 m/sec, 791591 t fired, .
Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1752 12/32 Sudoku-COL-AN09-LTLCardinality-09 701567 m, 65718 m/sec, 1671047 t fired, .
Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1752 16/32 Sudoku-COL-AN09-LTLCardinality-09 908409 m, 41368 m/sec, 2697229 t fired, .
Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1752 19/32 Sudoku-COL-AN09-LTLCardinality-09 1125232 m, 43364 m/sec, 3145557 t fired, .
Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1752 23/32 Sudoku-COL-AN09-LTLCardinality-09 1351012 m, 45156 m/sec, 3659900 t fired, .
Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1752 26/32 Sudoku-COL-AN09-LTLCardinality-09 1585479 m, 46893 m/sec, 4303047 t fired, .
Time elapsed: 125 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/1752 29/32 Sudoku-COL-AN09-LTLCardinality-09 1793262 m, 41556 m/sec, 5216151 t fired, .
Time elapsed: 130 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/1752 32/32 Sudoku-COL-AN09-LTLCardinality-09 1983198 m, 37987 m/sec, 5735770 t fired, .
Time elapsed: 135 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for Sudoku-COL-AN09-LTLCardinality-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 140 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 1 (type EXCL) for 0 Sudoku-COL-AN09-LTLCardinality-06
lola: time limit : 3460 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-COL-AN09-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3460 4/32 Sudoku-COL-AN09-LTLCardinality-06 200282 m, 40056 m/sec, 1192009 t fired, .
Time elapsed: 145 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3460 8/32 Sudoku-COL-AN09-LTLCardinality-06 387609 m, 37465 m/sec, 2373189 t fired, .
Time elapsed: 150 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3460 11/32 Sudoku-COL-AN09-LTLCardinality-06 560875 m, 34653 m/sec, 3547239 t fired, .
Time elapsed: 155 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3460 15/32 Sudoku-COL-AN09-LTLCardinality-06 719017 m, 31628 m/sec, 4728023 t fired, .
Time elapsed: 160 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3460 18/32 Sudoku-COL-AN09-LTLCardinality-06 876324 m, 31461 m/sec, 5909802 t fired, .
Time elapsed: 165 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3460 21/32 Sudoku-COL-AN09-LTLCardinality-06 1049043 m, 34543 m/sec, 7058155 t fired, .
Time elapsed: 170 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3460 24/32 Sudoku-COL-AN09-LTLCardinality-06 1215101 m, 33211 m/sec, 8207090 t fired, .
Time elapsed: 175 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3460 27/32 Sudoku-COL-AN09-LTLCardinality-06 1381600 m, 33299 m/sec, 9367986 t fired, .
Time elapsed: 180 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3460 30/32 Sudoku-COL-AN09-LTLCardinality-06 1532781 m, 30236 m/sec, 10531319 t fired, .
Time elapsed: 185 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for Sudoku-COL-AN09-LTLCardinality-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-AN09-LTLCardinality-06: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN09-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-AN09-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 190 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-AN09-LTLCardinality-06: LTL unknown AGGR
Sudoku-COL-AN09-LTLCardinality-09: LTL unknown AGGR
Sudoku-COL-AN09-LTLCardinality-11: LTL unknown AGGR
Time elapsed: 190 secs. Pages in use: 32
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-COL-AN09"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is Sudoku-COL-AN09, 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-167912702600067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN09.tgz
mv Sudoku-COL-AN09 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;