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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.2K Feb 26 09:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 09:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 09:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 09:08 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.8K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 09:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 26 09:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 09:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 09:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:17 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 146K 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-BN09-LTLCardinality-00
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-01
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-02
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-03
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-04
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-05
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-06
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-07
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-08
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-09
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-10
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-11
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-12
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-13
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-14
FORMULA_NAME Sudoku-COL-BN09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679169756763

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-BN09
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 20:02:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 20:02:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:02:38] [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 20:02:38] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 20:02:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 461 ms
[2023-03-18 20:02:38] [INFO ] Imported 5 HL places and 1 HL transitions for a total of 1053 PT places and 6561.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 20:02:39] [INFO ] Built PT skeleton of HLPN with 5 places and 1 transitions 5 arcs in 3 ms.
[2023-03-18 20:02:39] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-COL-BN09-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 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 12 properties that can be checked using skeleton over-approximation.
Computed a total of 5 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 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 50 ms. (steps per millisecond=200 ) properties (out of 22) seen :12
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 25 ms. (steps per millisecond=401 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 18 ms. (steps per millisecond=557 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 18 ms. (steps per millisecond=557 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 18 ms. (steps per millisecond=557 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 16 ms. (steps per millisecond=627 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10042 steps, including 120 resets, run finished after 18 ms. (steps per millisecond=557 ) properties (out of 10) 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 10) 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 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1 rows 5 cols
[2023-03-18 20:02:39] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-18 20:02:39] [INFO ] After 346ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-18 20:02:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-18 20:02:39] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :1
[2023-03-18 20:02:39] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-18 20:02:39] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :1
Fused 10 Parikh solutions to 1 different solutions.
Finished Parikh walk after 41 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=41 )
Parikh walk visited 1 properties in 2 ms.
Successfully simplified 9 atomic propositions for a total of 12 simplifications.
FORMULA Sudoku-COL-BN09-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 20:02:39] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2023-03-18 20:02:39] [INFO ] Flatten gal took : 20 ms
FORMULA Sudoku-COL-BN09-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-BN09-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 20:02:39] [INFO ] Flatten gal took : 2 ms
Domain [N(9), N(9)] of place Rows breaks symmetries in sort N
[2023-03-18 20:02:39] [INFO ] Unfolded HLPN to a Petri net with 1053 places and 729 transitions 3645 arcs in 37 ms.
[2023-03-18 20:02:39] [INFO ] Unfolded 7 HLPN properties in 6 ms.
Support contains 1053 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 14 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 1053 cols
[2023-03-18 20:02:40] [INFO ] Computed 324 place invariants in 30 ms
[2023-03-18 20:02:40] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-18 20:02:40] [INFO ] Invariant cache hit.
[2023-03-18 20:02:40] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
[2023-03-18 20:02:40] [INFO ] Invariant cache hit.
[2023-03-18 20:02:41] [INFO ] Dead Transitions using invariants and state equation in 436 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1157 ms. Remains : 1053/1053 places, 729/729 transitions.
Support contains 1053 out of 1053 places after structural reductions.
[2023-03-18 20:02:41] [INFO ] Flatten gal took : 106 ms
[2023-03-18 20:02:41] [INFO ] Flatten gal took : 89 ms
[2023-03-18 20:02:41] [INFO ] Input system was already deterministic with 729 transitions.
Incomplete random walk after 10000 steps, including 150 resets, run finished after 973 ms. (steps per millisecond=10 ) properties (out of 13) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 298 ms. (steps per millisecond=33 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-18 20:02:43] [INFO ] Invariant cache hit.
[2023-03-18 20:02:44] [INFO ] [Real]Absence check using 324 positive place invariants in 67 ms returned sat
[2023-03-18 20:03:05] [INFO ] After 21329ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 20:03:05] [INFO ] [Nat]Absence check using 324 positive place invariants in 63 ms returned sat
[2023-03-18 20:03:30] [INFO ] After 23592ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-18 20:03:30] [INFO ] After 23596ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-18 20:03:30] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 7 Parikh solutions to 4 different solutions.
Finished Parikh walk after 81 steps, including 0 resets, run visited all 6 properties in 8 ms. (steps per millisecond=10 )
Parikh walk visited 6 properties in 8 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 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' '!((G(p0) U p1))'
Support contains 810 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 58 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 20:03:30] [INFO ] Invariant cache hit.
[2023-03-18 20:03:30] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-18 20:03:30] [INFO ] Invariant cache hit.
[2023-03-18 20:03:31] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 1298 ms to find 0 implicit places.
[2023-03-18 20:03:31] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-18 20:03:31] [INFO ] Invariant cache hit.
[2023-03-18 20:03:32] [INFO ] Dead Transitions using invariants and state equation in 398 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1809 ms. Remains : 1053/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (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...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1980 reset in 5180 ms.
Product exploration explored 100000 steps with 1979 reset in 5197 ms.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 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) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 372 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 150 resets, run finished after 566 ms. (steps per millisecond=17 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 20:04:01] [INFO ] Invariant cache hit.
[2023-03-18 20:04:01] [INFO ] [Real]Absence check using 324 positive place invariants in 66 ms returned sat
[2023-03-18 20:04:01] [INFO ] After 358ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 20:04:02] [INFO ] [Nat]Absence check using 324 positive place invariants in 60 ms returned sat
[2023-03-18 20:04:11] [INFO ] After 9386ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 20:04:21] [INFO ] After 19216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5200 ms.
[2023-03-18 20:04:26] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 81 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=16 )
Parikh walk visited 2 properties in 4 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 10 factoid took 463 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), true, (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), true, (NOT p0)]
[2023-03-18 20:04:27] [INFO ] Invariant cache hit.
[2023-03-18 20:04:30] [INFO ] [Real]Absence check using 324 positive place invariants in 113 ms returned sat
[2023-03-18 20:04:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:04:31] [INFO ] [Real]Absence check using state equation in 551 ms returned sat
[2023-03-18 20:04:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:04:34] [INFO ] [Nat]Absence check using 324 positive place invariants in 156 ms returned sat
[2023-03-18 20:04:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:04:35] [INFO ] [Nat]Absence check using state equation in 913 ms returned sat
[2023-03-18 20:04:35] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 31 ms.
[2023-03-18 20:04:35] [INFO ] Added : 0 causal constraints over 0 iterations in 104 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 810 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 22 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 20:04:35] [INFO ] Invariant cache hit.
[2023-03-18 20:04:35] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-18 20:04:35] [INFO ] Invariant cache hit.
[2023-03-18 20:04:36] [INFO ] Implicit Places using invariants and state equation in 809 ms returned []
Implicit Place search using SMT with State Equation took 1225 ms to find 0 implicit places.
[2023-03-18 20:04:36] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-18 20:04:36] [INFO ] Invariant cache hit.
[2023-03-18 20:04:36] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1647 ms. Remains : 1053/1053 places, 729/729 transitions.
Computed a total of 1053 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1053 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) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 341 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), true, (NOT p0)]
Incomplete random walk after 10000 steps, including 150 resets, run finished after 593 ms. (steps per millisecond=16 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 20:04:56] [INFO ] Invariant cache hit.
[2023-03-18 20:04:56] [INFO ] [Real]Absence check using 324 positive place invariants in 61 ms returned sat
[2023-03-18 20:04:56] [INFO ] After 357ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 20:04:56] [INFO ] [Nat]Absence check using 324 positive place invariants in 63 ms returned sat
[2023-03-18 20:05:06] [INFO ] After 9388ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 20:05:16] [INFO ] After 19271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5136 ms.
[2023-03-18 20:05:21] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 81 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=16 )
Parikh walk visited 2 properties in 5 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 10 factoid took 544 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), true, (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), true, (NOT p0)]
[2023-03-18 20:05:22] [INFO ] Invariant cache hit.
[2023-03-18 20:05:25] [INFO ] [Real]Absence check using 324 positive place invariants in 104 ms returned sat
[2023-03-18 20:05:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 20:05:25] [INFO ] [Real]Absence check using state equation in 539 ms returned sat
[2023-03-18 20:05:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 20:05:28] [INFO ] [Nat]Absence check using 324 positive place invariants in 162 ms returned sat
[2023-03-18 20:05:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 20:05:29] [INFO ] [Nat]Absence check using state equation in 961 ms returned sat
[2023-03-18 20:05:29] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 25 ms.
[2023-03-18 20:05:29] [INFO ] Added : 0 causal constraints over 0 iterations in 97 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), true, (NOT p0)]
Product exploration explored 100000 steps with 1991 reset in 5010 ms.
Product exploration explored 100000 steps with 2009 reset in 5046 ms.
Support contains 810 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 30 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 20:05:39] [INFO ] Invariant cache hit.
[2023-03-18 20:05:40] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-18 20:05:40] [INFO ] Invariant cache hit.
[2023-03-18 20:05:41] [INFO ] Implicit Places using invariants and state equation in 790 ms returned []
Implicit Place search using SMT with State Equation took 1209 ms to find 0 implicit places.
[2023-03-18 20:05:41] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-18 20:05:41] [INFO ] Invariant cache hit.
[2023-03-18 20:05:41] [INFO ] Dead Transitions using invariants and state equation in 376 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1635 ms. Remains : 1053/1053 places, 729/729 transitions.
Treatment of property Sudoku-COL-BN09-LTLCardinality-00 finished in 131455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)||(p1&&F((!p1&&G(!p0))))))))'
Support contains 891 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 13 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 20:05:41] [INFO ] Invariant cache hit.
[2023-03-18 20:05:42] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-18 20:05:42] [INFO ] Invariant cache hit.
[2023-03-18 20:05:42] [INFO ] Implicit Places using invariants and state equation in 648 ms returned []
Implicit Place search using SMT with State Equation took 976 ms to find 0 implicit places.
[2023-03-18 20:05:42] [INFO ] Invariant cache hit.
[2023-03-18 20:05:43] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1365 ms. Remains : 1053/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (AND (NOT p0) p1), false, (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={1} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(GT (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 s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 65 steps with 0 reset in 11 ms.
FORMULA Sudoku-COL-BN09-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN09-LTLCardinality-01 finished in 1554 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 U (G(p0)||(p0&&(F(G(p1))||G(!p2)||(G(F(p3))&&(!p2||F(G(p1))))))))))'
Support contains 891 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 22 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 20:05:43] [INFO ] Invariant cache hit.
[2023-03-18 20:05:43] [INFO ] Implicit Places using invariants in 342 ms returned []
[2023-03-18 20:05:43] [INFO ] Invariant cache hit.
[2023-03-18 20:05:44] [INFO ] Implicit Places using invariants and state equation in 657 ms returned []
Implicit Place search using SMT with State Equation took 1001 ms to find 0 implicit places.
[2023-03-18 20:05:44] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-18 20:05:44] [INFO ] Invariant cache hit.
[2023-03-18 20:05:44] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1429 ms. Remains : 1053/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 286 ms :[(NOT p0), (AND (NOT p0) (NOT p1) p2 (NOT p3)), (AND (NOT p0) (NOT p1) p2 (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND p2 p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p2) (NOT p3) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3) (NOT p0)), acceptance={2} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), acceptance={0, 2} source=1 dest: 1}, { cond=(AND p1 p2 (NOT p3) p0), acceptance={1} source=1 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={0, 1} source=1 dest: 4}, { cond=(AND p1 p2 (NOT p3) (NOT p0)), acceptance={1, 2} source=1 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={0, 1, 2} source=1 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p3) (NOT p0))), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2 p0), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={1, 2} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2) (NOT p3) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={0} source=4 dest: 1}, { cond=(AND p1 p2 (NOT p3) p0), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={1, 2} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={0, 1, 2} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 2}, { cond=(OR (AND p2 (NOT p3)) (AND (NOT p3) (NOT p0))), acceptance={} source=5 dest: 4}, { cond=(OR p2 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GT 2 (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=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 67 steps with 0 reset in 10 ms.
FORMULA Sudoku-COL-BN09-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN09-LTLCardinality-03 finished in 1762 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)&&X(G(p1))))'
Support contains 1053 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 4 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 20:05:45] [INFO ] Invariant cache hit.
[2023-03-18 20:05:45] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-18 20:05:45] [INFO ] Invariant cache hit.
[2023-03-18 20:05:45] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
[2023-03-18 20:05:45] [INFO ] Invariant cache hit.
[2023-03-18 20:05:46] [INFO ] Dead Transitions using invariants and state equation in 397 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 997 ms. Remains : 1053/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GT (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 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-BN09-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN09-LTLCardinality-04 finished in 1143 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 81 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 324 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.5 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 39 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2023-03-18 20:05:46] [INFO ] Computed 75 place invariants in 35 ms
[2023-03-18 20:05:46] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-18 20:05:46] [INFO ] Invariant cache hit.
[2023-03-18 20:05:47] [INFO ] Implicit Places using invariants and state equation in 648 ms returned []
Implicit Place search using SMT with State Equation took 911 ms to find 0 implicit places.
[2023-03-18 20:05:47] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-18 20:05:47] [INFO ] Invariant cache hit.
[2023-03-18 20:05:47] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 324/1053 places, 729/729 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1219 ms. Remains : 324/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(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, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 68 steps with 0 reset in 7 ms.
FORMULA Sudoku-COL-BN09-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN09-LTLCardinality-08 finished in 1317 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 81 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Graph (complete) has 2916 edges and 1053 vertex of which 324 are kept as prefixes of interest. Removing 729 places using SCC suffix rule.4 ms
Discarding 729 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
[2023-03-18 20:05:47] [INFO ] Invariant cache hit.
[2023-03-18 20:05:47] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-18 20:05:47] [INFO ] Invariant cache hit.
[2023-03-18 20:05:48] [INFO ] Implicit Places using invariants and state equation in 594 ms returned []
Implicit Place search using SMT with State Equation took 838 ms to find 0 implicit places.
[2023-03-18 20:05:48] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-18 20:05:48] [INFO ] Invariant cache hit.
[2023-03-18 20:05:48] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 324/1053 places, 729/729 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1121 ms. Remains : 324/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (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 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 1507 reset in 4712 ms.
Product exploration explored 100000 steps with 1509 reset in 4802 ms.
Computed a total of 324 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 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, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 150 resets, run finished after 459 ms. (steps per millisecond=21 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 566707 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :{}
Probabilistic random walk after 566707 steps, saw 118890 distinct states, run finished after 3002 ms. (steps per millisecond=188 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 20:06:04] [INFO ] Invariant cache hit.
[2023-03-18 20:06:04] [INFO ] [Real]Absence check using 0 positive and 75 generalized place invariants in 21 ms returned sat
[2023-03-18 20:06:12] [INFO ] After 7676ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 20:06:12] [INFO ] [Nat]Absence check using 0 positive and 75 generalized place invariants in 23 ms returned sat
[2023-03-18 20:06:15] [INFO ] After 2679ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 20:06:17] [INFO ] After 4857ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6809 ms.
[2023-03-18 20:06:24] [INFO ] After 11756ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 81 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=27 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 203 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 44 ms :[(NOT p0)]
Support contains 81 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 16 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 20:06:24] [INFO ] Invariant cache hit.
[2023-03-18 20:06:24] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-18 20:06:24] [INFO ] Invariant cache hit.
[2023-03-18 20:06:25] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 855 ms to find 0 implicit places.
[2023-03-18 20:06:25] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-18 20:06:25] [INFO ] Invariant cache hit.
[2023-03-18 20:06:25] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1149 ms. Remains : 324/324 places, 729/729 transitions.
Computed a total of 324 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 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, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 148 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 151 resets, run finished after 465 ms. (steps per millisecond=21 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 564898 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :{}
Probabilistic random walk after 564898 steps, saw 118493 distinct states, run finished after 3003 ms. (steps per millisecond=188 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 20:06:32] [INFO ] Invariant cache hit.
[2023-03-18 20:06:32] [INFO ] [Real]Absence check using 0 positive and 75 generalized place invariants in 21 ms returned sat
[2023-03-18 20:06:39] [INFO ] After 7815ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 20:06:39] [INFO ] [Nat]Absence check using 0 positive and 75 generalized place invariants in 20 ms returned sat
[2023-03-18 20:06:42] [INFO ] After 2599ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 20:06:44] [INFO ] After 4723ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6822 ms.
[2023-03-18 20:06:51] [INFO ] After 11618ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 81 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1507 reset in 4732 ms.
Product exploration explored 100000 steps with 1509 reset in 4838 ms.
Support contains 81 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 10 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 20:07:01] [INFO ] Invariant cache hit.
[2023-03-18 20:07:01] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-03-18 20:07:01] [INFO ] Invariant cache hit.
[2023-03-18 20:07:02] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 839 ms to find 0 implicit places.
[2023-03-18 20:07:02] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-18 20:07:02] [INFO ] Invariant cache hit.
[2023-03-18 20:07:02] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1109 ms. Remains : 324/324 places, 729/729 transitions.
Treatment of property Sudoku-COL-BN09-LTLCardinality-13 finished in 75075 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&(G(!p1)||X(X(F(p1)))))))'
Support contains 891 out of 1053 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1053/1053 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 1053 /1053 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 1053 cols
[2023-03-18 20:07:02] [INFO ] Computed 324 place invariants in 7 ms
[2023-03-18 20:07:02] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-18 20:07:02] [INFO ] Invariant cache hit.
[2023-03-18 20:07:03] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 965 ms to find 0 implicit places.
[2023-03-18 20:07:03] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-18 20:07:03] [INFO ] Invariant cache hit.
[2023-03-18 20:07:03] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1361 ms. Remains : 1053/1053 places, 729/729 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-BN09-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, 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, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 10 ms.
FORMULA Sudoku-COL-BN09-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-BN09-LTLCardinality-14 finished in 1556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U p1))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-18 20:07:04] [INFO ] Flatten gal took : 48 ms
[2023-03-18 20:07:04] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-18 20:07:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1053 places, 729 transitions and 3645 arcs took 6 ms.
Total runtime 266218 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Sudoku-COL-BN09
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

BK_STOP 1679170130855

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 4 (type EXCL) for 3 Sudoku-COL-BN09-LTLCardinality-13
lola: time limit : 1800 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-BN09-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN09-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1800 4/32 Sudoku-COL-BN09-LTLCardinality-13 409542 m, 81908 m/sec, 2511016 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN09-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN09-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1800 7/32 Sudoku-COL-BN09-LTLCardinality-13 758562 m, 69804 m/sec, 5186914 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN09-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN09-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1800 11/32 Sudoku-COL-BN09-LTLCardinality-13 1155337 m, 79355 m/sec, 7798367 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN09-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN09-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1800 14/32 Sudoku-COL-BN09-LTLCardinality-13 1510176 m, 70967 m/sec, 10411935 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN09-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN09-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1800 17/32 Sudoku-COL-BN09-LTLCardinality-13 1878545 m, 73673 m/sec, 12927728 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN09-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN09-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1800 19/32 Sudoku-COL-BN09-LTLCardinality-13 2197062 m, 63703 m/sec, 15595475 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN09-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN09-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/1800 22/32 Sudoku-COL-BN09-LTLCardinality-13 2544966 m, 69580 m/sec, 18195027 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN09-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN09-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/1800 25/32 Sudoku-COL-BN09-LTLCardinality-13 2860786 m, 63164 m/sec, 20703924 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN09-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN09-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/1800 28/32 Sudoku-COL-BN09-LTLCardinality-13 3149327 m, 57708 m/sec, 23307368 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN09-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN09-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/1800 30/32 Sudoku-COL-BN09-LTLCardinality-13 3388684 m, 47871 m/sec, 25948884 t fired, .

Time elapsed: 50 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for Sudoku-COL-BN09-LTLCardinality-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN09-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
Sudoku-COL-BN09-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 Sudoku-COL-BN09-LTLCardinality-00
lola: time limit : 3545 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-BN09-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-BN09-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3545 5/32 Sudoku-COL-BN09-LTLCardinality-00 196615 m, 39323 m/sec, 1154863 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN09-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-BN09-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3545 8/32 Sudoku-COL-BN09-LTLCardinality-00 368580 m, 34393 m/sec, 2293333 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN09-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-BN09-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3545 12/32 Sudoku-COL-BN09-LTLCardinality-00 539913 m, 34266 m/sec, 3432097 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN09-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-BN09-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3545 14/32 Sudoku-COL-BN09-LTLCardinality-00 680419 m, 28101 m/sec, 4565011 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN09-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-BN09-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3545 17/32 Sudoku-COL-BN09-LTLCardinality-00 836267 m, 31169 m/sec, 5691068 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN09-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-BN09-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3545 21/32 Sudoku-COL-BN09-LTLCardinality-00 1010316 m, 34809 m/sec, 6797162 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN09-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-BN09-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3545 24/32 Sudoku-COL-BN09-LTLCardinality-00 1171866 m, 32310 m/sec, 7908435 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN09-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-BN09-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3545 27/32 Sudoku-COL-BN09-LTLCardinality-00 1311435 m, 27913 m/sec, 9023356 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN09-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
Sudoku-COL-BN09-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3545 30/32 Sudoku-COL-BN09-LTLCardinality-00 1467171 m, 31147 m/sec, 10130037 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Sudoku-COL-BN09-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
Sudoku-COL-BN09-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Sudoku-COL-BN09-LTLCardinality-00: LTL unknown AGGR
Sudoku-COL-BN09-LTLCardinality-13: LTL unknown AGGR


Time elapsed: 105 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-BN09"
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-BN09, 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-167912702700147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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