MCC'2023- Execution of r485-tall-167912699100251

About the Execution of ITS-Tools for Sudoku-PT-AN12

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16211.140	3156364.00	3440296.00	104478.90	F???FFFFTFFFFTFF	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 35M
-rw-r--r-- 1 mcc users 1.1M Feb 26 09:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 4.8M Feb 26 09:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9M Feb 26 08:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 8.9M Feb 26 08:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 453K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.6M Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 754K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.6M Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.2M Feb 26 10:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.1M Feb 26 10:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 984K Feb 26 09:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.3M Feb 26 09:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 84K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 207K Feb 25 17:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 963K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679193846583

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN12
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-19 02:44:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 02:44:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 02:44:09] [INFO ] Load time of PNML (sax parser for PT used): 231 ms
[2023-03-19 02:44:09] [INFO ] Transformed 2160 places.
[2023-03-19 02:44:09] [INFO ] Transformed 1728 transitions.
[2023-03-19 02:44:09] [INFO ] Parsed PT model containing 2160 places and 1728 transitions and 6912 arcs in 394 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 332 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-AN12-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2160 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 53 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 2160 cols
[2023-03-19 02:44:10] [INFO ] Computed 432 place invariants in 72 ms
[2023-03-19 02:44:10] [INFO ] Implicit Places using invariants in 699 ms returned []
[2023-03-19 02:44:10] [INFO ] Invariant cache hit.
[2023-03-19 02:44:12] [INFO ] Implicit Places using invariants and state equation in 1637 ms returned []
Implicit Place search using SMT with State Equation took 2393 ms to find 0 implicit places.
[2023-03-19 02:44:12] [INFO ] Invariant cache hit.
[2023-03-19 02:44:13] [INFO ] Dead Transitions using invariants and state equation in 1152 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3601 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Support contains 2160 out of 2160 places after structural reductions.
[2023-03-19 02:44:14] [INFO ] Flatten gal took : 193 ms
[2023-03-19 02:44:14] [INFO ] Flatten gal took : 137 ms
[2023-03-19 02:44:15] [INFO ] Input system was already deterministic with 1728 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 2234 ms. (steps per millisecond=4 ) properties (out of 22) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-19 02:44:18] [INFO ] Invariant cache hit.
[2023-03-19 02:44:19] [INFO ] [Real]Absence check using 432 positive place invariants in 116 ms returned sat
[2023-03-19 02:44:20] [INFO ] After 1206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-19 02:44:20] [INFO ] [Nat]Absence check using 432 positive place invariants in 115 ms returned sat
[2023-03-19 02:44:29] [INFO ] After 3381ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :3
[2023-03-19 02:44:29] [INFO ] After 3752ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :3
Attempting to minimize the solution found.
Minimization took 215 ms.
[2023-03-19 02:44:29] [INFO ] After 9745ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :3
Fused 12 Parikh solutions to 1 different solutions.
Finished Parikh walk after 144 steps, including 0 resets, run visited all 3 properties in 11 ms. (steps per millisecond=13 )
Parikh walk visited 3 properties in 12 ms.
FORMULA Sudoku-PT-AN12-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 9 atomic propositions for a total of 13 simplifications.
FORMULA Sudoku-PT-AN12-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G((p0||G(p1)))||((p0||G(p1))&&G((G(!p0) U !p1))))))'
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 84 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 02:44:30] [INFO ] Invariant cache hit.
[2023-03-19 02:44:31] [INFO ] Implicit Places using invariants in 843 ms returned []
[2023-03-19 02:44:31] [INFO ] Invariant cache hit.
[2023-03-19 02:44:33] [INFO ] Implicit Places using invariants and state equation in 2030 ms returned []
Implicit Place search using SMT with State Equation took 2877 ms to find 0 implicit places.
[2023-03-19 02:44:33] [INFO ] Redundant transitions in 108 ms returned []
[2023-03-19 02:44:33] [INFO ] Invariant cache hit.
[2023-03-19 02:44:34] [INFO ] Dead Transitions using invariants and state equation in 988 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4081 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 416 ms :[(AND (NOT p0) (NOT p1)), true, (NOT p1), false, p0, (AND (NOT p1) p0), p1, p1]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 p1), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND p0 p1), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 4}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 7}], [{ cond=(AND p0 p1), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(GT 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA Sudoku-PT-AN12-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLCardinality-00 finished in 4579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||X(X(p1))))))'
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 21 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 02:44:34] [INFO ] Invariant cache hit.
[2023-03-19 02:44:35] [INFO ] Implicit Places using invariants in 832 ms returned []
[2023-03-19 02:44:35] [INFO ] Invariant cache hit.
[2023-03-19 02:44:37] [INFO ] Implicit Places using invariants and state equation in 2027 ms returned []
Implicit Place search using SMT with State Equation took 2869 ms to find 0 implicit places.
[2023-03-19 02:44:37] [INFO ] Invariant cache hit.
[2023-03-19 02:44:38] [INFO ] Dead Transitions using invariants and state equation in 972 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3863 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 461 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=p0, acceptance={} source=7 dest: 1}, { cond=(NOT p0), acceptance={} source=7 dest: 3}], [{ cond=(NOT p0), acceptance={} source=8 dest: 4}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=5, aps=[p1:(LEQ 3 (ADD s2016 s2017 s2018 s2019 s2020 s2021 s2022 s2023 s2024 s2025 s2026 s2027 s2028 s2029 s2030 s2031 s2032 s2033 s2034 s2035 s2036 s2037 s2038 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 32690 steps with 6538 reset in 10001 ms.
Product exploration timeout after 32630 steps with 6526 reset in 10002 ms.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
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 p1 (NOT p0)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 206 ms. Reduced automaton from 9 states, 13 edges and 2 AP (stutter sensitive) to 8 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 78 resets, run finished after 1390 ms. (steps per millisecond=7 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 497 ms. (steps per millisecond=20 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 497 ms. (steps per millisecond=20 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 02:47:22] [INFO ] Invariant cache hit.
[2023-03-19 02:47:23] [INFO ] [Real]Absence check using 432 positive place invariants in 101 ms returned sat
[2023-03-19 02:47:25] [INFO ] After 3284ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-19 02:47:26] [INFO ] [Nat]Absence check using 432 positive place invariants in 99 ms returned sat
[2023-03-19 02:47:28] [INFO ] After 1146ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-19 02:47:28] [INFO ] After 1402ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 161 ms.
[2023-03-19 02:47:28] [INFO ] After 2922ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 142 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=15 )
Parikh walk visited 2 properties in 8 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 308 ms. Reduced automaton from 8 states, 11 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 240 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 21 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 02:47:29] [INFO ] Invariant cache hit.
[2023-03-19 02:47:30] [INFO ] Implicit Places using invariants in 774 ms returned []
[2023-03-19 02:47:30] [INFO ] Invariant cache hit.
[2023-03-19 02:47:32] [INFO ] Implicit Places using invariants and state equation in 1908 ms returned []
Implicit Place search using SMT with State Equation took 2717 ms to find 0 implicit places.
[2023-03-19 02:47:32] [INFO ] Invariant cache hit.
[2023-03-19 02:47:33] [INFO ] Dead Transitions using invariants and state equation in 996 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3760 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
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 p1 (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 177 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1121 ms. (steps per millisecond=8 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 02:47:52] [INFO ] Invariant cache hit.
[2023-03-19 02:47:53] [INFO ] [Real]Absence check using 432 positive place invariants in 135 ms returned sat
[2023-03-19 02:47:54] [INFO ] After 1058ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 02:47:54] [INFO ] [Nat]Absence check using 432 positive place invariants in 105 ms returned sat
[2023-03-19 02:48:19] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 144 out of 2160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 432 are kept as prefixes of interest. Removing 1728 places using SCC suffix rule.5 ms
Discarding 1728 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 59 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 432/2160 places, 1728/1728 transitions.
Incomplete random walk after 10000 steps, including 79 resets, run finished after 1068 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 224732 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 224732 steps, saw 166428 distinct states, run finished after 3002 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1728 rows 432 cols
[2023-03-19 02:48:23] [INFO ] Computed 35 place invariants in 104 ms
[2023-03-19 02:48:23] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 27 ms returned sat
[2023-03-19 02:48:24] [INFO ] After 813ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 02:48:24] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 25 ms returned sat
[2023-03-19 02:48:24] [INFO ] After 497ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 02:48:24] [INFO ] After 560ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-19 02:48:25] [INFO ] After 717ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 142 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=23 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND p1 (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 4 factoid took 208 ms. Reduced automaton from 8 states, 10 edges and 2 AP (stutter sensitive) to 8 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 330 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 223 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration timeout after 37700 steps with 7540 reset in 10002 ms.
Product exploration timeout after 37620 steps with 7524 reset in 10001 ms.
Applying partial POR strategy [true, true, false, true, false, false, false, false]
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 55 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 02:48:46] [INFO ] Redundant transitions in 93 ms returned []
// Phase 1: matrix 1728 rows 2160 cols
[2023-03-19 02:48:46] [INFO ] Computed 432 place invariants in 8 ms
[2023-03-19 02:48:47] [INFO ] Dead Transitions using invariants and state equation in 1068 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1263 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Built C files in :
/tmp/ltsmin8830328702791748965
[2023-03-19 02:48:47] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8830328702791748965
Running compilation step : cd /tmp/ltsmin8830328702791748965;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin8830328702791748965;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8830328702791748965;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 29 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 02:48:50] [INFO ] Invariant cache hit.
[2023-03-19 02:48:51] [INFO ] Implicit Places using invariants in 688 ms returned []
[2023-03-19 02:48:51] [INFO ] Invariant cache hit.
[2023-03-19 02:48:53] [INFO ] Implicit Places using invariants and state equation in 1941 ms returned []
Implicit Place search using SMT with State Equation took 2661 ms to find 0 implicit places.
[2023-03-19 02:48:53] [INFO ] Invariant cache hit.
[2023-03-19 02:48:54] [INFO ] Dead Transitions using invariants and state equation in 996 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3688 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Built C files in :
/tmp/ltsmin6347067718817430263
[2023-03-19 02:48:54] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6347067718817430263
Running compilation step : cd /tmp/ltsmin6347067718817430263;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin6347067718817430263;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6347067718817430263;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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)
[2023-03-19 02:48:57] [INFO ] Flatten gal took : 91 ms
[2023-03-19 02:48:58] [INFO ] Flatten gal took : 83 ms
[2023-03-19 02:48:58] [INFO ] Time to serialize gal into /tmp/LTL8250649170596305282.gal : 20 ms
[2023-03-19 02:48:58] [INFO ] Time to serialize properties into /tmp/LTL3133818109133684519.prop : 3 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8250649170596305282.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13720006533636681956.hoa' '-atoms' '/tmp/LTL3133818109133684519.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3133818109133684519.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13720006533636681956.hoa
Detected timeout of ITS tools.
[2023-03-19 02:49:13] [INFO ] Flatten gal took : 182 ms
[2023-03-19 02:49:13] [INFO ] Flatten gal took : 142 ms
[2023-03-19 02:49:13] [INFO ] Time to serialize gal into /tmp/LTL4349785580494527160.gal : 30 ms
[2023-03-19 02:49:13] [INFO ] Time to serialize properties into /tmp/LTL10675183094320075023.ltl : 30 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4349785580494527160.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10675183094320075023.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((G("((((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((B...27175
Formula 0 simplified : XX(F!"((((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((Boar...27163
Detected timeout of ITS tools.
[2023-03-19 02:49:28] [INFO ] Flatten gal took : 71 ms
[2023-03-19 02:49:28] [INFO ] Applying decomposition
[2023-03-19 02:49:28] [INFO ] Flatten gal took : 70 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1032512158491711986.txt' '-o' '/tmp/graph1032512158491711986.bin' '-w' '/tmp/graph1032512158491711986.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1032512158491711986.bin' '-l' '-1' '-v' '-w' '/tmp/graph1032512158491711986.weights' '-q' '0' '-e' '0.001'
[2023-03-19 02:49:32] [INFO ] Decomposing Gal with order
[2023-03-19 02:49:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 02:49:35] [INFO ] Removed a total of 1584 redundant transitions.
[2023-03-19 02:49:35] [INFO ] Flatten gal took : 2396 ms
[2023-03-19 02:49:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 1728 labels/synchronizations in 112 ms.
[2023-03-19 02:49:35] [INFO ] Time to serialize gal into /tmp/LTL14521093555807896391.gal : 13 ms
[2023-03-19 02:49:35] [INFO ] Time to serialize properties into /tmp/LTL4319301885627636466.ltl : 2 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14521093555807896391.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4319301885627636466.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((G("((((((((((((gu0.Board_0_0_0+gu0.Board_0_0_1)+(gu0.Board_0_0_2+gu0.Board_0_0_3))+((gu0.Board_0_0_4+gu0.Board_0_0_5)+(gu0.Boa...34663
Formula 0 simplified : XX(F!"((((((((((((gu0.Board_0_0_0+gu0.Board_0_0_1)+(gu0.Board_0_0_2+gu0.Board_0_0_3))+((gu0.Board_0_0_4+gu0.Board_0_0_5)+(gu0.Board_...34651
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6742734956847833033
[2023-03-19 02:49:50] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6742734956847833033
Running compilation step : cd /tmp/ltsmin6742734956847833033;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin6742734956847833033;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6742734956847833033;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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-AN12-LTLCardinality-01 finished in 318827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(X(X(((X(p0)&&F(p1))||X(G(p0)))))))))'
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 19 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 02:49:53] [INFO ] Invariant cache hit.
[2023-03-19 02:49:54] [INFO ] Implicit Places using invariants in 802 ms returned []
[2023-03-19 02:49:54] [INFO ] Invariant cache hit.
[2023-03-19 02:49:56] [INFO ] Implicit Places using invariants and state equation in 2011 ms returned []
Implicit Place search using SMT with State Equation took 2816 ms to find 0 implicit places.
[2023-03-19 02:49:56] [INFO ] Invariant cache hit.
[2023-03-19 02:49:57] [INFO ] Dead Transitions using invariants and state equation in 974 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3811 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 1208 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true, (NOT p1), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 8}, { cond=p0, acceptance={} source=2 dest: 9}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 6}, { cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={} source=6 dest: 10}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 11}], [{ cond=true, acceptance={} source=8 dest: 12}], [{ cond=(NOT p0), acceptance={} source=9 dest: 13}, { cond=p0, acceptance={} source=9 dest: 14}], [{ cond=true, acceptance={0} source=10 dest: 10}], [{ cond=(NOT p1), acceptance={0} source=11 dest: 11}], [{ cond=true, acceptance={} source=12 dest: 15}], [{ cond=true, acceptance={} source=13 dest: 16}], [{ cond=(NOT p0), acceptance={} source=14 dest: 17}, { cond=p0, acceptance={} source=14 dest: 18}], [{ cond=true, acceptance={} source=15 dest: 19}, { cond=(NOT p1), acceptance={} source=15 dest: 20}], [{ cond=true, acceptance={} source=16 dest: 21}, { cond=(NOT p1), acceptance={} source=16 dest: 22}], [{ cond=true, acceptance={} source=17 dest: 23}, { cond=(NOT p1), acceptance={} source=17 dest: 24}], [{ cond=(NOT p0), acceptance={} source=18 dest: 25}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=18 dest: 26}, { cond=p0, acceptance={} source=18 dest: 27}, { cond=(AND p0 (NOT p1)), acceptance={} source=18 dest: 28}], [{ cond=(NOT p0), acceptance={} source=19 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=19 dest: 7}], [{ cond=(NOT p1), acceptance={} source=20 dest: 7}], [{ cond=(NOT p0), acceptance={} source=21 dest: 19}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=21 dest: 20}], [{ cond=(NOT p1), acceptance={} source=22 dest: 20}], [{ cond=(NOT p0), acceptance={} source=23 dest: 21}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=23 dest: 22}], [{ cond=(NOT p1), acceptance={} source=24 dest: 22}], [{ cond=(NOT p0), acceptance={} source=25 dest: 23}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=25 dest: 24}], [{ cond=(NOT p1), acceptance={} source=26 dest: 24}], [{ cond=(NOT p0), acceptance={} source=27 dest: 25}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=27 dest: 26}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=28 dest: 26}, { cond=(AND p0 (NOT p1)), acceptance={} source=28 dest: 28}]], initial=0, aps=[p0:(LEQ 3 (ADD s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 34530 steps with 878 reset in 10001 ms.
Product exploration timeout after 34490 steps with 868 reset in 10003 ms.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
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) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 336 ms. Reduced automaton from 29 states, 47 edges and 2 AP (stutter sensitive) to 9 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Finished random walk after 73 steps, including 0 resets, run visited all 4 properties in 50 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p0 (NOT p1))), (F p0)]
Knowledge based reduction with 6 factoid took 431 ms. Reduced automaton from 9 states, 11 edges and 2 AP (stutter sensitive) to 9 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 276 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
[2023-03-19 02:52:40] [INFO ] Invariant cache hit.
[2023-03-19 02:52:53] [INFO ] [Real]Absence check using 432 positive place invariants in 305 ms returned sat
[2023-03-19 02:52:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 02:52:55] [INFO ] [Real]Absence check using state equation in 1743 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 14 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 02:52:55] [INFO ] Invariant cache hit.
[2023-03-19 02:52:56] [INFO ] Implicit Places using invariants in 790 ms returned []
[2023-03-19 02:52:56] [INFO ] Invariant cache hit.
[2023-03-19 02:52:58] [INFO ] Implicit Places using invariants and state equation in 2027 ms returned []
Implicit Place search using SMT with State Equation took 2849 ms to find 0 implicit places.
[2023-03-19 02:52:58] [INFO ] Invariant cache hit.
[2023-03-19 02:52:59] [INFO ] Dead Transitions using invariants and state equation in 1050 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3936 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 193 ms. Reduced automaton from 9 states, 11 edges and 2 AP (stutter sensitive) to 9 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 340 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Finished random walk after 73 steps, including 0 resets, run visited all 4 properties in 32 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F (AND (NOT p1) p0)), (F p0)]
Knowledge based reduction with 4 factoid took 294 ms. Reduced automaton from 9 states, 11 edges and 2 AP (stutter sensitive) to 9 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 285 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
[2023-03-19 02:53:19] [INFO ] Invariant cache hit.
[2023-03-19 02:53:31] [INFO ] [Real]Absence check using 432 positive place invariants in 200 ms returned sat
[2023-03-19 02:53:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 02:53:33] [INFO ] [Real]Absence check using state equation in 1850 ms returned sat
[2023-03-19 02:53:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 02:53:46] [INFO ] [Nat]Absence check using 432 positive place invariants in 282 ms returned sat
[2023-03-19 02:53:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 02:53:48] [INFO ] [Nat]Absence check using state equation in 1953 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 282 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Product exploration timeout after 30450 steps with 779 reset in 10002 ms.
Product exploration timeout after 30330 steps with 737 reset in 10001 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 434 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 47 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 02:54:09] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-19 02:54:09] [INFO ] Invariant cache hit.
[2023-03-19 02:54:10] [INFO ] Dead Transitions using invariants and state equation in 1172 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1294 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Built C files in :
/tmp/ltsmin10902284626138824618
[2023-03-19 02:54:12] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10902284626138824618
Running compilation step : cd /tmp/ltsmin10902284626138824618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin10902284626138824618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10902284626138824618;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 21 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 02:54:15] [INFO ] Invariant cache hit.
[2023-03-19 02:54:16] [INFO ] Implicit Places using invariants in 775 ms returned []
[2023-03-19 02:54:16] [INFO ] Invariant cache hit.
[2023-03-19 02:54:18] [INFO ] Implicit Places using invariants and state equation in 2202 ms returned []
Implicit Place search using SMT with State Equation took 2989 ms to find 0 implicit places.
[2023-03-19 02:54:18] [INFO ] Invariant cache hit.
[2023-03-19 02:54:19] [INFO ] Dead Transitions using invariants and state equation in 1071 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4088 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Built C files in :
/tmp/ltsmin16894028816233133532
[2023-03-19 02:54:19] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16894028816233133532
Running compilation step : cd /tmp/ltsmin16894028816233133532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin16894028816233133532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16894028816233133532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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)
[2023-03-19 02:54:23] [INFO ] Flatten gal took : 219 ms
[2023-03-19 02:54:23] [INFO ] Flatten gal took : 167 ms
[2023-03-19 02:54:23] [INFO ] Time to serialize gal into /tmp/LTL1864025598604880113.gal : 40 ms
[2023-03-19 02:54:23] [INFO ] Time to serialize properties into /tmp/LTL5334732238546320597.prop : 2 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1864025598604880113.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16422690275070168476.hoa' '-atoms' '/tmp/LTL5334732238546320597.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5334732238546320597.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16422690275070168476.hoa
Detected timeout of ITS tools.
[2023-03-19 02:54:38] [INFO ] Flatten gal took : 78 ms
[2023-03-19 02:54:38] [INFO ] Flatten gal took : 70 ms
[2023-03-19 02:54:38] [INFO ] Time to serialize gal into /tmp/LTL12805572109405696784.gal : 24 ms
[2023-03-19 02:54:38] [INFO ] Time to serialize properties into /tmp/LTL5339963469415499096.ltl : 15 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12805572109405696784.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5339963469415499096.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((("((((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((Board_0...101934
Formula 0 simplified : !"((((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((Board_0_...101915
Detected timeout of ITS tools.
[2023-03-19 02:54:54] [INFO ] Flatten gal took : 126 ms
[2023-03-19 02:54:54] [INFO ] Applying decomposition
[2023-03-19 02:54:54] [INFO ] Flatten gal took : 143 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8109539714163647245.txt' '-o' '/tmp/graph8109539714163647245.bin' '-w' '/tmp/graph8109539714163647245.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8109539714163647245.bin' '-l' '-1' '-v' '-w' '/tmp/graph8109539714163647245.weights' '-q' '0' '-e' '0.001'
[2023-03-19 02:55:06] [INFO ] Decomposing Gal with order
[2023-03-19 02:55:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 02:55:08] [INFO ] Removed a total of 1584 redundant transitions.
[2023-03-19 02:55:08] [INFO ] Flatten gal took : 1968 ms
[2023-03-19 02:55:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 1728 labels/synchronizations in 58 ms.
[2023-03-19 02:55:09] [INFO ] Time to serialize gal into /tmp/LTL15647436262652827214.gal : 9 ms
[2023-03-19 02:55:09] [INFO ] Time to serialize properties into /tmp/LTL811598287584775660.ltl : 4 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15647436262652827214.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL811598287584775660.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((("((((((((((((gu1.Board_0_0_0+gu1.Board_0_0_1)+(gu1.Board_0_0_2+gu1.Board_0_0_3))+((gu1.Board_0_0_4+gu1.Board_0_0_5)+(gu1.Board_0_0...130158
Formula 0 simplified : !"((((((((((((gu1.Board_0_0_0+gu1.Board_0_0_1)+(gu1.Board_0_0_2+gu1.Board_0_0_3))+((gu1.Board_0_0_4+gu1.Board_0_0_5)+(gu1.Board_0_0_...130139
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5777975846031434141
[2023-03-19 02:55:24] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5777975846031434141
Running compilation step : cd /tmp/ltsmin5777975846031434141;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin5777975846031434141;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5777975846031434141;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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-AN12-LTLCardinality-02 finished in 333771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1728 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 38 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 02:55:27] [INFO ] Invariant cache hit.
[2023-03-19 02:55:28] [INFO ] Implicit Places using invariants in 982 ms returned []
[2023-03-19 02:55:28] [INFO ] Invariant cache hit.
[2023-03-19 02:55:30] [INFO ] Implicit Places using invariants and state equation in 2344 ms returned []
Implicit Place search using SMT with State Equation took 3337 ms to find 0 implicit places.
[2023-03-19 02:55:30] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-19 02:55:30] [INFO ] Invariant cache hit.
[2023-03-19 02:55:31] [INFO ] Dead Transitions using invariants and state equation in 1023 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4475 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s144 s145 s146 s147 s148 s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171...], 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 52580 steps with 417 reset in 10003 ms.
Product exploration timeout after 52590 steps with 417 reset in 10003 ms.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2023-03-19 02:58:10] [INFO ] Invariant cache hit.
[2023-03-19 02:58:23] [INFO ] [Real]Absence check using 432 positive place invariants in 177 ms returned sat
[2023-03-19 02:58:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 02:58:24] [INFO ] [Real]Absence check using state equation in 1657 ms returned sat
[2023-03-19 02:58:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 02:58:38] [INFO ] [Nat]Absence check using 432 positive place invariants in 291 ms returned sat
[2023-03-19 02:58:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 02:58:39] [INFO ] [Nat]Absence check using state equation in 1881 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1728 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 47 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 02:58:39] [INFO ] Invariant cache hit.
[2023-03-19 02:58:41] [INFO ] Implicit Places using invariants in 1057 ms returned []
[2023-03-19 02:58:41] [INFO ] Invariant cache hit.
[2023-03-19 02:58:43] [INFO ] Implicit Places using invariants and state equation in 2341 ms returned []
Implicit Place search using SMT with State Equation took 3448 ms to find 0 implicit places.
[2023-03-19 02:58:43] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-19 02:58:43] [INFO ] Invariant cache hit.
[2023-03-19 02:58:44] [INFO ] Dead Transitions using invariants and state equation in 987 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4537 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Computed a total of 2160 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2160 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2023-03-19 03:01:03] [INFO ] Invariant cache hit.
[2023-03-19 03:01:17] [INFO ] [Real]Absence check using 432 positive place invariants in 206 ms returned sat
[2023-03-19 03:01:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 03:01:18] [INFO ] [Real]Absence check using state equation in 1753 ms returned sat
[2023-03-19 03:01:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 03:01:32] [INFO ] [Nat]Absence check using 432 positive place invariants in 295 ms returned sat
[2023-03-19 03:01:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 03:01:33] [INFO ] [Nat]Absence check using state equation in 1779 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration timeout after 53140 steps with 421 reset in 10002 ms.
Product exploration timeout after 52520 steps with 415 reset in 10001 ms.
Built C files in :
/tmp/ltsmin8450512594855796786
[2023-03-19 03:01:53] [INFO ] Too many transitions (1728) to apply POR reductions. Disabling POR matrices.
[2023-03-19 03:01:53] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8450512594855796786
Running compilation step : cd /tmp/ltsmin8450512594855796786;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin8450512594855796786;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8450512594855796786;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 1728 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 43 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 03:01:57] [INFO ] Invariant cache hit.
[2023-03-19 03:01:58] [INFO ] Implicit Places using invariants in 1080 ms returned []
[2023-03-19 03:01:58] [INFO ] Invariant cache hit.
[2023-03-19 03:02:00] [INFO ] Implicit Places using invariants and state equation in 2303 ms returned []
Implicit Place search using SMT with State Equation took 3415 ms to find 0 implicit places.
[2023-03-19 03:02:00] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-19 03:02:00] [INFO ] Invariant cache hit.
[2023-03-19 03:02:01] [INFO ] Dead Transitions using invariants and state equation in 981 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4486 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Built C files in :
/tmp/ltsmin17485024953768041608
[2023-03-19 03:02:01] [INFO ] Too many transitions (1728) to apply POR reductions. Disabling POR matrices.
[2023-03-19 03:02:01] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17485024953768041608
Running compilation step : cd /tmp/ltsmin17485024953768041608;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin17485024953768041608;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17485024953768041608;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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)
[2023-03-19 03:02:04] [INFO ] Flatten gal took : 64 ms
[2023-03-19 03:02:04] [INFO ] Flatten gal took : 67 ms
[2023-03-19 03:02:04] [INFO ] Time to serialize gal into /tmp/LTL7867436818953687160.gal : 37 ms
[2023-03-19 03:02:04] [INFO ] Time to serialize properties into /tmp/LTL2695725218478518689.prop : 3 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7867436818953687160.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15064385748862149664.hoa' '-atoms' '/tmp/LTL2695725218478518689.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2695725218478518689.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15064385748862149664.hoa
Detected timeout of ITS tools.
[2023-03-19 03:02:19] [INFO ] Flatten gal took : 60 ms
[2023-03-19 03:02:20] [INFO ] Flatten gal took : 60 ms
[2023-03-19 03:02:20] [INFO ] Time to serialize gal into /tmp/LTL15016455423989638624.gal : 8 ms
[2023-03-19 03:02:20] [INFO ] Time to serialize properties into /tmp/LTL5898946866392681403.ltl : 1 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15016455423989638624.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5898946866392681403.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((Boar...25092
Formula 0 simplified : GF!"((((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((Board_...25086
Detected timeout of ITS tools.
[2023-03-19 03:02:35] [INFO ] Flatten gal took : 60 ms
[2023-03-19 03:02:35] [INFO ] Applying decomposition
[2023-03-19 03:02:35] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15968406832624845703.txt' '-o' '/tmp/graph15968406832624845703.bin' '-w' '/tmp/graph15968406832624845703.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15968406832624845703.bin' '-l' '-1' '-v' '-w' '/tmp/graph15968406832624845703.weights' '-q' '0' '-e' '0.001'
[2023-03-19 03:02:38] [INFO ] Decomposing Gal with order
[2023-03-19 03:02:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 03:02:39] [INFO ] Removed a total of 3368 redundant transitions.
[2023-03-19 03:02:39] [INFO ] Flatten gal took : 760 ms
[2023-03-19 03:02:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 170 labels/synchronizations in 48 ms.
[2023-03-19 03:02:39] [INFO ] Time to serialize gal into /tmp/LTL6293955263172989240.gal : 12 ms
[2023-03-19 03:02:39] [INFO ] Time to serialize properties into /tmp/LTL3529886574374999071.ltl : 4 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6293955263172989240.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3529886574374999071.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((((((((gu0.Board_0_0_0+gu0.Board_0_0_1)+(gu0.Board_0_0_2+gu0.Board_0_0_3))+((gu0.Board_0_0_4+gu0.Board_0_0_5)+(gu0.Board_...32004
Formula 0 simplified : GF!"((((((((((((gu0.Board_0_0_0+gu0.Board_0_0_1)+(gu0.Board_0_0_2+gu0.Board_0_0_3))+((gu0.Board_0_0_4+gu0.Board_0_0_5)+(gu0.Board_0_...31998
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5704694787682185322
[2023-03-19 03:02:54] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5704694787682185322
Running compilation step : cd /tmp/ltsmin5704694787682185322;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin5704694787682185322;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5704694787682185322;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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-AN12-LTLCardinality-03 finished in 450087 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(!p0)))'
Support contains 1872 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Applied a total of 0 rules in 12 ms. Remains 2160 /2160 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2023-03-19 03:02:57] [INFO ] Invariant cache hit.
[2023-03-19 03:02:58] [INFO ] Implicit Places using invariants in 709 ms returned []
[2023-03-19 03:02:58] [INFO ] Invariant cache hit.
[2023-03-19 03:03:00] [INFO ] Implicit Places using invariants and state equation in 1918 ms returned []
Implicit Place search using SMT with State Equation took 2638 ms to find 0 implicit places.
[2023-03-19 03:03:00] [INFO ] Invariant cache hit.
[2023-03-19 03:03:01] [INFO ] Dead Transitions using invariants and state equation in 984 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3634 ms. Remains : 2160/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 875 ms :[true, (NOT p0), true]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-AN12-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLCardinality-06 finished in 4537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Reduce places removed 1727 places and 0 transitions.
Iterating post reduction 0 with 1727 rules applied. Total rules applied 1727 place count 433 transition count 1728
Applied a total of 1727 rules in 52 ms. Remains 433 /2160 variables (removed 1727) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 433 cols
[2023-03-19 03:03:02] [INFO ] Computed 35 place invariants in 63 ms
[2023-03-19 03:03:02] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-03-19 03:03:02] [INFO ] Invariant cache hit.
[2023-03-19 03:03:03] [INFO ] Implicit Places using invariants and state equation in 1434 ms returned []
Implicit Place search using SMT with State Equation took 1883 ms to find 0 implicit places.
[2023-03-19 03:03:03] [INFO ] Invariant cache hit.
[2023-03-19 03:03:04] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/2160 places, 1728/1728 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2479 ms. Remains : 433/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s144)], 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][false, false]]
Stuttering criterion allowed to conclude after 416 steps with 147 reset in 68 ms.
FORMULA Sudoku-PT-AN12-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLCardinality-09 finished in 2630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 4 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 433 are kept as prefixes of interest. Removing 1727 places using SCC suffix rule.5 ms
Discarding 1727 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 41 ms. Remains 433 /2160 variables (removed 1727) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 433 cols
[2023-03-19 03:03:04] [INFO ] Computed 35 place invariants in 65 ms
[2023-03-19 03:03:05] [INFO ] Implicit Places using invariants in 481 ms returned []
[2023-03-19 03:03:05] [INFO ] Invariant cache hit.
[2023-03-19 03:03:06] [INFO ] Implicit Places using invariants and state equation in 1777 ms returned []
Implicit Place search using SMT with State Equation took 2265 ms to find 0 implicit places.
[2023-03-19 03:03:06] [INFO ] Redundant transitions in 30 ms returned []
[2023-03-19 03:03:06] [INFO ] Invariant cache hit.
[2023-03-19 03:03:07] [INFO ] Dead Transitions using invariants and state equation in 725 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 433/2160 places, 1728/1728 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3070 ms. Remains : 433/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LEQ 1 s23) (LEQ s332 s144)), p0:(LEQ 1 s178)], 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 125 steps with 0 reset in 19 ms.
FORMULA Sudoku-PT-AN12-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLCardinality-14 finished in 3178 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 2160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Graph (complete) has 5184 edges and 2160 vertex of which 427 are kept as prefixes of interest. Removing 1733 places using SCC suffix rule.3 ms
Discarding 1733 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 85 ms. Remains 427 /2160 variables (removed 1733) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 427 cols
[2023-03-19 03:03:08] [INFO ] Computed 31 place invariants in 118 ms
[2023-03-19 03:03:08] [INFO ] Implicit Places using invariants in 517 ms returned []
[2023-03-19 03:03:08] [INFO ] Invariant cache hit.
[2023-03-19 03:03:09] [INFO ] Implicit Places using invariants and state equation in 1518 ms returned []
Implicit Place search using SMT with State Equation took 2037 ms to find 0 implicit places.
[2023-03-19 03:03:10] [INFO ] Redundant transitions in 97 ms returned []
[2023-03-19 03:03:10] [INFO ] Invariant cache hit.
[2023-03-19 03:03:10] [INFO ] Dead Transitions using invariants and state equation in 499 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 427/2160 places, 1728/1728 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2725 ms. Remains : 427/2160 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN12-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s310 s144)], 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 131 steps with 0 reset in 19 ms.
FORMULA Sudoku-PT-AN12-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLCardinality-15 finished in 2794 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||X(X(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(X(X(((X(p0)&&F(p1))||X(G(p0)))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-19 03:03:10] [INFO ] Flatten gal took : 68 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15396878838835854841
[2023-03-19 03:03:10] [INFO ] Too many transitions (1728) to apply POR reductions. Disabling POR matrices.
[2023-03-19 03:03:11] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15396878838835854841
Running compilation step : cd /tmp/ltsmin15396878838835854841;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-19 03:03:11] [INFO ] Applying decomposition
[2023-03-19 03:03:11] [INFO ] Flatten gal took : 70 ms
Compilation finished in 4747 ms.
Running link step : cd /tmp/ltsmin15396878838835854841;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin15396878838835854841;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([]((LTLAPp0==true))||X(X((LTLAPp1==true))))))' '--buchi-type=spotba'
[2023-03-19 03:03:29] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.util.concurrent.TimeoutException: Subprocess running '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8329276815654477767.txt' '-o' '/tmp/graph8329276815654477767.bin' '-w' '/tmp/graph8329276815654477767.weights' killed by timeout after 10 SECONDS
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:76)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:226)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:277)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:106)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:815)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-19 03:03:29] [INFO ] Flatten gal took : 189 ms
[2023-03-19 03:03:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality11116989129142163814.gal : 239 ms
[2023-03-19 03:03:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality17055950229718869480.ltl : 369 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11116989129142163814.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17055950229718869480.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 3 LTL properties
Checking formula 0 : !((X(X((G("((((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((B...27175
Formula 0 simplified : XX(F!"((((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((Boar...27163
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.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 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( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.026: LTL layer: formula: X(X(([]((LTLAPp0==true))||X(X((LTLAPp1==true))))))
pins2lts-mc-linux64( 5/ 8), 0.026: "X(X(([]((LTLAPp0==true))||X(X((LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.027: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.033: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.054: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.059: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.062: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.086: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 1.477: DFS-FIFO for weak LTL, using special progress label 1733
pins2lts-mc-linux64( 0/ 8), 1.477: There are 1734 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.477: State length is 2161, there are 1741 groups
pins2lts-mc-linux64( 0/ 8), 1.477: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.477: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.477: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 1.477: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 11.152: ~1 levels ~960 states ~1595120 transitions
pins2lts-mc-linux64( 2/ 8), 18.501: ~1 levels ~1920 states ~3221376 transitions
pins2lts-mc-linux64( 2/ 8), 33.994: ~1 levels ~3840 states ~6409408 transitions
pins2lts-mc-linux64( 6/ 8), 60.711: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 102.278:
pins2lts-mc-linux64( 0/ 8), 102.278: mean standard work distribution: 1.1% (states) 0.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 102.278:
pins2lts-mc-linux64( 0/ 8), 102.278: Explored 6813 states 11365715 transitions, fanout: 1668.239
pins2lts-mc-linux64( 0/ 8), 102.278: Total exploration time 100.780 sec (76.670 sec minimum, 87.472 sec on average)
pins2lts-mc-linux64( 0/ 8), 102.278: States per second: 68, Transitions per second: 112777
pins2lts-mc-linux64( 0/ 8), 102.278:
pins2lts-mc-linux64( 0/ 8), 102.278: Progress states detected: 8013095
pins2lts-mc-linux64( 0/ 8), 102.278: Redundant explorations: -99.9150
pins2lts-mc-linux64( 0/ 8), 102.278:
pins2lts-mc-linux64( 0/ 8), 102.278: Queue width: 8B, total height: 9468756, memory: 72.24MB
pins2lts-mc-linux64( 0/ 8), 102.278: Tree memory: 317.2MB, 41.5 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 102.278: Tree fill ratio (roots/leafs): 5.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 102.279: Stored 1755 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 102.279: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 102.279: Est. total memory use: 389.4MB (~1096.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15396878838835854841;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([]((LTLAPp0==true))||X(X((LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15396878838835854841;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([]((LTLAPp0==true))||X(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)
ITS-tools command line returned an error code 137
[2023-03-19 03:15:55] [INFO ] Flatten gal took : 853 ms
[2023-03-19 03:15:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality6477587368363955724.gal : 60 ms
[2023-03-19 03:15:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality11019169934486581180.ltl : 47 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6477587368363955724.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11019169934486581180.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 3 LTL properties
Checking formula 0 : !((X(X((G("((((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((B...27175
Formula 0 simplified : XX(F!"((((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((Boar...27163
ITS-tools command line returned an error code 137
[2023-03-19 03:26:15] [INFO ] Flatten gal took : 462 ms
[2023-03-19 03:26:17] [INFO ] Input system was already deterministic with 1728 transitions.
[2023-03-19 03:26:17] [INFO ] Transformed 2160 places.
[2023-03-19 03:26:17] [INFO ] Transformed 1728 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
Using order generated by GreatSPN with heuristic : META
[2023-03-19 03:26:18] [INFO ] Time to serialize gal into /tmp/LTLCardinality17018296439561887280.gal : 23 ms
[2023-03-19 03:26:18] [INFO ] Time to serialize properties into /tmp/LTLCardinality16796300732728342133.ltl : 16 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17018296439561887280.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16796300732728342133.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X((G("((((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((B...27175
Formula 0 simplified : XX(F!"((((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((Boar...27163
ITS-tools command line returned an error code 137
Total runtime 3150376 ms.

BK_STOP 1679197002947

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-AN12"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Sudoku-PT-AN12, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r485-tall-167912699100251"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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