fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r485-tall-167912698900107
Last Updated
May 14, 2023

About the Execution of ITS-Tools for Sudoku-COL-AN14

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16214.991 3600000.00 7480925.00 74226.10 FFF?FTFF?TFT?TFF 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-167912698900107.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Sudoku-COL-AN14, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912698900107
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 7.9K Feb 26 09:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 09:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 26 08:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 26 08:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 26 10:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 09:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 09:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.5K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679165143929

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-COL-AN14
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202303021504
[2023-03-18 18:45:45] [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-18 18:45:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 18:45:45] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-18 18:45:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 18:45:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 583 ms
[2023-03-18 18:45:46] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 3332 PT places and 2744.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 18:45:46] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 6 ms.
[2023-03-18 18:45:46] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-COL-AN14-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN14-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10097 steps, including 50 resets, run finished after 31 ms. (steps per millisecond=325 ) properties (out of 21) seen :13
Incomplete Best-First random walk after 10097 steps, including 50 resets, run finished after 12 ms. (steps per millisecond=841 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10097 steps, including 50 resets, run finished after 14 ms. (steps per millisecond=721 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10097 steps, including 50 resets, run finished after 12 ms. (steps per millisecond=841 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10097 steps, including 50 resets, run finished after 8 ms. (steps per millisecond=1262 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10097 steps, including 50 resets, run finished after 8 ms. (steps per millisecond=1262 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10097 steps, including 50 resets, run finished after 7 ms. (steps per millisecond=1442 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10097 steps, including 50 resets, run finished after 7 ms. (steps per millisecond=1442 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10097 steps, including 50 resets, run finished after 6 ms. (steps per millisecond=1682 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1 rows 4 cols
[2023-03-18 18:45:46] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-18 18:45:46] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 18:45:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 18:45:46] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 8 atomic propositions for a total of 14 simplifications.
FORMULA Sudoku-COL-AN14-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN14-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN14-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN14-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 18:45:46] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2023-03-18 18:45:46] [INFO ] Flatten gal took : 12 ms
FORMULA Sudoku-COL-AN14-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN14-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 18:45:46] [INFO ] Flatten gal took : 5 ms
Domain [N(14), N(14)] of place Rows breaks symmetries in sort N
[2023-03-18 18:45:46] [INFO ] Unfolded HLPN to a Petri net with 3332 places and 2744 transitions 10976 arcs in 46 ms.
[2023-03-18 18:45:46] [INFO ] Unfolded 8 HLPN properties in 3 ms.
Support contains 3332 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 40 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 3332 cols
[2023-03-18 18:45:46] [INFO ] Computed 588 place invariants in 43 ms
[2023-03-18 18:45:47] [INFO ] Implicit Places using invariants in 601 ms returned []
[2023-03-18 18:45:47] [INFO ] Invariant cache hit.
[2023-03-18 18:45:49] [INFO ] Implicit Places using invariants and state equation in 1828 ms returned []
Implicit Place search using SMT with State Equation took 2432 ms to find 0 implicit places.
[2023-03-18 18:45:49] [INFO ] Invariant cache hit.
[2023-03-18 18:45:50] [INFO ] Dead Transitions using invariants and state equation in 1711 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4187 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Support contains 3332 out of 3332 places after structural reductions.
[2023-03-18 18:45:51] [INFO ] Flatten gal took : 273 ms
[2023-03-18 18:45:51] [INFO ] Flatten gal took : 161 ms
[2023-03-18 18:45:52] [INFO ] Input system was already deterministic with 2744 transitions.
Incomplete random walk after 10000 steps, including 58 resets, run finished after 2641 ms. (steps per millisecond=3 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-18 18:45:56] [INFO ] Invariant cache hit.
[2023-03-18 18:45:57] [INFO ] After 756ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 18:45:58] [INFO ] [Nat]Absence check using 588 positive place invariants in 155 ms returned sat
[2023-03-18 18:46:22] [INFO ] After 12756ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2023-03-18 18:46:22] [INFO ] After 12766ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-18 18:46:22] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 588 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Graph (complete) has 8232 edges and 3332 vertex of which 588 are kept as prefixes of interest. Removing 2744 places using SCC suffix rule.7 ms
Discarding 2744 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 60 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 588/3332 places, 2744/2744 transitions.
Incomplete random walk after 10000 steps, including 58 resets, run finished after 2263 ms. (steps per millisecond=4 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 6) seen :0
Probabilistic random walk after 149330 steps, saw 149259 distinct states, run finished after 9028 ms. (steps per millisecond=16 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2744 rows 588 cols
[2023-03-18 18:46:34] [INFO ] Computed 41 place invariants in 248 ms
[2023-03-18 18:46:35] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 31 ms returned sat
[2023-03-18 18:46:41] [INFO ] After 6207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 18:46:41] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 32 ms returned sat
[2023-03-18 18:46:46] [INFO ] After 4477ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-18 18:46:46] [INFO ] After 5024ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 310 ms.
[2023-03-18 18:46:46] [INFO ] After 5586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 1 different solutions.
Finished Parikh walk after 196 steps, including 0 resets, run visited all 6 properties in 18 ms. (steps per millisecond=10 )
Parikh walk visited 6 properties in 19 ms.
FORMULA Sudoku-COL-AN14-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 7 simplifications.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/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 588 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Reduce places removed 2744 places and 0 transitions.
Iterating post reduction 0 with 2744 rules applied. Total rules applied 2744 place count 588 transition count 2744
Applied a total of 2744 rules in 21 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 18:46:47] [INFO ] Invariant cache hit.
[2023-03-18 18:46:47] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-18 18:46:47] [INFO ] Invariant cache hit.
[2023-03-18 18:46:47] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
[2023-03-18 18:46:47] [INFO ] Invariant cache hit.
[2023-03-18 18:46:48] [INFO ] Dead Transitions using invariants and state equation in 837 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1571 ms. Remains : 588/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN14-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (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 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 173 steps with 0 reset in 48 ms.
FORMULA Sudoku-COL-AN14-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN14-LTLCardinality-01 finished in 1834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 125 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 3332 cols
[2023-03-18 18:46:49] [INFO ] Computed 588 place invariants in 15 ms
[2023-03-18 18:46:50] [INFO ] Implicit Places using invariants in 1336 ms returned []
[2023-03-18 18:46:50] [INFO ] Invariant cache hit.
[2023-03-18 18:46:54] [INFO ] Implicit Places using invariants and state equation in 3684 ms returned []
Implicit Place search using SMT with State Equation took 5031 ms to find 0 implicit places.
[2023-03-18 18:46:54] [INFO ] Redundant transitions in 146 ms returned []
[2023-03-18 18:46:54] [INFO ] Invariant cache hit.
[2023-03-18 18:46:55] [INFO ] Dead Transitions using invariants and state equation in 1456 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6765 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN14-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 3 (ADD s2940 s2941 s2942 s2943 s2944 s2945 s2946 s2947 s2948 s2949 s2950 s2951 s2952 s2953 s2954 s2955 s2956 s2957 s2958 s2959 s2960 s2961 s2962 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 56460 steps with 327 reset in 10002 ms.
Product exploration timeout after 55620 steps with 322 reset in 10003 ms.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 401 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 58 resets, run finished after 1787 ms. (steps per millisecond=5 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 649 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 18:47:19] [INFO ] Invariant cache hit.
[2023-03-18 18:47:20] [INFO ] After 328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:47:20] [INFO ] [Nat]Absence check using 588 positive place invariants in 166 ms returned sat
[2023-03-18 18:47:45] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 77 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 1763 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 646 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 367994 steps, run timeout after 6001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 367994 steps, saw 286666 distinct states, run finished after 6003 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 18:47:53] [INFO ] Invariant cache hit.
[2023-03-18 18:47:54] [INFO ] After 329ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:47:55] [INFO ] [Nat]Absence check using 588 positive place invariants in 160 ms returned sat
[2023-03-18 18:48:19] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 139 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 45 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 18:48:19] [INFO ] Invariant cache hit.
[2023-03-18 18:48:21] [INFO ] Implicit Places using invariants in 1351 ms returned []
[2023-03-18 18:48:21] [INFO ] Invariant cache hit.
[2023-03-18 18:48:24] [INFO ] Implicit Places using invariants and state equation in 3695 ms returned []
Implicit Place search using SMT with State Equation took 5053 ms to find 0 implicit places.
[2023-03-18 18:48:24] [INFO ] Redundant transitions in 144 ms returned []
[2023-03-18 18:48:24] [INFO ] Invariant cache hit.
[2023-03-18 18:48:26] [INFO ] Dead Transitions using invariants and state equation in 1873 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7128 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 35 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 18:48:26] [INFO ] Invariant cache hit.
[2023-03-18 18:48:27] [INFO ] After 329ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:48:28] [INFO ] [Nat]Absence check using 588 positive place invariants in 162 ms returned sat
[2023-03-18 18:52:12] [INFO ] After 225020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0)))]
Knowledge based reduction with 5 factoid took 278 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 36 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 18:52:13] [INFO ] Invariant cache hit.
[2023-03-18 18:52:14] [INFO ] Implicit Places using invariants in 1284 ms returned []
[2023-03-18 18:52:14] [INFO ] Invariant cache hit.
[2023-03-18 18:52:17] [INFO ] Implicit Places using invariants and state equation in 3430 ms returned []
Implicit Place search using SMT with State Equation took 4716 ms to find 0 implicit places.
[2023-03-18 18:52:17] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-18 18:52:17] [INFO ] Invariant cache hit.
[2023-03-18 18:52:19] [INFO ] Dead Transitions using invariants and state equation in 1816 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6639 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 1749 ms. (steps per millisecond=5 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 650 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 18:52:23] [INFO ] Invariant cache hit.
[2023-03-18 18:52:23] [INFO ] After 322ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:52:24] [INFO ] [Nat]Absence check using 588 positive place invariants in 150 ms returned sat
[2023-03-18 18:52:48] [INFO ] After 25011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 32 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Incomplete random walk after 10000 steps, including 58 resets, run finished after 1752 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 638 ms. (steps per millisecond=15 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 376541 steps, run timeout after 6001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 376541 steps, saw 288300 distinct states, run finished after 6002 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 18:52:57] [INFO ] Invariant cache hit.
[2023-03-18 18:52:57] [INFO ] After 363ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:52:58] [INFO ] [Nat]Absence check using 588 positive place invariants in 165 ms returned sat
[2023-03-18 18:53:22] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 32 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 25 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 18:53:23] [INFO ] Invariant cache hit.
[2023-03-18 18:53:24] [INFO ] Implicit Places using invariants in 1300 ms returned []
[2023-03-18 18:53:24] [INFO ] Invariant cache hit.
[2023-03-18 18:53:27] [INFO ] Implicit Places using invariants and state equation in 3439 ms returned []
Implicit Place search using SMT with State Equation took 4741 ms to find 0 implicit places.
[2023-03-18 18:53:27] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-18 18:53:27] [INFO ] Invariant cache hit.
[2023-03-18 18:53:29] [INFO ] Dead Transitions using invariants and state equation in 1778 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6610 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 29 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-18 18:53:29] [INFO ] Invariant cache hit.
[2023-03-18 18:53:30] [INFO ] After 333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 18:53:30] [INFO ] [Nat]Absence check using 588 positive place invariants in 158 ms returned sat
[2023-03-18 18:57:15] [INFO ] After 225025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0)))]
Knowledge based reduction with 5 factoid took 209 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration timeout after 58120 steps with 337 reset in 10003 ms.
Product exploration timeout after 56830 steps with 329 reset in 10003 ms.
Built C files in :
/tmp/ltsmin5256697125802589896
[2023-03-18 18:57:35] [INFO ] Too many transitions (2744) to apply POR reductions. Disabling POR matrices.
[2023-03-18 18:57:35] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5256697125802589896
Running compilation step : cd /tmp/ltsmin5256697125802589896;'/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/ltsmin5256697125802589896;'/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/ltsmin5256697125802589896;'/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 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 26 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 18:57:38] [INFO ] Invariant cache hit.
[2023-03-18 18:57:40] [INFO ] Implicit Places using invariants in 1265 ms returned []
[2023-03-18 18:57:40] [INFO ] Invariant cache hit.
[2023-03-18 18:57:43] [INFO ] Implicit Places using invariants and state equation in 3354 ms returned []
Implicit Place search using SMT with State Equation took 4621 ms to find 0 implicit places.
[2023-03-18 18:57:43] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-18 18:57:43] [INFO ] Invariant cache hit.
[2023-03-18 18:57:45] [INFO ] Dead Transitions using invariants and state equation in 1702 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6409 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Built C files in :
/tmp/ltsmin6973812063605067107
[2023-03-18 18:57:45] [INFO ] Too many transitions (2744) to apply POR reductions. Disabling POR matrices.
[2023-03-18 18:57:45] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6973812063605067107
Running compilation step : cd /tmp/ltsmin6973812063605067107;'/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/ltsmin6973812063605067107;'/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/ltsmin6973812063605067107;'/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-18 18:57:48] [INFO ] Flatten gal took : 122 ms
[2023-03-18 18:57:48] [INFO ] Flatten gal took : 111 ms
[2023-03-18 18:57:48] [INFO ] Time to serialize gal into /tmp/LTL14415791643576831351.gal : 36 ms
[2023-03-18 18:57:48] [INFO ] Time to serialize properties into /tmp/LTL11967675318509687475.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/LTL14415791643576831351.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18006227191454160241.hoa' '-atoms' '/tmp/LTL11967675318509687475.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...320
Loading property file /tmp/LTL11967675318509687475.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18006227191454160241.hoa
Detected timeout of ITS tools.
[2023-03-18 18:58:04] [INFO ] Flatten gal took : 105 ms
[2023-03-18 18:58:04] [INFO ] Flatten gal took : 111 ms
[2023-03-18 18:58:04] [INFO ] Time to serialize gal into /tmp/LTL12945124535317740469.gal : 19 ms
[2023-03-18 18:58:04] [INFO ] Time to serialize properties into /tmp/LTL3109586796650887472.ltl : 6 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/LTL12945124535317740469.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3109586796650887472.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 : !((G(F(("(((((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_1...39091
Formula 0 simplified : G(F!"(((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((...39084
Detected timeout of ITS tools.
[2023-03-18 18:58:19] [INFO ] Flatten gal took : 100 ms
[2023-03-18 18:58:19] [INFO ] Applying decomposition
[2023-03-18 18:58:19] [INFO ] Flatten gal took : 102 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/graph12674713471775130989.txt' '-o' '/tmp/graph12674713471775130989.bin' '-w' '/tmp/graph12674713471775130989.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12674713471775130989.bin' '-l' '-1' '-v' '-w' '/tmp/graph12674713471775130989.weights' '-q' '0' '-e' '0.001'
[2023-03-18 18:58:43] [INFO ] Decomposing Gal with order
[2023-03-18 18:58:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 18:58:47] [INFO ] Removed a total of 2548 redundant transitions.
[2023-03-18 18:58:48] [INFO ] Flatten gal took : 4545 ms
[2023-03-18 18:58:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 2744 labels/synchronizations in 257 ms.
[2023-03-18 18:58:48] [INFO ] Time to serialize gal into /tmp/LTL7925048421173497913.gal : 17 ms
[2023-03-18 18:58:48] [INFO ] Time to serialize properties into /tmp/LTL12462450561397740743.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/LTL7925048421173497913.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12462450561397740743.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 : !((G(F(("(((((((((((((gu0.Board_0+gu0.Board_1)+(gu0.Board_2+gu0.Board_3))+((gu0.Board_4+gu0.Board_5)+(gu0.Board_6+gu0.Board_7)))+(((gu...51635
Formula 0 simplified : G(F!"(((((((((gu1.Cells_0+gu1.Cells_1)+(gu1.Cells_2+gu1.Cells_3))+((gu1.Cells_4+gu1.Cells_5)+(gu1.Cells_6+gu1.Cells_7)))+(((gu1.Cell...51628
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10758355472258162922
[2023-03-18 18:59:03] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10758355472258162922
Running compilation step : cd /tmp/ltsmin10758355472258162922;'/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/ltsmin10758355472258162922;'/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/ltsmin10758355472258162922;'/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-COL-AN14-LTLCardinality-03 finished in 737979 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 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 33 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 18:59:06] [INFO ] Invariant cache hit.
[2023-03-18 18:59:08] [INFO ] Implicit Places using invariants in 1354 ms returned []
[2023-03-18 18:59:08] [INFO ] Invariant cache hit.
[2023-03-18 18:59:11] [INFO ] Implicit Places using invariants and state equation in 3469 ms returned []
Implicit Place search using SMT with State Equation took 4826 ms to find 0 implicit places.
[2023-03-18 18:59:11] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-18 18:59:11] [INFO ] Invariant cache hit.
[2023-03-18 18:59:13] [INFO ] Dead Transitions using invariants and state equation in 1828 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6756 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN14-LTLCardinality-07 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 (ADD s196 s197 s198 s199 s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 168 steps with 0 reset in 51 ms.
FORMULA Sudoku-COL-AN14-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN14-LTLCardinality-07 finished in 6875 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((G((!p1&&(G(p2)||(p2&&(!p2||F(!p0)))))) U (p0&&G((!p1&&(G(p2)||(p2&&(!p2||F(!p0))))))))))))'
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 10 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 18:59:13] [INFO ] Invariant cache hit.
[2023-03-18 18:59:14] [INFO ] Implicit Places using invariants in 903 ms returned []
[2023-03-18 18:59:14] [INFO ] Invariant cache hit.
[2023-03-18 18:59:17] [INFO ] Implicit Places using invariants and state equation in 2662 ms returned []
Implicit Place search using SMT with State Equation took 3572 ms to find 0 implicit places.
[2023-03-18 18:59:17] [INFO ] Invariant cache hit.
[2023-03-18 18:59:19] [INFO ] Dead Transitions using invariants and state equation in 1839 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5423 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 6209 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Running random walk in product with property : Sudoku-COL-AN14-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(OR p1 (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 (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 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 56720 steps with 329 reset in 10004 ms.
Product exploration timeout after 56210 steps with 326 reset in 10004 ms.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (OR p1 (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 356 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 1951 ms. (steps per millisecond=5 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 631 ms. (steps per millisecond=15 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 18:59:49] [INFO ] Invariant cache hit.
[2023-03-18 18:59:50] [INFO ] [Real]Absence check using 588 positive place invariants in 176 ms returned sat
[2023-03-18 19:00:15] [INFO ] After 25016ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:00:15] [INFO ] [Nat]Absence check using 588 positive place invariants in 171 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
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-18 19:00:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 19:00:40] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 27 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Incomplete random walk after 10000 steps, including 58 resets, run finished after 1956 ms. (steps per millisecond=5 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 600 ms. (steps per millisecond=16 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 267751 steps, run timeout after 6002 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 267751 steps, saw 267552 distinct states, run finished after 6002 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 19:00:48] [INFO ] Invariant cache hit.
[2023-03-18 19:00:49] [INFO ] [Real]Absence check using 588 positive place invariants in 166 ms returned sat
[2023-03-18 19:01:14] [INFO ] After 25025ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:01:14] [INFO ] [Nat]Absence check using 588 positive place invariants in 159 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
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-18 19:01:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 19:01:39] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 18 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 17 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:01:39] [INFO ] Invariant cache hit.
[2023-03-18 19:01:39] [INFO ] Implicit Places using invariants in 834 ms returned []
[2023-03-18 19:01:39] [INFO ] Invariant cache hit.
[2023-03-18 19:01:42] [INFO ] Implicit Places using invariants and state equation in 2614 ms returned []
Implicit Place search using SMT with State Equation took 3456 ms to find 0 implicit places.
[2023-03-18 19:01:42] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-18 19:01:42] [INFO ] Invariant cache hit.
[2023-03-18 19:01:44] [INFO ] Dead Transitions using invariants and state equation in 1751 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5288 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (OR p1 (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND p2 (NOT p1))), (F (AND p0 p2 (NOT p1))), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 7 factoid took 381 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 10 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:01:45] [INFO ] Invariant cache hit.
[2023-03-18 19:01:45] [INFO ] Implicit Places using invariants in 823 ms returned []
[2023-03-18 19:01:45] [INFO ] Invariant cache hit.
[2023-03-18 19:01:48] [INFO ] Implicit Places using invariants and state equation in 2632 ms returned []
Implicit Place search using SMT with State Equation took 3457 ms to find 0 implicit places.
[2023-03-18 19:01:48] [INFO ] Invariant cache hit.
[2023-03-18 19:01:50] [INFO ] Dead Transitions using invariants and state equation in 1654 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5124 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (OR (NOT p2) p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 318 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 58 resets, run finished after 1910 ms. (steps per millisecond=5 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 609 ms. (steps per millisecond=16 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 19:01:54] [INFO ] Invariant cache hit.
[2023-03-18 19:01:55] [INFO ] [Real]Absence check using 588 positive place invariants in 158 ms returned sat
[2023-03-18 19:02:19] [INFO ] After 25027ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:02:20] [INFO ] [Nat]Absence check using 588 positive place invariants in 159 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
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-18 19:02:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 19:02:44] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 18 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Incomplete random walk after 10000 steps, including 58 resets, run finished after 1932 ms. (steps per millisecond=5 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 612 ms. (steps per millisecond=16 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 271511 steps, run timeout after 6001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 271511 steps, saw 269991 distinct states, run finished after 6001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 19:02:53] [INFO ] Invariant cache hit.
[2023-03-18 19:02:54] [INFO ] [Real]Absence check using 588 positive place invariants in 161 ms returned sat
[2023-03-18 19:03:18] [INFO ] After 25015ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:03:19] [INFO ] [Nat]Absence check using 588 positive place invariants in 159 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
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-18 19:03:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 19:03:43] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 24 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 26 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:03:43] [INFO ] Invariant cache hit.
[2023-03-18 19:03:44] [INFO ] Implicit Places using invariants in 839 ms returned []
[2023-03-18 19:03:44] [INFO ] Invariant cache hit.
[2023-03-18 19:03:47] [INFO ] Implicit Places using invariants and state equation in 2670 ms returned []
Implicit Place search using SMT with State Equation took 3511 ms to find 0 implicit places.
[2023-03-18 19:03:47] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-18 19:03:47] [INFO ] Invariant cache hit.
[2023-03-18 19:03:49] [INFO ] Dead Transitions using invariants and state equation in 1751 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5350 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (OR (NOT p2) p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F (AND p0 (NOT p1) p2)), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 7 factoid took 351 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Product exploration timeout after 56900 steps with 330 reset in 10003 ms.
Product exploration timeout after 56400 steps with 327 reset in 10004 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 77 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:04:10] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-18 19:04:10] [INFO ] Invariant cache hit.
[2023-03-18 19:04:12] [INFO ] Dead Transitions using invariants and state equation in 1741 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1882 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Built C files in :
/tmp/ltsmin6674314426859169260
[2023-03-18 19:04:12] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6674314426859169260
Running compilation step : cd /tmp/ltsmin6674314426859169260;'/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/ltsmin6674314426859169260;'/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/ltsmin6674314426859169260;'/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 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 11 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:04:15] [INFO ] Invariant cache hit.
[2023-03-18 19:04:15] [INFO ] Implicit Places using invariants in 791 ms returned []
[2023-03-18 19:04:15] [INFO ] Invariant cache hit.
[2023-03-18 19:04:18] [INFO ] Implicit Places using invariants and state equation in 2631 ms returned []
Implicit Place search using SMT with State Equation took 3432 ms to find 0 implicit places.
[2023-03-18 19:04:18] [INFO ] Invariant cache hit.
[2023-03-18 19:04:20] [INFO ] Dead Transitions using invariants and state equation in 1747 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5192 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Built C files in :
/tmp/ltsmin10646072196387389236
[2023-03-18 19:04:20] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10646072196387389236
Running compilation step : cd /tmp/ltsmin10646072196387389236;'/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/ltsmin10646072196387389236;'/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/ltsmin10646072196387389236;'/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-18 19:04:23] [INFO ] Flatten gal took : 134 ms
[2023-03-18 19:04:23] [INFO ] Flatten gal took : 99 ms
[2023-03-18 19:04:23] [INFO ] Time to serialize gal into /tmp/LTL12680365081397027629.gal : 13 ms
[2023-03-18 19:04:23] [INFO ] Time to serialize properties into /tmp/LTL3611039284081838484.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/LTL12680365081397027629.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6946445736271226601.hoa' '-atoms' '/tmp/LTL3611039284081838484.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/LTL3611039284081838484.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6946445736271226601.hoa
Detected timeout of ITS tools.
[2023-03-18 19:04:39] [INFO ] Flatten gal took : 103 ms
[2023-03-18 19:04:39] [INFO ] Flatten gal took : 103 ms
[2023-03-18 19:04:39] [INFO ] Time to serialize gal into /tmp/LTL11161722407766398184.gal : 13 ms
[2023-03-18 19:04:39] [INFO ] Time to serialize properties into /tmp/LTL10978776918082247820.ltl : 6 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/LTL11161722407766398184.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10978776918082247820.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...277
Read 1 LTL properties
Checking formula 0 : !((G(("(((((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows...97353
Formula 0 simplified : F(!"(((((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows_...50734
Detected timeout of ITS tools.
[2023-03-18 19:04:54] [INFO ] Flatten gal took : 102 ms
[2023-03-18 19:04:54] [INFO ] Applying decomposition
[2023-03-18 19:04:54] [INFO ] Flatten gal took : 101 ms
[2023-03-18 19:05:10] [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/graph11815894711622312053.txt' '-o' '/tmp/graph11815894711622312053.bin' '-w' '/tmp/graph11815894711622312053.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.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:663)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:341)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
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-18 19:05:10] [INFO ] Flatten gal took : 107 ms
[2023-03-18 19:05:10] [INFO ] Time to serialize gal into /tmp/LTL11926115244619993013.gal : 13 ms
[2023-03-18 19:05:10] [INFO ] Time to serialize properties into /tmp/LTL14667479676791807308.ltl : 6 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/LTL11926115244619993013.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14667479676791807308.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...277
Read 1 LTL properties
Checking formula 0 : !((G(("(((((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows...97353
Formula 0 simplified : F(!"(((((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows_...50734
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7903326383490189235
[2023-03-18 19:05:26] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7903326383490189235
Running compilation step : cd /tmp/ltsmin7903326383490189235;'/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/ltsmin7903326383490189235;'/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/ltsmin7903326383490189235;'/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-COL-AN14-LTLCardinality-08 finished in 375299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 196 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Graph (complete) has 8232 edges and 3332 vertex of which 588 are kept as prefixes of interest. Removing 2744 places using SCC suffix rule.7 ms
Discarding 2744 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 95 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 588 cols
[2023-03-18 19:05:29] [INFO ] Computed 41 place invariants in 145 ms
[2023-03-18 19:05:29] [INFO ] Implicit Places using invariants in 564 ms returned []
[2023-03-18 19:05:29] [INFO ] Invariant cache hit.
[2023-03-18 19:05:32] [INFO ] Implicit Places using invariants and state equation in 2395 ms returned []
Implicit Place search using SMT with State Equation took 2963 ms to find 0 implicit places.
[2023-03-18 19:05:32] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-18 19:05:32] [INFO ] Invariant cache hit.
[2023-03-18 19:05:33] [INFO ] Dead Transitions using invariants and state equation in 790 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 588/3332 places, 2744/2744 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3906 ms. Remains : 588/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN14-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s196 s197 s198 s199 s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 57390 steps with 333 reset in 10004 ms.
Product exploration timeout after 56720 steps with 329 reset in 10001 ms.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 58 resets, run finished after 1743 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Probabilistic random walk after 215335 steps, saw 215221 distinct states, run finished after 3005 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 19:05:58] [INFO ] Invariant cache hit.
[2023-03-18 19:05:58] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 38 ms returned sat
[2023-03-18 19:06:01] [INFO ] After 2545ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:06:01] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 35 ms returned sat
[2023-03-18 19:06:04] [INFO ] After 2765ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 19:06:04] [INFO ] After 2874ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-18 19:06:04] [INFO ] After 3049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 195 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Support contains 196 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 41 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:06:04] [INFO ] Invariant cache hit.
[2023-03-18 19:06:04] [INFO ] Implicit Places using invariants in 437 ms returned []
[2023-03-18 19:06:04] [INFO ] Invariant cache hit.
[2023-03-18 19:06:07] [INFO ] Implicit Places using invariants and state equation in 2164 ms returned []
Implicit Place search using SMT with State Equation took 2601 ms to find 0 implicit places.
[2023-03-18 19:06:07] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-18 19:06:07] [INFO ] Invariant cache hit.
[2023-03-18 19:06:08] [INFO ] Dead Transitions using invariants and state equation in 876 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3584 ms. Remains : 588/588 places, 2744/2744 transitions.
Computed a total of 588 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 588 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 1741 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Probabilistic random walk after 209831 steps, saw 209721 distinct states, run finished after 3003 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 19:06:13] [INFO ] Invariant cache hit.
[2023-03-18 19:06:13] [INFO ] [Real]Absence check using 0 positive and 41 generalized place invariants in 34 ms returned sat
[2023-03-18 19:06:15] [INFO ] After 2149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:06:15] [INFO ] [Nat]Absence check using 0 positive and 41 generalized place invariants in 34 ms returned sat
[2023-03-18 19:06:18] [INFO ] After 2300ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 19:06:18] [INFO ] After 2403ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-18 19:06:18] [INFO ] After 2573ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 195 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 57410 steps with 333 reset in 10002 ms.
Product exploration timeout after 57140 steps with 331 reset in 10002 ms.
Built C files in :
/tmp/ltsmin5767534574465851210
[2023-03-18 19:06:38] [INFO ] Too many transitions (2744) to apply POR reductions. Disabling POR matrices.
[2023-03-18 19:06:38] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5767534574465851210
Running compilation step : cd /tmp/ltsmin5767534574465851210;'/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/ltsmin5767534574465851210;'/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/ltsmin5767534574465851210;'/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 196 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 2744/2744 transitions.
Applied a total of 0 rules in 35 ms. Remains 588 /588 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:06:41] [INFO ] Invariant cache hit.
[2023-03-18 19:06:42] [INFO ] Implicit Places using invariants in 472 ms returned []
[2023-03-18 19:06:42] [INFO ] Invariant cache hit.
[2023-03-18 19:06:44] [INFO ] Implicit Places using invariants and state equation in 2184 ms returned []
Implicit Place search using SMT with State Equation took 2657 ms to find 0 implicit places.
[2023-03-18 19:06:44] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-18 19:06:44] [INFO ] Invariant cache hit.
[2023-03-18 19:06:45] [INFO ] Dead Transitions using invariants and state equation in 865 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3619 ms. Remains : 588/588 places, 2744/2744 transitions.
Built C files in :
/tmp/ltsmin14442514184069458108
[2023-03-18 19:06:45] [INFO ] Too many transitions (2744) to apply POR reductions. Disabling POR matrices.
[2023-03-18 19:06:45] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14442514184069458108
Running compilation step : cd /tmp/ltsmin14442514184069458108;'/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/ltsmin14442514184069458108;'/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/ltsmin14442514184069458108;'/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-18 19:06:48] [INFO ] Flatten gal took : 82 ms
[2023-03-18 19:06:48] [INFO ] Flatten gal took : 82 ms
[2023-03-18 19:06:48] [INFO ] Time to serialize gal into /tmp/LTL6071133388264532907.gal : 11 ms
[2023-03-18 19:06:48] [INFO ] Time to serialize properties into /tmp/LTL2117932893058127214.prop : 0 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/LTL6071133388264532907.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3472020109741881503.hoa' '-atoms' '/tmp/LTL2117932893058127214.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...317
Loading property file /tmp/LTL2117932893058127214.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3472020109741881503.hoa
Detected timeout of ITS tools.
[2023-03-18 19:07:03] [INFO ] Flatten gal took : 80 ms
[2023-03-18 19:07:04] [INFO ] Flatten gal took : 81 ms
[2023-03-18 19:07:04] [INFO ] Time to serialize gal into /tmp/LTL17852769588398357963.gal : 11 ms
[2023-03-18 19:07:04] [INFO ] Time to serialize properties into /tmp/LTL11563056459613095637.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/LTL17852769588398357963.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11563056459613095637.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...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+(...2278
Formula 0 simplified : FG!"(((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((C...2272
Detected timeout of ITS tools.
[2023-03-18 19:07:19] [INFO ] Flatten gal took : 80 ms
[2023-03-18 19:07:19] [INFO ] Applying decomposition
[2023-03-18 19:07:19] [INFO ] Flatten gal took : 82 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/graph486888772393839188.txt' '-o' '/tmp/graph486888772393839188.bin' '-w' '/tmp/graph486888772393839188.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph486888772393839188.bin' '-l' '-1' '-v' '-w' '/tmp/graph486888772393839188.weights' '-q' '0' '-e' '0.001'
[2023-03-18 19:07:19] [INFO ] Decomposing Gal with order
[2023-03-18 19:07:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 19:07:20] [INFO ] Removed a total of 7644 redundant transitions.
[2023-03-18 19:07:20] [INFO ] Flatten gal took : 459 ms
[2023-03-18 19:07:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2023-03-18 19:07:20] [INFO ] Time to serialize gal into /tmp/LTL1354193485585554170.gal : 12 ms
[2023-03-18 19:07:20] [INFO ] Time to serialize properties into /tmp/LTL535526721790801605.ltl : 0 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/LTL1354193485585554170.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL535526721790801605.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...274
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((gu196.Cells_0+gu196.Cells_1)+(gu196.Cells_2+gu196.Cells_3))+((gu196.Cells_4+gu196.Cells_5)+(gu196.Cells_6+gu196.Cells...3454
Formula 0 simplified : FG!"(((((((((gu196.Cells_0+gu196.Cells_1)+(gu196.Cells_2+gu196.Cells_3))+((gu196.Cells_4+gu196.Cells_5)+(gu196.Cells_6+gu196.Cells_7...3448
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12139301215575524206
[2023-03-18 19:07:35] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12139301215575524206
Running compilation step : cd /tmp/ltsmin12139301215575524206;'/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/ltsmin12139301215575524206;'/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/ltsmin12139301215575524206;'/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-COL-AN14-LTLCardinality-12 finished in 129170 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2940 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 28 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 3332 cols
[2023-03-18 19:07:38] [INFO ] Computed 588 place invariants in 12 ms
[2023-03-18 19:07:39] [INFO ] Implicit Places using invariants in 1200 ms returned []
[2023-03-18 19:07:39] [INFO ] Invariant cache hit.
[2023-03-18 19:07:42] [INFO ] Implicit Places using invariants and state equation in 3290 ms returned []
Implicit Place search using SMT with State Equation took 4492 ms to find 0 implicit places.
[2023-03-18 19:07:42] [INFO ] Invariant cache hit.
[2023-03-18 19:07:44] [INFO ] Dead Transitions using invariants and state equation in 1750 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6271 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN14-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s3136 s3137 s3138 s3139 s3140 s3141 s3142 s3143 s3144 s3145 s3146 s3147 s3148 s3149 s3150 s3151 s3152 s3153 s3154 s3155 s3156 s3157 s3158 s31...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN14-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN14-LTLCardinality-14 finished in 6514 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(((p1||F(p2))&&p0)))'
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 17 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:07:44] [INFO ] Invariant cache hit.
[2023-03-18 19:07:45] [INFO ] Implicit Places using invariants in 815 ms returned []
[2023-03-18 19:07:45] [INFO ] Invariant cache hit.
[2023-03-18 19:07:48] [INFO ] Implicit Places using invariants and state equation in 2561 ms returned []
Implicit Place search using SMT with State Equation took 3377 ms to find 0 implicit places.
[2023-03-18 19:07:48] [INFO ] Invariant cache hit.
[2023-03-18 19:07:49] [INFO ] Dead Transitions using invariants and state equation in 1791 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5186 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : Sudoku-COL-AN14-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(LEQ (ADD s196 s197 s198 s199 s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN14-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN14-LTLCardinality-15 finished in 5352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(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' '!(G((p0||X((G((!p1&&(G(p2)||(p2&&(!p2||F(!p0)))))) U (p0&&G((!p1&&(G(p2)||(p2&&(!p2||F(!p0))))))))))))'
Found a Lengthening insensitive property : Sudoku-COL-AN14-LTLCardinality-08
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 20 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:07:50] [INFO ] Invariant cache hit.
[2023-03-18 19:07:51] [INFO ] Implicit Places using invariants in 834 ms returned []
[2023-03-18 19:07:51] [INFO ] Invariant cache hit.
[2023-03-18 19:07:53] [INFO ] Implicit Places using invariants and state equation in 2664 ms returned []
Implicit Place search using SMT with State Equation took 3500 ms to find 0 implicit places.
[2023-03-18 19:07:53] [INFO ] Invariant cache hit.
[2023-03-18 19:07:55] [INFO ] Dead Transitions using invariants and state equation in 1809 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5330 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Running random walk in product with property : Sudoku-COL-AN14-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(OR p1 (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 (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 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 56700 steps with 329 reset in 10001 ms.
Product exploration timeout after 56210 steps with 326 reset in 10001 ms.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (OR p1 (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 395 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 58 resets, run finished after 1962 ms. (steps per millisecond=5 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 603 ms. (steps per millisecond=16 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 19:08:20] [INFO ] Invariant cache hit.
[2023-03-18 19:08:20] [INFO ] [Real]Absence check using 588 positive place invariants in 178 ms returned sat
[2023-03-18 19:08:45] [INFO ] After 25011ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:08:45] [INFO ] [Nat]Absence check using 588 positive place invariants in 158 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
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-18 19:09:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 19:09:10] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 21 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Incomplete random walk after 10000 steps, including 58 resets, run finished after 1949 ms. (steps per millisecond=5 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 623 ms. (steps per millisecond=16 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 241337 steps, run timeout after 6002 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 241337 steps, saw 241198 distinct states, run finished after 6002 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 19:09:19] [INFO ] Invariant cache hit.
[2023-03-18 19:09:19] [INFO ] [Real]Absence check using 588 positive place invariants in 160 ms returned sat
[2023-03-18 19:09:44] [INFO ] After 25015ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:09:44] [INFO ] [Nat]Absence check using 588 positive place invariants in 157 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
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-18 19:10:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 19:10:09] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 21 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 19 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:10:09] [INFO ] Invariant cache hit.
[2023-03-18 19:10:10] [INFO ] Implicit Places using invariants in 833 ms returned []
[2023-03-18 19:10:10] [INFO ] Invariant cache hit.
[2023-03-18 19:10:12] [INFO ] Implicit Places using invariants and state equation in 2645 ms returned []
Implicit Place search using SMT with State Equation took 3489 ms to find 0 implicit places.
[2023-03-18 19:10:13] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-18 19:10:13] [INFO ] Invariant cache hit.
[2023-03-18 19:10:14] [INFO ] Dead Transitions using invariants and state equation in 1743 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5317 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (OR p1 (NOT p2))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND p2 (NOT p1))), (F (AND p0 p2 (NOT p1))), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 7 factoid took 377 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 16 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:10:15] [INFO ] Invariant cache hit.
[2023-03-18 19:10:16] [INFO ] Implicit Places using invariants in 837 ms returned []
[2023-03-18 19:10:16] [INFO ] Invariant cache hit.
[2023-03-18 19:10:18] [INFO ] Implicit Places using invariants and state equation in 2541 ms returned []
Implicit Place search using SMT with State Equation took 3384 ms to find 0 implicit places.
[2023-03-18 19:10:18] [INFO ] Invariant cache hit.
[2023-03-18 19:10:20] [INFO ] Dead Transitions using invariants and state equation in 1764 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5165 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (OR (NOT p2) p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 328 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 58 resets, run finished after 1953 ms. (steps per millisecond=5 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 613 ms. (steps per millisecond=16 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 19:10:24] [INFO ] Invariant cache hit.
[2023-03-18 19:10:25] [INFO ] [Real]Absence check using 588 positive place invariants in 164 ms returned sat
[2023-03-18 19:10:50] [INFO ] After 25025ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:10:50] [INFO ] [Nat]Absence check using 588 positive place invariants in 153 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
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-18 19:11:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 19:11:15] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 21 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Incomplete random walk after 10000 steps, including 58 resets, run finished after 1942 ms. (steps per millisecond=5 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 614 ms. (steps per millisecond=16 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 273036 steps, run timeout after 6001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 273036 steps, saw 270350 distinct states, run finished after 6001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 19:11:23] [INFO ] Invariant cache hit.
[2023-03-18 19:11:24] [INFO ] [Real]Absence check using 588 positive place invariants in 160 ms returned sat
[2023-03-18 19:11:49] [INFO ] After 25025ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 19:11:49] [INFO ] [Nat]Absence check using 588 positive place invariants in 158 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
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-18 19:12:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 19:12:14] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 20 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 25 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:12:14] [INFO ] Invariant cache hit.
[2023-03-18 19:12:15] [INFO ] Implicit Places using invariants in 829 ms returned []
[2023-03-18 19:12:15] [INFO ] Invariant cache hit.
[2023-03-18 19:12:17] [INFO ] Implicit Places using invariants and state equation in 2696 ms returned []
Implicit Place search using SMT with State Equation took 3536 ms to find 0 implicit places.
[2023-03-18 19:12:17] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-18 19:12:17] [INFO ] Invariant cache hit.
[2023-03-18 19:12:19] [INFO ] Dead Transitions using invariants and state equation in 1800 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5439 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (OR (NOT p2) p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F (AND p0 (NOT p1) p2)), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 7 factoid took 419 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Product exploration timeout after 56710 steps with 329 reset in 10001 ms.
Product exploration timeout after 56230 steps with 326 reset in 10001 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (OR (NOT p2) (NOT p0) p1), true, (OR (NOT p2) p1)]
Support contains 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 22 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:12:40] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-18 19:12:40] [INFO ] Invariant cache hit.
[2023-03-18 19:12:42] [INFO ] Dead Transitions using invariants and state equation in 1810 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1894 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Built C files in :
/tmp/ltsmin85423103333997348
[2023-03-18 19:12:42] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin85423103333997348
Running compilation step : cd /tmp/ltsmin85423103333997348;'/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/ltsmin85423103333997348;'/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/ltsmin85423103333997348;'/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 3136 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 17 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
[2023-03-18 19:12:45] [INFO ] Invariant cache hit.
[2023-03-18 19:12:46] [INFO ] Implicit Places using invariants in 929 ms returned []
[2023-03-18 19:12:46] [INFO ] Invariant cache hit.
[2023-03-18 19:12:49] [INFO ] Implicit Places using invariants and state equation in 2678 ms returned []
Implicit Place search using SMT with State Equation took 3609 ms to find 0 implicit places.
[2023-03-18 19:12:49] [INFO ] Invariant cache hit.
[2023-03-18 19:12:51] [INFO ] Dead Transitions using invariants and state equation in 1850 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5478 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Built C files in :
/tmp/ltsmin11231695642725082682
[2023-03-18 19:12:51] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11231695642725082682
Running compilation step : cd /tmp/ltsmin11231695642725082682;'/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/ltsmin11231695642725082682;'/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/ltsmin11231695642725082682;'/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-18 19:12:55] [INFO ] Flatten gal took : 112 ms
[2023-03-18 19:12:55] [INFO ] Flatten gal took : 116 ms
[2023-03-18 19:12:55] [INFO ] Time to serialize gal into /tmp/LTL557488001610027907.gal : 17 ms
[2023-03-18 19:12:55] [INFO ] Time to serialize properties into /tmp/LTL15005083449113294032.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/LTL557488001610027907.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16106221839558774532.hoa' '-atoms' '/tmp/LTL15005083449113294032.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/LTL15005083449113294032.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16106221839558774532.hoa
Detected timeout of ITS tools.
[2023-03-18 19:13:10] [INFO ] Flatten gal took : 120 ms
[2023-03-18 19:13:10] [INFO ] Flatten gal took : 105 ms
[2023-03-18 19:13:10] [INFO ] Time to serialize gal into /tmp/LTL1103224077108224113.gal : 14 ms
[2023-03-18 19:13:10] [INFO ] Time to serialize properties into /tmp/LTL3599696102527464894.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/LTL1103224077108224113.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3599696102527464894.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 : !((G(("(((((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows...97353
Formula 0 simplified : F(!"(((((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows_...50734
Detected timeout of ITS tools.
[2023-03-18 19:13:25] [INFO ] Flatten gal took : 109 ms
[2023-03-18 19:13:25] [INFO ] Applying decomposition
[2023-03-18 19:13:25] [INFO ] Flatten gal took : 94 ms
[2023-03-18 19:13:48] [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/graph2803911711452331239.txt' '-o' '/tmp/graph2803911711452331239.bin' '-w' '/tmp/graph2803911711452331239.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.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:663)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:341)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
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-18 19:13:48] [INFO ] Flatten gal took : 104 ms
[2023-03-18 19:13:48] [INFO ] Time to serialize gal into /tmp/LTL8439587680487932424.gal : 13 ms
[2023-03-18 19:13:48] [INFO ] Time to serialize properties into /tmp/LTL11115023988764390866.ltl : 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/LTL8439587680487932424.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11115023988764390866.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 : !((G(("(((((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows...97353
Formula 0 simplified : F(!"(((((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows_...50734
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin159187768553919427
[2023-03-18 19:14:03] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin159187768553919427
Running compilation step : cd /tmp/ltsmin159187768553919427;'/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/ltsmin159187768553919427;'/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/ltsmin159187768553919427;'/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-COL-AN14-LTLCardinality-08 finished in 376483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-18 19:14:06] [INFO ] Flatten gal took : 109 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5761913983600621856
[2023-03-18 19:14:06] [INFO ] Too many transitions (2744) to apply POR reductions. Disabling POR matrices.
[2023-03-18 19:14:07] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5761913983600621856
Running compilation step : cd /tmp/ltsmin5761913983600621856;'/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-18 19:14:07] [INFO ] Applying decomposition
[2023-03-18 19:14:07] [INFO ] Flatten gal took : 117 ms
Compilation finished in 8609 ms.
Running link step : cd /tmp/ltsmin5761913983600621856;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin5761913983600621856;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
[2023-03-18 19:14:26] [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/graph9415863874369615414.txt' '-o' '/tmp/graph9415863874369615414.bin' '-w' '/tmp/graph9415863874369615414.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-18 19:14:26] [INFO ] Flatten gal took : 314 ms
[2023-03-18 19:14:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality14223815566106553024.gal : 8638 ms
[2023-03-18 19:14:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality13894885559983802595.ltl : 539 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/LTLCardinality14223815566106553024.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13894885559983802595.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 : !((G(F(("(((((((((((((Board_0+Board_1)+(Board_2+Board_3))+((Board_4+Board_5)+(Board_6+Board_7)))+(((Board_8+Board_9)+(Board_10+Board_1...39091
Formula 0 simplified : G(F!"(((((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((...39084
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin5761913983600621856;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin5761913983600621856;'/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' '[](((LTLAPp2==true)||X(([]((!(LTLAPp3==true)&&([]((LTLAPp4==true))||((LTLAPp4==true)&&(!(LTLAPp4==true)||<>(!(LTLAPp2==true))))))) U ((LTLAPp2==true)&&[]((!(LTLAPp3==true)&&([]((LTLAPp4==true))||((LTLAPp4==true)&&(!(LTLAPp4==true)||<>(!(LTLAPp2==true))))))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.060: LTL layer: formula: [](((LTLAPp2==true)||X(([]((!(LTLAPp3==true)&&([]((LTLAPp4==true))||((LTLAPp4==true)&&(!(LTLAPp4==true)||<>(!(LTLAPp2==true))))))) U ((LTLAPp2==true)&&[]((!(LTLAPp3==true)&&([]((LTLAPp4==true))||((LTLAPp4==true)&&(!(LTLAPp4==true)||<>(!(LTLAPp2==true))))))))))))
pins2lts-mc-linux64( 3/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.061: "[](((LTLAPp2==true)||X(([]((!(LTLAPp3==true)&&([]((LTLAPp4==true))||((LTLAPp4==true)&&(!(LTLAPp4==true)||<>(!(LTLAPp2==true))))))) U ((LTLAPp2==true)&&[]((!(LTLAPp3==true)&&([]((LTLAPp4==true))||((LTLAPp4==true)&&(!(LTLAPp4==true)||<>(!(LTLAPp2==true))))))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.063: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.063: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.071: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.082: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.083: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.094: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.098: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.117: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 3.258: DFS-FIFO for weak LTL, using special progress label 2751
pins2lts-mc-linux64( 0/ 8), 3.258: There are 2752 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 3.258: State length is 3333, there are 2754 groups
pins2lts-mc-linux64( 0/ 8), 3.258: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 3.258: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 3.258: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 3.258: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 97.386: ~1 levels ~960 states ~2587024 transitions
pins2lts-mc-linux64( 5/ 8), 115.349: ~1 levels ~1920 states ~5145984 transitions
pins2lts-mc-linux64( 7/ 8), 151.553: ~1 levels ~3840 states ~10313360 transitions
pins2lts-mc-linux64( 6/ 8), 162.194: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 224.619:
pins2lts-mc-linux64( 0/ 8), 224.621: mean standard work distribution: 0.6% (states) 1.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 224.621:
pins2lts-mc-linux64( 0/ 8), 224.621: Explored 4287 states 11502475 transitions, fanout: 2683.106
pins2lts-mc-linux64( 0/ 8), 224.621: Total exploration time 221.360 sec (164.780 sec minimum, 189.992 sec on average)
pins2lts-mc-linux64( 0/ 8), 224.621: States per second: 19, Transitions per second: 51963
pins2lts-mc-linux64( 0/ 8), 224.621:
pins2lts-mc-linux64( 0/ 8), 224.621: Progress states detected: 8653317
pins2lts-mc-linux64( 0/ 8), 224.621: Redundant explorations: -99.9505
pins2lts-mc-linux64( 0/ 8), 224.621:
pins2lts-mc-linux64( 0/ 8), 224.621: Queue width: 8B, total height: 10731232, memory: 81.87MB
pins2lts-mc-linux64( 0/ 8), 224.621: Tree memory: 322.0MB, 39.0 B/state, compr.: 0.3%
pins2lts-mc-linux64( 0/ 8), 224.621: Tree fill ratio (roots/leafs): 6.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 224.621: Stored 3363 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 224.621: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 224.624: Est. total memory use: 403.9MB (~1105.9MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5761913983600621856;'/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' '[](((LTLAPp2==true)||X(([]((!(LTLAPp3==true)&&([]((LTLAPp4==true))||((LTLAPp4==true)&&(!(LTLAPp4==true)||<>(!(LTLAPp2==true))))))) U ((LTLAPp2==true)&&[]((!(LTLAPp3==true)&&([]((LTLAPp4==true))||((LTLAPp4==true)&&(!(LTLAPp4==true)||<>(!(LTLAPp2==true))))))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5761913983600621856;'/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' '[](((LTLAPp2==true)||X(([]((!(LTLAPp3==true)&&([]((LTLAPp4==true))||((LTLAPp4==true)&&(!(LTLAPp4==true)||<>(!(LTLAPp2==true))))))) U ((LTLAPp2==true)&&[]((!(LTLAPp3==true)&&([]((LTLAPp4==true))||((LTLAPp4==true)&&(!(LTLAPp4==true)||<>(!(LTLAPp2==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-18 19:41:18] [INFO ] Applying decomposition
[2023-03-18 19:41:19] [INFO ] Flatten gal took : 673 ms
[2023-03-18 19:41:19] [INFO ] Decomposing Gal with order
[2023-03-18 19:41:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 19:41:21] [INFO ] Removed a total of 6874 redundant transitions.
[2023-03-18 19:41:22] [INFO ] Flatten gal took : 1017 ms
[2023-03-18 19:41:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 78 ms.
[2023-03-18 19:41:25] [INFO ] Time to serialize gal into /tmp/LTLCardinality7115427596880768664.gal : 69 ms
[2023-03-18 19:41:25] [INFO ] Time to serialize properties into /tmp/LTLCardinality7955168860148546283.ltl : 23 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/LTLCardinality7115427596880768664.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7955168860148546283.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...297
Read 3 LTL properties
Checking formula 0 : !((G(F(("(((((((((((((gNNN0.Board_0+gNNN1.Board_1)+(gNNN2.Board_2+gNNN3.Board_3))+((gNNN4.Board_4+gNNN5.Board_5)+(gNNN6.Board_6+gNNN7....65201
Formula 0 simplified : G(F!"(((((((((gNN0.Cells_0+gNN1.Cells_1)+(gNN2.Cells_2+gNN3.Cells_3))+((gNN4.Cells_4+gNN5.Cells_5)+(gNN6.Cells_6+gNN7.Cells_7)))+(((...65194
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9419844 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16254600 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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-COL-AN14"
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-COL-AN14, 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-167912698900107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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