Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 42M
-rw-r--r-- 1 mcc users 813K Apr 12 11:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Apr 12 11:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.6M Apr 12 10:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 7.3M Apr 12 10:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 379K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.7M Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7M Apr 12 12:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.6M Apr 12 12:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0M Apr 12 11:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.1M Apr 12 11:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 78K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 191K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.2M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717059327419

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-30 08:55:28] [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]
[2024-05-30 08:55:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 08:55:28] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2024-05-30 08:55:28] [INFO ] Transformed 2704 places.
[2024-05-30 08:55:28] [INFO ] Transformed 2197 transitions.
[2024-05-30 08:55:28] [INFO ] Found NUPN structural information;
[2024-05-30 08:55:28] [INFO ] Parsed PT model containing 2704 places and 2197 transitions and 8788 arcs in 325 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 68 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-AN13-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2704 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 29 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2024-05-30 08:55:29] [INFO ] Computed 507 invariants in 54 ms
[2024-05-30 08:55:30] [INFO ] Implicit Places using invariants in 934 ms returned []
[2024-05-30 08:55:30] [INFO ] Invariant cache hit.
[2024-05-30 08:55:32] [INFO ] Implicit Places using invariants and state equation in 2045 ms returned []
Implicit Place search using SMT with State Equation took 3007 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 2ms
Finished structural reductions in LTL mode , in 1 iterations and 3062 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Support contains 2704 out of 2704 places after structural reductions.
[2024-05-30 08:55:32] [INFO ] Flatten gal took : 256 ms
[2024-05-30 08:55:33] [INFO ] Flatten gal took : 208 ms
[2024-05-30 08:55:33] [INFO ] Input system was already deterministic with 2197 transitions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40000 steps (268 resets) in 12424 ms. (3 steps per ms) remains 9/24 properties
BEST_FIRST walk for 40004 steps (8 resets) in 500 ms. (79 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2340 ms. (17 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 457 ms. (87 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 441 ms. (90 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 613 ms. (65 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 497 ms. (80 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 659 ms. (60 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 458 ms. (87 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 765 ms. (52 steps per ms) remains 9/9 properties
[2024-05-30 08:55:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2704 variables, 2704/2704 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/2704 variables, 507/3211 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2704 variables, 0/3211 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4901/4901 variables, and 5915 constraints, problems are : Problem set: 2 solved, 7 unsolved in 5021 ms.
Refiners :[Domain max(s): 2704/2704 constraints, Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 2704/2704 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2704 variables, 2704/2704 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/4901 variables, and 3211 constraints, problems are : Problem set: 2 solved, 7 unsolved in 5020 ms.
Refiners :[Domain max(s): 2704/2704 constraints, Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 0/2704 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10828ms problems are : Problem set: 2 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2704 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 36 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 2704/2704 places, 2197/2197 transitions.
RANDOM walk for 40000 steps (268 resets) in 10752 ms. (3 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 521 ms. (76 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2340 ms. (17 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 513 ms. (77 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 444 ms. (89 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 448 ms. (89 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 447 ms. (89 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 713 ms. (56 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 272801 steps, run timeout after 12001 ms. (steps per millisecond=22 ) properties seen :0 out of 7
Probabilistic random walk after 272801 steps, saw 225514 distinct states, run finished after 12012 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-30 08:56:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2704 variables, 2704/2704 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2704 variables, 507/3211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2704 variables, 0/3211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2197/4901 variables, 2704/5915 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4901 variables, 0/5915 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/4901 variables, 0/5915 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4901/4901 variables, and 5915 constraints, problems are : Problem set: 0 solved, 7 unsolved in 23515 ms.
Refiners :[Domain max(s): 2704/2704 constraints, Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 2704/2704 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2704 variables, 2704/2704 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2704 variables, 507/3211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2704 variables, 0/3211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2197/4901 variables, 2704/5915 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4901 variables, 0/5915 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/4901 variables, 0/5915 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4901/4901 variables, and 5915 constraints, problems are : Problem set: 0 solved, 7 unsolved in 40857 ms.
Refiners :[Domain max(s): 2704/2704 constraints, Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 2704/2704 constraints, PredecessorRefiner: 7/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 64746ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Finished Parikh walk after 169 steps, including 0 resets, run visited all 7 properties in 23 ms. (steps per millisecond=7 )
Parikh walk visited 7 properties in 30 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA Sudoku-PT-AN13-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&((p1||F(p2)) U p3))))'
Support contains 2535 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 35 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 08:57:11] [INFO ] Invariant cache hit.
[2024-05-30 08:57:13] [INFO ] Implicit Places using invariants in 2066 ms returned []
[2024-05-30 08:57:13] [INFO ] Invariant cache hit.
[2024-05-30 08:57:16] [INFO ] Implicit Places using invariants and state equation in 3327 ms returned []
Implicit Place search using SMT with State Equation took 5397 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 5434 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), true, (NOT p2), (NOT p3)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-01
Product exploration timeout after 36570 steps with 18285 reset in 10001 ms.
Product exploration timeout after 36470 steps with 18235 reset in 10001 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p3 (NOT p1) (NOT p2)), (X (NOT p2)), (X p3), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X p0), (X (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 21 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN13-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLCardinality-01 finished in 27152 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 80 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2024-05-30 08:57:38] [INFO ] Computed 38 invariants in 125 ms
[2024-05-30 08:57:41] [INFO ] Implicit Places using invariants in 2476 ms returned []
[2024-05-30 08:57:41] [INFO ] Invariant cache hit.
[2024-05-30 08:58:10] [INFO ] Implicit Places using invariants and state equation in 29798 ms returned []
Implicit Place search using SMT with State Equation took 32280 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32362 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-02
Product exploration timeout after 48280 steps with 24140 reset in 10002 ms.
Product exploration timeout after 47410 steps with 23705 reset in 10002 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN13-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLCardinality-02 finished in 52953 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2197 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 41 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2024-05-30 08:58:31] [INFO ] Computed 507 invariants in 10 ms
[2024-05-30 08:58:36] [INFO ] Implicit Places using invariants in 5039 ms returned []
[2024-05-30 08:58:36] [INFO ] Invariant cache hit.
[2024-05-30 08:58:42] [INFO ] Implicit Places using invariants and state equation in 6178 ms returned []
Implicit Place search using SMT with State Equation took 11221 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 11265 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-03
Stuttering criterion allowed to conclude after 148 steps with 0 reset in 31 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-03 finished in 11444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p0 U (X(p1) U ((p1&&X(p1))||X(G(p1))))))))'
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 24 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 08:58:43] [INFO ] Invariant cache hit.
[2024-05-30 08:58:46] [INFO ] Implicit Places using invariants in 3468 ms returned []
[2024-05-30 08:58:46] [INFO ] Invariant cache hit.
[2024-05-30 08:58:51] [INFO ] Implicit Places using invariants and state equation in 4509 ms returned []
Implicit Place search using SMT with State Equation took 7982 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 8008 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-05
Product exploration timeout after 38010 steps with 256 reset in 10004 ms.
Product exploration timeout after 38070 steps with 256 reset in 10001 ms.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 160 ms. Reduced automaton from 8 states, 18 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
RANDOM walk for 40000 steps (268 resets) in 6714 ms. (5 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2233 ms. (17 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2719 ms. (14 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 571 ms. (69 steps per ms) remains 3/3 properties
[2024-05-30 08:59:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2366 variables, 2366/2366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/2366 variables, 169/2535 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2366 variables, 0/2535 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2704/4901 variables, and 2873 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2863 ms.
Refiners :[Domain max(s): 2366/2704 constraints, Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 0/2704 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2366 variables, 2366/2366 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2366 variables, 169/2535 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2366 variables, 0/2535 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/4901 variables, and 2873 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2102 ms.
Refiners :[Domain max(s): 2366/2704 constraints, Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 0/2704 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 5609ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 162 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 2704/2704 places, 2197/2197 transitions.
RANDOM walk for 40000 steps (268 resets) in 8939 ms. (4 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2536 ms. (15 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 462 ms. (86 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 439560 steps, run timeout after 9001 ms. (steps per millisecond=48 ) properties seen :0 out of 2
Probabilistic random walk after 439560 steps, saw 250722 distinct states, run finished after 9001 ms. (steps per millisecond=48 ) properties seen :0
[2024-05-30 08:59:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2366 variables, 2366/2366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2366 variables, 169/2535 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2366 variables, 0/2535 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 338/2704 variables, 338/2873 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2704 variables, 338/3211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2704 variables, 0/3211 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2197/4901 variables, 2704/5915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4901 variables, 0/5915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/4901 variables, 0/5915 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4901/4901 variables, and 5915 constraints, problems are : Problem set: 0 solved, 2 unsolved in 41553 ms.
Refiners :[Domain max(s): 2704/2704 constraints, Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 2704/2704 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2366 variables, 2366/2366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2366 variables, 169/2535 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2366 variables, 0/2535 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/4901 variables, and 2873 constraints, problems are : Problem set: 0 solved, 2 unsolved in 17638 ms.
Refiners :[Domain max(s): 2366/2704 constraints, Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 0/2704 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 59456ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 34 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 32 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 09:00:33] [INFO ] Invariant cache hit.
[2024-05-30 09:00:37] [INFO ] Implicit Places using invariants in 3492 ms returned []
[2024-05-30 09:00:37] [INFO ] Invariant cache hit.
[2024-05-30 09:00:41] [INFO ] Implicit Places using invariants and state equation in 4504 ms returned []
Implicit Place search using SMT with State Equation took 7999 ms to find 0 implicit places.
[2024-05-30 09:00:42] [INFO ] Redundant transitions in 99 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8137 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 321 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 24 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 09:00:42] [INFO ] Invariant cache hit.
[2024-05-30 09:00:46] [INFO ] Implicit Places using invariants in 3293 ms returned []
[2024-05-30 09:00:46] [INFO ] Invariant cache hit.
[2024-05-30 09:00:50] [INFO ] Implicit Places using invariants and state equation in 4490 ms returned []
Implicit Place search using SMT with State Equation took 7790 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 7817 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Computed a total of 2704 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2704 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 125 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
RANDOM walk for 40000 steps (268 resets) in 6173 ms. (6 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 637 ms. (62 steps per ms) remains 1/1 properties
[2024-05-30 09:00:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2197/2366 variables, 169/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/2366 variables, 2197/2535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2366 variables, 0/2535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2704/4901 variables, and 2873 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1490 ms.
Refiners :[Domain max(s): 2366/2704 constraints, Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 0/2704 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2197/2366 variables, 169/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2366 variables, 2197/2535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2366 variables, 0/2535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/4901 variables, and 2873 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1476 ms.
Refiners :[Domain max(s): 2366/2704 constraints, Positive P Invariants (semi-flows): 507/507 constraints, State Equation: 0/2704 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3029ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 169 out of 2704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.3 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 44 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 507/2704 places, 2197/2197 transitions.
RANDOM walk for 40000 steps (268 resets) in 7206 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 558 ms. (71 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 430787 steps, run timeout after 6001 ms. (steps per millisecond=71 ) properties seen :0 out of 1
Probabilistic random walk after 430787 steps, saw 249526 distinct states, run finished after 6001 ms. (steps per millisecond=71 ) properties seen :0
// Phase 1: matrix 2197 rows 507 cols
[2024-05-30 09:01:05] [INFO ] Computed 38 invariants in 59 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 332/501 variables, 32/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 332/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/507 variables, 6/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 6/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2197/2704 variables, 507/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2704 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2704 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2704/2704 variables, and 1052 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3888 ms.
Refiners :[Domain max(s): 507/507 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 332/501 variables, 32/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 332/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/507 variables, 6/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 6/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2197/2704 variables, 507/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2704 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2704 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2704/2704 variables, and 1052 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2087 ms.
Refiners :[Domain max(s): 507/507 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 6095ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 167 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [(AND p1 p0), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 225 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Product exploration timeout after 40280 steps with 271 reset in 10003 ms.
Product exploration timeout after 39810 steps with 268 reset in 10001 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 275 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 98 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 09:01:32] [INFO ] Redundant transitions in 165 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 269 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin15620163085267411833
[2024-05-30 09:01:32] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15620163085267411833
Running compilation step : cd /tmp/ltsmin15620163085267411833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin15620163085267411833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin15620163085267411833;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2366 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Applied a total of 0 rules in 24 ms. Remains 2704 /2704 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 2704 cols
[2024-05-30 09:01:36] [INFO ] Computed 507 invariants in 9 ms
[2024-05-30 09:01:39] [INFO ] Implicit Places using invariants in 3683 ms returned []
[2024-05-30 09:01:39] [INFO ] Invariant cache hit.
[2024-05-30 09:01:44] [INFO ] Implicit Places using invariants and state equation in 4600 ms returned []
Implicit Place search using SMT with State Equation took 8294 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 8319 ms. Remains : 2704/2704 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin12113044329132415058
[2024-05-30 09:01:44] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12113044329132415058
Running compilation step : cd /tmp/ltsmin12113044329132415058;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin12113044329132415058;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin12113044329132415058;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-30 09:01:47] [INFO ] Flatten gal took : 105 ms
[2024-05-30 09:01:47] [INFO ] Flatten gal took : 106 ms
[2024-05-30 09:01:47] [INFO ] Time to serialize gal into /tmp/LTL6749397965483973843.gal : 57 ms
[2024-05-30 09:01:47] [INFO ] Time to serialize properties into /tmp/LTL4199493774716080867.prop : 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6749397965483973843.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4743685771879157459.hoa' '-atoms' '/tmp/LTL4199493774716080867.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4199493774716080867.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4743685771879157459.hoa
Detected timeout of ITS tools.
[2024-05-30 09:02:03] [INFO ] Flatten gal took : 96 ms
[2024-05-30 09:02:03] [INFO ] Flatten gal took : 118 ms
[2024-05-30 09:02:03] [INFO ] Time to serialize gal into /tmp/LTL17450896030340009942.gal : 23 ms
[2024-05-30 09:02:03] [INFO ] Time to serialize properties into /tmp/LTL1875995253258314338.ltl : 13 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17450896030340009942.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1875995253258314338.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G("(((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)+(Ce...133420
Formula 0 simplified : F!"(((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)+(Cell...133406
Detected timeout of ITS tools.
[2024-05-30 09:02:18] [INFO ] Flatten gal took : 85 ms
[2024-05-30 09:02:18] [INFO ] Applying decomposition
[2024-05-30 09:02:18] [INFO ] Flatten gal took : 86 ms
[2024-05-30 09:02:35] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph5847226901711494938.txt' '-o' '/tmp/graph5847226901711494938.bin' '-w' '/tmp/graph5847226901711494938.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:114)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:719)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:342)
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:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-30 09:02:35] [INFO ] Flatten gal took : 98 ms
[2024-05-30 09:02:35] [INFO ] Time to serialize gal into /tmp/LTL67791455467179211.gal : 18 ms
[2024-05-30 09:02:35] [INFO ] Time to serialize properties into /tmp/LTL16618222283558663508.ltl : 7 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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL67791455467179211.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16618222283558663508.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !(((G("(((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)+(Ce...133420
Formula 0 simplified : F!"(((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)+(Cell...133406
Detected timeout of ITS tools.
Treatment of property Sudoku-PT-AN13-LTLCardinality-05 finished in 247281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&G(F(p2)))))'
Support contains 338 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.4 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 25 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2024-05-30 09:02:50] [INFO ] Computed 38 invariants in 45 ms
[2024-05-30 09:02:51] [INFO ] Implicit Places using invariants in 1295 ms returned []
[2024-05-30 09:02:51] [INFO ] Invariant cache hit.
[2024-05-30 09:03:05] [INFO ] Implicit Places using invariants and state equation in 14023 ms returned []
Implicit Place search using SMT with State Equation took 15334 ms to find 0 implicit places.
[2024-05-30 09:03:05] [INFO ] Redundant transitions in 64 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15429 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p2) (NOT p1)), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-07
Product exploration timeout after 73790 steps with 498 reset in 10002 ms.
Product exploration timeout after 73680 steps with 496 reset in 10002 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p1), (X p1), (X p2), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 133 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (268 resets) in 7214 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 596 ms. (67 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 432290 steps, run timeout after 6001 ms. (steps per millisecond=72 ) properties seen :0 out of 1
Probabilistic random walk after 432290 steps, saw 249630 distinct states, run finished after 6001 ms. (steps per millisecond=72 ) properties seen :0
[2024-05-30 09:03:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 326/495 variables, 26/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 326/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/507 variables, 12/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 12/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2704/2704 variables, and 1052 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1049 ms.
Refiners :[Domain max(s): 507/507 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 326/495 variables, 26/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 326/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/507 variables, 12/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 12/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/2704 variables, and 1052 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2631 ms.
Refiners :[Domain max(s): 507/507 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3713ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 169 out of 507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 35 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 507/507 places, 2197/2197 transitions.
RANDOM walk for 40000 steps (268 resets) in 7002 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 627 ms. (63 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 430300 steps, run timeout after 6001 ms. (steps per millisecond=71 ) properties seen :0 out of 1
Probabilistic random walk after 430300 steps, saw 249495 distinct states, run finished after 6001 ms. (steps per millisecond=71 ) properties seen :0
[2024-05-30 09:03:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 326/495 variables, 26/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 326/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/507 variables, 12/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 12/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2197/2704 variables, 507/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2704 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2704 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2704/2704 variables, and 1052 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1079 ms.
Refiners :[Domain max(s): 507/507 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 326/495 variables, 26/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 326/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/507 variables, 12/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 12/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/2704 variables, and 1052 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9425 ms.
Refiners :[Domain max(s): 507/507 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10540ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 169 out of 507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 43 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 507/507 places, 2197/2197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 23 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 09:03:57] [INFO ] Invariant cache hit.
[2024-05-30 09:03:59] [INFO ] Implicit Places using invariants in 2222 ms returned []
[2024-05-30 09:03:59] [INFO ] Invariant cache hit.
[2024-05-30 09:04:16] [INFO ] Implicit Places using invariants and state equation in 16298 ms returned []
Implicit Place search using SMT with State Equation took 18522 ms to find 0 implicit places.
[2024-05-30 09:04:16] [INFO ] Redundant transitions in 45 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18601 ms. Remains : 507/507 places, 2197/2197 transitions.
Knowledge obtained : [(AND p2 p1), (X p1), (X p2), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 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 79 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p2), (NOT p2)]
Support contains 169 out of 507 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 17 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 09:04:16] [INFO ] Invariant cache hit.
[2024-05-30 09:04:17] [INFO ] Implicit Places using invariants in 1166 ms returned []
[2024-05-30 09:04:17] [INFO ] Invariant cache hit.
[2024-05-30 09:04:31] [INFO ] Implicit Places using invariants and state equation in 14206 ms returned []
Implicit Place search using SMT with State Equation took 15375 ms to find 0 implicit places.
[2024-05-30 09:04:31] [INFO ] Redundant transitions in 43 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15442 ms. Remains : 507/507 places, 2197/2197 transitions.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p2, (X p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 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 68 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (268 resets) in 6865 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 626 ms. (63 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 437869 steps, run timeout after 6001 ms. (steps per millisecond=72 ) properties seen :0 out of 1
Probabilistic random walk after 437869 steps, saw 250292 distinct states, run finished after 6001 ms. (steps per millisecond=72 ) properties seen :0
[2024-05-30 09:04:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 326/495 variables, 26/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 326/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/507 variables, 12/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 12/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2704/2704 variables, and 1052 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1030 ms.
Refiners :[Domain max(s): 507/507 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 326/495 variables, 26/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 326/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/507 variables, 12/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 12/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/2704 variables, and 1052 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2617 ms.
Refiners :[Domain max(s): 507/507 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3682ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 169 out of 507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 35 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 507/507 places, 2197/2197 transitions.
RANDOM walk for 40000 steps (268 resets) in 7152 ms. (5 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 549 ms. (72 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 437139 steps, run timeout after 6001 ms. (steps per millisecond=72 ) properties seen :0 out of 1
Probabilistic random walk after 437139 steps, saw 250085 distinct states, run finished after 6001 ms. (steps per millisecond=72 ) properties seen :0
[2024-05-30 09:04:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 326/495 variables, 26/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 326/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/507 variables, 12/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 12/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2197/2704 variables, 507/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/2704 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2704 variables, 0/1052 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2704/2704 variables, and 1052 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1058 ms.
Refiners :[Domain max(s): 507/507 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 169/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 326/495 variables, 26/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/495 variables, 326/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/495 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/507 variables, 12/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 12/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2704/2704 variables, and 1052 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9419 ms.
Refiners :[Domain max(s): 507/507 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 507/507 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10522ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 169 out of 507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 29 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 507/507 places, 2197/2197 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 23 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 09:05:03] [INFO ] Invariant cache hit.
[2024-05-30 09:05:05] [INFO ] Implicit Places using invariants in 2228 ms returned []
[2024-05-30 09:05:05] [INFO ] Invariant cache hit.
[2024-05-30 09:05:22] [INFO ] Implicit Places using invariants and state equation in 17189 ms returned []
Implicit Place search using SMT with State Equation took 19419 ms to find 0 implicit places.
[2024-05-30 09:05:22] [INFO ] Redundant transitions in 40 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19492 ms. Remains : 507/507 places, 2197/2197 transitions.
Knowledge obtained : [p2, (X p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 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 p2), (NOT p2)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p2), (NOT p2)]
Product exploration timeout after 74140 steps with 500 reset in 10003 ms.
Product exploration timeout after 73570 steps with 496 reset in 10001 ms.
Built C files in :
/tmp/ltsmin4023642619275240830
[2024-05-30 09:05:42] [INFO ] Too many transitions (2197) to apply POR reductions. Disabling POR matrices.
[2024-05-30 09:05:42] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4023642619275240830
Running compilation step : cd /tmp/ltsmin4023642619275240830;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin4023642619275240830;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin4023642619275240830;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 169 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 28 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 09:05:45] [INFO ] Invariant cache hit.
[2024-05-30 09:05:48] [INFO ] Implicit Places using invariants in 2258 ms returned []
[2024-05-30 09:05:48] [INFO ] Invariant cache hit.
[2024-05-30 09:06:05] [INFO ] Implicit Places using invariants and state equation in 16833 ms returned []
Implicit Place search using SMT with State Equation took 19094 ms to find 0 implicit places.
[2024-05-30 09:06:05] [INFO ] Redundant transitions in 46 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19179 ms. Remains : 507/507 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin10781790991232283760
[2024-05-30 09:06:05] [INFO ] Too many transitions (2197) to apply POR reductions. Disabling POR matrices.
[2024-05-30 09:06:05] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10781790991232283760
Running compilation step : cd /tmp/ltsmin10781790991232283760;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin10781790991232283760;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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/ltsmin10781790991232283760;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/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:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-30 09:06:08] [INFO ] Flatten gal took : 61 ms
[2024-05-30 09:06:08] [INFO ] Flatten gal took : 80 ms
[2024-05-30 09:06:08] [INFO ] Time to serialize gal into /tmp/LTL663876226537991700.gal : 9 ms
[2024-05-30 09:06:08] [INFO ] Time to serialize properties into /tmp/LTL17467065856827364446.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL663876226537991700.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2917161726909868593.hoa' '-atoms' '/tmp/LTL17467065856827364446.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL17467065856827364446.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2917161726909868593.hoa
Detected timeout of ITS tools.
[2024-05-30 09:06:23] [INFO ] Flatten gal took : 61 ms
[2024-05-30 09:06:23] [INFO ] Flatten gal took : 61 ms
[2024-05-30 09:06:23] [INFO ] Time to serialize gal into /tmp/LTL1297351844086257711.gal : 8 ms
[2024-05-30 09:06:23] [INFO ] Time to serialize properties into /tmp/LTL14966280850262158576.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1297351844086257711.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14966280850262158576.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((("(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows_0_10+R...10252
Formula 0 simplified : FG!"(((((((((Rows_0_0+Rows_0_1)+(Rows_0_2+Rows_0_3))+((Rows_0_4+Rows_0_5)+(Rows_0_6+Rows_0_7)))+(((Rows_0_8+Rows_0_9)+(Rows_0_10+Row...8296
Detected timeout of ITS tools.
[2024-05-30 09:06:38] [INFO ] Flatten gal took : 61 ms
[2024-05-30 09:06:38] [INFO ] Applying decomposition
[2024-05-30 09:06:38] [INFO ] Flatten gal took : 72 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6186037169426106751.txt' '-o' '/tmp/graph6186037169426106751.bin' '-w' '/tmp/graph6186037169426106751.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6186037169426106751.bin' '-l' '-1' '-v' '-w' '/tmp/graph6186037169426106751.weights' '-q' '0' '-e' '0.001'
[2024-05-30 09:06:39] [INFO ] Decomposing Gal with order
[2024-05-30 09:06:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 09:06:40] [INFO ] Removed a total of 6084 redundant transitions.
[2024-05-30 09:06:40] [INFO ] Flatten gal took : 955 ms
[2024-05-30 09:06:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2024-05-30 09:06:40] [INFO ] Time to serialize gal into /tmp/LTL9286761262404715116.gal : 24 ms
[2024-05-30 09:06:40] [INFO ] Time to serialize properties into /tmp/LTL12048826126322040190.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9286761262404715116.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12048826126322040190.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((("(((((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_0_6+gu0.Rows_0_7)))+((...13970
Formula 0 simplified : FG!"(((((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_0_6+gu0.Rows_0_7)))+(((g...11338
Detected timeout of ITS tools.
Treatment of property Sudoku-PT-AN13-LTLCardinality-07 finished in 245084 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((X(!F(!X(p0))) U p0)))))'
Support contains 2 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 507 are kept as prefixes of interest. Removing 2197 places using SCC suffix rule.8 ms
Discarding 2197 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 60 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 09:06:55] [INFO ] Invariant cache hit.
[2024-05-30 09:06:58] [INFO ] Implicit Places using invariants in 3316 ms returned []
[2024-05-30 09:06:58] [INFO ] Invariant cache hit.
[2024-05-30 09:07:30] [INFO ] Implicit Places using invariants and state equation in 31224 ms returned []
Implicit Place search using SMT with State Equation took 34545 ms to find 0 implicit places.
[2024-05-30 09:07:30] [INFO ] Redundant transitions in 43 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Starting structural reductions in SI_LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34661 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-08
Stuttering criterion allowed to conclude after 594 steps with 3 reset in 80 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-08 finished in 34869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 48 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
[2024-05-30 09:07:30] [INFO ] Invariant cache hit.
[2024-05-30 09:07:33] [INFO ] Implicit Places using invariants in 3327 ms returned []
[2024-05-30 09:07:33] [INFO ] Invariant cache hit.
[2024-05-30 09:08:05] [INFO ] Implicit Places using invariants and state equation in 31587 ms returned []
Implicit Place search using SMT with State Equation took 34921 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34971 ms. Remains : 507/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-09 finished in 35106 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1)&&F(G(p2)))))'
Support contains 4 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 508 are kept as prefixes of interest. Removing 2196 places using SCC suffix rule.7 ms
Discarding 2196 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 68 ms. Remains 508 /2704 variables (removed 2196) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 508 cols
[2024-05-30 09:08:05] [INFO ] Computed 38 invariants in 92 ms
[2024-05-30 09:08:08] [INFO ] Implicit Places using invariants in 3402 ms returned []
[2024-05-30 09:08:08] [INFO ] Invariant cache hit.
[2024-05-30 09:08:49] [INFO ] Performed 5/508 implicitness test of which 0 returned IMPLICIT in 39 seconds.
[2024-05-30 09:08:57] [INFO ] Implicit Places using invariants and state equation in 48512 ms returned []
Implicit Place search using SMT with State Equation took 51916 ms to find 0 implicit places.
[2024-05-30 09:08:57] [INFO ] Redundant transitions in 43 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 508/2704 places, 2197/2197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52041 ms. Remains : 508/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-10
Stuttering criterion allowed to conclude after 227 steps with 2 reset in 48 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-10 finished in 52259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||p0))))'
Support contains 2 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 508 are kept as prefixes of interest. Removing 2196 places using SCC suffix rule.3 ms
Discarding 2196 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 56 ms. Remains 508 /2704 variables (removed 2196) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 508 cols
[2024-05-30 09:08:57] [INFO ] Computed 38 invariants in 69 ms
[2024-05-30 09:09:01] [INFO ] Implicit Places using invariants in 3380 ms returned []
[2024-05-30 09:09:01] [INFO ] Invariant cache hit.
[2024-05-30 09:09:44] [INFO ] Performed 3/508 implicitness test of which 0 returned IMPLICIT in 39 seconds.
[2024-05-30 09:10:07] [INFO ] Implicit Places using invariants and state equation in 66857 ms returned []
Implicit Place search using SMT with State Equation took 70238 ms to find 0 implicit places.
[2024-05-30 09:10:07] [INFO ] Redundant transitions in 40 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 508/2704 places, 2197/2197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70347 ms. Remains : 508/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-11
Stuttering criterion allowed to conclude after 3571 steps with 23 reset in 461 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-11 finished in 70993 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 2704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Graph (complete) has 6591 edges and 2704 vertex of which 508 are kept as prefixes of interest. Removing 2196 places using SCC suffix rule.2 ms
Discarding 2196 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 54 ms. Remains 508 /2704 variables (removed 2196) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 508 cols
[2024-05-30 09:10:08] [INFO ] Computed 38 invariants in 65 ms
[2024-05-30 09:10:11] [INFO ] Implicit Places using invariants in 3172 ms returned []
[2024-05-30 09:10:11] [INFO ] Invariant cache hit.
[2024-05-30 09:10:45] [INFO ] Performed 1/508 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-30 09:11:17] [INFO ] Performed 3/508 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-30 09:11:49] [INFO ] Performed 5/508 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-30 09:12:23] [INFO ] Performed 13/508 implicitness test of which 0 returned IMPLICIT in 130 seconds.
[2024-05-30 09:12:23] [INFO ] Timeout of Implicit test with SMT after 130 seconds.
[2024-05-30 09:12:23] [INFO ] Implicit Places using invariants and state equation in 131627 ms returned []
Implicit Place search using SMT with State Equation took 134800 ms to find 0 implicit places.
[2024-05-30 09:12:23] [INFO ] Redundant transitions in 47 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 508/2704 places, 2197/2197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134915 ms. Remains : 508/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-12
Stuttering criterion allowed to conclude after 147 steps with 0 reset in 24 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-12 finished in 135010 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0&&X(p1)) U p2)||X(X(G(p3)))))'
Support contains 7 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2194 places and 0 transitions.
Iterating post reduction 0 with 2194 rules applied. Total rules applied 2194 place count 510 transition count 2197
Applied a total of 2194 rules in 45 ms. Remains 510 /2704 variables (removed 2194) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 510 cols
[2024-05-30 09:12:23] [INFO ] Computed 38 invariants in 172 ms
[2024-05-30 09:12:27] [INFO ] Implicit Places using invariants in 3528 ms returned []
[2024-05-30 09:12:27] [INFO ] Invariant cache hit.
[2024-05-30 09:13:04] [INFO ] Performed 5/510 implicitness test of which 0 returned IMPLICIT in 34 seconds.
[2024-05-30 09:13:10] [INFO ] Implicit Places using invariants and state equation in 43352 ms returned []
Implicit Place search using SMT with State Equation took 46882 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 510/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46929 ms. Remains : 510/2704 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 239 ms :[true, (OR (NOT p2) (NOT p1)), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3)]
Running random walk in product with property : Sudoku-PT-AN13-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA Sudoku-PT-AN13-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLCardinality-13 finished in 47195 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((p0 U (X(p1) U ((p1&&X(p1))||X(G(p1))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&G(F(p2)))))'
[2024-05-30 09:13:11] [INFO ] Flatten gal took : 156 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7439111279451599253
[2024-05-30 09:13:11] [INFO ] Too many transitions (2197) to apply POR reductions. Disabling POR matrices.
[2024-05-30 09:13:11] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7439111279451599253
Running compilation step : cd /tmp/ltsmin7439111279451599253;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-30 09:13:11] [INFO ] Applying decomposition
[2024-05-30 09:13:11] [INFO ] Flatten gal took : 188 ms
Compilation finished in 8195 ms.
Running link step : cd /tmp/ltsmin7439111279451599253;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin7439111279451599253;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(((LTLAPp0==true) U (X((LTLAPp1==true)) U (((LTLAPp1==true)&&X((LTLAPp1==true)))||X([]((LTLAPp1==true))))))))' '--buchi-type=spotba'
[2024-05-30 09:13:28] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph6849964398361068937.txt' '-o' '/tmp/graph6849964398361068937.bin' '-w' '/tmp/graph6849964398361068937.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:114)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:106)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1011)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-30 09:13:29] [INFO ] Flatten gal took : 300 ms
[2024-05-30 09:13:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality11313799745337002703.gal : 53 ms
[2024-05-30 09:13:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality8611774328807827372.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11313799745337002703.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8611774328807827372.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !(((G("(((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)+(Ce...133420
Formula 0 simplified : F!"(((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)+(Cell...133406
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: 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( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.045: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.045: LTL layer: formula: ([]((LTLAPp0==true))||X(((LTLAPp0==true) U (X((LTLAPp1==true)) U (((LTLAPp1==true)&&X((LTLAPp1==true)))||X([]((LTLAPp1==true))))))))
pins2lts-mc-linux64( 1/ 8), 0.045: "([]((LTLAPp0==true))||X(((LTLAPp0==true) U (X((LTLAPp1==true)) U (((LTLAPp1==true)&&X((LTLAPp1==true)))||X([]((LTLAPp1==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.046: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.056: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.068: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.070: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.085: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.090: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.096: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.154: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 5.796: DFS-FIFO for weak LTL, using special progress label 2203
pins2lts-mc-linux64( 0/ 8), 5.796: There are 2204 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 5.796: State length is 2705, there are 2215 groups
pins2lts-mc-linux64( 0/ 8), 5.796: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 5.796: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 5.796: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 5.796: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 30.392: ~1 levels ~960 states ~2073896 transitions
pins2lts-mc-linux64( 7/ 8), 41.973: ~1 levels ~1920 states ~4130520 transitions
pins2lts-mc-linux64( 3/ 8), 64.787: ~1 levels ~3840 states ~8163544 transitions
pins2lts-mc-linux64( 4/ 8), 85.205: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 125.708:
pins2lts-mc-linux64( 0/ 8), 125.708: mean standard work distribution: 1.0% (states) 1.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 125.708:
pins2lts-mc-linux64( 0/ 8), 125.708: Explored 5336 states 11394421 transitions, fanout: 2135.386
pins2lts-mc-linux64( 0/ 8), 125.708: Total exploration time 119.850 sec (84.890 sec minimum, 103.306 sec on average)
pins2lts-mc-linux64( 0/ 8), 125.708: States per second: 45, Transitions per second: 95072
pins2lts-mc-linux64( 0/ 8), 125.708:
pins2lts-mc-linux64( 0/ 8), 125.708: Progress states detected: 8627884
pins2lts-mc-linux64( 0/ 8), 125.708: Redundant explorations: -99.9382
pins2lts-mc-linux64( 0/ 8), 125.708:
pins2lts-mc-linux64( 0/ 8), 125.708: Queue width: 8B, total height: 9590399, memory: 73.17MB
pins2lts-mc-linux64( 0/ 8), 125.708: Tree memory: 321.8MB, 39.1 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 125.708: Tree fill ratio (roots/leafs): 6.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 125.708: Stored 2289 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 125.708: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 125.708: Est. total memory use: 395.0MB (~1097.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7439111279451599253;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(((LTLAPp0==true) U (X((LTLAPp1==true)) U (((LTLAPp1==true)&&X((LTLAPp1==true)))||X([]((LTLAPp1==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7439111279451599253;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp0==true))||X(((LTLAPp0==true) U (X((LTLAPp1==true)) U (((LTLAPp1==true)&&X((LTLAPp1==true)))||X([]((LTLAPp1==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-05-30 09:23:02] [INFO ] Applying decomposition
[2024-05-30 09:23:02] [INFO ] Flatten gal took : 90 ms
[2024-05-30 09:23:02] [INFO ] Decomposing Gal with order
[2024-05-30 09:23:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 09:23:02] [INFO ] Removed a total of 4056 redundant transitions.
[2024-05-30 09:23:03] [INFO ] Flatten gal took : 250 ms
[2024-05-30 09:23:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2024-05-30 09:23:03] [INFO ] Time to serialize gal into /tmp/LTLCardinality15448226230341415791.gal : 15 ms
[2024-05-30 09:23:03] [INFO ] Time to serialize properties into /tmp/LTLCardinality2436985611657178321.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality15448226230341415791.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2436985611657178321.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.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !(((G("(((((((((gu183.Cells_0_0+gu184.Cells_0_1)+(gu185.Cells_0_2+gu186.Cells_0_3))+((gu187.Cells_0_4+gu188.Cells_0_5)+(gu189.Cells_0_...182536
Formula 0 simplified : F!"(((((((((gu183.Cells_0_0+gu184.Cells_0_1)+(gu185.Cells_0_2+gu186.Cells_0_3))+((gu187.Cells_0_4+gu188.Cells_0_5)+(gu189.Cells_0_6+...182522
ITS-tools command line returned an error code 137
[2024-05-30 09:33:00] [INFO ] Flatten gal took : 86 ms
[2024-05-30 09:33:00] [INFO ] Input system was already deterministic with 2197 transitions.
[2024-05-30 09:33:00] [INFO ] Transformed 2704 places.
[2024-05-30 09:33:00] [INFO ] Transformed 2197 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-30 09:33:01] [INFO ] Time to serialize gal into /tmp/LTLCardinality14158775257875871710.gal : 11 ms
[2024-05-30 09:33:01] [INFO ] Time to serialize properties into /tmp/LTLCardinality11503289315045456471.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.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14158775257875871710.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11503289315045456471.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((G("(((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)+(Ce...133420
Formula 0 simplified : F!"(((((((((Cells_0_0+Cells_0_1)+(Cells_0_2+Cells_0_3))+((Cells_0_4+Cells_0_5)+(Cells_0_6+Cells_0_7)))+(((Cells_0_8+Cells_0_9)+(Cell...133406
ITS-tools command line returned an error code 137
Total runtime 2829582 ms.

BK_STOP 1717062158518

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

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