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.r485-tall-167912698800004.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 itstools
Input is Sudoku-COL-AN01, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912698800004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.7K Feb 26 09:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 09:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 09:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 09:33 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.3K Feb 25 17:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 09:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 26 09:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 09:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 09:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.5K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679146221067

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN01
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-18 13:30:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 13:30:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 13:30:22] [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 13:30:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 13:30:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 431 ms
[2023-03-18 13:30:23] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 4 PT places and 1.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 13:30:23] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 5 ms.
[2023-03-18 13:30:23] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 2 properties that can be checked using skeleton over-approximation.
FORMULA Sudoku-COL-AN01-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2023-03-18 13:30:23] [INFO ] Flatten gal took : 12 ms
[2023-03-18 13:30:23] [INFO ] Flatten gal took : 1 ms
[2023-03-18 13:30:23] [INFO ] Unfolded HLPN to a Petri net with 4 places and 1 transitions 4 arcs in 4 ms.
[2023-03-18 13:30:23] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-COL-AN01-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 1
Applied a total of 1 rules in 9 ms. Remains 3 /4 variables (removed 1) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 3 cols
[2023-03-18 13:30:23] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-18 13:30:23] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-18 13:30:23] [INFO ] Invariant cache hit.
[2023-03-18 13:30:23] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2023-03-18 13:30:23] [INFO ] Invariant cache hit.
[2023-03-18 13:30:23] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 1/1 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 194 ms. Remains : 3/4 places, 1/1 transitions.
Support contains 3 out of 3 places after structural reductions.
[2023-03-18 13:30:23] [INFO ] Flatten gal took : 2 ms
[2023-03-18 13:30:23] [INFO ] Flatten gal took : 2 ms
[2023-03-18 13:30:23] [INFO ] Input system was already deterministic with 1 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 6 properties in 152 ms. (steps per millisecond=0 )
Computed a total of 3 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 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).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F((!p0||X(!p0)))))'
Support contains 3 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 13:30:24] [INFO ] Invariant cache hit.
[2023-03-18 13:30:24] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-18 13:30:24] [INFO ] Invariant cache hit.
[2023-03-18 13:30:24] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-18 13:30:24] [INFO ] Invariant cache hit.
[2023-03-18 13:30:24] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 3/3 places, 1/1 transitions.
Stuttering acceptance computed with spot in 271 ms :[true, (NOT p0), p0, true]
Running random walk in product with property : Sudoku-COL-AN01-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s1 1) (LT s2 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 164 ms.
Product exploration explored 100000 steps with 50000 reset in 80 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 114 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN01-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN01-LTLFireability-00 finished in 829 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 U X(!p0)))))'
Support contains 3 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 13:30:25] [INFO ] Invariant cache hit.
[2023-03-18 13:30:25] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-18 13:30:25] [INFO ] Invariant cache hit.
[2023-03-18 13:30:25] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-18 13:30:25] [INFO ] Invariant cache hit.
[2023-03-18 13:30:25] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 3/3 places, 1/1 transitions.
Stuttering acceptance computed with spot in 87 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-AN01-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s1 1) (LT s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN01-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN01-LTLFireability-02 finished in 177 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 2 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 13:30:25] [INFO ] Invariant cache hit.
[2023-03-18 13:30:25] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-18 13:30:25] [INFO ] Invariant cache hit.
[2023-03-18 13:30:25] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-18 13:30:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 13:30:25] [INFO ] Invariant cache hit.
[2023-03-18 13:30:25] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 3/3 places, 1/1 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN01-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s1 1) (LT s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 52 ms.
Product exploration explored 100000 steps with 50000 reset in 124 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 62 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN01-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN01-LTLFireability-04 finished in 395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U X(!p0))&&X(X(!p0)))))'
Support contains 3 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 13:30:25] [INFO ] Invariant cache hit.
[2023-03-18 13:30:25] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-18 13:30:25] [INFO ] Invariant cache hit.
[2023-03-18 13:30:25] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-18 13:30:25] [INFO ] Invariant cache hit.
[2023-03-18 13:30:25] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68 ms. Remains : 3/3 places, 1/1 transitions.
Stuttering acceptance computed with spot in 153 ms :[p0, p0, p0, p0, true]
Running random walk in product with property : Sudoku-COL-AN01-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s1 1) (LT s2 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN01-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN01-LTLFireability-05 finished in 234 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 3 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 13:30:25] [INFO ] Invariant cache hit.
[2023-03-18 13:30:25] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-18 13:30:25] [INFO ] Invariant cache hit.
[2023-03-18 13:30:25] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-18 13:30:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 13:30:25] [INFO ] Invariant cache hit.
[2023-03-18 13:30:25] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70 ms. Remains : 3/3 places, 1/1 transitions.
Stuttering acceptance computed with spot in 72 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-AN01-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s1 1) (LT s2 1))], 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 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN01-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN01-LTLFireability-06 finished in 153 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!p0))||G(p1)))'
Support contains 3 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 13:30:26] [INFO ] Invariant cache hit.
[2023-03-18 13:30:26] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-18 13:30:26] [INFO ] Invariant cache hit.
[2023-03-18 13:30:26] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-18 13:30:26] [INFO ] Invariant cache hit.
[2023-03-18 13:30:26] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 3/3 places, 1/1 transitions.
Stuttering acceptance computed with spot in 117 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN01-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s0 1) (LT s1 1) (LT s2 1)), p1:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s2 1) (GEQ s0 1) (GEQ s1 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN01-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN01-LTLFireability-07 finished in 197 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(!p1))&&p0)))'
Support contains 3 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 13:30:26] [INFO ] Invariant cache hit.
[2023-03-18 13:30:26] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-18 13:30:26] [INFO ] Invariant cache hit.
[2023-03-18 13:30:26] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-18 13:30:26] [INFO ] Invariant cache hit.
[2023-03-18 13:30:26] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 3/3 places, 1/1 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Running random walk in product with property : Sudoku-COL-AN01-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s2 1)), p1:(OR (LT s0 1) (LT s1 1) (LT s2 1))], nbAcceptance=1, 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN01-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN01-LTLFireability-08 finished in 257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 3 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 13:30:26] [INFO ] Invariant cache hit.
[2023-03-18 13:30:26] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-18 13:30:26] [INFO ] Invariant cache hit.
[2023-03-18 13:30:26] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-18 13:30:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 13:30:26] [INFO ] Invariant cache hit.
[2023-03-18 13:30:26] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64 ms. Remains : 3/3 places, 1/1 transitions.
Stuttering acceptance computed with spot in 31 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN01-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s1 1) (LT s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN01-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN01-LTLFireability-09 finished in 103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F((G(F(!p2))&&p1))&&p0))))'
Support contains 3 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 13:30:26] [INFO ] Invariant cache hit.
[2023-03-18 13:30:26] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-18 13:30:26] [INFO ] Invariant cache hit.
[2023-03-18 13:30:26] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-18 13:30:26] [INFO ] Invariant cache hit.
[2023-03-18 13:30:26] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 3/3 places, 1/1 transitions.
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), (OR (NOT p0) (NOT p1) p2), true, p2, p2, (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN01-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 p2), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s2 1)), p2:(OR (LT s0 1) (LT s1 1) (LT s2 1)), p1:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN01-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN01-LTLFireability-10 finished in 340 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0)&&X(X(X(p0))))))'
Support contains 3 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 13:30:26] [INFO ] Invariant cache hit.
[2023-03-18 13:30:26] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-18 13:30:26] [INFO ] Invariant cache hit.
[2023-03-18 13:30:27] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-18 13:30:27] [INFO ] Invariant cache hit.
[2023-03-18 13:30:27] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 3/3 places, 1/1 transitions.
Stuttering acceptance computed with spot in 235 ms :[true, true, p0, (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-COL-AN01-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s1 1) (LT s2 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN01-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN01-LTLFireability-11 finished in 308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(!p1)||p0))))'
Support contains 3 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 13:30:27] [INFO ] Invariant cache hit.
[2023-03-18 13:30:27] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-18 13:30:27] [INFO ] Invariant cache hit.
[2023-03-18 13:30:27] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-18 13:30:27] [INFO ] Invariant cache hit.
[2023-03-18 13:30:27] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 3/3 places, 1/1 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : Sudoku-COL-AN01-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s0 1) (LT s1 1) (LT s2 1)), p0:(OR (LT s0 1) (LT s1 1) (LT s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 63 ms.
Product exploration explored 100000 steps with 50000 reset in 78 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 282 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 5000 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 13:30:28] [INFO ] Invariant cache hit.
[2023-03-18 13:30:28] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (G p1)), (F (G p0)), (G (NOT (AND (NOT p1) p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 9 factoid took 448 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 96 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 3 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 13:30:28] [INFO ] Invariant cache hit.
[2023-03-18 13:30:28] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-18 13:30:28] [INFO ] Invariant cache hit.
[2023-03-18 13:30:28] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-18 13:30:28] [INFO ] Invariant cache hit.
[2023-03-18 13:30:28] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 3/3 places, 1/1 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p0), (X (X p0)), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 294 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p0), (X (X p0)), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 6 factoid took 243 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 105 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 101 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 50000 reset in 51 ms.
Product exploration explored 100000 steps with 50000 reset in 45 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 120 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Support contains 3 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 13:30:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 13:30:30] [INFO ] Invariant cache hit.
[2023-03-18 13:30:30] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22 ms. Remains : 3/3 places, 1/1 transitions.
Built C files in :
/tmp/ltsmin4243885838904891002
[2023-03-18 13:30:30] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4243885838904891002
Running compilation step : cd /tmp/ltsmin4243885838904891002;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 134 ms.
Running link step : cd /tmp/ltsmin4243885838904891002;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4243885838904891002;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1336462716182130485.hoa' '--buchi-type=spotba'
LTSmin run took 388 ms.
FORMULA Sudoku-COL-AN01-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Sudoku-COL-AN01-LTLFireability-12 finished in 3564 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 13:30:30] [INFO ] Invariant cache hit.
[2023-03-18 13:30:30] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-18 13:30:30] [INFO ] Invariant cache hit.
[2023-03-18 13:30:30] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2023-03-18 13:30:30] [INFO ] Invariant cache hit.
[2023-03-18 13:30:30] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 3/3 places, 1/1 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN01-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s0 1) (LT s1 1) (LT s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 38 ms.
Product exploration explored 100000 steps with 50000 reset in 29 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 245 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
[2023-03-18 13:30:31] [INFO ] Invariant cache hit.
[2023-03-18 13:30:31] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 13:30:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 13:30:31] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-18 13:30:31] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 13:30:31] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 13:30:31] [INFO ] Invariant cache hit.
[2023-03-18 13:30:31] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-18 13:30:31] [INFO ] Invariant cache hit.
[2023-03-18 13:30:31] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2023-03-18 13:30:31] [INFO ] Invariant cache hit.
[2023-03-18 13:30:31] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 3/3 places, 1/1 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 216 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
[2023-03-18 13:30:32] [INFO ] Invariant cache hit.
[2023-03-18 13:30:32] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 13:30:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 13:30:32] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-18 13:30:32] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 13:30:32] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 31 ms.
Product exploration explored 100000 steps with 50000 reset in 43 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 13:30:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 13:30:32] [INFO ] Invariant cache hit.
[2023-03-18 13:30:32] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 29 ms. Remains : 3/3 places, 1/1 transitions.
Built C files in :
/tmp/ltsmin1175521461232527580
[2023-03-18 13:30:32] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1175521461232527580
Running compilation step : cd /tmp/ltsmin1175521461232527580;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 65 ms.
Running link step : cd /tmp/ltsmin1175521461232527580;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin1175521461232527580;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1227210088708384536.hoa' '--buchi-type=spotba'
LTSmin run took 294 ms.
FORMULA Sudoku-COL-AN01-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Sudoku-COL-AN01-LTLFireability-14 finished in 2450 ms.
All properties solved by simple procedures.
Total runtime 10371 ms.

BK_STOP 1679146234771

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-AN01"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Sudoku-COL-AN01, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r485-tall-167912698800004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN01.tgz
mv Sudoku-COL-AN01 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;