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-165303545500308.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-PT-AN14, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545500308
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 26M
-rw-r--r-- 1 mcc users 675K Apr 30 12:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.2M Apr 30 12:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2M Apr 30 11:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 11M Apr 30 11:44 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 420K May 9 09:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.4M May 9 09:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M May 9 09:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 4.2M May 9 09:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 96K May 9 09:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 235K May 9 09:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.5M 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-PT-AN14-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN14-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653112794787

Running Version 202205111006
[2022-05-21 05:59:55] [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-21 05:59:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 05:59:56] [INFO ] Load time of PNML (sax parser for PT used): 246 ms
[2022-05-21 05:59:56] [INFO ] Transformed 3332 places.
[2022-05-21 05:59:56] [INFO ] Transformed 2744 transitions.
[2022-05-21 05:59:56] [INFO ] Parsed PT model containing 3332 places and 2744 transitions in 366 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 219 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-PT-AN14-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 588 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Reduce places removed 2744 places and 0 transitions.
Iterating post reduction 0 with 2744 rules applied. Total rules applied 2744 place count 588 transition count 2744
Applied a total of 2744 rules in 62 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:00:00] [INFO ] Computed 41 place invariants in 204 ms
[2022-05-21 06:00:00] [INFO ] Implicit Places using invariants in 528 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:00:00] [INFO ] Computed 41 place invariants in 128 ms
[2022-05-21 06:00:01] [INFO ] Implicit Places using invariants and state equation in 818 ms returned []
Implicit Place search using SMT with State Equation took 1372 ms to find 0 implicit places.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:00:01] [INFO ] Computed 41 place invariants in 111 ms
[2022-05-21 06:00:02] [INFO ] Dead Transitions using invariants and state equation in 979 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/3332 places, 2744/2744 transitions.
Support contains 588 out of 588 places after structural reductions.
[2022-05-21 06:00:03] [INFO ] Flatten gal took : 492 ms
[2022-05-21 06:00:06] [INFO ] Flatten gal took : 472 ms
[2022-05-21 06:00:08] [INFO ] Input system was already deterministic with 2744 transitions.
Finished random walk after 172 steps, including 0 resets, run visited all 15 properties in 109 ms. (steps per millisecond=1 )
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
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' '!(X(X(F(X(F((F(p0)||p0)))))))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 6 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:00:09] [INFO ] Computed 41 place invariants in 117 ms
[2022-05-21 06:00:10] [INFO ] Implicit Places using invariants in 217 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:00:10] [INFO ] Computed 41 place invariants in 92 ms
[2022-05-21 06:00:10] [INFO ] Implicit Places using invariants and state equation in 846 ms returned []
Implicit Place search using SMT with State Equation took 1065 ms to find 0 implicit places.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:00:10] [INFO ] Computed 41 place invariants in 108 ms
[2022-05-21 06:00:11] [INFO ] Dead Transitions using invariants and state equation in 982 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 281 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (OR (LT s134 1) (LT s328 1) (LT s484 1)) (OR (LT s113 1) (LT s316 1) (LT s505 1)) (OR (LT s113 1) (LT s320 1) (LT s561 1)) (OR (LT s134 1) (LT s33...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 56340 steps with 327 reset in 10001 ms.
Product exploration timeout after 56210 steps with 326 reset in 10001 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
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), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 56 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN14-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN14-LTLFireability-00 finished in 25028 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(F(X((G(p0)&&X(G(p0))))))))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 21 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:00:34] [INFO ] Computed 41 place invariants in 92 ms
[2022-05-21 06:00:34] [INFO ] Implicit Places using invariants in 186 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:00:35] [INFO ] Computed 41 place invariants in 89 ms
[2022-05-21 06:00:35] [INFO ] Implicit Places using invariants and state equation in 836 ms returned []
Implicit Place search using SMT with State Equation took 1023 ms to find 0 implicit places.
[2022-05-21 06:00:35] [INFO ] Redundant transitions in 151 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:00:36] [INFO ] Computed 41 place invariants in 95 ms
[2022-05-21 06:00:36] [INFO ] Dead Transitions using invariants and state equation in 916 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s134 1) (LT s328 1) (LT s484 1)) (OR (LT s113 1) (LT s316 1) (LT s505 1)) (OR (LT s113 1) (LT s320 1) (LT s561 1)) (OR (LT s134 1) (LT s33...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 56020 steps with 325 reset in 10002 ms.
Product exploration timeout after 55320 steps with 321 reset in 10002 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
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)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN14-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN14-LTLFireability-01 finished in 24439 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(!(F(X(p0)) U X(p0)))||!(p0 U p0))))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 5 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:00:59] [INFO ] Computed 41 place invariants in 105 ms
[2022-05-21 06:00:59] [INFO ] Implicit Places using invariants in 193 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:00:59] [INFO ] Computed 41 place invariants in 90 ms
[2022-05-21 06:01:00] [INFO ] Implicit Places using invariants and state equation in 829 ms returned []
Implicit Place search using SMT with State Equation took 1026 ms to find 0 implicit places.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:01:00] [INFO ] Computed 41 place invariants in 91 ms
[2022-05-21 06:01:01] [INFO ] Dead Transitions using invariants and state equation in 913 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, p0, p0, p0, p0]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(OR (AND (GEQ s134 1) (GEQ s328 1) (GEQ s484 1)) (AND (GEQ s113 1) (GEQ s316 1) (GEQ s505 1)) (AND (GEQ s113 1) (GEQ s320 1) (GEQ s561 1)) (AND (GEQ s1...], 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]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-AN14-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLFireability-05 finished in 2158 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 17 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:01:01] [INFO ] Computed 41 place invariants in 90 ms
[2022-05-21 06:01:01] [INFO ] Implicit Places using invariants in 179 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:01:01] [INFO ] Computed 41 place invariants in 108 ms
[2022-05-21 06:01:02] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1016 ms to find 0 implicit places.
[2022-05-21 06:01:02] [INFO ] Redundant transitions in 139 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:01:02] [INFO ] Computed 41 place invariants in 91 ms
[2022-05-21 06:01:03] [INFO ] Dead Transitions using invariants and state equation in 901 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s134 1) (LT s328 1) (LT s484 1)) (OR (LT s113 1) (LT s316 1) (LT s505 1)) (OR (LT s113 1) (LT s320 1) (LT s561 1)) (OR (LT s134 1) (LT s33...], 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 timeout after 57330 steps with 333 reset in 10002 ms.
Product exploration timeout after 56740 steps with 329 reset in 10002 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
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)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN14-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN14-LTLFireability-06 finished in 24515 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(G(p0)) U p0)||X(!p0))))'
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 22 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:01:26] [INFO ] Computed 41 place invariants in 89 ms
[2022-05-21 06:01:26] [INFO ] Implicit Places using invariants in 203 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:01:26] [INFO ] Computed 41 place invariants in 89 ms
[2022-05-21 06:01:26] [INFO ] Implicit Places using invariants and state equation in 690 ms returned []
Implicit Place search using SMT with State Equation took 898 ms to find 0 implicit places.
[2022-05-21 06:01:26] [INFO ] Redundant transitions in 70 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:01:26] [INFO ] Computed 41 place invariants in 97 ms
[2022-05-21 06:01:27] [INFO ] Dead Transitions using invariants and state equation in 973 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), false, false]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(OR (AND (GEQ s134 1) (GEQ s328 1) (GEQ s484 1)) (AND (GEQ s113 1) (GEQ s316 1) (GEQ s505 1)) (AND (GEQ s113 1) (GEQ s320 1) (GEQ s561 1)) (AND (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration timeout after 55680 steps with 323 reset in 10004 ms.
Product exploration timeout after 55440 steps with 321 reset in 10002 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
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), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 4 states, 7 edges and 1 AP to 4 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), false, false]
Finished random walk after 170 steps, including 0 resets, run visited all 1 properties in 41 ms. (steps per millisecond=4 )
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 4 states, 7 edges and 1 AP to 4 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), false, false]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), false, false]
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 14 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:01:50] [INFO ] Computed 41 place invariants in 88 ms
[2022-05-21 06:01:51] [INFO ] Implicit Places using invariants in 182 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:01:51] [INFO ] Computed 41 place invariants in 93 ms
[2022-05-21 06:01:51] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1017 ms to find 0 implicit places.
[2022-05-21 06:01:51] [INFO ] Redundant transitions in 72 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:01:52] [INFO ] Computed 41 place invariants in 93 ms
[2022-05-21 06:01:52] [INFO ] Dead Transitions using invariants and state equation in 905 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/588 places, 2744/2744 transitions.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
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), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 4 states, 7 edges and 1 AP to 4 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), false, false]
Finished random walk after 170 steps, including 0 resets, run visited all 1 properties in 34 ms. (steps per millisecond=5 )
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 4 states, 7 edges and 1 AP to 4 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), false, false]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), false, false]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), false, false]
Product exploration timeout after 55500 steps with 322 reset in 10002 ms.
Product exploration timeout after 55290 steps with 321 reset in 10002 ms.
Built C files in :
/tmp/ltsmin17595489409799707128
[2022-05-21 06:02:15] [INFO ] Too many transitions (2744) to apply POR reductions. Disabling POR matrices.
[2022-05-21 06:02:15] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17595489409799707128
Running compilation step : cd /tmp/ltsmin17595489409799707128;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17595489409799707128;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17595489409799707128;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 588 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 15 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:02:19] [INFO ] Computed 41 place invariants in 89 ms
[2022-05-21 06:02:19] [INFO ] Implicit Places using invariants in 200 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:02:19] [INFO ] Computed 41 place invariants in 92 ms
[2022-05-21 06:02:19] [INFO ] Implicit Places using invariants and state equation in 701 ms returned []
Implicit Place search using SMT with State Equation took 920 ms to find 0 implicit places.
[2022-05-21 06:02:19] [INFO ] Redundant transitions in 71 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:02:20] [INFO ] Computed 41 place invariants in 101 ms
[2022-05-21 06:02:20] [INFO ] Dead Transitions using invariants and state equation in 986 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/588 places, 2744/2744 transitions.
Built C files in :
/tmp/ltsmin4235512310210425453
[2022-05-21 06:02:20] [INFO ] Too many transitions (2744) to apply POR reductions. Disabling POR matrices.
[2022-05-21 06:02:21] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4235512310210425453
Running compilation step : cd /tmp/ltsmin4235512310210425453;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4235512310210425453;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4235512310210425453;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-21 06:02:25] [INFO ] Flatten gal took : 280 ms
[2022-05-21 06:02:25] [INFO ] Flatten gal took : 253 ms
[2022-05-21 06:02:25] [INFO ] Time to serialize gal into /tmp/LTL16711598733490355608.gal : 58 ms
[2022-05-21 06:02:25] [INFO ] Time to serialize properties into /tmp/LTL15263130103104597541.ltl : 96 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/LTL16711598733490355608.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15263130103104597541.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/LTL1671159...268
Read 1 LTL properties
Checking formula 0 : !((G(((X(G("(((((((((((((((Rows_9_8>=1)&&(Cells_9_6>=1))&&(Columns_6_8>=1))||(((Rows_8_1>=1)&&(Cells_8_8>=1))&&(Columns_8_1>=1)))||(((...458683
Formula 0 simplified : !G((XG"(((((((((((((((Rows_9_8>=1)&&(Cells_9_6>=1))&&(Columns_6_8>=1))||(((Rows_8_1>=1)&&(Cells_8_8>=1))&&(Columns_8_1>=1)))||((((Ro...458672
Detected timeout of ITS tools.
[2022-05-21 06:02:40] [INFO ] Flatten gal took : 194 ms
[2022-05-21 06:02:40] [INFO ] Applying decomposition
[2022-05-21 06:02:41] [INFO ] Flatten gal took : 226 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/graph9991237925845632681.txt' '-o' '/tmp/graph9991237925845632681.bin' '-w' '/tmp/graph9991237925845632681.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9991237925845632681.bin' '-l' '-1' '-v' '-w' '/tmp/graph9991237925845632681.weights' '-q' '0' '-e' '0.001'
[2022-05-21 06:02:41] [INFO ] Decomposing Gal with order
[2022-05-21 06:02:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 06:02:42] [INFO ] Removed a total of 7644 redundant transitions.
[2022-05-21 06:02:42] [INFO ] Flatten gal took : 348 ms
[2022-05-21 06:02:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 73 ms.
[2022-05-21 06:02:42] [INFO ] Time to serialize gal into /tmp/LTL2192500796709105875.gal : 20 ms
[2022-05-21 06:02:42] [INFO ] Time to serialize properties into /tmp/LTL6838723598195899079.ltl : 48 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/LTL2192500796709105875.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6838723598195899079.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/LTL2192500...245
Read 1 LTL properties
Checking formula 0 : !((G(((X(G("(((((((((((((((u134.Rows_9_8>=1)&&(u328.Cells_9_6>=1))&&(u484.Columns_6_8>=1))||(((u113.Rows_8_1>=1)&&(u316.Cells_8_8>=1))...577543
Formula 0 simplified : !G((XG"(((((((((((((((u134.Rows_9_8>=1)&&(u328.Cells_9_6>=1))&&(u484.Columns_6_8>=1))||(((u113.Rows_8_1>=1)&&(u316.Cells_8_8>=1))&&(...577532
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17592555950231194442
[2022-05-21 06:02:57] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17592555950231194442
Running compilation step : cd /tmp/ltsmin17592555950231194442;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17592555950231194442;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17592555950231194442;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Sudoku-PT-AN14-LTLFireability-07 finished in 94817 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G((F(p0) U p1))&&!p1))))'
Support contains 6 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 156 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:03:00] [INFO ] Computed 41 place invariants in 95 ms
[2022-05-21 06:03:01] [INFO ] Implicit Places using invariants in 750 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:03:01] [INFO ] Computed 41 place invariants in 114 ms
[2022-05-21 06:03:07] [INFO ] Implicit Places using invariants and state equation in 5980 ms returned []
Implicit Place search using SMT with State Equation took 6732 ms to find 0 implicit places.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:03:07] [INFO ] Computed 41 place invariants in 90 ms
[2022-05-21 06:03:08] [INFO ] Dead Transitions using invariants and state equation in 977 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 237 ms :[true, true, (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s163 1) (GEQ s352 1) (GEQ s429 1)), p0:(AND (GEQ s52 1) (GEQ s249 1) (GEQ s556 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 170 steps with 0 reset in 40 ms.
FORMULA Sudoku-PT-AN14-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLFireability-09 finished in 8173 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U (G(p1)||X(!p2))))'
Support contains 9 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 67 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:03:09] [INFO ] Computed 41 place invariants in 97 ms
[2022-05-21 06:03:09] [INFO ] Implicit Places using invariants in 739 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:03:09] [INFO ] Computed 41 place invariants in 96 ms
[2022-05-21 06:03:13] [INFO ] Implicit Places using invariants and state equation in 3890 ms returned []
Implicit Place search using SMT with State Equation took 4632 ms to find 0 implicit places.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:03:13] [INFO ] Computed 41 place invariants in 119 ms
[2022-05-21 06:03:14] [INFO ] Dead Transitions using invariants and state equation in 954 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) p2), (AND p2 (NOT p0)), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND p1 p2), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s88 1) (GEQ s283 1) (GEQ s438 1)), p2:(AND (NOT (AND (GEQ s66 1) (GEQ s255 1) (GEQ s444 1))) (GEQ s8 1) (GEQ s209 1) (GEQ s582 1)), p0:(AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 196 steps with 11 reset in 36 ms.
FORMULA Sudoku-PT-AN14-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLFireability-10 finished in 5932 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 3 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 108 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:03:14] [INFO ] Computed 41 place invariants in 98 ms
[2022-05-21 06:03:15] [INFO ] Implicit Places using invariants in 694 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:03:15] [INFO ] Computed 41 place invariants in 94 ms
[2022-05-21 06:03:21] [INFO ] Implicit Places using invariants and state equation in 6256 ms returned []
Implicit Place search using SMT with State Equation took 6952 ms to find 0 implicit places.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:03:21] [INFO ] Computed 41 place invariants in 98 ms
[2022-05-21 06:03:22] [INFO ] Dead Transitions using invariants and state equation in 906 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s21 1) (GEQ s222 1) (GEQ s567 1)), p0:(OR (LT s21 1) (LT s222 1) (LT s567 1))], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 82 steps with 0 reset in 26 ms.
FORMULA Sudoku-PT-AN14-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLFireability-11 finished in 8107 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(G(X((!(!X(p0) U G(p0))&&p1)))))))'
Support contains 6 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 69 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:03:23] [INFO ] Computed 41 place invariants in 89 ms
[2022-05-21 06:03:23] [INFO ] Implicit Places using invariants in 683 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:03:23] [INFO ] Computed 41 place invariants in 90 ms
[2022-05-21 06:03:30] [INFO ] Implicit Places using invariants and state equation in 6926 ms returned []
Implicit Place search using SMT with State Equation took 7622 ms to find 0 implicit places.
[2022-05-21 06:03:30] [INFO ] Redundant transitions in 69 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:03:30] [INFO ] Computed 41 place invariants in 97 ms
[2022-05-21 06:03:31] [INFO ] Dead Transitions using invariants and state equation in 878 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 61 ms :[(OR (NOT p1) p0), p0]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s166 1) (LT s360 1) (LT s544 1)), p0:(AND (GEQ s10 1) (GEQ s208 1) (GEQ s570 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 47530 steps with 390 reset in 10001 ms.
Product exploration timeout after 47910 steps with 383 reset in 10003 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN14-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN14-LTLFireability-12 finished in 29344 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!X(G(p0)) U (F(p1) U p2)))'
Support contains 9 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 65 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:03:52] [INFO ] Computed 41 place invariants in 96 ms
[2022-05-21 06:03:52] [INFO ] Implicit Places using invariants in 666 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:03:53] [INFO ] Computed 41 place invariants in 89 ms
[2022-05-21 06:03:55] [INFO ] Implicit Places using invariants and state equation in 2675 ms returned []
Implicit Place search using SMT with State Equation took 3343 ms to find 0 implicit places.
[2022-05-21 06:03:55] [INFO ] Redundant transitions in 70 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:03:55] [INFO ] Computed 41 place invariants in 95 ms
[2022-05-21 06:03:56] [INFO ] Dead Transitions using invariants and state equation in 930 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 131 ms :[true, p2, (OR (AND (NOT p0) p2) (AND p1 p2)), (OR (NOT p0) p1)]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p1 p2) (AND p2 (NOT p0))), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=2 dest: 3}], [{ cond=(OR p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(AND (GEQ s100 1) (GEQ s304 1) (GEQ s534 1) (NOT (AND (GEQ s87 1) (GEQ s288 1) (GEQ s507 1)))), p1:(AND (GEQ s92 1) (GEQ s289 1) (GEQ s526 1)), p0:(OR ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 70 steps with 0 reset in 30 ms.
FORMULA Sudoku-PT-AN14-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLFireability-13 finished in 4599 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(F(G((G(p1)||p0)))))))'
Support contains 6 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 64 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:03:56] [INFO ] Computed 41 place invariants in 97 ms
[2022-05-21 06:03:57] [INFO ] Implicit Places using invariants in 707 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:03:57] [INFO ] Computed 41 place invariants in 91 ms
[2022-05-21 06:04:00] [INFO ] Implicit Places using invariants and state equation in 2595 ms returned []
Implicit Place search using SMT with State Equation took 3302 ms to find 0 implicit places.
[2022-05-21 06:04:00] [INFO ] Redundant transitions in 76 ms returned []
// Phase 1: matrix 2744 rows 588 cols
[2022-05-21 06:04:00] [INFO ] Computed 41 place invariants in 106 ms
[2022-05-21 06:04:01] [INFO ] Dead Transitions using invariants and state equation in 939 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 588/588 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN14-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s189 1) (GEQ s381 1) (GEQ s441 1)), p0:(OR (AND (GEQ s108 1) (GEQ s305 1) (GEQ s556 1)) (AND (GEQ s189 1) (GEQ s381 1) (GEQ s441 1)))], nbAcceptance=2, 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 169 steps with 0 reset in 31 ms.
FORMULA Sudoku-PT-AN14-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN14-LTLFireability-14 finished in 4521 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(G(p0)) U p0)||X(!p0))))'
[2022-05-21 06:04:01] [INFO ] Flatten gal took : 190 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin390368362070191696
[2022-05-21 06:04:02] [INFO ] Too many transitions (2744) to apply POR reductions. Disabling POR matrices.
[2022-05-21 06:04:02] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin390368362070191696
Running compilation step : cd /tmp/ltsmin390368362070191696;'/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-21 06:04:02] [INFO ] Applying decomposition
[2022-05-21 06:04:02] [INFO ] Flatten gal took : 200 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/graph6010631531336331440.txt' '-o' '/tmp/graph6010631531336331440.bin' '-w' '/tmp/graph6010631531336331440.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6010631531336331440.bin' '-l' '-1' '-v' '-w' '/tmp/graph6010631531336331440.weights' '-q' '0' '-e' '0.001'
[2022-05-21 06:04:02] [INFO ] Decomposing Gal with order
[2022-05-21 06:04:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 06:04:03] [INFO ] Removed a total of 7644 redundant transitions.
[2022-05-21 06:04:03] [INFO ] Flatten gal took : 279 ms
[2022-05-21 06:04:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2022-05-21 06:04:03] [INFO ] Time to serialize gal into /tmp/LTLFireability3149113151421204254.gal : 11 ms
[2022-05-21 06:04:03] [INFO ] Time to serialize properties into /tmp/LTLFireability5975451220579295626.ltl : 29 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/LTLFireability3149113151421204254.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5975451220579295626.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(G("(((((((((((((((u134.Rows_9_8>=1)&&(u328.Cells_9_6>=1))&&(u484.Columns_6_8>=1))||(((u113.Rows_8_1>=1)&&(u316.Cells_8_8>=1))...577543
Formula 0 simplified : !G((XG"(((((((((((((((u134.Rows_9_8>=1)&&(u328.Cells_9_6>=1))&&(u484.Columns_6_8>=1))||(((u113.Rows_8_1>=1)&&(u316.Cells_8_8>=1))&&(...577532
Compilation finished in 7224 ms.
Running link step : cd /tmp/ltsmin390368362070191696;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin390368362070191696;'/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([]((LTLAPp0==true))) U (LTLAPp0==true))||X(!(LTLAPp0==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: 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: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: LTL layer: formula: [](((X([]((LTLAPp0==true))) U (LTLAPp0==true))||X(!(LTLAPp0==true))))
pins2lts-mc-linux64( 2/ 8), 0.010: "[](((X([]((LTLAPp0==true))) U (LTLAPp0==true))||X(!(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.010: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.058: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.619: DFS-FIFO for weak LTL, using special progress label 2746
pins2lts-mc-linux64( 0/ 8), 0.619: There are 2747 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.619: State length is 589, there are 2751 groups
pins2lts-mc-linux64( 0/ 8), 0.619: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.619: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.619: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.619: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 21.603: ~1 levels ~960 states ~2596160 transitions
pins2lts-mc-linux64( 2/ 8), 33.779: ~1 levels ~1920 states ~5192000 transitions
pins2lts-mc-linux64( 2/ 8), 57.528: ~1 levels ~3840 states ~10383680 transitions
pins2lts-mc-linux64( 1/ 8), 105.249: ~1 levels ~7680 states ~20463664 transitions
pins2lts-mc-linux64( 1/ 8), 199.180: ~1 levels ~15360 states ~40926000 transitions
pins2lts-mc-linux64( 0/ 8), 249.247: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 293.541:
pins2lts-mc-linux64( 0/ 8), 293.541: mean standard work distribution: 1.1% (states) 0.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 293.541:
pins2lts-mc-linux64( 0/ 8), 293.541: Explored 19051 states 50862817 transitions, fanout: 2669.824
pins2lts-mc-linux64( 0/ 8), 293.541: Total exploration time 292.920 sec (251.430 sec minimum, 267.214 sec on average)
pins2lts-mc-linux64( 0/ 8), 293.541: States per second: 65, Transitions per second: 173641
pins2lts-mc-linux64( 0/ 8), 293.541:
pins2lts-mc-linux64( 0/ 8), 293.541: Progress states detected: 34600226
pins2lts-mc-linux64( 0/ 8), 293.541: Redundant explorations: -99.9449
pins2lts-mc-linux64( 0/ 8), 293.541:
pins2lts-mc-linux64( 0/ 8), 293.541: Queue width: 8B, total height: 38288866, memory: 292.12MB
pins2lts-mc-linux64( 0/ 8), 293.541: Tree memory: 520.0MB, 15.8 B/state, compr.: 0.7%
pins2lts-mc-linux64( 0/ 8), 293.541: Tree fill ratio (roots/leafs): 25.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 293.541: Stored 2864 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 293.541: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 293.541: Est. total memory use: 812.1MB (~1316.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin390368362070191696;'/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([]((LTLAPp0==true))) U (LTLAPp0==true))||X(!(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin390368362070191696;'/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([]((LTLAPp0==true))) U (LTLAPp0==true))||X(!(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-21 06:25:50] [INFO ] Flatten gal took : 2417 ms
[2022-05-21 06:25:51] [INFO ] Time to serialize gal into /tmp/LTLFireability1707547481920774977.gal : 37 ms
[2022-05-21 06:25:51] [INFO ] Time to serialize properties into /tmp/LTLFireability16124108752553786993.ltl : 33 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/LTLFireability1707547481920774977.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16124108752553786993.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/LTLFireabi...289
Read 1 LTL properties
Checking formula 0 : !((G(((X(G("(((((((((((((((Rows_9_8>=1)&&(Cells_9_6>=1))&&(Columns_6_8>=1))||(((Rows_8_1>=1)&&(Cells_8_8>=1))&&(Columns_8_1>=1)))||(((...458683
Formula 0 simplified : !G((XG"(((((((((((((((Rows_9_8>=1)&&(Cells_9_6>=1))&&(Columns_6_8>=1))||(((Rows_8_1>=1)&&(Cells_8_8>=1))&&(Columns_8_1>=1)))||((((Ro...458672
Detected timeout of ITS tools.
[2022-05-21 06:47:30] [INFO ] Flatten gal took : 13971 ms
[2022-05-21 06:47:32] [INFO ] Input system was already deterministic with 2744 transitions.
[2022-05-21 06:47:32] [INFO ] Transformed 588 places.
[2022-05-21 06:47:32] [INFO ] Transformed 2744 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-21 06:47:32] [INFO ] Time to serialize gal into /tmp/LTLFireability5008525163130016819.gal : 9 ms
[2022-05-21 06:47:32] [INFO ] Time to serialize properties into /tmp/LTLFireability10495501189449007404.ltl : 28 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/LTLFireability5008525163130016819.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10495501189449007404.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...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(((X(G("(((((((((((((((Rows_9_8>=1)&&(Cells_9_6>=1))&&(Columns_6_8>=1))||(((Rows_8_1>=1)&&(Cells_8_8>=1))&&(Columns_8_1>=1)))||(((...458683
Formula 0 simplified : !G((XG"(((((((((((((((Rows_9_8>=1)&&(Cells_9_6>=1))&&(Columns_6_8>=1))||(((Rows_8_1>=1)&&(Cells_8_8>=1))&&(Columns_8_1>=1)))||((((Ro...458672

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-PT-AN14"
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-PT-AN14, 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-165303545500308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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