Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r258-tall-165303545200068.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Sudoku-COL-AN04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545200068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 7.6K Apr 30 11:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 30 11:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 30 11:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 30 11:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 09:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 09:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 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-AN04-LTLFireability-00
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-01
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-02
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-03
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-04
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-05
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-06
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-07
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-08
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-09
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-10
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-11
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-12
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-13
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-14
FORMULA_NAME Sudoku-COL-AN04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653062245692

Running Version 202205111006
[2022-05-20 15:57:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 15:57:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 15:57:26] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-20 15:57:27] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 15:57:27] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 488 ms
[2022-05-20 15:57:27] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 112 PT places and 64.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2022-05-20 15:57:27] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 6 ms.
[2022-05-20 15:57:27] [INFO ] Skeletonized 16 HLPN properties in 1 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).
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Domain [N(4), N(4)] of place Rows breaks symmetries in sort N
[2022-05-20 15:57:27] [INFO ] Unfolded HLPN to a Petri net with 112 places and 64 transitions 256 arcs in 9 ms.
[2022-05-20 15:57:27] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-COL-AN04-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 7 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:27] [INFO ] Computed 11 place invariants in 15 ms
[2022-05-20 15:57:27] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:27] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-20 15:57:27] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:27] [INFO ] Computed 11 place invariants in 4 ms
[2022-05-20 15:57:27] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/112 places, 64/64 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/112 places, 64/64 transitions.
Support contains 48 out of 48 places after structural reductions.
[2022-05-20 15:57:28] [INFO ] Flatten gal took : 36 ms
[2022-05-20 15:57:28] [INFO ] Flatten gal took : 36 ms
[2022-05-20 15:57:28] [INFO ] Input system was already deterministic with 64 transitions.
Finished random walk after 14 steps, including 0 resets, run visited all 5 properties in 13 ms. (steps per millisecond=1 )
FORMULA Sudoku-COL-AN04-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X((!(X(!F(!p0)) U p0)&&X(!p0))))))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:28] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 15:57:28] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:28] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-20 15:57:28] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:28] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-20 15:57:28] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 832 ms :[p0, p0, p0]
Running random walk in product with property : Sudoku-COL-AN04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s17 1) (GEQ s37 1)) (AND (GEQ s10 1) (GEQ s26 1) (GEQ s42 1)) (AND (GEQ s9 1) (GEQ s24 1) (GEQ s33 1)) (AND (GEQ s12 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6947 reset in 640 ms.
Product exploration explored 100000 steps with 6956 reset in 554 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
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 (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 3 states, 6 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN04-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN04-LTLFireability-03 finished in 2375 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U (F((G(p0)||p1)) U p0)))))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:31] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-20 15:57:31] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:31] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-20 15:57:31] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:31] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 15:57:31] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN04-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s17 1) (GEQ s37 1)) (AND (GEQ s10 1) (GEQ s26 1) (GEQ s42 1)) (AND (GEQ s9 1) (GEQ s24 1) (GEQ s33 1)) (AND (GEQ s12 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 565 ms.
Product exploration explored 100000 steps with 33333 reset in 560 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
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 p0 p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 5 factoid took 102 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN04-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN04-LTLFireability-04 finished in 1609 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(X(p1))||p0))))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:32] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 15:57:32] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:32] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 15:57:32] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:32] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-20 15:57:32] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s17 1) (GEQ s37 1)) (AND (GEQ s10 1) (GEQ s26 1) (GEQ s42 1)) (AND (GEQ s9 1) (GEQ s24 1) (GEQ s33 1)) (AND (GEQ s12 1) (GEQ s...], 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]]
Product exploration explored 100000 steps with 50000 reset in 419 ms.
Product exploration explored 100000 steps with 50000 reset in 451 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
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 p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN04-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN04-LTLFireability-05 finished in 1274 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G(F(X(G((p0 U p0)))))))))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:34] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-20 15:57:34] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:34] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 15:57:34] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2022-05-20 15:57:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:34] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-20 15:57:34] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 628 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s17 1) (GEQ s37 1)) (AND (GEQ s10 1) (GEQ s26 1) (GEQ s42 1)) (AND (GEQ s9 1) (GEQ s24 1) (GEQ s33 1)) (AND (GEQ s12 1) (GEQ s...], 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 12 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN04-LTLFireability-06 finished in 789 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!(p0 U p0))||X(p0)))))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:34] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-20 15:57:34] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:34] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-20 15:57:34] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:34] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-20 15:57:34] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 207 ms :[true, (NOT p0), false, false, p0, false, false]
Running random walk in product with property : Sudoku-COL-AN04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 3}]], initial=5, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s17 1) (GEQ s37 1)) (AND (GEQ s10 1) (GEQ s26 1) (GEQ s42 1)) (AND (GEQ s9 1) (GEQ s24 1) (GEQ s33 1)) (AND (GEQ s12 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 616 ms.
Product exploration explored 100000 steps with 25000 reset in 624 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 7 states, 9 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=4 )
Knowledge obtained : [p0, (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:37] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 15:57:37] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:37] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 15:57:37] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:37] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 15:57:37] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 64/64 transitions.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [p0, true, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 25000 reset in 658 ms.
Product exploration explored 100000 steps with 25000 reset in 617 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2022-05-20 15:57:39] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:39] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 15:57:39] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 64/64 transitions.
Product exploration explored 100000 steps with 25000 reset in 795 ms.
Product exploration explored 100000 steps with 25000 reset in 763 ms.
Built C files in :
/tmp/ltsmin3113043766446973772
[2022-05-20 15:57:41] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3113043766446973772
Running compilation step : cd /tmp/ltsmin3113043766446973772;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 273 ms.
Running link step : cd /tmp/ltsmin3113043766446973772;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin3113043766446973772;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13635664740568407107.hoa' '--buchi-type=spotba'
LTSmin run took 465 ms.
FORMULA Sudoku-COL-AN04-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Sudoku-COL-AN04-LTLFireability-07 finished in 7537 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(F((!(F(p1) U p1)&&p0))))))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:42] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 15:57:42] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:42] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-20 15:57:42] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2022-05-20 15:57:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:42] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-20 15:57:42] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Running random walk in product with property : Sudoku-COL-AN04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s1 1) (LT s17 1) (LT s37 1)) (OR (LT s10 1) (LT s26 1) (LT s42 1)) (OR (LT s9 1) (LT s24 1) (LT s33 1)) (OR (LT s12 1) (LT s31 1) (LT s44 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 6965 reset in 645 ms.
Product exploration explored 100000 steps with 6948 reset in 638 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X p1)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 312 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Finished random walk after 16 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X p1)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 8 factoid took 572 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1]
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:45] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 15:57:45] [INFO ] [Real]Absence check using 0 positive and 11 generalized place invariants in 4 ms returned sat
[2022-05-20 15:57:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 15:57:45] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2022-05-20 15:57:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 15:57:45] [INFO ] [Nat]Absence check using 0 positive and 11 generalized place invariants in 4 ms returned sat
[2022-05-20 15:57:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 15:57:45] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2022-05-20 15:57:45] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-20 15:57:45] [INFO ] Added : 0 causal constraints over 0 iterations in 32 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:45] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 15:57:45] [INFO ] [Real]Absence check using 0 positive and 11 generalized place invariants in 4 ms returned sat
[2022-05-20 15:57:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 15:57:45] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-05-20 15:57:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 15:57:46] [INFO ] [Nat]Absence check using 0 positive and 11 generalized place invariants in 5 ms returned sat
[2022-05-20 15:57:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 15:57:46] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-05-20 15:57:46] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-20 15:57:46] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Could not prove EG p1
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:46] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-20 15:57:46] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:46] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 15:57:46] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2022-05-20 15:57:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:46] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-20 15:57:46] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 64/64 transitions.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X p1)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 251 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Finished random walk after 14 steps, including 0 resets, run visited all 3 properties in 9 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (OR (NOT p0) p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (NOT p0) p1))), (X (X p1)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 8 factoid took 384 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1]
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:47] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-20 15:57:47] [INFO ] [Real]Absence check using 0 positive and 11 generalized place invariants in 12 ms returned sat
[2022-05-20 15:57:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 15:57:47] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2022-05-20 15:57:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 15:57:47] [INFO ] [Nat]Absence check using 0 positive and 11 generalized place invariants in 4 ms returned sat
[2022-05-20 15:57:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 15:57:47] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-05-20 15:57:47] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-20 15:57:47] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:57:47] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-20 15:57:47] [INFO ] [Real]Absence check using 0 positive and 11 generalized place invariants in 5 ms returned sat
[2022-05-20 15:57:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 15:57:47] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2022-05-20 15:57:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 15:57:48] [INFO ] [Nat]Absence check using 0 positive and 11 generalized place invariants in 4 ms returned sat
[2022-05-20 15:57:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 15:57:48] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-05-20 15:57:48] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-20 15:57:48] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Product exploration explored 100000 steps with 6945 reset in 607 ms.
Product exploration explored 100000 steps with 6946 reset in 635 ms.
Built C files in :
/tmp/ltsmin12808978357542004896
[2022-05-20 15:57:49] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2022-05-20 15:57:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:57:49] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2022-05-20 15:57:49] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:57:49] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2022-05-20 15:57:49] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:57:49] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12808978357542004896
Running compilation step : cd /tmp/ltsmin12808978357542004896;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 210 ms.
Running link step : cd /tmp/ltsmin12808978357542004896;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12808978357542004896;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8626697033988476570.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 6 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:58:04] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 15:58:04] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:58:04] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 15:58:04] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2022-05-20 15:58:04] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:58:04] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 15:58:04] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 64/64 transitions.
Built C files in :
/tmp/ltsmin12304920476096519600
[2022-05-20 15:58:04] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2022-05-20 15:58:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:58:04] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2022-05-20 15:58:04] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:58:04] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2022-05-20 15:58:04] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:58:04] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12304920476096519600
Running compilation step : cd /tmp/ltsmin12304920476096519600;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 189 ms.
Running link step : cd /tmp/ltsmin12304920476096519600;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12304920476096519600;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14778149872184630739.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 15:58:19] [INFO ] Flatten gal took : 7 ms
[2022-05-20 15:58:19] [INFO ] Flatten gal took : 7 ms
[2022-05-20 15:58:19] [INFO ] Time to serialize gal into /tmp/LTL6576103185660986353.gal : 2 ms
[2022-05-20 15:58:19] [INFO ] Time to serialize properties into /tmp/LTL13042992443077431023.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6576103185660986353.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13042992443077431023.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6576103...267
Read 1 LTL properties
Checking formula 0 : !((G(X(X(F((((((((!((F("(((((((((Rows_1>=1)&&(Cells_1>=1))&&(Columns_5>=1))||(((Rows_10>=1)&&(Cells_10>=1))&&(Columns_10>=1)))||((((Ro...9505
Formula 0 simplified : !GXXF("((((((((Rows_6<1)||(Cells_6<1))||(Columns_10<1))&&(((Rows_8<1)||(Cells_11<1))||(Columns_12<1)))&&((((Rows_3<1)||(Cells_0<1))|...9472
Detected timeout of ITS tools.
[2022-05-20 15:58:34] [INFO ] Flatten gal took : 7 ms
[2022-05-20 15:58:34] [INFO ] Applying decomposition
[2022-05-20 15:58:34] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2421937006672747365.txt' '-o' '/tmp/graph2421937006672747365.bin' '-w' '/tmp/graph2421937006672747365.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2421937006672747365.bin' '-l' '-1' '-v' '-w' '/tmp/graph2421937006672747365.weights' '-q' '0' '-e' '0.001'
[2022-05-20 15:58:35] [INFO ] Decomposing Gal with order
[2022-05-20 15:58:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 15:58:35] [INFO ] Removed a total of 144 redundant transitions.
[2022-05-20 15:58:35] [INFO ] Flatten gal took : 41 ms
[2022-05-20 15:58:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-20 15:58:35] [INFO ] Time to serialize gal into /tmp/LTL16034841477570884732.gal : 2 ms
[2022-05-20 15:58:35] [INFO ] Time to serialize properties into /tmp/LTL14126110429580505204.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16034841477570884732.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14126110429580505204.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1603484...247
Read 1 LTL properties
Checking formula 0 : !((G(X(X(F((((((((!((F("(((((((((u1.Rows_1>=1)&&(u17.Cells_1>=1))&&(u37.Columns_5>=1))||(((u10.Rows_10>=1)&&(u26.Cells_10>=1))&&(u42.C...11689
Formula 0 simplified : !GXXF("((((((((u6.Rows_6<1)||(u22.Cells_6<1))||(u42.Columns_10<1))&&(((u8.Rows_8<1)||(u27.Cells_11<1))||(u44.Columns_12<1)))&&((((u3...11656
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2040877202086930346
[2022-05-20 15:58:50] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2040877202086930346
Running compilation step : cd /tmp/ltsmin2040877202086930346;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 203 ms.
Running link step : cd /tmp/ltsmin2040877202086930346;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2040877202086930346;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(X(<>((!(<>((LTLAPp1==true)) U (LTLAPp1==true))&&(LTLAPp0==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN04-LTLFireability-08 finished in 82917 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(p0))&&G(p1)))))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:59:05] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-20 15:59:05] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:59:05] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 15:59:05] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2022-05-20 15:59:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:59:05] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 15:59:05] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 35 ms :[(OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (AND (GEQ s1 1) (GEQ s17 1) (GEQ s37 1)) (AND (GEQ s10 1) (GEQ s26 1) (GEQ s42 1)) (AND (GEQ s9 1) (GEQ s24 1) (GEQ s33 1)) (AND (GEQ s12 1) (GEQ s...], 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 14 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN04-LTLFireability-09 finished in 200 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(G(X(F(X(F(X(p0))))))))))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:59:05] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-20 15:59:05] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:59:05] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-20 15:59:05] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2022-05-20 15:59:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:59:05] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 15:59:05] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN04-LTLFireability-10 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:(AND (OR (LT s1 1) (LT s17 1) (LT s37 1)) (OR (LT s10 1) (LT s26 1) (LT s42 1)) (OR (LT s9 1) (LT s24 1) (LT s33 1)) (OR (LT s12 1) (LT s31 1) (LT s44 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6954 reset in 461 ms.
Product exploration explored 100000 steps with 6949 reset in 466 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN04-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN04-LTLFireability-10 finished in 1275 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(p0 U p0) U (p0 U G(p0)))))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:59:06] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-20 15:59:06] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:59:06] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 15:59:06] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:59:06] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 15:59:06] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-COL-AN04-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s17 1) (GEQ s37 1)) (AND (GEQ s10 1) (GEQ s26 1) (GEQ s42 1)) (AND (GEQ s9 1) (GEQ s24 1) (GEQ s33 1)) (AND (GEQ s12 1) (GEQ 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 13 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN04-LTLFireability-11 finished in 239 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||p0)))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:59:07] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 15:59:07] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:59:07] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 15:59:07] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:59:07] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-20 15:59:07] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-COL-AN04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s1 1) (LT s17 1) (LT s37 1)) (OR (LT s10 1) (LT s26 1) (LT s42 1)) (OR (LT s9 1) (LT s24 1) (LT s33 1)) (OR (LT s12 1) (LT s31 1) (LT s44 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN04-LTLFireability-12 finished in 215 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:59:07] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-20 15:59:07] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:59:07] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 15:59:07] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:59:07] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 15:59:07] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN04-LTLFireability-13 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:(AND (OR (LT s1 1) (LT s17 1) (LT s37 1)) (OR (LT s10 1) (LT s26 1) (LT s42 1)) (OR (LT s9 1) (LT s24 1) (LT s33 1)) (OR (LT s12 1) (LT s31 1) (LT s44 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN04-LTLFireability-13 finished in 209 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)&&((p0 U p0)||G(p0))))))'
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:59:07] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 15:59:07] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:59:07] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-20 15:59:07] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:59:07] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-20 15:59:07] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 64/64 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s17 1) (GEQ s37 1)) (AND (GEQ s10 1) (GEQ s26 1) (GEQ s42 1)) (AND (GEQ s9 1) (GEQ s24 1) (GEQ s33 1)) (AND (GEQ s12 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 624 ms.
Product exploration explored 100000 steps with 25000 reset in 636 ms.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [p0, (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:59:09] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 15:59:09] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:59:09] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-20 15:59:09] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:59:09] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-20 15:59:09] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 64/64 transitions.
Computed a total of 48 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, true, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [p0, true, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 344 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 25000 reset in 606 ms.
Product exploration explored 100000 steps with 25000 reset in 634 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 48 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2022-05-20 15:59:12] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2022-05-20 15:59:12] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-20 15:59:12] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 64/64 transitions.
Product exploration explored 100000 steps with 25000 reset in 750 ms.
Product exploration explored 100000 steps with 25000 reset in 775 ms.
Built C files in :
/tmp/ltsmin9665203188610085337
[2022-05-20 15:59:14] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9665203188610085337
Running compilation step : cd /tmp/ltsmin9665203188610085337;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 159 ms.
Running link step : cd /tmp/ltsmin9665203188610085337;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin9665203188610085337;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9398406194376430691.hoa' '--buchi-type=spotba'
LTSmin run took 490 ms.
FORMULA Sudoku-COL-AN04-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Sudoku-COL-AN04-LTLFireability-14 finished in 7366 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(F((!(F(p1) U p1)&&p0))))))'
[2022-05-20 15:59:14] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13112906532230069451
[2022-05-20 15:59:14] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2022-05-20 15:59:14] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:59:14] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2022-05-20 15:59:14] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:59:14] [INFO ] Applying decomposition
[2022-05-20 15:59:14] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2022-05-20 15:59:14] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 15:59:14] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13112906532230069451
Running compilation step : cd /tmp/ltsmin13112906532230069451;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-20 15:59:14] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph300763103122062716.txt' '-o' '/tmp/graph300763103122062716.bin' '-w' '/tmp/graph300763103122062716.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph300763103122062716.bin' '-l' '-1' '-v' '-w' '/tmp/graph300763103122062716.weights' '-q' '0' '-e' '0.001'
[2022-05-20 15:59:14] [INFO ] Decomposing Gal with order
[2022-05-20 15:59:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 15:59:14] [INFO ] Removed a total of 144 redundant transitions.
[2022-05-20 15:59:14] [INFO ] Flatten gal took : 14 ms
[2022-05-20 15:59:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-20 15:59:14] [INFO ] Time to serialize gal into /tmp/LTLFireability2403207608772357119.gal : 1 ms
[2022-05-20 15:59:14] [INFO ] Time to serialize properties into /tmp/LTLFireability3645082874488580000.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2403207608772357119.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3645082874488580000.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 1 LTL properties
Checking formula 0 : !((G(X(X(F((((((((!((F("(((((((((u1.Rows_1>=1)&&(u17.Cells_1>=1))&&(u37.Columns_5>=1))||(((u10.Rows_10>=1)&&(u26.Cells_10>=1))&&(u42.C...11689
Formula 0 simplified : !GXXF("((((((((u6.Rows_6<1)||(u22.Cells_6<1))||(u42.Columns_10<1))&&(((u8.Rows_8<1)||(u27.Cells_11<1))||(u44.Columns_12<1)))&&((((u3...11656
Compilation finished in 221 ms.
Running link step : cd /tmp/ltsmin13112906532230069451;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin13112906532230069451;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(X(<>((!(<>((LTLAPp1==true)) U (LTLAPp1==true))&&(LTLAPp0==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: LTL layer: formula: [](X(X(<>((!(<>((LTLAPp1==true)) U (LTLAPp1==true))&&(LTLAPp0==true))))))
pins2lts-mc-linux64( 2/ 8), 0.001: "[](X(X(<>((!(<>((LTLAPp1==true)) U (LTLAPp1==true))&&(LTLAPp0==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: There are 67 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.015: State length is 49, there are 72 groups
pins2lts-mc-linux64( 0/ 8), 0.015: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.015: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.015: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.015: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.056: [Blue] ~16 levels ~960 states ~9680 transitions
pins2lts-mc-linux64( 6/ 8), 0.063: [Blue] ~16 levels ~1920 states ~16464 transitions
pins2lts-mc-linux64( 0/ 8), 0.081: [Blue] ~16 levels ~3840 states ~30816 transitions
pins2lts-mc-linux64( 0/ 8), 0.113: [Blue] ~16 levels ~7680 states ~62528 transitions
pins2lts-mc-linux64( 2/ 8), 0.168: [Blue] ~16 levels ~15360 states ~116928 transitions
pins2lts-mc-linux64( 2/ 8), 0.295: [Blue] ~16 levels ~30720 states ~265552 transitions
pins2lts-mc-linux64( 2/ 8), 0.540: [Blue] ~16 levels ~61440 states ~553744 transitions
pins2lts-mc-linux64( 2/ 8), 0.975: [Blue] ~16 levels ~122880 states ~1215664 transitions
pins2lts-mc-linux64( 6/ 8), 1.701: [Blue] ~16 levels ~245760 states ~2691456 transitions
pins2lts-mc-linux64( 1/ 8), 2.764: [Blue] ~18 levels ~491520 states ~5804016 transitions
pins2lts-mc-linux64( 2/ 8), 4.395: [Blue] ~16 levels ~983040 states ~11829424 transitions
pins2lts-mc-linux64( 2/ 8), 7.264: [Blue] ~16 levels ~1966080 states ~25238128 transitions
pins2lts-mc-linux64( 2/ 8), 13.258: [Blue] ~16 levels ~3932160 states ~53257632 transitions
pins2lts-mc-linux64( 1/ 8), 26.214: [Blue] ~18 levels ~7864320 states ~113469216 transitions
pins2lts-mc-linux64( 1/ 8), 53.619: [Blue] ~18 levels ~15728640 states ~240946896 transitions
pins2lts-mc-linux64( 2/ 8), 112.661: [Blue] ~16 levels ~31457280 states ~520655136 transitions
pins2lts-mc-linux64( 7/ 8), 242.094: [Blue] ~16 levels ~62914560 states ~1113979808 transitions
pins2lts-mc-linux64( 1/ 8), 543.259: [Blue] ~18 levels ~125829120 states ~2429840848 transitions
pins2lts-mc-linux64( 6/ 8), 678.710: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 678.737:
pins2lts-mc-linux64( 0/ 8), 678.737: Explored 134216678 states 2929898323 transitions, fanout: 21.830
pins2lts-mc-linux64( 0/ 8), 678.737: Total exploration time 678.700 sec (678.660 sec minimum, 678.685 sec on average)
pins2lts-mc-linux64( 0/ 8), 678.737: States per second: 197756, Transitions per second: 4316927
pins2lts-mc-linux64( 0/ 8), 678.737:
pins2lts-mc-linux64( 0/ 8), 678.737: State space has 134217390 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 678.737: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 678.737: blue states: 134216678 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 678.737: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 678.737: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 678.737:
pins2lts-mc-linux64( 0/ 8), 678.737: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 678.737:
pins2lts-mc-linux64( 0/ 8), 678.737: Queue width: 8B, total height: 131, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 678.737: Tree memory: 1239.4MB, 9.7 B/state, compr.: 4.9%
pins2lts-mc-linux64( 0/ 8), 678.737: Tree fill ratio (roots/leafs): 99.0%/84.0%
pins2lts-mc-linux64( 0/ 8), 678.737: Stored 64 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 678.737: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 678.737: Est. total memory use: 1239.4MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13112906532230069451;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(X(<>((!(<>((LTLAPp1==true)) U (LTLAPp1==true))&&(LTLAPp0==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13112906532230069451;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(X(<>((!(<>((LTLAPp1==true)) U (LTLAPp1==true))&&(LTLAPp0==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-20 16:19:52] [INFO ] Applying decomposition
[2022-05-20 16:19:52] [INFO ] Flatten gal took : 124 ms
[2022-05-20 16:19:52] [INFO ] Decomposing Gal with order
[2022-05-20 16:19:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 16:19:52] [INFO ] Removed a total of 84 redundant transitions.
[2022-05-20 16:19:52] [INFO ] Flatten gal took : 103 ms
[2022-05-20 16:19:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2022-05-20 16:19:52] [INFO ] Time to serialize gal into /tmp/LTLFireability13091577330160938806.gal : 31 ms
[2022-05-20 16:19:52] [INFO ] Time to serialize properties into /tmp/LTLFireability10032113534310872766.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13091577330160938806.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10032113534310872766.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !((G(X(X(F((((((((!((F("(((((((((NN1.Rows_1>=1)&&(NN1.Cells_1>=1))&&(NN5.Columns_5>=1))||(((NN10.Rows_10>=1)&&(NN10.Cells_10>=1))&&(NN...12025
Formula 0 simplified : !GXXF("((((((((NN6.Rows_6<1)||(NN6.Cells_6<1))||(NN10.Columns_10<1))&&(((NN8.Rows_8<1)||(NN11.Cells_11<1))||(NN12.Columns_12<1)))&&(...11992
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t2...487
Computing Next relation with stutter on 53165 deadlock states
Detected timeout of ITS tools.
[2022-05-20 16:41:06] [INFO ] Flatten gal took : 234 ms
[2022-05-20 16:41:06] [INFO ] Input system was already deterministic with 64 transitions.
[2022-05-20 16:41:06] [INFO ] Transformed 48 places.
[2022-05-20 16:41:06] [INFO ] Transformed 64 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
java.lang.NullPointerException
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.computeOrderWithGreatSPN(MultiOrderRunner.java:57)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:135)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:737)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-20 16:41:06] [INFO ] Time to serialize gal into /tmp/LTLFireability11009593227717493661.gal : 9 ms
[2022-05-20 16:41:06] [INFO ] Time to serialize properties into /tmp/LTLFireability13865279393682836946.ltl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11009593227717493661.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13865279393682836946.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...335
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(X(X(F((((((((!((F("(((((((((Rows_1>=1)&&(Cells_1>=1))&&(Columns_5>=1))||(((Rows_10>=1)&&(Cells_10>=1))&&(Columns_10>=1)))||((((Ro...9505
Formula 0 simplified : !GXXF("((((((((Rows_6<1)||(Cells_6<1))||(Columns_10<1))&&(((Rows_8<1)||(Cells_11<1))||(Columns_12<1)))&&((((Rows_3<1)||(Cells_0<1))|...9472

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-AN04"
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-4028"
echo " Executing tool itstools"
echo " Input is Sudoku-COL-AN04, 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 r258-tall-165303545200068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN04.tgz
mv Sudoku-COL-AN04 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 ;