Execution Chart

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

Trace from the execution

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

--------------------
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 1717148849943

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN08
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-31 09:47:31] [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-31 09:47:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 09:47:31] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-05-31 09:47:31] [INFO ] Transformed 704 places.
[2024-05-31 09:47:31] [INFO ] Transformed 512 transitions.
[2024-05-31 09:47:31] [INFO ] Found NUPN structural information;
[2024-05-31 09:47:31] [INFO ] Parsed PT model containing 704 places and 512 transitions and 2048 arcs in 152 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 59 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 13 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2024-05-31 09:47:32] [INFO ] Computed 192 invariants in 28 ms
[2024-05-31 09:47:32] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-31 09:47:32] [INFO ] Invariant cache hit.
[2024-05-31 09:47:32] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 886 ms to find 0 implicit places.
[2024-05-31 09:47:32] [INFO ] Invariant cache hit.
[2024-05-31 09:47:33] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1252 ms. Remains : 704/704 places, 512/512 transitions.
Support contains 704 out of 704 places after structural reductions.
[2024-05-31 09:47:33] [INFO ] Flatten gal took : 91 ms
[2024-05-31 09:47:33] [INFO ] Flatten gal took : 47 ms
[2024-05-31 09:47:33] [INFO ] Input system was already deterministic with 512 transitions.
Incomplete random walk after 10000 steps, including 180 resets, run finished after 1114 ms. (steps per millisecond=8 ) properties (out of 24) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2024-05-31 09:47:35] [INFO ] Invariant cache hit.
[2024-05-31 09:47:36] [INFO ] [Real]Absence check using 192 positive place invariants in 38 ms returned sat
[2024-05-31 09:47:36] [INFO ] After 615ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-31 09:47:36] [INFO ] [Nat]Absence check using 192 positive place invariants in 37 ms returned sat
[2024-05-31 09:47:45] [INFO ] After 8099ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :6
[2024-05-31 09:47:53] [INFO ] After 16223ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :6
Attempting to minimize the solution found.
Minimization took 5811 ms.
[2024-05-31 09:47:59] [INFO ] After 22580ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :6
Fused 11 Parikh solutions to 6 different solutions.
Finished Parikh walk after 64 steps, including 0 resets, run visited all 6 properties in 3 ms. (steps per millisecond=21 )
Parikh walk visited 3 properties in 5 ms.
Support contains 128 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.3 ms
Discarding 512 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 39 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 39 ms. Remains : 192/704 places, 512/512 transitions.
Incomplete random walk after 10000 steps, including 179 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Finished probabilistic random walk after 110904 steps, run visited all 3 properties in 708 ms. (steps per millisecond=156 )
Probabilistic random walk after 110904 steps, saw 34413 distinct states, run finished after 709 ms. (steps per millisecond=156 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
FORMULA Sudoku-PT-AN08-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
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.202304061127/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 8 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-31 09:48:00] [INFO ] Invariant cache hit.
[2024-05-31 09:48:01] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-31 09:48:01] [INFO ] Invariant cache hit.
[2024-05-31 09:48:01] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 814 ms to find 0 implicit places.
[2024-05-31 09:48:01] [INFO ] Invariant cache hit.
[2024-05-31 09:48:01] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1147 ms. Remains : 704/704 places, 512/512 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p0) p1), true, p1, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GT (ADD s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 s9...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
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 1512 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 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-31 09:48:02] [INFO ] Invariant cache hit.
[2024-05-31 09:48:02] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-05-31 09:48:02] [INFO ] Invariant cache hit.
[2024-05-31 09:48:03] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 989 ms to find 0 implicit places.
[2024-05-31 09:48:03] [INFO ] Redundant transitions in 33 ms returned []
[2024-05-31 09:48:03] [INFO ] Invariant cache hit.
[2024-05-31 09:48:03] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1379 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s640 s641 s642 s643 s644 s645 s646 s647 s648 s649 s650 s651 s652 s653 s654 s655 s656 s657 s658 s659 s660 s661 s662 s663 s664 s665 s666 s667 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3030 reset in 5938 ms.
Product exploration explored 100000 steps with 3030 reset in 5940 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 105 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)]
Finished random walk after 32 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
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 89 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 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2024-05-31 09:48:19] [INFO ] Invariant cache hit.
[2024-05-31 09:48:20] [INFO ] [Real]Absence check using 192 positive place invariants in 92 ms returned sat
[2024-05-31 09:48:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 09:48:23] [INFO ] [Real]Absence check using state equation in 2620 ms returned sat
[2024-05-31 09:48:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 09:48:29] [INFO ] [Nat]Absence check using 192 positive place invariants in 37 ms returned sat
[2024-05-31 09:48:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 09:48:29] [INFO ] [Nat]Absence check using state equation in 187 ms returned sat
[2024-05-31 09:48:29] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 22 ms.
[2024-05-31 09:48:29] [INFO ] Added : 0 causal constraints over 0 iterations in 69 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 25 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-31 09:48:29] [INFO ] Invariant cache hit.
[2024-05-31 09:48:29] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-31 09:48:29] [INFO ] Invariant cache hit.
[2024-05-31 09:48:30] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 986 ms to find 0 implicit places.
[2024-05-31 09:48:30] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-31 09:48:30] [INFO ] Invariant cache hit.
[2024-05-31 09:48:31] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1399 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 28 ms :[(NOT p0)]
Finished random walk after 32 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
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 97 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2024-05-31 09:48:34] [INFO ] Invariant cache hit.
[2024-05-31 09:48:36] [INFO ] [Real]Absence check using 192 positive place invariants in 92 ms returned sat
[2024-05-31 09:48:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 09:48:38] [INFO ] [Real]Absence check using state equation in 2606 ms returned sat
[2024-05-31 09:48:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 09:48:44] [INFO ] [Nat]Absence check using 192 positive place invariants in 39 ms returned sat
[2024-05-31 09:48:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 09:48:45] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2024-05-31 09:48:45] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-31 09:48:45] [INFO ] Added : 0 causal constraints over 0 iterations in 70 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3030 reset in 5866 ms.
Product exploration explored 100000 steps with 3030 reset in 5908 ms.
Built C files in :
/tmp/ltsmin9367992757971649092
[2024-05-31 09:48:57] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-31 09:48:57] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:48:57] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-31 09:48:57] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:48:57] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-31 09:48:57] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:48:57] [INFO ] Built C files in 107ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9367992757971649092
Running compilation step : cd /tmp/ltsmin9367992757971649092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1513 ms.
Running link step : cd /tmp/ltsmin9367992757971649092;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin9367992757971649092;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5081355221649511982.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 20 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-31 09:49:12] [INFO ] Invariant cache hit.
[2024-05-31 09:49:12] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-31 09:49:12] [INFO ] Invariant cache hit.
[2024-05-31 09:49:13] [INFO ] Implicit Places using invariants and state equation in 648 ms returned []
Implicit Place search using SMT with State Equation took 1014 ms to find 0 implicit places.
[2024-05-31 09:49:13] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 09:49:13] [INFO ] Invariant cache hit.
[2024-05-31 09:49:13] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1364 ms. Remains : 704/704 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin3591619827857304391
[2024-05-31 09:49:13] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-31 09:49:13] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:49:13] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-31 09:49:13] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:49:13] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-31 09:49:13] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:49:13] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3591619827857304391
Running compilation step : cd /tmp/ltsmin3591619827857304391;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1356 ms.
Running link step : cd /tmp/ltsmin3591619827857304391;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin3591619827857304391;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3555423652668798685.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 09:49:28] [INFO ] Flatten gal took : 34 ms
[2024-05-31 09:49:28] [INFO ] Flatten gal took : 32 ms
[2024-05-31 09:49:28] [INFO ] Time to serialize gal into /tmp/LTL5277914975501747046.gal : 5 ms
[2024-05-31 09:49:28] [INFO ] Time to serialize properties into /tmp/LTL1446056127214867587.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5277914975501747046.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3810285314871337078.hoa' '-atoms' '/tmp/LTL1446056127214867587.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1446056127214867587.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3810285314871337078.hoa
Detected timeout of ITS tools.
[2024-05-31 09:49:43] [INFO ] Flatten gal took : 32 ms
[2024-05-31 09:49:43] [INFO ] Flatten gal took : 27 ms
[2024-05-31 09:49:43] [INFO ] Time to serialize gal into /tmp/LTL5410688976224712703.gal : 4 ms
[2024-05-31 09:49:43] [INFO ] Time to serialize properties into /tmp/LTL7835832452660612908.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5410688976224712703.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7835832452660612908.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
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-31 09:49:58] [INFO ] Flatten gal took : 41 ms
[2024-05-31 09:49:58] [INFO ] Applying decomposition
[2024-05-31 09:49:59] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13035428149962923868.txt' '-o' '/tmp/graph13035428149962923868.bin' '-w' '/tmp/graph13035428149962923868.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13035428149962923868.bin' '-l' '-1' '-v' '-w' '/tmp/graph13035428149962923868.weights' '-q' '0' '-e' '0.001'
[2024-05-31 09:49:59] [INFO ] Decomposing Gal with order
[2024-05-31 09:49:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 09:49:59] [INFO ] Removed a total of 655 redundant transitions.
[2024-05-31 09:49:59] [INFO ] Flatten gal took : 316 ms
[2024-05-31 09:49:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 144 labels/synchronizations in 19 ms.
[2024-05-31 09:50:00] [INFO ] Time to serialize gal into /tmp/LTL14343335225858333398.gal : 9 ms
[2024-05-31 09:50:00] [INFO ] Time to serialize properties into /tmp/LTL7415867619187181256.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14343335225858333398.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7415867619187181256.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F("(((((((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.
Built C files in :
/tmp/ltsmin14630365938488214368
[2024-05-31 09:50:15] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14630365938488214368
Running compilation step : cd /tmp/ltsmin14630365938488214368;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 975 ms.
Running link step : cd /tmp/ltsmin14630365938488214368;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14630365938488214368;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-PT-AN08-LTLCardinality-01 finished in 147921 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||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 9 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-31 09:50:30] [INFO ] Invariant cache hit.
[2024-05-31 09:50:30] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-31 09:50:30] [INFO ] Invariant cache hit.
[2024-05-31 09:50:30] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
[2024-05-31 09:50:30] [INFO ] Invariant cache hit.
[2024-05-31 09:50:31] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1049 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 321 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 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ 1 (ADD s640 s641 s642 s643 s644 s645 s646 s647 s648 s649 s650 s651 s652 s653 s654 s655 s656 s657 s658 s659 s660 s661 s662 s663 s664 s665 s666 s667...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1798 reset in 3227 ms.
Product exploration explored 100000 steps with 1796 reset in 3262 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 p0), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (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 16 factoid took 1756 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 327 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))]
Incomplete random walk after 10000 steps, including 179 resets, run finished after 724 ms. (steps per millisecond=13 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-31 09:50:51] [INFO ] Invariant cache hit.
[2024-05-31 09:50:51] [INFO ] [Real]Absence check using 192 positive place invariants in 37 ms returned sat
[2024-05-31 09:50:51] [INFO ] After 345ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:2
[2024-05-31 09:50:51] [INFO ] [Nat]Absence check using 192 positive place invariants in 35 ms returned sat
[2024-05-31 09:50:57] [INFO ] After 5020ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :2
[2024-05-31 09:51:01] [INFO ] After 9075ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :2
Attempting to minimize the solution found.
Minimization took 10583 ms.
[2024-05-31 09:51:11] [INFO ] After 19989ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :1
Fused 7 Parikh solutions to 2 different solutions.
Finished Parikh walk after 64 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 2 ms.
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 9 ms. Remains : 704/704 places, 512/512 transitions.
Incomplete random walk after 10000 steps, including 180 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
Finished probabilistic random walk after 20100 steps, run visited all 1 properties in 168 ms. (steps per millisecond=119 )
Probabilistic random walk after 20100 steps, saw 20004 distinct states, run finished after 169 ms. (steps per millisecond=118 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1 (NOT p3)), (X p0), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (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 (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (G (NOT (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3))))), (G (NOT (AND (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (NOT (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (F (NOT (AND p0 p1 (NOT p2)))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))), (F (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (F (NOT (AND p1 (NOT p2))))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))
Knowledge based reduction with 20 factoid took 2327 ms. Reduced automaton from 7 states, 25 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN08-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN08-LTLCardinality-02 finished in 44691 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p1&&X(p2))||p0))))'
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 3 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-31 09:51:14] [INFO ] Invariant cache hit.
[2024-05-31 09:51:15] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-31 09:51:15] [INFO ] Invariant cache hit.
[2024-05-31 09:51:15] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
[2024-05-31 09:51:15] [INFO ] Invariant cache hit.
[2024-05-31 09:51:15] [INFO ] Dead Transitions using invariants and state equation in 343 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 894 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ (ADD s576 s577 s578 s579 s580 s581 s582 s583 s584 s585 s586 s587 s588 s589 s590 s591 s592 s593 s594 s595 s596 s597 s598 s599 s600 s601 s602 s603 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1799 reset in 4133 ms.
Product exploration explored 100000 steps with 1798 reset in 4223 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 p1 p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 734 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 208 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), false, false]
Incomplete random walk after 10000 steps, including 179 resets, run finished after 731 ms. (steps per millisecond=13 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 190528 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 190528 steps, saw 47128 distinct states, run finished after 3002 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-31 09:51:34] [INFO ] Invariant cache hit.
[2024-05-31 09:51:34] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2024-05-31 09:51:34] [INFO ] [Nat]Absence check using 192 positive place invariants in 36 ms returned sat
[2024-05-31 09:51:34] [INFO ] After 202ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (G (NOT (AND p1 (NOT p0) p2))), (G (NOT (AND (NOT p1) (NOT p0)))), (G (NOT (AND p1 (NOT p0)))), (G (NOT (AND p1 (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 18 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN08-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN08-LTLCardinality-03 finished in 19796 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X((G(p1) U p2))) U p1))'
Support contains 576 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 7 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-31 09:51:34] [INFO ] Invariant cache hit.
[2024-05-31 09:51:35] [INFO ] Implicit Places using invariants in 415 ms returned []
[2024-05-31 09:51:35] [INFO ] Invariant cache hit.
[2024-05-31 09:51:35] [INFO ] Implicit Places using invariants and state equation in 688 ms returned []
Implicit Place search using SMT with State Equation took 1105 ms to find 0 implicit places.
[2024-05-31 09:51:35] [INFO ] Invariant cache hit.
[2024-05-31 09:51:36] [INFO ] Dead Transitions using invariants and state equation in 340 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1453 ms. Remains : 704/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ (ADD s576 s577 s578 s579 s580 s581 s582 s583 s584 s585 s586 s587 s588 s589 s590 s591 s592 s593 s594 s595 s596 s597 s598 s599 s600 s601 s602 s603 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 81200 steps with 19071 reset in 10001 ms.
Product exploration timeout after 81230 steps with 19121 reset in 10002 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) p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 1407 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p2), (NOT p2), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 179 resets, run finished after 761 ms. (steps per millisecond=13 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-31 09:52:37] [INFO ] Invariant cache hit.
[2024-05-31 09:52:37] [INFO ] [Real]Absence check using 192 positive place invariants in 36 ms returned sat
[2024-05-31 09:52:37] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p2) p1))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND p0 (NOT p2)))), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 22 factoid took 4077 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
[2024-05-31 09:52:41] [INFO ] Invariant cache hit.
[2024-05-31 09:52:43] [INFO ] [Real]Absence check using 192 positive place invariants in 97 ms returned sat
[2024-05-31 09:52:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 09:52:44] [INFO ] [Real]Absence check using state equation in 1475 ms returned sat
[2024-05-31 09:52:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 09:52:50] [INFO ] [Nat]Absence check using 192 positive place invariants in 43 ms returned sat
[2024-05-31 09:52:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 09:52:51] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2024-05-31 09:52:51] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-31 09:52:51] [INFO ] Added : 0 causal constraints over 0 iterations in 66 ms. Result :sat
Could not prove EG (NOT 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 16 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-31 09:52:51] [INFO ] Invariant cache hit.
[2024-05-31 09:52:51] [INFO ] Implicit Places using invariants in 407 ms returned []
[2024-05-31 09:52:51] [INFO ] Invariant cache hit.
[2024-05-31 09:52:52] [INFO ] Implicit Places using invariants and state equation in 703 ms returned []
Implicit Place search using SMT with State Equation took 1113 ms to find 0 implicit places.
[2024-05-31 09:52:52] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-31 09:52:52] [INFO ] Invariant cache hit.
[2024-05-31 09:52:52] [INFO ] Dead Transitions using invariants and state equation in 320 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1469 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 p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 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 27 ms :[(NOT p1)]
Finished random walk after 32 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 98 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 27 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
[2024-05-31 09:52:56] [INFO ] Invariant cache hit.
[2024-05-31 09:52:58] [INFO ] [Real]Absence check using 192 positive place invariants in 98 ms returned sat
[2024-05-31 09:52:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 09:52:59] [INFO ] [Real]Absence check using state equation in 1516 ms returned sat
[2024-05-31 09:52:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 09:53:05] [INFO ] [Nat]Absence check using 192 positive place invariants in 44 ms returned sat
[2024-05-31 09:53:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 09:53:05] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2024-05-31 09:53:06] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 21 ms.
[2024-05-31 09:53:06] [INFO ] Added : 0 causal constraints over 0 iterations in 71 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Product exploration explored 100000 steps with 3030 reset in 5898 ms.
Product exploration explored 100000 steps with 3030 reset in 5957 ms.
Built C files in :
/tmp/ltsmin13126687236713649927
[2024-05-31 09:53:17] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-31 09:53:18] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:53:18] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-31 09:53:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:53:18] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-31 09:53:18] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:53:18] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13126687236713649927
Running compilation step : cd /tmp/ltsmin13126687236713649927;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1371 ms.
Running link step : cd /tmp/ltsmin13126687236713649927;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin13126687236713649927;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16717390605150544567.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 14 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-31 09:53:33] [INFO ] Invariant cache hit.
[2024-05-31 09:53:33] [INFO ] Implicit Places using invariants in 408 ms returned []
[2024-05-31 09:53:33] [INFO ] Invariant cache hit.
[2024-05-31 09:53:34] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
[2024-05-31 09:53:34] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-31 09:53:34] [INFO ] Invariant cache hit.
[2024-05-31 09:53:34] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1423 ms. Remains : 704/704 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin387401057269977051
[2024-05-31 09:53:34] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-31 09:53:34] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:53:34] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-31 09:53:34] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:53:34] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-31 09:53:34] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:53:34] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin387401057269977051
Running compilation step : cd /tmp/ltsmin387401057269977051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1333 ms.
Running link step : cd /tmp/ltsmin387401057269977051;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin387401057269977051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16109674997420697930.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 09:53:49] [INFO ] Flatten gal took : 33 ms
[2024-05-31 09:53:49] [INFO ] Flatten gal took : 31 ms
[2024-05-31 09:53:49] [INFO ] Time to serialize gal into /tmp/LTL8199791320321050204.gal : 4 ms
[2024-05-31 09:53:49] [INFO ] Time to serialize properties into /tmp/LTL8243265687309319109.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8199791320321050204.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9087257202186261360.hoa' '-atoms' '/tmp/LTL8243265687309319109.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL8243265687309319109.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9087257202186261360.hoa
Detected timeout of ITS tools.
[2024-05-31 09:54:04] [INFO ] Flatten gal took : 23 ms
[2024-05-31 09:54:04] [INFO ] Flatten gal took : 22 ms
[2024-05-31 09:54:04] [INFO ] Time to serialize gal into /tmp/LTL17602898315591305904.gal : 10 ms
[2024-05-31 09:54:04] [INFO ] Time to serialize properties into /tmp/LTL6476624736702012854.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17602898315591305904.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6476624736702012854.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((("(((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((Board_0...38200
Formula 0 simplified : (!"(((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((Board_0_...38195
Detected timeout of ITS tools.
[2024-05-31 09:54:20] [INFO ] Flatten gal took : 32 ms
[2024-05-31 09:54:20] [INFO ] Applying decomposition
[2024-05-31 09:54:20] [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.202304061127/bin/convert-linux64' '-i' '/tmp/graph499980477427229787.txt' '-o' '/tmp/graph499980477427229787.bin' '-w' '/tmp/graph499980477427229787.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph499980477427229787.bin' '-l' '-1' '-v' '-w' '/tmp/graph499980477427229787.weights' '-q' '0' '-e' '0.001'
[2024-05-31 09:54:21] [INFO ] Decomposing Gal with order
[2024-05-31 09:54:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 09:54:21] [INFO ] Removed a total of 448 redundant transitions.
[2024-05-31 09:54:21] [INFO ] Flatten gal took : 190 ms
[2024-05-31 09:54:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 512 labels/synchronizations in 18 ms.
[2024-05-31 09:54:21] [INFO ] Time to serialize gal into /tmp/LTL16136194233506850004.gal : 3 ms
[2024-05-31 09:54:21] [INFO ] Time to serialize properties into /tmp/LTL6033805538297249452.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16136194233506850004.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6033805538297249452.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((("(((((((((((gu0.Board_0_0_0+gu0.Board_0_0_1)+(gu0.Board_0_0_2+gu0.Board_0_0_3))+((gu0.Board_0_0_4+gu0.Board_0_0_5)+(gu0.Board_0_0...49208
Formula 0 simplified : (!"(((((((((((gu0.Board_0_0_0+gu0.Board_0_0_1)+(gu0.Board_0_0_2+gu0.Board_0_0_3))+((gu0.Board_0_0_4+gu0.Board_0_0_5)+(gu0.Board_0_0_...49203
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5017391268856875412
[2024-05-31 09:54:36] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5017391268856875412
Running compilation step : cd /tmp/ltsmin5017391268856875412;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1142 ms.
Running link step : cd /tmp/ltsmin5017391268856875412;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin5017391268856875412;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true) U X(([]((LTLAPp1==true)) U (LTLAPp2==true)))) U (LTLAPp1==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-PT-AN08-LTLCardinality-04 finished in 197387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||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 27 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 192 cols
[2024-05-31 09:54:52] [INFO ] Computed 23 invariants in 27 ms
[2024-05-31 09:54:52] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-31 09:54:52] [INFO ] Invariant cache hit.
[2024-05-31 09:54:52] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 796 ms to find 0 implicit places.
[2024-05-31 09:54:52] [INFO ] Invariant cache hit.
[2024-05-31 09:54:53] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 192/704 places, 512/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1060 ms. Remains : 192/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT 2 (ADD s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s88 s89 s90 s91 s92 s93 s94 s95 s96 s97 s98 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
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 1212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(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 9 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
[2024-05-31 09:54:53] [INFO ] Invariant cache hit.
[2024-05-31 09:54:53] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-31 09:54:53] [INFO ] Invariant cache hit.
[2024-05-31 09:54:54] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
[2024-05-31 09:54:54] [INFO ] Invariant cache hit.
[2024-05-31 09:54:54] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 192/704 places, 512/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 977 ms. Remains : 192/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 355 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 4793 ms.
Product exploration explored 100000 steps with 50000 reset in 4874 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 19 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 12191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
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.6 ms
Discarding 512 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
[2024-05-31 09:55:05] [INFO ] Invariant cache hit.
[2024-05-31 09:55:05] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-31 09:55:05] [INFO ] Invariant cache hit.
[2024-05-31 09:55:06] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 912 ms to find 0 implicit places.
[2024-05-31 09:55:06] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-31 09:55:06] [INFO ] Invariant cache hit.
[2024-05-31 09:55:06] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
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 1182 ms. Remains : 192/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s105 0) (EQ s151 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 101 steps with 1 reset in 7 ms.
FORMULA Sudoku-PT-AN08-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN08-LTLCardinality-09 finished in 1276 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 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 8 ms. Remains 192 /704 variables (removed 512) and now considering 512/512 (removed 0) transitions.
[2024-05-31 09:55:06] [INFO ] Invariant cache hit.
[2024-05-31 09:55:07] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-31 09:55:07] [INFO ] Invariant cache hit.
[2024-05-31 09:55:07] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 906 ms to find 0 implicit places.
[2024-05-31 09:55:07] [INFO ] Invariant cache hit.
[2024-05-31 09:55:07] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 192/704 places, 512/512 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1155 ms. Remains : 192/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s100 0) (EQ s183 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN08-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN08-LTLCardinality-10 finished in 1256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(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.4 ms
Discarding 511 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 20 ms. Remains 193 /704 variables (removed 511) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 193 cols
[2024-05-31 09:55:08] [INFO ] Computed 23 invariants in 19 ms
[2024-05-31 09:55:08] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-31 09:55:08] [INFO ] Invariant cache hit.
[2024-05-31 09:55:08] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 963 ms to find 0 implicit places.
[2024-05-31 09:55:08] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 09:55:08] [INFO ] Invariant cache hit.
[2024-05-31 09:55:09] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
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 1226 ms. Remains : 193/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s162 0) (EQ s105 1)), p0:(OR (AND (EQ s162 0) (EQ s105 1)) (AND (EQ s64 0) (EQ s91 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 6 ms.
FORMULA Sudoku-PT-AN08-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN08-LTLCardinality-12 finished in 1328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 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.4 ms
Discarding 523 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 25 ms. Remains 181 /704 variables (removed 523) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 181 cols
[2024-05-31 09:55:09] [INFO ] Computed 17 invariants in 14 ms
[2024-05-31 09:55:09] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-31 09:55:09] [INFO ] Invariant cache hit.
[2024-05-31 09:55:10] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
[2024-05-31 09:55:10] [INFO ] Redundant transitions in 44 ms returned []
[2024-05-31 09:55:10] [INFO ] Invariant cache hit.
[2024-05-31 09:55:10] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
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 938 ms. Remains : 181/704 places, 512/512 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s91 0) (EQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 290 steps with 7 reset in 14 ms.
FORMULA Sudoku-PT-AN08-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN08-LTLCardinality-14 finished in 1004 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X((G(p1) U p2))) U p1))'
Found a Lengthening insensitive property : Sudoku-PT-AN08-LTLCardinality-04
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p2), (NOT p2), true, (NOT p1)]
Support contains 576 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 13 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
// Phase 1: matrix 512 rows 704 cols
[2024-05-31 09:55:10] [INFO ] Computed 192 invariants in 3 ms
[2024-05-31 09:55:11] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-05-31 09:55:11] [INFO ] Invariant cache hit.
[2024-05-31 09:55:11] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 1122 ms to find 0 implicit places.
[2024-05-31 09:55:11] [INFO ] Invariant cache hit.
[2024-05-31 09:55:12] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1449 ms. Remains : 704/704 places, 512/512 transitions.
Running random walk in product with property : Sudoku-PT-AN08-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ (ADD s576 s577 s578 s579 s580 s581 s582 s583 s584 s585 s586 s587 s588 s589 s590 s591 s592 s593 s594 s595 s596 s597 s598 s599 s600 s601 s602 s603 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 81820 steps with 19257 reset in 10001 ms.
Product exploration timeout after 81280 steps with 19120 reset in 10001 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) p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 1388 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p2), (NOT p2), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 180 resets, run finished after 632 ms. (steps per millisecond=15 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-31 09:56:13] [INFO ] Invariant cache hit.
[2024-05-31 09:56:13] [INFO ] [Real]Absence check using 192 positive place invariants in 35 ms returned sat
[2024-05-31 09:56:13] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p2) p1))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND p0 (NOT p2)))), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 22 factoid took 4084 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
[2024-05-31 09:56:17] [INFO ] Invariant cache hit.
[2024-05-31 09:56:19] [INFO ] [Real]Absence check using 192 positive place invariants in 96 ms returned sat
[2024-05-31 09:56:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 09:56:20] [INFO ] [Real]Absence check using state equation in 1482 ms returned sat
[2024-05-31 09:56:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 09:56:26] [INFO ] [Nat]Absence check using 192 positive place invariants in 45 ms returned sat
[2024-05-31 09:56:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 09:56:27] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2024-05-31 09:56:27] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 21 ms.
[2024-05-31 09:56:27] [INFO ] Added : 0 causal constraints over 0 iterations in 94 ms. Result :sat
Could not prove EG (NOT 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 9 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-31 09:56:27] [INFO ] Invariant cache hit.
[2024-05-31 09:56:27] [INFO ] Implicit Places using invariants in 497 ms returned []
[2024-05-31 09:56:27] [INFO ] Invariant cache hit.
[2024-05-31 09:56:28] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 1258 ms to find 0 implicit places.
[2024-05-31 09:56:28] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 09:56:28] [INFO ] Invariant cache hit.
[2024-05-31 09:56:28] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1635 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 p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 144 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 32 ms :[(NOT p1)]
Finished random walk after 32 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
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 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
[2024-05-31 09:56:32] [INFO ] Invariant cache hit.
[2024-05-31 09:56:34] [INFO ] [Real]Absence check using 192 positive place invariants in 96 ms returned sat
[2024-05-31 09:56:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 09:56:35] [INFO ] [Real]Absence check using state equation in 1502 ms returned sat
[2024-05-31 09:56:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 09:56:41] [INFO ] [Nat]Absence check using 192 positive place invariants in 42 ms returned sat
[2024-05-31 09:56:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 09:56:41] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2024-05-31 09:56:41] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 46 ms.
[2024-05-31 09:56:41] [INFO ] Added : 0 causal constraints over 0 iterations in 91 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Product exploration explored 100000 steps with 3030 reset in 5855 ms.
Product exploration explored 100000 steps with 3030 reset in 5976 ms.
Built C files in :
/tmp/ltsmin1652861724630789044
[2024-05-31 09:56:53] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-31 09:56:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:56:53] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-31 09:56:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:56:53] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-31 09:56:53] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:56:53] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1652861724630789044
Running compilation step : cd /tmp/ltsmin1652861724630789044;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1286 ms.
Running link step : cd /tmp/ltsmin1652861724630789044;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1652861724630789044;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7198004590002335206.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 10 ms. Remains 704 /704 variables (removed 0) and now considering 512/512 (removed 0) transitions.
[2024-05-31 09:57:08] [INFO ] Invariant cache hit.
[2024-05-31 09:57:09] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-05-31 09:57:09] [INFO ] Invariant cache hit.
[2024-05-31 09:57:10] [INFO ] Implicit Places using invariants and state equation in 664 ms returned []
Implicit Place search using SMT with State Equation took 1074 ms to find 0 implicit places.
[2024-05-31 09:57:10] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-31 09:57:10] [INFO ] Invariant cache hit.
[2024-05-31 09:57:10] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1411 ms. Remains : 704/704 places, 512/512 transitions.
Built C files in :
/tmp/ltsmin9581959743117564452
[2024-05-31 09:57:10] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-31 09:57:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:57:10] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-31 09:57:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:57:10] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-31 09:57:10] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:57:10] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9581959743117564452
Running compilation step : cd /tmp/ltsmin9581959743117564452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1395 ms.
Running link step : cd /tmp/ltsmin9581959743117564452;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9581959743117564452;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5411662744089518146.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 09:57:25] [INFO ] Flatten gal took : 18 ms
[2024-05-31 09:57:25] [INFO ] Flatten gal took : 18 ms
[2024-05-31 09:57:25] [INFO ] Time to serialize gal into /tmp/LTL12805538299541482516.gal : 3 ms
[2024-05-31 09:57:25] [INFO ] Time to serialize properties into /tmp/LTL12249794256972650023.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12805538299541482516.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11697819986468453925.hoa' '-atoms' '/tmp/LTL12249794256972650023.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12249794256972650023.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11697819986468453925.hoa
Detected timeout of ITS tools.
[2024-05-31 09:57:40] [INFO ] Flatten gal took : 18 ms
[2024-05-31 09:57:40] [INFO ] Flatten gal took : 18 ms
[2024-05-31 09:57:40] [INFO ] Time to serialize gal into /tmp/LTL8464496846454619868.gal : 4 ms
[2024-05-31 09:57:40] [INFO ] Time to serialize properties into /tmp/LTL16748366788297791165.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8464496846454619868.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16748366788297791165.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((("(((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((Board_0...38200
Formula 0 simplified : (!"(((((((((((Board_0_0_0+Board_0_0_1)+(Board_0_0_2+Board_0_0_3))+((Board_0_0_4+Board_0_0_5)+(Board_0_0_6+Board_0_0_7)))+(((Board_0_...38195
Detected timeout of ITS tools.
[2024-05-31 09:57:55] [INFO ] Flatten gal took : 20 ms
[2024-05-31 09:57:55] [INFO ] Applying decomposition
[2024-05-31 09:57:55] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13094613591731424806.txt' '-o' '/tmp/graph13094613591731424806.bin' '-w' '/tmp/graph13094613591731424806.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13094613591731424806.bin' '-l' '-1' '-v' '-w' '/tmp/graph13094613591731424806.weights' '-q' '0' '-e' '0.001'
[2024-05-31 09:57:57] [INFO ] Decomposing Gal with order
[2024-05-31 09:57:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 09:57:57] [INFO ] Removed a total of 448 redundant transitions.
[2024-05-31 09:57:57] [INFO ] Flatten gal took : 224 ms
[2024-05-31 09:57:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 512 labels/synchronizations in 16 ms.
[2024-05-31 09:57:57] [INFO ] Time to serialize gal into /tmp/LTL14995669923326979119.gal : 4 ms
[2024-05-31 09:57:57] [INFO ] Time to serialize properties into /tmp/LTL17481448085989503651.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14995669923326979119.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17481448085989503651.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((("(((((((((((gu0.Board_0_0_0+gu0.Board_0_0_1)+(gu0.Board_0_0_2+gu0.Board_0_0_3))+((gu0.Board_0_0_4+gu0.Board_0_0_5)+(gu0.Board_0_0...49208
Formula 0 simplified : (!"(((((((((((gu0.Board_0_0_0+gu0.Board_0_0_1)+(gu0.Board_0_0_2+gu0.Board_0_0_3))+((gu0.Board_0_0_4+gu0.Board_0_0_5)+(gu0.Board_0_0_...49203
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7845112328715228013
[2024-05-31 09:58:13] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7845112328715228013
Running compilation step : cd /tmp/ltsmin7845112328715228013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1141 ms.
Running link step : cd /tmp/ltsmin7845112328715228013;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin7845112328715228013;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true) U X(([]((LTLAPp1==true)) U (LTLAPp2==true)))) U (LTLAPp1==true))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-PT-AN08-LTLCardinality-04 finished in 197619 ms.
[2024-05-31 09:58:28] [INFO ] Flatten gal took : 31 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2492090832910016185
[2024-05-31 09:58:28] [INFO ] Applying decomposition
[2024-05-31 09:58:28] [INFO ] Computing symmetric may disable matrix : 512 transitions.
[2024-05-31 09:58:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:58:28] [INFO ] Computing symmetric may enable matrix : 512 transitions.
[2024-05-31 09:58:28] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:58:28] [INFO ] Flatten gal took : 20 ms
[2024-05-31 09:58:28] [INFO ] Computing Do-Not-Accords matrix : 512 transitions.
[2024-05-31 09:58:28] [INFO ] Computation of Completed DNA matrix. took 57 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 09:58:28] [INFO ] Built C files in 145ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2492090832910016185
Running compilation step : cd /tmp/ltsmin2492090832910016185;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1614 ms.
Running link step : cd /tmp/ltsmin2492090832910016185;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin2492090832910016185;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7031283612001479381.txt' '-o' '/tmp/graph7031283612001479381.bin' '-w' '/tmp/graph7031283612001479381.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7031283612001479381.bin' '-l' '-1' '-v' '-w' '/tmp/graph7031283612001479381.weights' '-q' '0' '-e' '0.001'
[2024-05-31 09:58:30] [INFO ] Decomposing Gal with order
[2024-05-31 09:58:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 09:58:30] [INFO ] Removed a total of 896 redundant transitions.
[2024-05-31 09:58:30] [INFO ] Flatten gal took : 667 ms
[2024-05-31 09:58:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-31 09:58:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality14422481940519047116.gal : 15 ms
[2024-05-31 09:58:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality7726085729228896123.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14422481940519047116.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7726085729228896123.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 LTL properties
Checking formula 0 : !((F("(((((((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+g...10397
Formula 0 simplified : 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_6+gu...10393
Detected timeout of ITS tools.
[2024-05-31 10:22:10] [INFO ] Applying decomposition
[2024-05-31 10:22:10] [INFO ] Flatten gal took : 51 ms
[2024-05-31 10:22:10] [INFO ] Decomposing Gal with order
[2024-05-31 10:22:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 10:22:10] [INFO ] Removed a total of 896 redundant transitions.
[2024-05-31 10:22:10] [INFO ] Flatten gal took : 126 ms
[2024-05-31 10:22:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-31 10:22:10] [INFO ] Time to serialize gal into /tmp/LTLCardinality16545642298936984539.gal : 16 ms
[2024-05-31 10:22:10] [INFO ] Time to serialize properties into /tmp/LTLCardinality4953162268812576285.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16545642298936984539.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4953162268812576285.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 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
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin2492090832910016185;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>((LTLAPp0==true))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2492090832910016185;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp1==true) U X(([]((LTLAPp2==true)) U (LTLAPp3==true)))) U (LTLAPp2==true))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.007: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.025: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.025: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.037: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.037: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.046: LTL layer: formula: (((LTLAPp1==true) U X(([]((LTLAPp2==true)) U (LTLAPp3==true)))) U (LTLAPp2==true))
pins2lts-mc-linux64( 4/ 8), 0.046: "(((LTLAPp1==true) U X(([]((LTLAPp2==true)) U (LTLAPp3==true)))) U (LTLAPp2==true))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.046: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.062: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.062: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.063: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.063: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.229: There are 517 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.229: State length is 705, there are 532 groups
pins2lts-mc-linux64( 0/ 8), 0.229: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.229: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.229: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.229: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.779: [Blue] ~33 levels ~960 states ~65872 transitions
pins2lts-mc-linux64( 4/ 8), 0.803: [Blue] ~33 levels ~1920 states ~66464 transitions
pins2lts-mc-linux64( 4/ 8), 0.849: [Blue] ~33 levels ~3840 states ~68904 transitions
pins2lts-mc-linux64( 2/ 8), 0.944: [Blue] ~33 levels ~7680 states ~72072 transitions
pins2lts-mc-linux64( 7/ 8), 1.121: [Blue] ~33 levels ~15360 states ~83056 transitions
pins2lts-mc-linux64( 2/ 8), 1.482: [Blue] ~33 levels ~30720 states ~116920 transitions
pins2lts-mc-linux64( 0/ 8), 2.205: [Blue] ~33 levels ~61440 states ~179464 transitions
pins2lts-mc-linux64( 7/ 8), 3.598: [Blue] ~33 levels ~122880 states ~307952 transitions
pins2lts-mc-linux64( 6/ 8), 6.428: [Blue] ~33 levels ~245760 states ~556176 transitions
pins2lts-mc-linux64( 7/ 8), 11.844: [Blue] ~33 levels ~491520 states ~1171008 transitions
pins2lts-mc-linux64( 7/ 8), 22.294: [Blue] ~33 levels ~983040 states ~2776128 transitions
pins2lts-mc-linux64( 0/ 8), 42.863: [Blue] ~33 levels ~1966080 states ~5678840 transitions
pins2lts-mc-linux64( 0/ 8), 89.793: [Blue] ~33 levels ~3932160 states ~11958696 transitions
pins2lts-mc-linux64( 0/ 8), 177.524: [Blue] ~33 levels ~7864320 states ~24509792 transitions
pins2lts-mc-linux64( 4/ 8), 251.733: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 253.070:
pins2lts-mc-linux64( 0/ 8), 253.070: Explored 10365623 states 33166576 transitions, fanout: 3.200
pins2lts-mc-linux64( 0/ 8), 253.070: Total exploration time 252.840 sec (251.520 sec minimum, 251.994 sec on average)
pins2lts-mc-linux64( 0/ 8), 253.070: States per second: 40997, Transitions per second: 131176
pins2lts-mc-linux64( 0/ 8), 253.070:
pins2lts-mc-linux64( 0/ 8), 253.070: State space has 10425445 states, 10365368 are accepting
pins2lts-mc-linux64( 0/ 8), 253.070: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 253.070: blue states: 10365623 (99.43%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 253.070: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 253.070: all-red states: 10365368 (99.42%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 253.070:
pins2lts-mc-linux64( 0/ 8), 253.070: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 253.070:
pins2lts-mc-linux64( 0/ 8), 253.070: Queue width: 8B, total height: 264, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 253.070: Tree memory: 335.5MB, 33.7 B/state, compr.: 1.2%
pins2lts-mc-linux64( 0/ 8), 253.070: Tree fill ratio (roots/leafs): 7.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 253.070: Stored 518 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 253.070: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 253.070: Est. total memory use: 335.5MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2492090832910016185;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp1==true) U X(([]((LTLAPp2==true)) U (LTLAPp3==true)))) U (LTLAPp2==true))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2492090832910016185;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp1==true) U X(([]((LTLAPp2==true)) U (LTLAPp3==true)))) U (LTLAPp2==true))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-31 10:45:50] [INFO ] Flatten gal took : 153 ms
[2024-05-31 10:45:51] [INFO ] Input system was already deterministic with 512 transitions.
[2024-05-31 10:45:51] [INFO ] Transformed 704 places.
[2024-05-31 10:45:51] [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-31 10:45:51] [INFO ] Time to serialize gal into /tmp/LTLCardinality3330972535286022280.gal : 8 ms
[2024-05-31 10:45:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality3739354479680561873.ltl : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3330972535286022280.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3739354479680561873.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 2 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
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 13360796 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16012760 kB

BK_TIME_CONFINEMENT_REACHED

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is Sudoku-PT-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 r417-tall-171690556400392"
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 ;