Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 7.5K Feb 26 09:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 09:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 09:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 09:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 09:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Feb 26 09:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 09:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 09:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.5K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679149966204

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN06
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202303021504
[2023-03-18 14:32:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 14:32:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 14:32:47] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-18 14:32:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 14:32:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 378 ms
[2023-03-18 14:32:48] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 324 PT places and 216.0 transition bindings in 10 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 14:32:48] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2023-03-18 14:32:48] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-COL-AN06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10031 steps, including 263 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 20) seen :13
Incomplete Best-First random walk after 10031 steps, including 263 resets, run finished after 60 ms. (steps per millisecond=167 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10031 steps, including 263 resets, run finished after 37 ms. (steps per millisecond=271 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10031 steps, including 263 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10031 steps, including 263 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10031 steps, including 263 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10031 steps, including 263 resets, run finished after 34 ms. (steps per millisecond=295 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10031 steps, including 263 resets, run finished after 11 ms. (steps per millisecond=911 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1 rows 4 cols
[2023-03-18 14:32:49] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-18 14:32:49] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 14:32:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 14:32:49] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :2
[2023-03-18 14:32:49] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-18 14:32:49] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :2
Fused 7 Parikh solutions to 2 different solutions.
Finished Parikh walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Parikh walk visited 2 properties in 2 ms.
Successfully simplified 5 atomic propositions for a total of 15 simplifications.
FORMULA Sudoku-COL-AN06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 14:32:49] [INFO ] Flatten gal took : 13 ms
[2023-03-18 14:32:49] [INFO ] Flatten gal took : 2 ms
Domain [N(6), N(6)] of place Rows breaks symmetries in sort N
[2023-03-18 14:32:49] [INFO ] Unfolded HLPN to a Petri net with 324 places and 216 transitions 864 arcs in 11 ms.
[2023-03-18 14:32:49] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Support contains 324 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 9 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2023-03-18 14:32:49] [INFO ] Computed 108 place invariants in 13 ms
[2023-03-18 14:32:49] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-18 14:32:49] [INFO ] Invariant cache hit.
[2023-03-18 14:32:49] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2023-03-18 14:32:49] [INFO ] Invariant cache hit.
[2023-03-18 14:32:49] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 451 ms. Remains : 324/324 places, 216/216 transitions.
Support contains 324 out of 324 places after structural reductions.
[2023-03-18 14:32:50] [INFO ] Flatten gal took : 31 ms
[2023-03-18 14:32:50] [INFO ] Flatten gal took : 28 ms
[2023-03-18 14:32:50] [INFO ] Input system was already deterministic with 216 transitions.
Incomplete random walk after 10000 steps, including 319 resets, run finished after 586 ms. (steps per millisecond=17 ) properties (out of 17) seen :10
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-18 14:32:51] [INFO ] Invariant cache hit.
[2023-03-18 14:32:51] [INFO ] [Real]Absence check using 108 positive place invariants in 18 ms returned sat
[2023-03-18 14:32:51] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 14:32:51] [INFO ] [Nat]Absence check using 108 positive place invariants in 17 ms returned sat
[2023-03-18 14:32:51] [INFO ] After 522ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :4
[2023-03-18 14:32:52] [INFO ] After 1015ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 427 ms.
[2023-03-18 14:32:52] [INFO ] After 1591ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
Fused 7 Parikh solutions to 4 different solutions.
Finished Parikh walk after 36 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=12 )
Parikh walk visited 4 properties in 2 ms.
FORMULA Sudoku-COL-AN06-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-COL-AN06-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-COL-AN06-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 16 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-18 14:32:53] [INFO ] Invariant cache hit.
[2023-03-18 14:32:53] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-18 14:32:53] [INFO ] Invariant cache hit.
[2023-03-18 14:32:53] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2023-03-18 14:32:53] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-18 14:32:53] [INFO ] Invariant cache hit.
[2023-03-18 14:32:53] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 638 ms. Remains : 324/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 767 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (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) (ADD s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5263 reset in 2315 ms.
Product exploration explored 100000 steps with 5263 reset in 2306 ms.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
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 164 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
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 164 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
[2023-03-18 14:33:00] [INFO ] Invariant cache hit.
[2023-03-18 14:33:00] [INFO ] [Real]Absence check using 108 positive place invariants in 29 ms returned sat
[2023-03-18 14:33:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 14:33:00] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2023-03-18 14:33:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 14:33:01] [INFO ] [Nat]Absence check using 108 positive place invariants in 59 ms returned sat
[2023-03-18 14:33:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 14:33:01] [INFO ] [Nat]Absence check using state equation in 462 ms returned sat
[2023-03-18 14:33:01] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-18 14:33:01] [INFO ] Added : 0 causal constraints over 0 iterations in 44 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 11 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-18 14:33:01] [INFO ] Invariant cache hit.
[2023-03-18 14:33:01] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-18 14:33:01] [INFO ] Invariant cache hit.
[2023-03-18 14:33:01] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2023-03-18 14:33:01] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-18 14:33:01] [INFO ] Invariant cache hit.
[2023-03-18 14:33:02] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 457 ms. Remains : 324/324 places, 216/216 transitions.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
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 209 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
[2023-03-18 14:33:03] [INFO ] Invariant cache hit.
[2023-03-18 14:33:03] [INFO ] [Real]Absence check using 108 positive place invariants in 26 ms returned sat
[2023-03-18 14:33:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 14:33:03] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2023-03-18 14:33:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 14:33:03] [INFO ] [Nat]Absence check using 108 positive place invariants in 60 ms returned sat
[2023-03-18 14:33:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 14:33:04] [INFO ] [Nat]Absence check using state equation in 488 ms returned sat
[2023-03-18 14:33:04] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-18 14:33:04] [INFO ] Added : 0 causal constraints over 0 iterations in 38 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5263 reset in 2242 ms.
Product exploration explored 100000 steps with 5263 reset in 2260 ms.
Built C files in :
/tmp/ltsmin4736874336949694440
[2023-03-18 14:33:09] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2023-03-18 14:33:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:33:09] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2023-03-18 14:33:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:33:09] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2023-03-18 14:33:09] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:33:09] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4736874336949694440
Running compilation step : cd /tmp/ltsmin4736874336949694440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 594 ms.
Running link step : cd /tmp/ltsmin4736874336949694440;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin4736874336949694440;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10585373136565827245.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 252 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 15 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-18 14:33:24] [INFO ] Invariant cache hit.
[2023-03-18 14:33:24] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-18 14:33:24] [INFO ] Invariant cache hit.
[2023-03-18 14:33:24] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2023-03-18 14:33:24] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-18 14:33:24] [INFO ] Invariant cache hit.
[2023-03-18 14:33:24] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 493 ms. Remains : 324/324 places, 216/216 transitions.
Built C files in :
/tmp/ltsmin2594740260245192727
[2023-03-18 14:33:24] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2023-03-18 14:33:24] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:33:24] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2023-03-18 14:33:24] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:33:24] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2023-03-18 14:33:24] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:33:24] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2594740260245192727
Running compilation step : cd /tmp/ltsmin2594740260245192727;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 509 ms.
Running link step : cd /tmp/ltsmin2594740260245192727;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin2594740260245192727;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18314333207410562733.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 14:33:39] [INFO ] Flatten gal took : 26 ms
[2023-03-18 14:33:39] [INFO ] Flatten gal took : 25 ms
[2023-03-18 14:33:39] [INFO ] Time to serialize gal into /tmp/LTL4516445555408261544.gal : 4 ms
[2023-03-18 14:33:39] [INFO ] Time to serialize properties into /tmp/LTL1039897474323142921.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4516445555408261544.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18267065739574751588.hoa' '-atoms' '/tmp/LTL1039897474323142921.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1039897474323142921.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18267065739574751588.hoa
Detected timeout of ITS tools.
[2023-03-18 14:33:55] [INFO ] Flatten gal took : 17 ms
[2023-03-18 14:33:55] [INFO ] Flatten gal took : 15 ms
[2023-03-18 14:33:55] [INFO ] Time to serialize gal into /tmp/LTL10280139072268757614.gal : 2 ms
[2023-03-18 14:33:55] [INFO ] Time to serialize properties into /tmp/LTL2192002886309358928.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10280139072268757614.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2192002886309358928.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows_...2864
Formula 0 simplified : FG!"(((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows_13...2858
Detected timeout of ITS tools.
[2023-03-18 14:34:10] [INFO ] Flatten gal took : 14 ms
[2023-03-18 14:34:10] [INFO ] Applying decomposition
[2023-03-18 14:34:10] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13837689721403481547.txt' '-o' '/tmp/graph13837689721403481547.bin' '-w' '/tmp/graph13837689721403481547.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13837689721403481547.bin' '-l' '-1' '-v' '-w' '/tmp/graph13837689721403481547.weights' '-q' '0' '-e' '0.001'
[2023-03-18 14:34:10] [INFO ] Decomposing Gal with order
[2023-03-18 14:34:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 14:34:10] [INFO ] Removed a total of 296 redundant transitions.
[2023-03-18 14:34:10] [INFO ] Flatten gal took : 94 ms
[2023-03-18 14:34:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 8 ms.
[2023-03-18 14:34:10] [INFO ] Time to serialize gal into /tmp/LTL13996856533669003828.gal : 4 ms
[2023-03-18 14:34:10] [INFO ] Time to serialize properties into /tmp/LTL3552607867010602049.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13996856533669003828.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3552607867010602049.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((gu0.Rows_0+gu0.Rows_1)+(gu0.Rows_2+gu0.Rows_3))+((gu0.Rows_4+gu0.Rows_5)+(gu0.Rows_6+gu0.Rows_7)))+(((gu0.Rows_8+gu0.Ro...3872
Formula 0 simplified : FG!"(((((((gu0.Rows_0+gu0.Rows_1)+(gu0.Rows_2+gu0.Rows_3))+((gu0.Rows_4+gu0.Rows_5)+(gu0.Rows_6+gu0.Rows_7)))+(((gu0.Rows_8+gu0.Rows...3866
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14016054960418454338
[2023-03-18 14:34:25] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14016054960418454338
Running compilation step : cd /tmp/ltsmin14016054960418454338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 410 ms.
Running link step : cd /tmp/ltsmin14016054960418454338;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14016054960418454338;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN06-LTLCardinality-00 finished in 107563 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 36 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Graph (complete) has 648 edges and 324 vertex of which 108 are kept as prefixes of interest. Removing 216 places using SCC suffix rule.5 ms
Discarding 216 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2023-03-18 14:34:40] [INFO ] Computed 17 place invariants in 8 ms
[2023-03-18 14:34:40] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-18 14:34:40] [INFO ] Invariant cache hit.
[2023-03-18 14:34:40] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-18 14:34:40] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 14:34:40] [INFO ] Invariant cache hit.
[2023-03-18 14:34:40] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 345 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 (ADD 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 s99 s100 s101 s102 s103 s104 s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN06-LTLCardinality-01 finished in 405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G((!p1&&X(!p0))))))'
Support contains 288 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2023-03-18 14:34:41] [INFO ] Computed 108 place invariants in 3 ms
[2023-03-18 14:34:41] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-18 14:34:41] [INFO ] Invariant cache hit.
[2023-03-18 14:34:41] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2023-03-18 14:34:41] [INFO ] Invariant cache hit.
[2023-03-18 14:34:41] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 377 ms. Remains : 324/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 2 (ADD s288 s289 s290 s291 s292 s293 s294 s295 s296 s297 s298 s299 s300 s301 s302 s303 s304 s305 s306 s307 s308 s309 s310 s311 s312 s313 s314 s315 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN06-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN06-LTLCardinality-03 finished in 521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 36 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Graph (complete) has 648 edges and 324 vertex of which 108 are kept as prefixes of interest. Removing 216 places using SCC suffix rule.3 ms
Discarding 216 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2023-03-18 14:34:41] [INFO ] Computed 17 place invariants in 7 ms
[2023-03-18 14:34:41] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-18 14:34:41] [INFO ] Invariant cache hit.
[2023-03-18 14:34:41] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2023-03-18 14:34:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 14:34:41] [INFO ] Invariant cache hit.
[2023-03-18 14:34:41] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 302 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 (ADD 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 s99 s100 s101 s102 s103 s104 s1...], 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 419 steps with 12 reset in 13 ms.
FORMULA Sudoku-COL-AN06-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN06-LTLCardinality-04 finished in 404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 288 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 8 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 324 cols
[2023-03-18 14:34:41] [INFO ] Computed 108 place invariants in 3 ms
[2023-03-18 14:34:42] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-18 14:34:42] [INFO ] Invariant cache hit.
[2023-03-18 14:34:42] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2023-03-18 14:34:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 14:34:42] [INFO ] Invariant cache hit.
[2023-03-18 14:34:42] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 419 ms. Remains : 324/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ 2 (ADD s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s6...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 56810 steps with 1806 reset in 1514 ms.
FORMULA Sudoku-COL-AN06-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN06-LTLCardinality-05 finished in 1988 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1||G(p0))))'
Support contains 288 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 15 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-18 14:34:43] [INFO ] Invariant cache hit.
[2023-03-18 14:34:44] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-18 14:34:44] [INFO ] Invariant cache hit.
[2023-03-18 14:34:44] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2023-03-18 14:34:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 14:34:44] [INFO ] Invariant cache hit.
[2023-03-18 14:34:44] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 573 ms. Remains : 324/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 45 ms :[true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (LEQ 2 (ADD s252 s253 s254 s255 s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5000 reset in 2902 ms.
Product exploration explored 100000 steps with 5000 reset in 3006 ms.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
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), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 294 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[true, (AND (NOT p1) (NOT p0))]
Finished random walk after 8981 steps, including 284 resets, run visited all 2 properties in 141 ms. (steps per millisecond=63 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 8 factoid took 317 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[true, (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 45 ms :[true, (AND (NOT p1) (NOT p0))]
Support contains 288 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 10 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-18 14:34:51] [INFO ] Invariant cache hit.
[2023-03-18 14:34:52] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-18 14:34:52] [INFO ] Invariant cache hit.
[2023-03-18 14:34:52] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2023-03-18 14:34:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 14:34:52] [INFO ] Invariant cache hit.
[2023-03-18 14:34:52] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 380 ms. Remains : 324/324 places, 216/216 transitions.
Computed a total of 324 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 transition count 216
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), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 454 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[true, (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 319 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 14:34:53] [INFO ] Invariant cache hit.
[2023-03-18 14:34:53] [INFO ] [Real]Absence check using 108 positive place invariants in 16 ms returned sat
[2023-03-18 14:34:53] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 14:34:53] [INFO ] [Nat]Absence check using 108 positive place invariants in 16 ms returned sat
[2023-03-18 14:34:54] [INFO ] After 216ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 14:34:54] [INFO ] After 327ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 121 ms.
[2023-03-18 14:34:54] [INFO ] After 525ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 35 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=17 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 8 factoid took 401 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 46 ms :[true, (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 52 ms :[true, (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 5000 reset in 2869 ms.
Product exploration explored 100000 steps with 5000 reset in 2908 ms.
Built C files in :
/tmp/ltsmin4695972160409713875
[2023-03-18 14:35:00] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2023-03-18 14:35:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:35:00] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2023-03-18 14:35:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:35:00] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2023-03-18 14:35:00] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:35:00] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4695972160409713875
Running compilation step : cd /tmp/ltsmin4695972160409713875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 545 ms.
Running link step : cd /tmp/ltsmin4695972160409713875;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin4695972160409713875;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18023447980127795310.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 288 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 13 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-18 14:35:15] [INFO ] Invariant cache hit.
[2023-03-18 14:35:15] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-18 14:35:15] [INFO ] Invariant cache hit.
[2023-03-18 14:35:15] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2023-03-18 14:35:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 14:35:16] [INFO ] Invariant cache hit.
[2023-03-18 14:35:16] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 431 ms. Remains : 324/324 places, 216/216 transitions.
Built C files in :
/tmp/ltsmin2642375519719456529
[2023-03-18 14:35:16] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2023-03-18 14:35:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:35:16] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2023-03-18 14:35:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:35:16] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2023-03-18 14:35:16] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:35:16] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2642375519719456529
Running compilation step : cd /tmp/ltsmin2642375519719456529;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 540 ms.
Running link step : cd /tmp/ltsmin2642375519719456529;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2642375519719456529;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased65078281562769856.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 14:35:31] [INFO ] Flatten gal took : 18 ms
[2023-03-18 14:35:31] [INFO ] Flatten gal took : 17 ms
[2023-03-18 14:35:31] [INFO ] Time to serialize gal into /tmp/LTL6925802266173386849.gal : 2 ms
[2023-03-18 14:35:31] [INFO ] Time to serialize properties into /tmp/LTL1523481511433671984.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6925802266173386849.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12065005899691214463.hoa' '-atoms' '/tmp/LTL1523481511433671984.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1523481511433671984.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12065005899691214463.hoa
Detected timeout of ITS tools.
[2023-03-18 14:35:46] [INFO ] Flatten gal took : 13 ms
[2023-03-18 14:35:46] [INFO ] Flatten gal took : 13 ms
[2023-03-18 14:35:46] [INFO ] Time to serialize gal into /tmp/LTL14670753160221067392.gal : 2 ms
[2023-03-18 14:35:46] [INFO ] Time to serialize properties into /tmp/LTL16123602253570974623.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14670753160221067392.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16123602253570974623.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((("(((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((Cell...4151
Formula 0 simplified : !"(((((((Cells_0+Cells_1)+(Cells_2+Cells_3))+((Cells_4+Cells_5)+(Cells_6+Cells_7)))+(((Cells_8+Cells_9)+(Cells_10+Cells_11))+((Cells...3749
Detected timeout of ITS tools.
[2023-03-18 14:36:01] [INFO ] Flatten gal took : 17 ms
[2023-03-18 14:36:01] [INFO ] Applying decomposition
[2023-03-18 14:36:01] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5082415589189089603.txt' '-o' '/tmp/graph5082415589189089603.bin' '-w' '/tmp/graph5082415589189089603.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5082415589189089603.bin' '-l' '-1' '-v' '-w' '/tmp/graph5082415589189089603.weights' '-q' '0' '-e' '0.001'
[2023-03-18 14:36:01] [INFO ] Decomposing Gal with order
[2023-03-18 14:36:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 14:36:01] [INFO ] Removed a total of 180 redundant transitions.
[2023-03-18 14:36:01] [INFO ] Flatten gal took : 91 ms
[2023-03-18 14:36:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 216 labels/synchronizations in 6 ms.
[2023-03-18 14:36:01] [INFO ] Time to serialize gal into /tmp/LTL9330314934854658521.gal : 2 ms
[2023-03-18 14:36:01] [INFO ] Time to serialize properties into /tmp/LTL17283649235663045450.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9330314934854658521.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17283649235663045450.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((("(((((((gu0.Cells_0+gu0.Cells_1)+(gu0.Cells_2+gu0.Cells_3))+((gu0.Cells_4+gu0.Cells_5)+(gu0.Cells_6+gu0.Cells_7)))+(((gu0.Cells_8+...5591
Formula 0 simplified : !"(((((((gu0.Cells_0+gu0.Cells_1)+(gu0.Cells_2+gu0.Cells_3))+((gu0.Cells_4+gu0.Cells_5)+(gu0.Cells_6+gu0.Cells_7)))+(((gu0.Cells_8+g...5045
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8961715135765560767
[2023-03-18 14:36:16] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8961715135765560767
Running compilation step : cd /tmp/ltsmin8961715135765560767;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 417 ms.
Running link step : cd /tmp/ltsmin8961715135765560767;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8961715135765560767;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((LTLAPp0==true) U ([]((LTLAPp0==true))||(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-COL-AN06-LTLCardinality-08 finished in 107952 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (p1&&F(p2)))))'
Support contains 288 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 324 /324 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2023-03-18 14:36:31] [INFO ] Invariant cache hit.
[2023-03-18 14:36:32] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-18 14:36:32] [INFO ] Invariant cache hit.
[2023-03-18 14:36:32] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2023-03-18 14:36:32] [INFO ] Invariant cache hit.
[2023-03-18 14:36:32] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 402 ms. Remains : 324/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(GT 3 (ADD s252 s253 s254 s255 s256 s257 s258 s259 s260 s261 s262 s263 s264 s265 s266 s267 s268 s269 s270 s271 s272 s273 s274 s275 s276 s277 s278 s279 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 3 ms.
FORMULA Sudoku-COL-AN06-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN06-LTLCardinality-09 finished in 589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 36 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Graph (complete) has 648 edges and 324 vertex of which 108 are kept as prefixes of interest. Removing 216 places using SCC suffix rule.2 ms
Discarding 216 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 108 cols
[2023-03-18 14:36:32] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-18 14:36:32] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-18 14:36:32] [INFO ] Invariant cache hit.
[2023-03-18 14:36:32] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-18 14:36:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 14:36:32] [INFO ] Invariant cache hit.
[2023-03-18 14:36:32] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 303 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 66 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 (ADD 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 s99 s100 s101 s102 s103 s104 s10...], 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 47726 steps with 1520 reset in 610 ms.
FORMULA Sudoku-COL-AN06-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN06-LTLCardinality-10 finished in 1000 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 36 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Graph (complete) has 648 edges and 324 vertex of which 108 are kept as prefixes of interest. Removing 216 places using SCC suffix rule.1 ms
Discarding 216 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
[2023-03-18 14:36:33] [INFO ] Invariant cache hit.
[2023-03-18 14:36:33] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-18 14:36:33] [INFO ] Invariant cache hit.
[2023-03-18 14:36:33] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-03-18 14:36:33] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 14:36:33] [INFO ] Invariant cache hit.
[2023-03-18 14:36:33] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 307 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 (ADD s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3186 reset in 1474 ms.
Product exploration explored 100000 steps with 3187 reset in 1492 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 481 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 318 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 14:36:37] [INFO ] Invariant cache hit.
[2023-03-18 14:36:37] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 4 ms returned sat
[2023-03-18 14:36:38] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-18 14:36:38] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 4 ms returned sat
[2023-03-18 14:36:38] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-18 14:36:38] [INFO ] After 258ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 135 ms.
[2023-03-18 14:36:38] [INFO ] After 434ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 35 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=17 )
Parikh walk visited 1 properties in 2 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge :(F (OR (G p0) (G (NOT p0))))
Knowledge based reduction with 12 factoid took 507 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN06-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN06-LTLCardinality-12 finished in 5580 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 36 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 108 transition count 216
Applied a total of 216 rules in 3 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
[2023-03-18 14:36:39] [INFO ] Invariant cache hit.
[2023-03-18 14:36:39] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-18 14:36:39] [INFO ] Invariant cache hit.
[2023-03-18 14:36:39] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-18 14:36:39] [INFO ] Invariant cache hit.
[2023-03-18 14:36:39] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 288 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-14 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 2 (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))], 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 1610 ms.
Product exploration explored 100000 steps with 50000 reset in 1673 ms.
Computed a total of 108 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 108 transition count 216
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 :(X p0)
Knowledge based reduction with 4 factoid took 66 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-COL-AN06-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN06-LTLCardinality-14 finished in 3863 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 36 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 216/216 transitions.
Graph (complete) has 648 edges and 324 vertex of which 108 are kept as prefixes of interest. Removing 216 places using SCC suffix rule.1 ms
Discarding 216 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 108 /324 variables (removed 216) and now considering 216/216 (removed 0) transitions.
[2023-03-18 14:36:42] [INFO ] Invariant cache hit.
[2023-03-18 14:36:43] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-18 14:36:43] [INFO ] Invariant cache hit.
[2023-03-18 14:36:43] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-18 14:36:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 14:36:43] [INFO ] Invariant cache hit.
[2023-03-18 14:36:43] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/324 places, 216/216 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 312 ms. Remains : 108/324 places, 216/216 transitions.
Stuttering acceptance computed with spot in 45 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN06-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 (ADD 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 s99 s100 s101 s102 s103 s104 s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 77681 steps with 2473 reset in 1005 ms.
FORMULA Sudoku-COL-AN06-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN06-LTLCardinality-15 finished in 1384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1||G(p0))))'
[2023-03-18 14:36:44] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7473095970658173655
[2023-03-18 14:36:44] [INFO ] Applying decomposition
[2023-03-18 14:36:44] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2023-03-18 14:36:44] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:36:44] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2023-03-18 14:36:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:36:44] [INFO ] Flatten gal took : 12 ms
[2023-03-18 14:36:44] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2023-03-18 14:36:44] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-18 14:36:44] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7473095970658173655
Running compilation step : cd /tmp/ltsmin7473095970658173655;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16815385822420643886.txt' '-o' '/tmp/graph16815385822420643886.bin' '-w' '/tmp/graph16815385822420643886.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16815385822420643886.bin' '-l' '-1' '-v' '-w' '/tmp/graph16815385822420643886.weights' '-q' '0' '-e' '0.001'
[2023-03-18 14:36:44] [INFO ] Decomposing Gal with order
[2023-03-18 14:36:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 14:36:44] [INFO ] Removed a total of 540 redundant transitions.
[2023-03-18 14:36:44] [INFO ] Flatten gal took : 76 ms
[2023-03-18 14:36:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2023-03-18 14:36:44] [INFO ] Time to serialize gal into /tmp/LTLCardinality11859939730214286838.gal : 4 ms
[2023-03-18 14:36:44] [INFO ] Time to serialize properties into /tmp/LTLCardinality11700856740533911587.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11859939730214286838.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11700856740533911587.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 2 LTL properties
Checking formula 0 : !((G(F("(((((((gu0.Rows_0+gu0.Rows_1)+(gu0.Rows_2+gu0.Rows_3))+((gu0.Rows_4+gu0.Rows_5)+(gu0.Rows_6+gu0.Rows_7)))+(((gu0.Rows_8+gu0.Ro...4736
Formula 0 simplified : FG!"(((((((gu0.Rows_0+gu0.Rows_1)+(gu0.Rows_2+gu0.Rows_3))+((gu0.Rows_4+gu0.Rows_5)+(gu0.Rows_6+gu0.Rows_7)))+(((gu0.Rows_8+gu0.Rows...4730
Compilation finished in 558 ms.
Running link step : cd /tmp/ltsmin7473095970658173655;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7473095970658173655;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: Initializing POR dependencies: labels 219, guards 216
pins2lts-mc-linux64( 1/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.420: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 2/ 8), 0.420: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.421: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.556: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.566: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.592: There are 221 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.592: State length is 325, there are 219 groups
pins2lts-mc-linux64( 0/ 8), 0.592: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.592: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.592: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.592: Visible groups: 0 / 219, labels: 1 / 221
pins2lts-mc-linux64( 0/ 8), 0.592: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.592: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 3/ 8), 0.945: [Blue] ~19 levels ~960 states ~18768 transitions
pins2lts-mc-linux64( 4/ 8), 1.007: [Blue] ~19 levels ~1920 states ~20408 transitions
pins2lts-mc-linux64( 5/ 8), 1.124: [Blue] ~19 levels ~3840 states ~22328 transitions
pins2lts-mc-linux64( 3/ 8), 1.370: [Blue] ~19 levels ~7680 states ~32312 transitions
pins2lts-mc-linux64( 3/ 8), 1.899: [Blue] ~19 levels ~15360 states ~47680 transitions
pins2lts-mc-linux64( 5/ 8), 2.860: [Blue] ~19 levels ~30720 states ~76928 transitions
pins2lts-mc-linux64( 5/ 8), 4.769: [Blue] ~19 levels ~61440 states ~148408 transitions
pins2lts-mc-linux64( 1/ 8), 8.703: [Blue] ~19 levels ~122880 states ~375936 transitions
pins2lts-mc-linux64( 5/ 8), 15.974: [Blue] ~19 levels ~245760 states ~718552 transitions
pins2lts-mc-linux64( 5/ 8), 30.519: [Blue] ~19 levels ~491520 states ~1463488 transitions
pins2lts-mc-linux64( 5/ 8), 58.079: [Blue] ~19 levels ~983040 states ~3164824 transitions
pins2lts-mc-linux64( 2/ 8), 113.473: [Blue] ~19 levels ~1966080 states ~7262656 transitions
pins2lts-mc-linux64( 7/ 8), 222.330: [Blue] ~19 levels ~3932160 states ~15000072 transitions
pins2lts-mc-linux64( 2/ 8), 444.370: [Blue] ~19 levels ~7864320 states ~31830224 transitions
pins2lts-mc-linux64( 7/ 8), 827.744: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 828.352:
pins2lts-mc-linux64( 0/ 8), 828.352: Explored 13568811 states 56183514 transitions, fanout: 4.141
pins2lts-mc-linux64( 0/ 8), 828.352: Total exploration time 827.720 sec (827.170 sec minimum, 827.394 sec on average)
pins2lts-mc-linux64( 0/ 8), 828.352: States per second: 16393, Transitions per second: 67877
pins2lts-mc-linux64( 0/ 8), 828.352:
pins2lts-mc-linux64( 0/ 8), 828.352: State space has 13582891 states, 13568667 are accepting
pins2lts-mc-linux64( 0/ 8), 828.352: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 828.352: blue states: 13568811 (99.90%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 828.352: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 828.352: all-red states: 13568667 (99.90%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 828.352:
pins2lts-mc-linux64( 0/ 8), 828.352: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 828.352:
pins2lts-mc-linux64( 0/ 8), 828.352: Queue width: 8B, total height: 152, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 828.352: Tree memory: 359.6MB, 27.8 B/state, compr.: 2.1%
pins2lts-mc-linux64( 0/ 8), 828.352: Tree fill ratio (roots/leafs): 10.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 828.352: Stored 216 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 828.352: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 828.352: Est. total memory use: 359.6MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7473095970658173655;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7473095970658173655;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--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.
[2023-03-18 14:58:06] [INFO ] Applying decomposition
[2023-03-18 14:58:06] [INFO ] Flatten gal took : 150 ms
[2023-03-18 14:58:06] [INFO ] Decomposing Gal with order
[2023-03-18 14:58:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 14:58:07] [INFO ] Removed a total of 402 redundant transitions.
[2023-03-18 14:58:07] [INFO ] Flatten gal took : 258 ms
[2023-03-18 14:58:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 15 ms.
[2023-03-18 14:58:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality3723381214499008801.gal : 22 ms
[2023-03-18 14:58:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality4575785293732935159.ltl : 50 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3723381214499008801.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4575785293732935159.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 2 LTL properties
Checking formula 0 : !((G(F("(((((((gNN0.Rows_0+gNN1.Rows_1)+(gNN2.Rows_2+gNN3.Rows_3))+((gNN4.Rows_4+gNN5.Rows_5)+(gNN6.Rows_6+gNN7.Rows_7)))+(((gNN8.Rows...4688
Formula 0 simplified : FG!"(((((((gNN0.Rows_0+gNN1.Rows_1)+(gNN2.Rows_2+gNN3.Rows_3))+((gNN4.Rows_4+gNN5.Rows_5)+(gNN6.Rows_6+gNN7.Rows_7)))+(((gNN8.Rows_8...4682
Detected timeout of ITS tools.
[2023-03-18 15:19:37] [INFO ] Flatten gal took : 210 ms
[2023-03-18 15:19:38] [INFO ] Input system was already deterministic with 216 transitions.
[2023-03-18 15:19:38] [INFO ] Transformed 324 places.
[2023-03-18 15:19:38] [INFO ] Transformed 216 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-18 15:19:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality9263327122061902952.gal : 5 ms
[2023-03-18 15:19:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality14847837121004578003.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9263327122061902952.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14847837121004578003.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("(((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows_...2864
Formula 0 simplified : FG!"(((((((Rows_0+Rows_1)+(Rows_2+Rows_3))+((Rows_4+Rows_5)+(Rows_6+Rows_7)))+(((Rows_8+Rows_9)+(Rows_10+Rows_11))+((Rows_12+Rows_13...2858
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 242384 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16228024 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-COL-AN06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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