Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r417-tall-171690556400418.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Sudoku-PT-AN13, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556400418
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 42M
-rw-r--r-- 1 mcc users 813K Apr 12 11:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Apr 12 11:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.6M Apr 12 10:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 7.3M Apr 12 10:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 379K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.7M Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7M Apr 12 12:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.6M Apr 12 12:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0M Apr 12 11:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.1M Apr 12 11:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 78K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 191K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.2M May 18 16:43 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-AN13-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717155291024

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN13
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-31 11:34:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 11:34:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 11:34:52] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2024-05-31 11:34:52] [INFO ] Transformed 2704 places.
[2024-05-31 11:34:52] [INFO ] Transformed 2197 transitions.
[2024-05-31 11:34:52] [INFO ] Found NUPN structural information;
[2024-05-31 11:34:52] [INFO ] Parsed PT model containing 2704 places and 2197 transitions and 8788 arcs in 282 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 162 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-AN13-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 507 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 49 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2024-05-31 11:34:54] [INFO ] Computed 38 invariants in 130 ms
[2024-05-31 11:34:54] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-31 11:34:54] [INFO ] Invariant cache hit.
[2024-05-31 11:34:55] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 1034 ms to find 0 implicit places.
[2024-05-31 11:34:55] [INFO ] Invariant cache hit.
[2024-05-31 11:34:56] [INFO ] Dead Transitions using invariants and state equation in 1495 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2583 ms. Remains : 507/2704 places, 2197/2197 transitions.
Support contains 507 out of 507 places after structural reductions.
[2024-05-31 11:34:57] [INFO ] Flatten gal took : 419 ms
[2024-05-31 11:35:01] [INFO ] Flatten gal took : 466 ms
[2024-05-31 11:35:04] [INFO ] Input system was already deterministic with 2197 transitions.
Finished random walk after 149 steps, including 0 resets, run visited all 14 properties in 72 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 19 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:35:05] [INFO ] Invariant cache hit.
[2024-05-31 11:35:05] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-31 11:35:05] [INFO ] Invariant cache hit.
[2024-05-31 11:35:05] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2024-05-31 11:35:06] [INFO ] Redundant transitions in 119 ms returned []
[2024-05-31 11:35:06] [INFO ] Invariant cache hit.
[2024-05-31 11:35:07] [INFO ] Dead Transitions using invariants and state equation in 1499 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2310 ms. Remains : 507/507 places, 2197/2197 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (EQ s82 1) (EQ s258 1) (EQ s485 1)) (AND (EQ s136 1) (EQ s302 1) (EQ s383 1)) (AND (EQ s116 1) (EQ s285 1) (EQ s506 1)) (AND (EQ s48 1) (EQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 143 steps with 0 reset in 27 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-00 finished in 2632 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 18 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:35:08] [INFO ] Invariant cache hit.
[2024-05-31 11:35:08] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-31 11:35:08] [INFO ] Invariant cache hit.
[2024-05-31 11:35:09] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
[2024-05-31 11:35:09] [INFO ] Redundant transitions in 133 ms returned []
[2024-05-31 11:35:09] [INFO ] Invariant cache hit.
[2024-05-31 11:35:10] [INFO ] Dead Transitions using invariants and state equation in 1412 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2262 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-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:(OR (AND (EQ s82 1) (EQ s258 1) (EQ s485 1)) (AND (EQ s136 1) (EQ s302 1) (EQ s383 1)) (AND (EQ s116 1) (EQ s285 1) (EQ s506 1)) (AND (EQ s48 1) (EQ s2...], 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 147 steps with 0 reset in 27 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-01 finished in 3179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&G(p1)))||X(F(p0))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 5 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:35:11] [INFO ] Invariant cache hit.
[2024-05-31 11:35:12] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-31 11:35:12] [INFO ] Invariant cache hit.
[2024-05-31 11:35:12] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
[2024-05-31 11:35:12] [INFO ] Invariant cache hit.
[2024-05-31 11:35:14] [INFO ] Dead Transitions using invariants and state equation in 1504 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2229 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (EQ s82 1) (EQ s258 1) (EQ s485 1)) (AND (EQ s136 1) (EQ s302 1) (EQ s383 1)) (AND (EQ s116 1) (EQ s285 1) (EQ s506 1)) (AND (EQ s48 1) (EQ s2...], 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 timeout after 47380 steps with 23690 reset in 10001 ms.
Product exploration timeout after 47530 steps with 23765 reset in 10002 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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 (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 30 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN13-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLFireability-02 finished in 25350 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||p0))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 14 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:35:36] [INFO ] Invariant cache hit.
[2024-05-31 11:35:36] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-31 11:35:36] [INFO ] Invariant cache hit.
[2024-05-31 11:35:37] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
[2024-05-31 11:35:37] [INFO ] Redundant transitions in 46 ms returned []
[2024-05-31 11:35:37] [INFO ] Invariant cache hit.
[2024-05-31 11:35:38] [INFO ] Dead Transitions using invariants and state equation in 1412 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2134 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s82 1) (EQ s258 1) (EQ s485 1)) (AND (EQ s136 1) (EQ s302 1) (EQ s383 1)) (AND (EQ s116 1) (EQ s285 1) (EQ s506 1)) (AND (EQ s48 1) (EQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 148 steps with 0 reset in 22 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-03 finished in 2283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1&&X(p1)))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 5 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:35:38] [INFO ] Invariant cache hit.
[2024-05-31 11:35:38] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-31 11:35:38] [INFO ] Invariant cache hit.
[2024-05-31 11:35:39] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
[2024-05-31 11:35:39] [INFO ] Invariant cache hit.
[2024-05-31 11:35:40] [INFO ] Dead Transitions using invariants and state equation in 1383 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2029 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true, (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}]], initial=0, aps=[p0:(AND (OR (EQ s82 0) (EQ s258 0) (EQ s485 0)) (OR (EQ s136 0) (EQ s302 0) (EQ s383 0)) (OR (EQ s116 0) (EQ s285 0) (EQ s506 0)) (OR (EQ s48 0) (EQ s218 ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 73970 steps with 949 reset in 10002 ms.
Product exploration timeout after 73610 steps with 976 reset in 10002 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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 p1), (X (NOT p0)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Finished random walk after 144 steps, including 0 resets, run visited all 1 properties in 23 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 130 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 6 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:36:03] [INFO ] Invariant cache hit.
[2024-05-31 11:36:03] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-31 11:36:03] [INFO ] Invariant cache hit.
[2024-05-31 11:36:04] [INFO ] Implicit Places using invariants and state equation in 581 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
[2024-05-31 11:36:04] [INFO ] Invariant cache hit.
[2024-05-31 11:36:05] [INFO ] Dead Transitions using invariants and state equation in 1549 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2255 ms. Remains : 507/507 places, 2197/2197 transitions.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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 : [p1, (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Finished random walk after 150 steps, including 0 resets, run visited all 1 properties in 23 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Product exploration timeout after 36310 steps with 12103 reset in 10003 ms.
Product exploration timeout after 36420 steps with 12140 reset in 10004 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 10 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:36:28] [INFO ] Redundant transitions in 48 ms returned []
[2024-05-31 11:36:28] [INFO ] Invariant cache hit.
[2024-05-31 11:36:30] [INFO ] Dead Transitions using invariants and state equation in 1354 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1426 ms. Remains : 507/507 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin2817550936057283811
[2024-05-31 11:36:30] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2817550936057283811
Running compilation step : cd /tmp/ltsmin2817550936057283811;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2817550936057283811;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin2817550936057283811;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 3 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:36:33] [INFO ] Invariant cache hit.
[2024-05-31 11:36:33] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-31 11:36:33] [INFO ] Invariant cache hit.
[2024-05-31 11:36:33] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2024-05-31 11:36:33] [INFO ] Invariant cache hit.
[2024-05-31 11:36:35] [INFO ] Dead Transitions using invariants and state equation in 1360 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2030 ms. Remains : 507/507 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin9386441844908201243
[2024-05-31 11:36:35] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9386441844908201243
Running compilation step : cd /tmp/ltsmin9386441844908201243;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin9386441844908201243;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin9386441844908201243;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-31 11:36:39] [INFO ] Flatten gal took : 92 ms
[2024-05-31 11:36:39] [INFO ] Flatten gal took : 83 ms
[2024-05-31 11:36:39] [INFO ] Time to serialize gal into /tmp/LTL5611295432646726321.gal : 19 ms
[2024-05-31 11:36:39] [INFO ] Time to serialize properties into /tmp/LTL11938003303131952447.prop : 17 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5611295432646726321.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2177958328821395663.hoa' '-atoms' '/tmp/LTL11938003303131952447.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11938003303131952447.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2177958328821395663.hoa
Detected timeout of ITS tools.
[2024-05-31 11:36:55] [INFO ] Flatten gal took : 225 ms
[2024-05-31 11:36:55] [INFO ] Flatten gal took : 122 ms
[2024-05-31 11:36:55] [INFO ] Time to serialize gal into /tmp/LTL8152420139476255775.gal : 11 ms
[2024-05-31 11:36:55] [INFO ] Time to serialize properties into /tmp/LTL12729309393353822724.ltl : 52 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8152420139476255775.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12729309393353822724.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((((((((((Rows_6_4==0)||(Cells_6_11==0))||(Columns_11_4==0))&&(((Rows_10_6==0)||(Cells_10_3==0))||(Columns_3_6==0)))&&((((...371672
Formula 0 simplified : G!"(((((((((((((((Rows_6_4==0)||(Cells_6_11==0))||(Columns_11_4==0))&&(((Rows_10_6==0)||(Cells_10_3==0))||(Columns_3_6==0)))&&((((Ro...371662
Detected timeout of ITS tools.
[2024-05-31 11:37:10] [INFO ] Flatten gal took : 125 ms
[2024-05-31 11:37:10] [INFO ] Applying decomposition
[2024-05-31 11:37:10] [INFO ] Flatten gal took : 126 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8697203023215230623.txt' '-o' '/tmp/graph8697203023215230623.bin' '-w' '/tmp/graph8697203023215230623.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8697203023215230623.bin' '-l' '-1' '-v' '-w' '/tmp/graph8697203023215230623.weights' '-q' '0' '-e' '0.001'
[2024-05-31 11:37:11] [INFO ] Decomposing Gal with order
[2024-05-31 11:37:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 11:37:11] [INFO ] Removed a total of 6084 redundant transitions.
[2024-05-31 11:37:11] [INFO ] Flatten gal took : 309 ms
[2024-05-31 11:37:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2024-05-31 11:37:11] [INFO ] Time to serialize gal into /tmp/LTL15626628635660740895.gal : 19 ms
[2024-05-31 11:37:11] [INFO ] Time to serialize properties into /tmp/LTL4411741028674603986.ltl : 29 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15626628635660740895.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4411741028674603986.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((((((((((u82.Rows_6_4==0)||(u258.Cells_6_11==0))||(u485.Columns_11_4==0))&&(((u136.Rows_10_6==0)||(u302.Cells_10_3==0))||...466247
Formula 0 simplified : G!"(((((((((((((((u82.Rows_6_4==0)||(u258.Cells_6_11==0))||(u485.Columns_11_4==0))&&(((u136.Rows_10_6==0)||(u302.Cells_10_3==0))||(u...466237
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13926162570533711806
[2024-05-31 11:37:26] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13926162570533711806
Running compilation step : cd /tmp/ltsmin13926162570533711806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13926162570533711806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin13926162570533711806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Sudoku-PT-AN13-LTLFireability-04 finished in 111315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 10 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:37:30] [INFO ] Invariant cache hit.
[2024-05-31 11:37:30] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-31 11:37:30] [INFO ] Invariant cache hit.
[2024-05-31 11:37:31] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
[2024-05-31 11:37:31] [INFO ] Invariant cache hit.
[2024-05-31 11:37:32] [INFO ] Dead Transitions using invariants and state equation in 1544 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2225 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (EQ s82 1) (EQ s258 1) (EQ s485 1)) (AND (EQ s136 1) (EQ s302 1) (EQ s383 1)) (AND (EQ s116 1) (EQ s285 1) (EQ s506 1)) (AND (EQ s48 1) (EQ s2...], 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 148 steps with 0 reset in 22 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-05 finished in 3067 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!((p0 U F(p0)) U p0))||X((X(p0) U p0)))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 4 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:37:33] [INFO ] Invariant cache hit.
[2024-05-31 11:37:33] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-31 11:37:33] [INFO ] Invariant cache hit.
[2024-05-31 11:37:33] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
[2024-05-31 11:37:33] [INFO ] Invariant cache hit.
[2024-05-31 11:37:35] [INFO ] Dead Transitions using invariants and state equation in 1514 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2238 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 269 ms :[true, false, false, p0, (NOT p0), (NOT p0), false, false]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 7}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}], [{ cond=(NOT p0), acceptance={} source=6 dest: 3}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}]], initial=1, aps=[p0:(OR (AND (EQ s82 1) (EQ s258 1) (EQ s485 1)) (AND (EQ s136 1) (EQ s302 1) (EQ s383 1)) (AND (EQ s116 1) (EQ s285 1) (EQ s506 1)) (AND (EQ s48 1) (EQ s2...], 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, null][false, false, false, false, false, false, false, false]]
Product exploration timeout after 36510 steps with 12170 reset in 10001 ms.
Product exploration timeout after 36190 steps with 12063 reset in 10003 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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 102 ms. Reduced automaton from 8 states, 10 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Finished random walk after 146 steps, including 0 resets, run visited all 1 properties in 22 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 6 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:37:58] [INFO ] Invariant cache hit.
[2024-05-31 11:37:58] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-31 11:37:58] [INFO ] Invariant cache hit.
[2024-05-31 11:37:59] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 749 ms to find 0 implicit places.
[2024-05-31 11:37:59] [INFO ] Invariant cache hit.
[2024-05-31 11:38:00] [INFO ] Dead Transitions using invariants and state equation in 1564 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2321 ms. Remains : 507/507 places, 2197/2197 transitions.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Finished random walk after 152 steps, including 0 resets, run visited all 1 properties in 23 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Product exploration timeout after 36310 steps with 12103 reset in 10001 ms.
Product exploration timeout after 36360 steps with 12120 reset in 10004 ms.
Applying partial POR strategy [false, false, true, true, false]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 17 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:38:23] [INFO ] Redundant transitions in 46 ms returned []
[2024-05-31 11:38:23] [INFO ] Invariant cache hit.
[2024-05-31 11:38:25] [INFO ] Dead Transitions using invariants and state equation in 1489 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1569 ms. Remains : 507/507 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin8039046735069662500
[2024-05-31 11:38:25] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8039046735069662500
Running compilation step : cd /tmp/ltsmin8039046735069662500;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin8039046735069662500;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin8039046735069662500;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 7 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:38:28] [INFO ] Invariant cache hit.
[2024-05-31 11:38:28] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-31 11:38:28] [INFO ] Invariant cache hit.
[2024-05-31 11:38:29] [INFO ] Implicit Places using invariants and state equation in 581 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
[2024-05-31 11:38:29] [INFO ] Invariant cache hit.
[2024-05-31 11:38:30] [INFO ] Dead Transitions using invariants and state equation in 1478 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2212 ms. Remains : 507/507 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin12610347946863877088
[2024-05-31 11:38:30] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12610347946863877088
Running compilation step : cd /tmp/ltsmin12610347946863877088;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12610347946863877088;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin12610347946863877088;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-31 11:38:34] [INFO ] Flatten gal took : 145 ms
[2024-05-31 11:38:34] [INFO ] Flatten gal took : 74 ms
[2024-05-31 11:38:34] [INFO ] Time to serialize gal into /tmp/LTL8133658671348993042.gal : 8 ms
[2024-05-31 11:38:34] [INFO ] Time to serialize properties into /tmp/LTL3136791402752916494.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8133658671348993042.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4477145296571059957.hoa' '-atoms' '/tmp/LTL3136791402752916494.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3136791402752916494.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4477145296571059957.hoa
Detected timeout of ITS tools.
[2024-05-31 11:38:49] [INFO ] Flatten gal took : 160 ms
[2024-05-31 11:38:50] [INFO ] Flatten gal took : 211 ms
[2024-05-31 11:38:50] [INFO ] Time to serialize gal into /tmp/LTL7251370838642710907.gal : 8 ms
[2024-05-31 11:38:50] [INFO ] Time to serialize properties into /tmp/LTL13767676831552086871.ltl : 61 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7251370838642710907.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13767676831552086871.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G(!((("(((((((((((((((Rows_6_4==1)&&(Cells_6_11==1))&&(Columns_11_4==1))||(((Rows_10_6==1)&&(Cells_10_3==1))&&(Columns_3_6==1)))...619440
Formula 0 simplified : X(F"(((((((((((((((Rows_6_4==1)&&(Cells_6_11==1))&&(Columns_11_4==1))||(((Rows_10_6==1)&&(Cells_10_3==1))&&(Columns_3_6==1)))||((((R...371664
Detected timeout of ITS tools.
[2024-05-31 11:39:05] [INFO ] Flatten gal took : 154 ms
[2024-05-31 11:39:05] [INFO ] Applying decomposition
[2024-05-31 11:39:05] [INFO ] Flatten gal took : 151 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16602760949117319897.txt' '-o' '/tmp/graph16602760949117319897.bin' '-w' '/tmp/graph16602760949117319897.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16602760949117319897.bin' '-l' '-1' '-v' '-w' '/tmp/graph16602760949117319897.weights' '-q' '0' '-e' '0.001'
[2024-05-31 11:39:05] [INFO ] Decomposing Gal with order
[2024-05-31 11:39:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 11:39:06] [INFO ] Removed a total of 6084 redundant transitions.
[2024-05-31 11:39:06] [INFO ] Flatten gal took : 261 ms
[2024-05-31 11:39:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2024-05-31 11:39:06] [INFO ] Time to serialize gal into /tmp/LTL14390242831683763204.gal : 10 ms
[2024-05-31 11:39:06] [INFO ] Time to serialize properties into /tmp/LTL15013984709133969287.ltl : 39 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14390242831683763204.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15013984709133969287.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X((G(!((("(((((((((((((((u82.Rows_6_4==1)&&(u258.Cells_6_11==1))&&(u485.Columns_11_4==1))||(((u136.Rows_10_6==1)&&(u302.Cells_10_3=...777065
Formula 0 simplified : X(F"(((((((((((((((u82.Rows_6_4==1)&&(u258.Cells_6_11==1))&&(u485.Columns_11_4==1))||(((u136.Rows_10_6==1)&&(u302.Cells_10_3==1))&&(...466239
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16182891678174495990
[2024-05-31 11:39:21] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16182891678174495990
Running compilation step : cd /tmp/ltsmin16182891678174495990;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16182891678174495990;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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/ltsmin16182891678174495990;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/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:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property Sudoku-PT-AN13-LTLFireability-07 finished in 111618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))&&F(p1)))))'
Support contains 9 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 120 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:39:24] [INFO ] Invariant cache hit.
[2024-05-31 11:39:27] [INFO ] Implicit Places using invariants in 2764 ms returned []
[2024-05-31 11:39:27] [INFO ] Invariant cache hit.
[2024-05-31 11:39:37] [INFO ] Implicit Places using invariants and state equation in 9667 ms returned []
Implicit Place search using SMT with State Equation took 12448 ms to find 0 implicit places.
[2024-05-31 11:39:37] [INFO ] Invariant cache hit.
[2024-05-31 11:39:38] [INFO ] Dead Transitions using invariants and state equation in 1544 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14117 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s20 1) (EQ s192 1) (EQ s475 1) (EQ s96 1) (EQ s267 1) (EQ s434 1)), p1:(AND (EQ s11 1) (EQ s176 1) (EQ s440 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 145 steps with 0 reset in 27 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-09 finished in 14436 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 60 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:39:39] [INFO ] Invariant cache hit.
[2024-05-31 11:39:41] [INFO ] Implicit Places using invariants in 2766 ms returned []
[2024-05-31 11:39:41] [INFO ] Invariant cache hit.
[2024-05-31 11:39:49] [INFO ] Implicit Places using invariants and state equation in 7433 ms returned []
Implicit Place search using SMT with State Equation took 10203 ms to find 0 implicit places.
[2024-05-31 11:39:49] [INFO ] Redundant transitions in 49 ms returned []
[2024-05-31 11:39:49] [INFO ] Invariant cache hit.
[2024-05-31 11:39:50] [INFO ] Dead Transitions using invariants and state equation in 1497 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11820 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 342 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-10 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 (NEQ s139 1) (NEQ s301 1) (NEQ s373 1))], 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 75560 steps with 510 reset in 10004 ms.
Product exploration timeout after 75570 steps with 509 reset in 10004 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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 : [(X p0), (X (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 12 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN13-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLFireability-10 finished in 32585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 83 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:40:11] [INFO ] Invariant cache hit.
[2024-05-31 11:40:14] [INFO ] Implicit Places using invariants in 2629 ms returned []
[2024-05-31 11:40:14] [INFO ] Invariant cache hit.
[2024-05-31 11:40:21] [INFO ] Implicit Places using invariants and state equation in 7414 ms returned []
Implicit Place search using SMT with State Equation took 10070 ms to find 0 implicit places.
[2024-05-31 11:40:21] [INFO ] Invariant cache hit.
[2024-05-31 11:40:23] [INFO ] Dead Transitions using invariants and state equation in 1481 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11648 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s70 1) (NEQ s242 1) (NEQ s447 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-11 finished in 11752 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(X((p0 U G((!p1 U X(p0))))) U X(p2)))'
Support contains 12 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 47 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:40:23] [INFO ] Invariant cache hit.
[2024-05-31 11:40:25] [INFO ] Implicit Places using invariants in 2523 ms returned []
[2024-05-31 11:40:25] [INFO ] Invariant cache hit.
[2024-05-31 11:40:34] [INFO ] Implicit Places using invariants and state equation in 8240 ms returned []
Implicit Place search using SMT with State Equation took 10777 ms to find 0 implicit places.
[2024-05-31 11:40:34] [INFO ] Invariant cache hit.
[2024-05-31 11:40:35] [INFO ] Dead Transitions using invariants and state equation in 1540 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12366 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 366 ms :[p2, p2, true, (AND p0 p2), (AND p0 p2), (AND p0 p2), false, p0, false]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 6}, { cond=(AND p0 p2), acceptance={} source=3 dest: 7}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 6}, { cond=p2, acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 6}, { cond=p2, acceptance={} source=5 dest: 7}, { cond=(AND p0 p2), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={0} source=6 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(NOT p0), acceptance={} source=8 dest: 7}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(AND (EQ s157 1) (EQ s328 1) (EQ s378 1)), p0:(AND (EQ s78 1) (EQ s254 1) (EQ s429 1)), p1:(AND (EQ s33 1) (EQ s196 1) (EQ s358 1) (EQ s16 1) (EQ s185 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-12 finished in 12767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 49 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:40:36] [INFO ] Invariant cache hit.
[2024-05-31 11:40:38] [INFO ] Implicit Places using invariants in 2762 ms returned []
[2024-05-31 11:40:38] [INFO ] Invariant cache hit.
[2024-05-31 11:40:47] [INFO ] Implicit Places using invariants and state equation in 8262 ms returned []
Implicit Place search using SMT with State Equation took 11026 ms to find 0 implicit places.
[2024-05-31 11:40:47] [INFO ] Invariant cache hit.
[2024-05-31 11:40:48] [INFO ] Dead Transitions using invariants and state equation in 1532 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12608 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-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 (EQ s69 1) (EQ s237 1) (EQ s381 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 89 steps with 0 reset in 24 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-13 finished in 12734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 6 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 62 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:40:48] [INFO ] Invariant cache hit.
[2024-05-31 11:40:51] [INFO ] Implicit Places using invariants in 2603 ms returned []
[2024-05-31 11:40:51] [INFO ] Invariant cache hit.
[2024-05-31 11:40:59] [INFO ] Implicit Places using invariants and state equation in 7502 ms returned []
Implicit Place search using SMT with State Equation took 10116 ms to find 0 implicit places.
[2024-05-31 11:40:59] [INFO ] Redundant transitions in 42 ms returned []
[2024-05-31 11:40:59] [INFO ] Invariant cache hit.
[2024-05-31 11:41:00] [INFO ] Dead Transitions using invariants and state equation in 1513 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11743 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s27 1) (NEQ s199 1) (NEQ s391 1) (NEQ s104 1) (NEQ s284 1) (NEQ s481 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration timeout after 34690 steps with 1336 reset in 10001 ms.
Product exploration timeout after 34210 steps with 1288 reset in 10002 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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 : [(X (NOT p0)), (X p0)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 22 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN13-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLFireability-14 finished in 32227 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0)) U !p0))'
Support contains 3 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 65 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-31 11:41:21] [INFO ] Invariant cache hit.
[2024-05-31 11:41:23] [INFO ] Implicit Places using invariants in 2761 ms returned []
[2024-05-31 11:41:23] [INFO ] Invariant cache hit.
[2024-05-31 11:41:30] [INFO ] Implicit Places using invariants and state equation in 6982 ms returned []
Implicit Place search using SMT with State Equation took 9748 ms to find 0 implicit places.
[2024-05-31 11:41:30] [INFO ] Redundant transitions in 52 ms returned []
[2024-05-31 11:41:30] [INFO ] Invariant cache hit.
[2024-05-31 11:41:32] [INFO ] Dead Transitions using invariants and state equation in 1529 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11402 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 113 ms :[p0, p0, p0]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s84 1) (EQ s257 1) (EQ s474 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 42690 steps with 871 reset in 10003 ms.
Product exploration timeout after 42720 steps with 880 reset in 10002 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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, (F (G (NOT p0)))]
False Knowledge obtained : [(X p0), (X (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN13-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLFireability-15 finished in 31949 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1&&X(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!((p0 U F(p0)) U p0))||X((X(p0) U p0)))))'
[2024-05-31 11:41:53] [INFO ] Flatten gal took : 228 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12463517775856634357
[2024-05-31 11:41:53] [INFO ] Too many transitions (2197) to apply POR reductions. Disabling POR matrices.
[2024-05-31 11:41:53] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12463517775856634357
Running compilation step : cd /tmp/ltsmin12463517775856634357;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-31 11:41:53] [INFO ] Applying decomposition
[2024-05-31 11:41:54] [INFO ] Flatten gal took : 231 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15216997147257714089.txt' '-o' '/tmp/graph15216997147257714089.bin' '-w' '/tmp/graph15216997147257714089.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15216997147257714089.bin' '-l' '-1' '-v' '-w' '/tmp/graph15216997147257714089.weights' '-q' '0' '-e' '0.001'
[2024-05-31 11:41:54] [INFO ] Decomposing Gal with order
[2024-05-31 11:41:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 11:41:54] [INFO ] Removed a total of 6084 redundant transitions.
[2024-05-31 11:41:55] [INFO ] Flatten gal took : 336 ms
[2024-05-31 11:41:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2024-05-31 11:41:55] [INFO ] Time to serialize gal into /tmp/LTLFireability4494975981578103447.gal : 12 ms
[2024-05-31 11:41:55] [INFO ] Time to serialize properties into /tmp/LTLFireability14999230433022283554.ltl : 399 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4494975981578103447.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14999230433022283554.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !(((F("(((((((((((((((u82.Rows_6_4==0)||(u258.Cells_6_11==0))||(u485.Columns_11_4==0))&&(((u136.Rows_10_6==0)||(u302.Cells_10_3==0))||...466247
Formula 0 simplified : G!"(((((((((((((((u82.Rows_6_4==0)||(u258.Cells_6_11==0))||(u485.Columns_11_4==0))&&(((u136.Rows_10_6==0)||(u302.Cells_10_3==0))||(u...466237
Compilation finished in 6134 ms.
Running link step : cd /tmp/ltsmin12463517775856634357;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin12463517775856634357;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))&&X(((LTLAPp1==true)&&X((LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-31 12:04:30] [INFO ] Applying decomposition
[2024-05-31 12:04:41] [INFO ] Flatten gal took : 7982 ms
[2024-05-31 12:04:43] [INFO ] Decomposing Gal with order
[2024-05-31 12:04:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 12:05:17] [INFO ] Removed a total of 6084 redundant transitions.
[2024-05-31 12:05:58] [INFO ] Flatten gal took : 42319 ms
[2024-05-31 12:05:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 43 ms.
[2024-05-31 12:06:00] [INFO ] Time to serialize gal into /tmp/LTLFireability8112796242551769490.gal : 63 ms
[2024-05-31 12:06:00] [INFO ] Time to serialize properties into /tmp/LTLFireability2131312635261153424.ltl : 223 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8112796242551769490.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2131312635261153424.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !(((F("(((((((((((((((u114.Rows_6_4==0)||(u259.Cells_6_11==0))||(u486.Columns_11_4==0))&&(((u40.Rows_10_6==0)||(u303.Cells_10_3==0))||...466325
Formula 0 simplified : G!"(((((((((((((((u114.Rows_6_4==0)||(u259.Cells_6_11==0))||(u486.Columns_11_4==0))&&(((u40.Rows_10_6==0)||(u303.Cells_10_3==0))||(u...466315
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( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: LTL layer: formula: (<>((LTLAPp0==true))&&X(((LTLAPp1==true)&&X((LTLAPp1==true)))))
pins2lts-mc-linux64( 4/ 8), 0.009: "(<>((LTLAPp0==true))&&X(((LTLAPp1==true)&&X((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.010: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.028: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.030: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.038: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.518: DFS-FIFO for weak LTL, using special progress label 2200
pins2lts-mc-linux64( 0/ 8), 0.522: There are 2201 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.522: State length is 508, there are 2209 groups
pins2lts-mc-linux64( 0/ 8), 0.522: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.522: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.522: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.522: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 5.679: ~105 levels ~960 states ~977528 transitions
pins2lts-mc-linux64( 7/ 8), 5.762: ~145 levels ~1920 states ~993592 transitions
pins2lts-mc-linux64( 7/ 8), 5.872: ~145 levels ~3840 states ~1000632 transitions
pins2lts-mc-linux64( 7/ 8), 6.114: ~145 levels ~7680 states ~1018752 transitions
pins2lts-mc-linux64( 7/ 8), 6.561: ~145 levels ~15360 states ~1056568 transitions
pins2lts-mc-linux64( 7/ 8), 7.582: ~146 levels ~30720 states ~1145288 transitions
pins2lts-mc-linux64( 7/ 8), 9.495: ~146 levels ~61440 states ~1317256 transitions
pins2lts-mc-linux64( 7/ 8), 13.561: ~146 levels ~122880 states ~1704504 transitions
pins2lts-mc-linux64( 3/ 8), 22.811: ~145 levels ~245760 states ~2647432 transitions
pins2lts-mc-linux64( 3/ 8), 39.513: ~145 levels ~491520 states ~4467920 transitions
pins2lts-mc-linux64( 3/ 8), 74.004: ~145 levels ~983040 states ~8097272 transitions
pins2lts-mc-linux64( 3/ 8), 142.909: ~145 levels ~1966080 states ~15540416 transitions
pins2lts-mc-linux64( 3/ 8), 289.672: ~145 levels ~3932160 states ~32036448 transitions
pins2lts-mc-linux64( 3/ 8), 578.971: ~145 levels ~7864320 states ~64936000 transitions
pins2lts-mc-linux64( 3/ 8), 1182.343: ~145 levels ~15728640 states ~133939696 transitions
pins2lts-mc-linux64( 6/ 8), 1620.466: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1620.551:
pins2lts-mc-linux64( 0/ 8), 1620.560: mean standard work distribution: 2.0% (states) 2.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 1620.561:
pins2lts-mc-linux64( 0/ 8), 1620.561: Explored 19777551 states 185362382 transitions, fanout: 9.372
pins2lts-mc-linux64( 0/ 8), 1620.561: Total exploration time 1620.020 sec (1619.950 sec minimum, 1619.976 sec on average)
pins2lts-mc-linux64( 0/ 8), 1620.561: States per second: 12208, Transitions per second: 114420
pins2lts-mc-linux64( 0/ 8), 1620.561:
pins2lts-mc-linux64( 0/ 8), 1620.561: Progress states detected: 2371898
pins2lts-mc-linux64( 0/ 8), 1620.561: Redundant explorations: -13.5894
pins2lts-mc-linux64( 0/ 8), 1620.561:
pins2lts-mc-linux64( 0/ 8), 1620.562: Queue width: 8B, total height: 4746705, memory: 36.21MB
pins2lts-mc-linux64( 0/ 8), 1620.562: Tree memory: 430.6MB, 19.7 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 1620.562: Tree fill ratio (roots/leafs): 17.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1620.562: Stored 2467 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1620.602: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1620.602: Est. total memory use: 466.8MB (~1060.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12463517775856634357;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))&&X(((LTLAPp1==true)&&X((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12463517775856634357;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))&&X(((LTLAPp1==true)&&X((LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-31 12:28:43] [INFO ] Flatten gal took : 894 ms
[2024-05-31 12:28:43] [INFO ] Input system was already deterministic with 2197 transitions.
[2024-05-31 12:28:43] [INFO ] Transformed 507 places.
[2024-05-31 12:28:43] [INFO ] Transformed 2197 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
java.lang.NullPointerException: Cannot read the array length because "order" is null
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.computeOrderWithGreatSPN(MultiOrderRunner.java:60)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:143)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:855)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2024-05-31 12:28:46] [INFO ] Time to serialize gal into /tmp/LTLFireability813069091030278334.gal : 2430 ms
[2024-05-31 12:28:47] [INFO ] Time to serialize properties into /tmp/LTLFireability3892611080177652237.ltl : 166 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability813069091030278334.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3892611080177652237.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...341
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F("(((((((((((((((Rows_6_4==0)||(Cells_6_11==0))||(Columns_11_4==0))&&(((Rows_10_6==0)||(Cells_10_3==0))||(Columns_3_6==0)))&&((((...371672
Formula 0 simplified : G!"(((((((((((((((Rows_6_4==0)||(Cells_6_11==0))||(Columns_11_4==0))&&(((Rows_10_6==0)||(Cells_10_3==0))||(Columns_3_6==0)))&&((((Ro...371662
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7555640 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15883556 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-PT-AN13"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is Sudoku-PT-AN13, 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 r417-tall-171690556400418"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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