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-171690532800627.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-AN08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532800627
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 178K Apr 12 11:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 897K Apr 12 11:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 437K Apr 12 11:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.1M Apr 12 11:43 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 163K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 564K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 227K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 820K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 521K Apr 12 12:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.6M Apr 12 12:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 652K Apr 12 12:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.1M Apr 12 12:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 51K 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 298K 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-AN08-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717051660196

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-AN08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-30 06:47:41] [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 06:47:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 06:47:41] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-05-30 06:47:41] [INFO ] Transformed 704 places.
[2024-05-30 06:47:41] [INFO ] Transformed 512 transitions.
[2024-05-30 06:47:41] [INFO ] Found NUPN structural information;
[2024-05-30 06:47:41] [INFO ] Parsed PT model containing 704 places and 512 transitions and 2048 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 44 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-AN08-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN08-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 704 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 14 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2024-05-30 06:47:41] [INFO ] Computed 192 invariants in 25 ms
[2024-05-30 06:47:42] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-30 06:47:42] [INFO ] Invariant cache hit.
[2024-05-30 06:47:42] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 748 ms. Remains : 704/704 places, 512/512 transitions.
Support contains 704 out of 704 places after structural reductions.
[2024-05-30 06:47:42] [INFO ] Flatten gal took : 86 ms
[2024-05-30 06:47:42] [INFO ] Flatten gal took : 47 ms
[2024-05-30 06:47:43] [INFO ] Input system was already deterministic with 512 transitions.
RANDOM walk for 40000 steps (716 resets) in 4103 ms. (9 steps per ms) remains 11/24 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 421 ms. (94 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 959 ms. (41 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 376 ms. (106 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 11/11 properties
[2024-05-30 06:47:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 704/704 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 192/896 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/704 variables, 0/896 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 512/1216 variables, 704/1600 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1216 variables, 0/1600 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/1216 variables, 0/1600 constraints. Problems are: Problem set: 5 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1216/1216 variables, and 1600 constraints, problems are : Problem set: 5 solved, 6 unsolved in 1372 ms.
Refiners :[Domain max(s): 704/704 constraints, Positive P Invariants (semi-flows): 192/192 constraints, State Equation: 704/704 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 192/192 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 0/192 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 512/704 variables, 192/384 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/704 variables, 512/896 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/704 variables, 0/896 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 512/1216 variables, 704/1600 constraints. Problems are: Problem set: 5 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1216/1216 variables, and 1606 constraints, problems are : Problem set: 5 solved, 6 unsolved in 5017 ms.
Refiners :[Domain max(s): 704/704 constraints, Positive P Invariants (semi-flows): 192/192 constraints, State Equation: 704/704 constraints, PredecessorRefiner: 6/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 6919ms problems are : Problem set: 5 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 192 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 512/512 transitions.
Graph (complete) has 1536 edges and 704 vertex of which 192 are kept as prefixes of interest. Removing 512 places using SCC suffix rule.2 ms
Discarding 512 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 192/704 places, 512/512 transitions.
RANDOM walk for 40000 steps (717 resets) in 1698 ms. (23 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 110904 steps, run visited all 6 properties in 1032 ms. (steps per millisecond=107 )
Probabilistic random walk after 110904 steps, saw 34413 distinct states, run finished after 1036 ms. (steps per millisecond=107 ) properties seen :6
FORMULA Sudoku-PT-AN08-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 12 simplifications.
FORMULA Sudoku-PT-AN08-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN08-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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' '!((F(X((F(p0) U X(p0))))&&!(p0 U p1)))'
Support contains 640 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 9 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 06:47:54] [INFO ] Invariant cache hit.
[2024-05-30 06:47:54] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-05-30 06:47:54] [INFO ] Invariant cache hit.
[2024-05-30 06:47:55] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 816 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 825 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) p1), true, p1, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 36 steps with 1 reset in 11 ms.
FORMULA Sudoku-PT-AN08-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN08-LTLCardinality-00 finished in 1148 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))'
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 31 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 06:47:55] [INFO ] Invariant cache hit.
[2024-05-30 06:47:56] [INFO ] Implicit Places using invariants in 641 ms returned []
[2024-05-30 06:47:56] [INFO ] Invariant cache hit.
[2024-05-30 06:47:57] [INFO ] Implicit Places using invariants and state equation in 772 ms returned []
Implicit Place search using SMT with State Equation took 1416 ms to find 0 implicit places.
[2024-05-30 06:47:57] [INFO ] Redundant transitions in 34 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 1494 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-01
Product exploration explored 100000 steps with 3030 reset in 5759 ms.
Product exploration explored 100000 steps with 3030 reset in 5772 ms.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 128 steps (0 resets) in 22 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-05-30 06:48:12] [INFO ] Invariant cache hit.
[2024-05-30 06:48:14] [INFO ] [Real]Absence check using 192 positive place invariants in 228 ms returned sat
[2024-05-30 06:48:16] [INFO ] [Real]Absence check using state equation in 1390 ms returned sat
[2024-05-30 06:48:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 06:48:18] [INFO ] [Nat]Absence check using 192 positive place invariants in 45 ms returned sat
[2024-05-30 06:48:18] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2024-05-30 06:48:18] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 27 ms.
[2024-05-30 06:48:18] [INFO ] Added : 0 causal constraints over 0 iterations in 80 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 14 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 06:48:19] [INFO ] Invariant cache hit.
[2024-05-30 06:48:19] [INFO ] Implicit Places using invariants in 608 ms returned []
[2024-05-30 06:48:19] [INFO ] Invariant cache hit.
[2024-05-30 06:48:20] [INFO ] Implicit Places using invariants and state equation in 772 ms returned []
Implicit Place search using SMT with State Equation took 1383 ms to find 0 implicit places.
[2024-05-30 06:48:20] [INFO ] Redundant transitions in 7 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 1410 ms. Remains : 704/704 places, 512/512 transitions.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 128 steps (0 resets) in 23 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-30 06:48:24] [INFO ] Invariant cache hit.
[2024-05-30 06:48:26] [INFO ] [Real]Absence check using 192 positive place invariants in 221 ms returned sat
[2024-05-30 06:48:27] [INFO ] [Real]Absence check using state equation in 1407 ms returned sat
[2024-05-30 06:48:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 06:48:30] [INFO ] [Nat]Absence check using 192 positive place invariants in 43 ms returned sat
[2024-05-30 06:48:30] [INFO ] [Nat]Absence check using state equation in 180 ms returned sat
[2024-05-30 06:48:30] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 23 ms.
[2024-05-30 06:48:30] [INFO ] Added : 0 causal constraints over 0 iterations in 74 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3030 reset in 5666 ms.
Product exploration explored 100000 steps with 3030 reset in 5732 ms.
Built C files in :
/tmp/ltsmin12320806916934663152
[2024-05-30 06:48:41] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-30 06:48:41] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:48:41] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-30 06:48:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:48:42] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-30 06:48:42] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:48:42] [INFO ] Built C files in 99ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12320806916934663152
Running compilation step : cd /tmp/ltsmin12320806916934663152;'/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'
Compilation finished in 1840 ms.
Running link step : cd /tmp/ltsmin12320806916934663152;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin12320806916934663152;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7279915564256923439.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 21 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 06:48:57] [INFO ] Invariant cache hit.
[2024-05-30 06:48:57] [INFO ] Implicit Places using invariants in 613 ms returned []
[2024-05-30 06:48:57] [INFO ] Invariant cache hit.
[2024-05-30 06:48:58] [INFO ] Implicit Places using invariants and state equation in 731 ms returned []
Implicit Place search using SMT with State Equation took 1346 ms to find 0 implicit places.
[2024-05-30 06:48:58] [INFO ] Redundant transitions in 5 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 1377 ms. Remains : 704/704 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin12726136114667901205
[2024-05-30 06:48:58] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-30 06:48:58] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:48:58] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-30 06:48:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:48:58] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-30 06:48:58] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:48:58] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12726136114667901205
Running compilation step : cd /tmp/ltsmin12726136114667901205;'/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'
Compilation finished in 1618 ms.
Running link step : cd /tmp/ltsmin12726136114667901205;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin12726136114667901205;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18282860947032400289.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 06:49:13] [INFO ] Flatten gal took : 34 ms
[2024-05-30 06:49:13] [INFO ] Flatten gal took : 33 ms
[2024-05-30 06:49:13] [INFO ] Time to serialize gal into /tmp/LTL346383845497872589.gal : 8 ms
[2024-05-30 06:49:13] [INFO ] Time to serialize properties into /tmp/LTL12896392879169793293.prop : 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/LTL346383845497872589.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17319924154584405446.hoa' '-atoms' '/tmp/LTL12896392879169793293.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...318
Loading property file /tmp/LTL12896392879169793293.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17319924154584405446.hoa
Detected timeout of ITS tools.
[2024-05-30 06:49:28] [INFO ] Flatten gal took : 31 ms
[2024-05-30 06:49:28] [INFO ] Flatten gal took : 27 ms
[2024-05-30 06:49:28] [INFO ] Time to serialize gal into /tmp/LTL4341486947174879660.gal : 5 ms
[2024-05-30 06:49:28] [INFO ] Time to serialize properties into /tmp/LTL16716422491205198783.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/LTL4341486947174879660.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16716422491205198783.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("(((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns_1_0...8093
Formula 0 simplified : G!"(((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns_1_0+...8089
Detected timeout of ITS tools.
[2024-05-30 06:49:43] [INFO ] Flatten gal took : 26 ms
[2024-05-30 06:49:43] [INFO ] Applying decomposition
[2024-05-30 06:49:43] [INFO ] Flatten gal took : 26 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/graph13211163844964922577.txt' '-o' '/tmp/graph13211163844964922577.bin' '-w' '/tmp/graph13211163844964922577.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13211163844964922577.bin' '-l' '-1' '-v' '-w' '/tmp/graph13211163844964922577.weights' '-q' '0' '-e' '0.001'
[2024-05-30 06:49:44] [INFO ] Decomposing Gal with order
[2024-05-30 06:49:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 06:49:44] [INFO ] Removed a total of 645 redundant transitions.
[2024-05-30 06:49:45] [INFO ] Flatten gal took : 338 ms
[2024-05-30 06:49:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 180 labels/synchronizations in 21 ms.
[2024-05-30 06:49:45] [INFO ] Time to serialize gal into /tmp/LTL9580334407038234510.gal : 7 ms
[2024-05-30 06:49:45] [INFO ] Time to serialize properties into /tmp/LTL6530797663149540056.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/LTL9580334407038234510.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6530797663149540056.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...275
Read 1 LTL properties
Checking formula 0 : !((F("(((((((gu90.Columns_0_0+gu90.Columns_0_1)+(gu90.Columns_0_2+gu90.Columns_0_3))+((gu90.Columns_0_4+gu90.Columns_0_5)+(gu90.Column...10973
Formula 0 simplified : G!"(((((((gu90.Columns_0_0+gu90.Columns_0_1)+(gu90.Columns_0_2+gu90.Columns_0_3))+((gu90.Columns_0_4+gu90.Columns_0_5)+(gu90.Columns...10969
Detected timeout of ITS tools.
Treatment of property Sudoku-PT-AN08-LTLCardinality-01 finished in 124455 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||X((((p1 U p2)||G(F(p3))) U (p0&&((p1 U p2)||G(F(p3))))))))))'
Support contains 640 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 6 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 06:50:00] [INFO ] Invariant cache hit.
[2024-05-30 06:50:00] [INFO ] Implicit Places using invariants in 444 ms returned []
[2024-05-30 06:50:00] [INFO ] Invariant cache hit.
[2024-05-30 06:50:01] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 1006 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 1013 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 326 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-02
Product exploration explored 100000 steps with 1796 reset in 3176 ms.
Product exploration explored 100000 steps with 1799 reset in 3140 ms.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p2) p1 (NOT p3)), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 1098 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 7 states, 25 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 470 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
RANDOM walk for 40000 steps (717 resets) in 2228 ms. (17 steps per ms) remains 9/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 746 ms. (53 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 677 ms. (59 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 648 ms. (61 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 836 ms. (47 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 645 ms. (61 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 883 ms. (45 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 9/9 properties
[2024-05-30 06:50:23] [INFO ] Invariant cache hit.
Problem apf5 is UNSAT
Problem apf7 is UNSAT
Problem apf8 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 640/640 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 128/768 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 0/768 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 64/704 variables, 64/832 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/704 variables, 64/896 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/704 variables, 0/896 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 512/1216 variables, 704/1600 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1216 variables, 0/1600 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1216 variables, 0/1600 constraints. Problems are: Problem set: 5 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1216/1216 variables, and 1600 constraints, problems are : Problem set: 5 solved, 4 unsolved in 1317 ms.
Refiners :[Domain max(s): 704/704 constraints, Positive P Invariants (semi-flows): 192/192 constraints, State Equation: 704/704 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 640/640 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 128/768 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 0/768 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 64/704 variables, 64/832 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/704 variables, 64/896 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/704 variables, 0/896 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 512/1216 variables, 704/1600 constraints. Problems are: Problem set: 5 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1216/1216 variables, and 1604 constraints, problems are : Problem set: 5 solved, 4 unsolved in 5008 ms.
Refiners :[Domain max(s): 704/704 constraints, Positive P Invariants (semi-flows): 192/192 constraints, State Equation: 704/704 constraints, PredecessorRefiner: 4/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 7030ms problems are : Problem set: 5 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 640 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 12 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 704/704 places, 512/512 transitions.
RANDOM walk for 40000 steps (716 resets) in 2225 ms. (17 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 946 ms. (42 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 110898 steps, run visited all 4 properties in 1045 ms. (steps per millisecond=106 )
Probabilistic random walk after 110898 steps, saw 34881 distinct states, run finished after 1045 ms. (steps per millisecond=106 ) properties seen :4
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1 (NOT p3)), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (G (AND (OR p0 (NOT p1) p3) (OR p0 (NOT p2) p3))), (G (OR p0 (NOT p1) p2 p3)), (G (OR (NOT p0) p1 p2 p3)), (G (OR p0 p1 p2 p3)), (G (OR p1 p2))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (F (NOT (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (F (NOT p1)), (F p2), (F p3), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND p0 p1 (NOT p2))))]
Knowledge based reduction with 25 factoid took 2670 ms. Reduced automaton from 7 states, 25 edges and 4 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 64 out of 704 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 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 14 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 06:50:35] [INFO ] Invariant cache hit.
[2024-05-30 06:50:35] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-05-30 06:50:35] [INFO ] Invariant cache hit.
[2024-05-30 06:50:36] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
[2024-05-30 06:50:36] [INFO ] Redundant transitions in 5 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 854 ms. Remains : 704/704 places, 512/512 transitions.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 161 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 58 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (716 resets) in 1737 ms. (23 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 110898 steps, run visited all 1 properties in 472 ms. (steps per millisecond=234 )
Probabilistic random walk after 110898 steps, saw 34881 distinct states, run finished after 472 ms. (steps per millisecond=234 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 139 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1799 reset in 3116 ms.
Product exploration explored 100000 steps with 1798 reset in 3151 ms.
Built C files in :
/tmp/ltsmin5535674603280951065
[2024-05-30 06:50:45] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-30 06:50:45] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:50:45] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-30 06:50:45] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:50:45] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-30 06:50:45] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:50:45] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5535674603280951065
Running compilation step : cd /tmp/ltsmin5535674603280951065;'/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'
Compilation finished in 1528 ms.
Running link step : cd /tmp/ltsmin5535674603280951065;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin5535674603280951065;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8417189086086716443.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 64 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Graph (complete) has 1536 edges and 704 vertex of which 192 are kept as prefixes of interest. Removing 512 places using SCC suffix rule.4 ms
Discarding 512 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 34 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2024-05-30 06:51:00] [INFO ] Computed 23 invariants in 31 ms
[2024-05-30 06:51:01] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-30 06:51:01] [INFO ] Invariant cache hit.
[2024-05-30 06:51:01] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 826 ms to find 0 implicit places.
[2024-05-30 06:51:01] [INFO ] Redundant transitions in 2 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 : 192/704 places, 512/512 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 875 ms. Remains : 192/704 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin11982426517674373532
[2024-05-30 06:51:01] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-30 06:51:01] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:51:01] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-30 06:51:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:51:01] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-30 06:51:01] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:51:01] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11982426517674373532
Running compilation step : cd /tmp/ltsmin11982426517674373532;'/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'
Compilation finished in 1360 ms.
Running link step : cd /tmp/ltsmin11982426517674373532;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin11982426517674373532;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11159585132327316384.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 06:51:16] [INFO ] Flatten gal took : 39 ms
[2024-05-30 06:51:16] [INFO ] Flatten gal took : 37 ms
[2024-05-30 06:51:16] [INFO ] Time to serialize gal into /tmp/LTL15385197415158608462.gal : 4 ms
[2024-05-30 06:51:16] [INFO ] Time to serialize properties into /tmp/LTL102448187899733269.prop : 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/LTL15385197415158608462.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2102049767552427876.hoa' '-atoms' '/tmp/LTL102448187899733269.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/LTL102448187899733269.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2102049767552427876.hoa
Detected timeout of ITS tools.
[2024-05-30 06:51:32] [INFO ] Flatten gal took : 21 ms
[2024-05-30 06:51:32] [INFO ] Flatten gal took : 21 ms
[2024-05-30 06:51:32] [INFO ] Time to serialize gal into /tmp/LTL7019057655837109648.gal : 4 ms
[2024-05-30 06:51:32] [INFO ] Time to serialize properties into /tmp/LTL14083905157959730458.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/LTL7019057655837109648.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14083905157959730458.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(G(("(((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns_...19444
Formula 0 simplified : GF(!"(((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns_1_...10632
Detected timeout of ITS tools.
[2024-05-30 06:51:47] [INFO ] Flatten gal took : 30 ms
[2024-05-30 06:51:47] [INFO ] Applying decomposition
[2024-05-30 06:51:47] [INFO ] Flatten gal took : 22 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/graph10173024147952947562.txt' '-o' '/tmp/graph10173024147952947562.bin' '-w' '/tmp/graph10173024147952947562.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10173024147952947562.bin' '-l' '-1' '-v' '-w' '/tmp/graph10173024147952947562.weights' '-q' '0' '-e' '0.001'
[2024-05-30 06:51:47] [INFO ] Decomposing Gal with order
[2024-05-30 06:51:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 06:51:47] [INFO ] Removed a total of 896 redundant transitions.
[2024-05-30 06:51:48] [INFO ] Flatten gal took : 265 ms
[2024-05-30 06:51:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-30 06:51:48] [INFO ] Time to serialize gal into /tmp/LTL16573701174359787143.gal : 19 ms
[2024-05-30 06:51:48] [INFO ] Time to serialize properties into /tmp/LTL12276229471834449486.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16573701174359787143.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12276229471834449486.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...277
Read 1 LTL properties
Checking formula 0 : !((F(G(("(((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_0_4+gu2.Columns_0_5)+(gu2.Columns_0_...25076
Formula 0 simplified : GF(!"(((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_0_4+gu2.Columns_0_5)+(gu2.Columns_0_6+...13704
Detected timeout of ITS tools.
Treatment of property Sudoku-PT-AN08-LTLCardinality-02 finished in 123029 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(F((p0&&F(p1))))))'
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 12 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2024-05-30 06:52:03] [INFO ] Computed 192 invariants in 3 ms
[2024-05-30 06:52:03] [INFO ] Implicit Places using invariants in 705 ms returned []
[2024-05-30 06:52:03] [INFO ] Invariant cache hit.
[2024-05-30 06:52:04] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 1436 ms to find 0 implicit places.
[2024-05-30 06:52:04] [INFO ] Redundant transitions in 3 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 1457 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-04
Product exploration explored 100000 steps with 3030 reset in 6699 ms.
Product exploration explored 100000 steps with 3030 reset in 6737 ms.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 177 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (716 resets) in 3824 ms. (10 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1725 ms. (23 steps per ms) remains 1/1 properties
[2024-05-30 06:52:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 576/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 576/1216 variables, and 640 constraints, problems are : Problem set: 1 solved, 0 unsolved in 218 ms.
Refiners :[Domain max(s): 576/704 constraints, Positive P Invariants (semi-flows): 64/192 constraints, State Equation: 0/704 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 335ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 10 factoid took 343 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2024-05-30 06:52:29] [INFO ] Invariant cache hit.
[2024-05-30 06:52:30] [INFO ] [Real]Absence check using 192 positive place invariants in 161 ms returned sat
[2024-05-30 06:52:31] [INFO ] [Real]Absence check using state equation in 935 ms returned sat
[2024-05-30 06:52:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 06:52:34] [INFO ] [Nat]Absence check using 192 positive place invariants in 44 ms returned sat
[2024-05-30 06:52:34] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-30 06:52:34] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 22 ms.
[2024-05-30 06:52:34] [INFO ] Added : 0 causal constraints over 0 iterations in 65 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 9 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 06:52:34] [INFO ] Invariant cache hit.
[2024-05-30 06:52:35] [INFO ] Implicit Places using invariants in 575 ms returned []
[2024-05-30 06:52:35] [INFO ] Invariant cache hit.
[2024-05-30 06:52:36] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 1274 ms to find 0 implicit places.
[2024-05-30 06:52:36] [INFO ] Redundant transitions in 2 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 1291 ms. Remains : 704/704 places, 512/512 transitions.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 128 steps (0 resets) in 17 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
[2024-05-30 06:52:40] [INFO ] Invariant cache hit.
[2024-05-30 06:52:41] [INFO ] [Real]Absence check using 192 positive place invariants in 156 ms returned sat
[2024-05-30 06:52:42] [INFO ] [Real]Absence check using state equation in 937 ms returned sat
[2024-05-30 06:52:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 06:52:45] [INFO ] [Nat]Absence check using 192 positive place invariants in 44 ms returned sat
[2024-05-30 06:52:45] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2024-05-30 06:52:45] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 22 ms.
[2024-05-30 06:52:45] [INFO ] Added : 0 causal constraints over 0 iterations in 72 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3030 reset in 5690 ms.
Product exploration explored 100000 steps with 3030 reset in 5922 ms.
Built C files in :
/tmp/ltsmin18060090146319269947
[2024-05-30 06:52:57] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-30 06:52:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:52:57] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-30 06:52:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:52:57] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-30 06:52:57] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:52:57] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18060090146319269947
Running compilation step : cd /tmp/ltsmin18060090146319269947;'/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'
Compilation finished in 1544 ms.
Running link step : cd /tmp/ltsmin18060090146319269947;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin18060090146319269947;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3632749355384429207.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 576 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 16 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 06:53:12] [INFO ] Invariant cache hit.
[2024-05-30 06:53:12] [INFO ] Implicit Places using invariants in 591 ms returned []
[2024-05-30 06:53:12] [INFO ] Invariant cache hit.
[2024-05-30 06:53:13] [INFO ] Implicit Places using invariants and state equation in 724 ms returned []
Implicit Place search using SMT with State Equation took 1321 ms to find 0 implicit places.
[2024-05-30 06:53:13] [INFO ] Redundant transitions in 3 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 1351 ms. Remains : 704/704 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin18014726861961782894
[2024-05-30 06:53:13] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-30 06:53:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:53:13] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-30 06:53:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:53:13] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-30 06:53:13] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:53:13] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18014726861961782894
Running compilation step : cd /tmp/ltsmin18014726861961782894;'/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'
Compilation finished in 1574 ms.
Running link step : cd /tmp/ltsmin18014726861961782894;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin18014726861961782894;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased898242292192473228.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 06:53:28] [INFO ] Flatten gal took : 21 ms
[2024-05-30 06:53:28] [INFO ] Flatten gal took : 19 ms
[2024-05-30 06:53:28] [INFO ] Time to serialize gal into /tmp/LTL15810221270948385462.gal : 4 ms
[2024-05-30 06:53:28] [INFO ] Time to serialize properties into /tmp/LTL7874534463851291669.prop : 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/LTL15810221270948385462.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2420392936142313623.hoa' '-atoms' '/tmp/LTL7874534463851291669.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...318
Loading property file /tmp/LTL7874534463851291669.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2420392936142313623.hoa
Detected timeout of ITS tools.
[2024-05-30 06:53:43] [INFO ] Flatten gal took : 20 ms
[2024-05-30 06:53:44] [INFO ] Flatten gal took : 21 ms
[2024-05-30 06:53:44] [INFO ] Time to serialize gal into /tmp/LTL148168889684563935.gal : 3 ms
[2024-05-30 06:53:44] [INFO ] Time to serialize properties into /tmp/LTL9172855124902575601.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/LTL148168889684563935.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9172855124902575601.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 : !((X(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_1_0+Cells_1_1)+(Ce...15149
Formula 0 simplified : XG(!"(((((((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_1_0+Cells_1_1)+(Cell...15141
Detected timeout of ITS tools.
[2024-05-30 06:53:59] [INFO ] Flatten gal took : 32 ms
[2024-05-30 06:53:59] [INFO ] Applying decomposition
[2024-05-30 06:53:59] [INFO ] Flatten gal took : 34 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/graph5428831309719111601.txt' '-o' '/tmp/graph5428831309719111601.bin' '-w' '/tmp/graph5428831309719111601.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5428831309719111601.bin' '-l' '-1' '-v' '-w' '/tmp/graph5428831309719111601.weights' '-q' '0' '-e' '0.001'
[2024-05-30 06:53:59] [INFO ] Decomposing Gal with order
[2024-05-30 06:53:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 06:54:00] [INFO ] Removed a total of 448 redundant transitions.
[2024-05-30 06:54:00] [INFO ] Flatten gal took : 319 ms
[2024-05-30 06:54:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 512 labels/synchronizations in 36 ms.
[2024-05-30 06:54:00] [INFO ] Time to serialize gal into /tmp/LTL3616943971596410569.gal : 3 ms
[2024-05-30 06:54:00] [INFO ] Time to serialize properties into /tmp/LTL8033998826522576692.ltl : 115 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/LTL3616943971596410569.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8033998826522576692.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...275
Read 1 LTL properties
Checking formula 0 : !((X(F(("(((((((gu1.Cells_0_0+gu1.Cells_0_1)+(gu1.Cells_0_2+gu1.Cells_0_3))+((gu1.Cells_0_4+gu1.Cells_0_5)+(gu1.Cells_0_6+gu1.Cells_0_...19501
Formula 0 simplified : XG(!"(((((((gu1.Cells_0_0+gu1.Cells_0_1)+(gu1.Cells_0_2+gu1.Cells_0_3))+((gu1.Cells_0_4+gu1.Cells_0_5)+(gu1.Cells_0_6+gu1.Cells_0_7)...19493
Detected timeout of ITS tools.
Treatment of property Sudoku-PT-AN08-LTLCardinality-04 finished in 132273 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((p0||X(G(p0)))))'
Support contains 64 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Reduce places removed 512 places and 0 transitions.
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 192 transition count 512
Applied a total of 512 rules in 10 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2024-05-30 06:54:15] [INFO ] Computed 23 invariants in 9 ms
[2024-05-30 06:54:15] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-05-30 06:54:15] [INFO ] Invariant cache hit.
[2024-05-30 06:54:16] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 959 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 : 192/704 places, 512/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 969 ms. Remains : 192/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN08-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN08-LTLCardinality-06 finished in 1105 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 64 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Reduce places removed 512 places and 0 transitions.
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 192 transition count 512
Applied a total of 512 rules in 4 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
[2024-05-30 06:54:16] [INFO ] Invariant cache hit.
[2024-05-30 06:54:16] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-05-30 06:54:16] [INFO ] Invariant cache hit.
[2024-05-30 06:54:17] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 841 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 : 192/704 places, 512/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 846 ms. Remains : 192/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 4482 ms.
Product exploration explored 100000 steps with 50000 reset in 4518 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 192 transition count 512
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), (X (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 4 factoid took 13 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-AN08-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN08-LTLCardinality-07 finished in 11082 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)))'
Support contains 2 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Graph (complete) has 1536 edges and 704 vertex of which 192 are kept as prefixes of interest. Removing 512 places using SCC suffix rule.1 ms
Discarding 512 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
[2024-05-30 06:54:27] [INFO ] Invariant cache hit.
[2024-05-30 06:54:28] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-30 06:54:28] [INFO ] Invariant cache hit.
[2024-05-30 06:54:28] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 1063 ms to find 0 implicit places.
[2024-05-30 06:54:28] [INFO ] Redundant transitions in 2 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 : 192/704 places, 512/512 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1080 ms. Remains : 192/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-09
Stuttering criterion allowed to conclude after 220 steps with 3 reset in 7 ms.
FORMULA Sudoku-PT-AN08-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN08-LTLCardinality-09 finished in 1153 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(G(p0)))'
Support contains 2 out of 704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Reduce places removed 512 places and 0 transitions.
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 192 transition count 512
Applied a total of 512 rules in 5 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
[2024-05-30 06:54:28] [INFO ] Invariant cache hit.
[2024-05-30 06:54:29] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-30 06:54:29] [INFO ] Invariant cache hit.
[2024-05-30 06:54:29] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 1023 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 : 192/704 places, 512/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1028 ms. Remains : 192/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 71 steps with 1 reset in 5 ms.
FORMULA Sudoku-PT-AN08-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN08-LTLCardinality-10 finished in 1116 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)||F(p1)))'
Support contains 4 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Graph (complete) has 1536 edges and 704 vertex of which 193 are kept as prefixes of interest. Removing 511 places using SCC suffix rule.1 ms
Discarding 511 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 21 ms. Remains 193 /704 variables (removed 511) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 193 cols
[2024-05-30 06:54:29] [INFO ] Computed 23 invariants in 9 ms
[2024-05-30 06:54:30] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-05-30 06:54:30] [INFO ] Invariant cache hit.
[2024-05-30 06:54:31] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 1125 ms to find 0 implicit places.
[2024-05-30 06:54:31] [INFO ] Redundant transitions in 2 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 : 193/704 places, 512/512 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1164 ms. Remains : 193/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-12
Stuttering criterion allowed to conclude after 84 steps with 1 reset in 5 ms.
FORMULA Sudoku-PT-AN08-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN08-LTLCardinality-12 finished in 1244 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))'
Support contains 2 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Graph (complete) has 1536 edges and 704 vertex of which 181 are kept as prefixes of interest. Removing 523 places using SCC suffix rule.2 ms
Discarding 523 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 46 ms. Remains 181 /704 variables (removed 523) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 181 cols
[2024-05-30 06:54:31] [INFO ] Computed 17 invariants in 5 ms
[2024-05-30 06:54:31] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-30 06:54:31] [INFO ] Invariant cache hit.
[2024-05-30 06:54:31] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 719 ms to find 0 implicit places.
[2024-05-30 06:54:31] [INFO ] Redundant transitions in 29 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 : 181/704 places, 512/512 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 801 ms. Remains : 181/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-14
Stuttering criterion allowed to conclude after 213 steps with 4 reset in 12 ms.
FORMULA Sudoku-PT-AN08-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN08-LTLCardinality-14 finished in 854 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))'
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||X((((p1 U p2)||G(F(p3))) U (p0&&((p1 U p2)||G(F(p3))))))))))'
Found a Lengthening insensitive property : Sudoku-PT-AN08-LTLCardinality-02
Stuttering acceptance computed with spot in 270 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 640 out of 704 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 6 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2024-05-30 06:54:32] [INFO ] Computed 192 invariants in 2 ms
[2024-05-30 06:54:33] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-05-30 06:54:33] [INFO ] Invariant cache hit.
[2024-05-30 06:54:33] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 909 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 LI_LTL mode , in 1 iterations and 915 ms. Remains : 704/704 places, 512/512 transitions.
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-02
Product exploration explored 100000 steps with 1797 reset in 3080 ms.
Product exploration explored 100000 steps with 1797 reset in 3142 ms.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p2) p1 (NOT p3)), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 1092 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 7 states, 25 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 307 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3))]
RANDOM walk for 40000 steps (718 resets) in 3729 ms. (10 steps per ms) remains 9/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1038 ms. (38 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1242 ms. (32 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1193 ms. (33 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1379 ms. (28 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 795 ms. (50 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 888 ms. (44 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 9/9 properties
[2024-05-30 06:54:56] [INFO ] Invariant cache hit.
Problem apf5 is UNSAT
Problem apf7 is UNSAT
Problem apf8 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 640/640 constraints. Problems are: Problem set: 3 solved, 6 unsolved
Problem apf2 is UNSAT
Problem apf3 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 128/768 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 0/768 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 64/704 variables, 64/832 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/704 variables, 64/896 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/704 variables, 0/896 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 512/1216 variables, 704/1600 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1216 variables, 0/1600 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/1216 variables, 0/1600 constraints. Problems are: Problem set: 5 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1216/1216 variables, and 1600 constraints, problems are : Problem set: 5 solved, 4 unsolved in 1227 ms.
Refiners :[Domain max(s): 704/704 constraints, Positive P Invariants (semi-flows): 192/192 constraints, State Equation: 704/704 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 640/640 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/640 variables, 128/768 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/640 variables, 0/768 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 64/704 variables, 64/832 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/704 variables, 64/896 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/704 variables, 0/896 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 512/1216 variables, 704/1600 constraints. Problems are: Problem set: 5 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1216/1216 variables, and 1604 constraints, problems are : Problem set: 5 solved, 4 unsolved in 5005 ms.
Refiners :[Domain max(s): 704/704 constraints, Positive P Invariants (semi-flows): 192/192 constraints, State Equation: 704/704 constraints, PredecessorRefiner: 4/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 6766ms problems are : Problem set: 5 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 640 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 9 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 704/704 places, 512/512 transitions.
RANDOM walk for 40000 steps (716 resets) in 3422 ms. (11 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 909 ms. (43 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 110898 steps, run visited all 4 properties in 1166 ms. (steps per millisecond=95 )
Probabilistic random walk after 110898 steps, saw 34881 distinct states, run finished after 1166 ms. (steps per millisecond=95 ) properties seen :4
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1 (NOT p3)), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (G (AND (OR p0 (NOT p1) p3) (OR p0 (NOT p2) p3))), (G (OR p0 (NOT p1) p2 p3)), (G (OR (NOT p0) p1 p2 p3)), (G (OR p0 p1 p2 p3)), (G (OR p1 p2))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (F (NOT (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (F (NOT p1)), (F p2), (F p3), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND p0 p1 (NOT p2))))]
Knowledge based reduction with 25 factoid took 2632 ms. Reduced automaton from 7 states, 25 edges and 4 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 64 out of 704 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 : 704/704 places, 512/512 transitions.
Applied a total of 0 rules in 6 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-30 06:55:08] [INFO ] Invariant cache hit.
[2024-05-30 06:55:08] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-30 06:55:08] [INFO ] Invariant cache hit.
[2024-05-30 06:55:09] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
[2024-05-30 06:55:09] [INFO ] Redundant transitions in 8 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 809 ms. Remains : 704/704 places, 512/512 transitions.
Computed a total of 704 stabilizing places and 512 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 704 transition count 512
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), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 116 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 86 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (717 resets) in 1732 ms. (23 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 110898 steps, run visited all 1 properties in 480 ms. (steps per millisecond=231 )
Probabilistic random walk after 110898 steps, saw 34881 distinct states, run finished after 480 ms. (steps per millisecond=231 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 131 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 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1798 reset in 3086 ms.
Product exploration explored 100000 steps with 1797 reset in 3163 ms.
Built C files in :
/tmp/ltsmin7563768005432713749
[2024-05-30 06:55:18] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-30 06:55:18] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:55:18] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-30 06:55:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:55:18] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-30 06:55:18] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:55:18] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7563768005432713749
Running compilation step : cd /tmp/ltsmin7563768005432713749;'/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'
Compilation finished in 1590 ms.
Running link step : cd /tmp/ltsmin7563768005432713749;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin7563768005432713749;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4468528701217348311.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 64 out of 704 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 704/704 places, 512/512 transitions.
Graph (complete) has 1536 edges and 704 vertex of which 192 are kept as prefixes of interest. Removing 512 places using SCC suffix rule.2 ms
Discarding 512 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2024-05-30 06:55:33] [INFO ] Computed 23 invariants in 11 ms
[2024-05-30 06:55:33] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-30 06:55:33] [INFO ] Invariant cache hit.
[2024-05-30 06:55:34] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
[2024-05-30 06:55:34] [INFO ] Redundant transitions in 6 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 : 192/704 places, 512/512 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 825 ms. Remains : 192/704 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin13450235407210441094
[2024-05-30 06:55:34] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-30 06:55:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:55:34] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-30 06:55:34] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:55:34] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-30 06:55:34] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:55:34] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13450235407210441094
Running compilation step : cd /tmp/ltsmin13450235407210441094;'/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'
Compilation finished in 1367 ms.
Running link step : cd /tmp/ltsmin13450235407210441094;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin13450235407210441094;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11398551803596096771.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-30 06:55:49] [INFO ] Flatten gal took : 15 ms
[2024-05-30 06:55:49] [INFO ] Flatten gal took : 15 ms
[2024-05-30 06:55:49] [INFO ] Time to serialize gal into /tmp/LTL16132087804294366463.gal : 3 ms
[2024-05-30 06:55:49] [INFO ] Time to serialize properties into /tmp/LTL12124471486764498008.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/LTL16132087804294366463.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8464495346384261435.hoa' '-atoms' '/tmp/LTL12124471486764498008.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...319
Loading property file /tmp/LTL12124471486764498008.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8464495346384261435.hoa
Detected timeout of ITS tools.
[2024-05-30 06:56:04] [INFO ] Flatten gal took : 21 ms
[2024-05-30 06:56:04] [INFO ] Flatten gal took : 18 ms
[2024-05-30 06:56:04] [INFO ] Time to serialize gal into /tmp/LTL15148099408206817917.gal : 3 ms
[2024-05-30 06:56:04] [INFO ] Time to serialize properties into /tmp/LTL8856887933897249671.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/LTL15148099408206817917.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8856887933897249671.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(G(("(((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns_...19444
Formula 0 simplified : GF(!"(((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns_1_...10632
Detected timeout of ITS tools.
[2024-05-30 06:56:19] [INFO ] Flatten gal took : 22 ms
[2024-05-30 06:56:19] [INFO ] Applying decomposition
[2024-05-30 06:56:19] [INFO ] Flatten gal took : 17 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/graph15542779056197308075.txt' '-o' '/tmp/graph15542779056197308075.bin' '-w' '/tmp/graph15542779056197308075.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15542779056197308075.bin' '-l' '-1' '-v' '-w' '/tmp/graph15542779056197308075.weights' '-q' '0' '-e' '0.001'
[2024-05-30 06:56:20] [INFO ] Decomposing Gal with order
[2024-05-30 06:56:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 06:56:20] [INFO ] Removed a total of 896 redundant transitions.
[2024-05-30 06:56:20] [INFO ] Flatten gal took : 231 ms
[2024-05-30 06:56:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-30 06:56:20] [INFO ] Time to serialize gal into /tmp/LTL5971833979657521127.gal : 4 ms
[2024-05-30 06:56:20] [INFO ] Time to serialize properties into /tmp/LTL10677751693751899210.ltl : 140 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/LTL5971833979657521127.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10677751693751899210.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(G(("(((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_0_4+gu2.Columns_0_5)+(gu2.Columns_0_...25076
Formula 0 simplified : GF(!"(((((((gu2.Columns_0_0+gu2.Columns_0_1)+(gu2.Columns_0_2+gu2.Columns_0_3))+((gu2.Columns_0_4+gu2.Columns_0_5)+(gu2.Columns_0_6+...13704
Detected timeout of ITS tools.
Treatment of property Sudoku-PT-AN08-LTLCardinality-02 finished in 123426 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(F((p0&&F(p1))))))'
[2024-05-30 06:56:35] [INFO ] Flatten gal took : 19 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9574551919490376401
[2024-05-30 06:56:35] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-30 06:56:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:56:35] [INFO ] Applying decomposition
[2024-05-30 06:56:35] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-30 06:56:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:56:35] [INFO ] Flatten gal took : 23 ms
[2024-05-30 06:56:35] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-30 06:56:35] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 06:56:35] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9574551919490376401
Running compilation step : cd /tmp/ltsmin9574551919490376401;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' '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'
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/graph844533837907698563.txt' '-o' '/tmp/graph844533837907698563.bin' '-w' '/tmp/graph844533837907698563.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph844533837907698563.bin' '-l' '-1' '-v' '-w' '/tmp/graph844533837907698563.weights' '-q' '0' '-e' '0.001'
[2024-05-30 06:56:37] [INFO ] Decomposing Gal with order
[2024-05-30 06:56:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 06:56:37] [INFO ] Removed a total of 1344 redundant transitions.
[2024-05-30 06:56:37] [INFO ] Flatten gal took : 326 ms
[2024-05-30 06:56:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-30 06:56:37] [INFO ] Time to serialize gal into /tmp/LTLCardinality5162243729848709906.gal : 4 ms
[2024-05-30 06:56:37] [INFO ] Time to serialize properties into /tmp/LTLCardinality12383567978236266923.ltl : 15 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5162243729848709906.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12383567978236266923.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 3 LTL properties
Checking formula 0 : !((F("(((((((gu3.Columns_0_0+gu3.Columns_0_1)+(gu3.Columns_0_2+gu3.Columns_0_3))+((gu3.Columns_0_4+gu3.Columns_0_5)+(gu3.Columns_0_6+g...10397
Formula 0 simplified : G!"(((((((gu3.Columns_0_0+gu3.Columns_0_1)+(gu3.Columns_0_2+gu3.Columns_0_3))+((gu3.Columns_0_4+gu3.Columns_0_5)+(gu3.Columns_0_6+gu...10393
Compilation finished in 2295 ms.
Running link step : cd /tmp/ltsmin9574551919490376401;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin9574551919490376401;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin9574551919490376401;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9574551919490376401;'/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' '<>([](((LTLAPp1==true)||X(((((LTLAPp2==true) U (LTLAPp3==true))||[](<>((LTLAPp4==true)))) U ((LTLAPp1==true)&&(((LTLAPp2==true) U (LTLAPp3==true))||[](<>((LTLAPp4==true))))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.033: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.033: LTL layer: formula: <>([](((LTLAPp1==true)||X(((((LTLAPp2==true) U (LTLAPp3==true))||[](<>((LTLAPp4==true)))) U ((LTLAPp1==true)&&(((LTLAPp2==true) U (LTLAPp3==true))||[](<>((LTLAPp4==true))))))))))
pins2lts-mc-linux64( 6/ 8), 0.033: "<>([](((LTLAPp1==true)||X(((((LTLAPp2==true) U (LTLAPp3==true))||[](<>((LTLAPp4==true)))) U ((LTLAPp1==true)&&(((LTLAPp2==true) U (LTLAPp3==true))||[](<>((LTLAPp4==true))))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.033: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.055: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.070: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.072: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.078: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.084: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.277: There are 520 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.277: State length is 705, there are 536 groups
pins2lts-mc-linux64( 0/ 8), 0.277: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.277: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.277: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.277: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.835: [Blue] ~56 levels ~960 states ~73312 transitions
pins2lts-mc-linux64( 2/ 8), 0.853: [Blue] ~54 levels ~1920 states ~73728 transitions
pins2lts-mc-linux64( 2/ 8), 0.898: [Blue] ~54 levels ~3840 states ~81848 transitions
pins2lts-mc-linux64( 4/ 8), 1.000: [Blue] ~58 levels ~7680 states ~99656 transitions
pins2lts-mc-linux64( 2/ 8), 1.188: [Blue] ~54 levels ~15360 states ~135560 transitions
pins2lts-mc-linux64( 5/ 8), 1.553: [Blue] ~57 levels ~30720 states ~227832 transitions
pins2lts-mc-linux64( 3/ 8), 2.308: [Blue] ~55 levels ~61440 states ~396664 transitions
pins2lts-mc-linux64( 3/ 8), 3.712: [Blue] ~55 levels ~122880 states ~788440 transitions
pins2lts-mc-linux64( 3/ 8), 6.721: [Blue] ~56 levels ~245760 states ~1548888 transitions
pins2lts-mc-linux64( 3/ 8), 12.403: [Blue] ~56 levels ~491520 states ~3182688 transitions
pins2lts-mc-linux64( 0/ 8), 23.551: [Blue] ~58 levels ~983040 states ~6917200 transitions
pins2lts-mc-linux64( 3/ 8), 45.067: [Blue] ~56 levels ~1966080 states ~14035232 transitions
pins2lts-mc-linux64( 3/ 8), 89.171: [Blue] ~57 levels ~3932160 states ~29359808 transitions
pins2lts-mc-linux64( 3/ 8), 182.948: [Blue] ~57 levels ~7864320 states ~63277472 transitions
pins2lts-mc-linux64( 1/ 8), 233.594: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 233.687:
pins2lts-mc-linux64( 0/ 8), 233.687: Explored 9495224 states 78688311 transitions, fanout: 8.287
pins2lts-mc-linux64( 0/ 8), 233.687: Total exploration time 233.400 sec (233.320 sec minimum, 233.342 sec on average)
pins2lts-mc-linux64( 0/ 8), 233.687: States per second: 40682, Transitions per second: 337139
pins2lts-mc-linux64( 0/ 8), 233.687:
pins2lts-mc-linux64( 0/ 8), 233.687: State space has 9560352 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 233.687: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 233.687: blue states: 9495224 (99.32%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 233.687: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 233.687: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 233.687:
pins2lts-mc-linux64( 0/ 8), 233.687: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 233.687:
pins2lts-mc-linux64( 0/ 8), 233.687: Queue width: 8B, total height: 463, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 233.687: Tree memory: 328.9MB, 36.1 B/state, compr.: 1.3%
pins2lts-mc-linux64( 0/ 8), 233.687: Tree fill ratio (roots/leafs): 7.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 233.687: Stored 540 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 233.687: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 233.687: Est. total memory use: 328.9MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9574551919490376401;'/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' '<>([](((LTLAPp1==true)||X(((((LTLAPp2==true) U (LTLAPp3==true))||[](<>((LTLAPp4==true)))) U ((LTLAPp1==true)&&(((LTLAPp2==true) U (LTLAPp3==true))||[](<>((LTLAPp4==true))))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9574551919490376401;'/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' '<>([](((LTLAPp1==true)||X(((((LTLAPp2==true) U (LTLAPp3==true))||[](<>((LTLAPp4==true)))) U ((LTLAPp1==true)&&(((LTLAPp2==true) U (LTLAPp3==true))||[](<>((LTLAPp4==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 07:13:36] [INFO ] Applying decomposition
[2024-05-30 07:13:36] [INFO ] Flatten gal took : 20 ms
[2024-05-30 07:13:36] [INFO ] Decomposing Gal with order
[2024-05-30 07:13:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 07:13:36] [INFO ] Removed a total of 896 redundant transitions.
[2024-05-30 07:13:36] [INFO ] Flatten gal took : 73 ms
[2024-05-30 07:13:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-30 07:13:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality8440583129876407045.gal : 5 ms
[2024-05-30 07:13:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality13458138627982630275.ltl : 9 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/LTLCardinality8440583129876407045.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13458138627982630275.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 3 LTL properties
Checking formula 0 : !((F("(((((((gu129.Columns_0_0+gu130.Columns_0_1)+(gu131.Columns_0_2+gu132.Columns_0_3))+((gu133.Columns_0_4+gu134.Columns_0_5)+(gu135...10965
Formula 0 simplified : G!"(((((((gu129.Columns_0_0+gu130.Columns_0_1)+(gu131.Columns_0_2+gu132.Columns_0_3))+((gu133.Columns_0_4+gu134.Columns_0_5)+(gu135....10961
ITS-tools command line returned an error code 137
[2024-05-30 07:24:32] [INFO ] Flatten gal took : 21 ms
[2024-05-30 07:24:32] [INFO ] Input system was already deterministic with 512 transitions.
[2024-05-30 07:24:32] [INFO ] Transformed 704 places.
[2024-05-30 07:24:32] [INFO ] Transformed 512 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 07:24:32] [INFO ] Time to serialize gal into /tmp/LTLCardinality12410950009599813386.gal : 4 ms
[2024-05-30 07:24:32] [INFO ] Time to serialize properties into /tmp/LTLCardinality3229669364927707573.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12410950009599813386.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3229669364927707573.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...343
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F("(((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns_1_0...8093
Formula 0 simplified : G!"(((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns_1_0+...8089
ITS-tools command line returned an error code 137
Total runtime 2889426 ms.

BK_STOP 1717054551279

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

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