Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r254-tall-162106746200565.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Sudoku-PT-AN02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106746200565
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 33K May 15 08:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 207K May 15 08:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 15 08:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K May 15 08:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.9K Mar 28 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Mar 28 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 28 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 30K Mar 28 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K May 13 19:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K May 13 19:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 13 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K May 13 19:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.3K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 7.4K May 5 16:52 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621232095152

Running Version 0
[2021-05-17 06:14:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 06:14:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 06:14:56] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2021-05-17 06:14:56] [INFO ] Transformed 20 places.
[2021-05-17 06:14:56] [INFO ] Transformed 8 transitions.
[2021-05-17 06:14:56] [INFO ] Parsed PT model containing 20 places and 8 transitions in 58 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 06:14:56] [INFO ] Initial state test concluded for 4 properties.
FORMULA Sudoku-PT-AN02-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 8/8 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 12 transition count 8
Applied a total of 8 rules in 8 ms. Remains 12 /20 variables (removed 8) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:14:56] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-17 06:14:56] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:14:56] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-17 06:14:57] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:14:57] [INFO ] Computed 5 place invariants in 6 ms
[2021-05-17 06:14:57] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/20 places, 8/8 transitions.
[2021-05-17 06:14:57] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 06:14:57] [INFO ] Flatten gal took : 18 ms
FORMULA Sudoku-PT-AN02-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 06:14:57] [INFO ] Flatten gal took : 5 ms
[2021-05-17 06:14:57] [INFO ] Input system was already deterministic with 8 transitions.
Finished random walk after 7 steps, including 1 resets, run visited all 11 properties in 1 ms. (steps per millisecond=7 )
FORMULA Sudoku-PT-AN02-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0 U (G(p0)||(F(G(p0))&&p1)))))], workingDir=/home/mcc/execution]
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 5 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:14:57] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 06:14:57] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:14:57] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 06:14:57] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2021-05-17 06:14:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:14:57] [INFO ] Computed 5 place invariants in 9 ms
[2021-05-17 06:14:57] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN02-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s5 1) (LT s10 1)) (OR (LT s0 1) (LT s4 1) (LT s8 1)) (OR (LT s2 1) (LT s7 1) (LT s10 1)) (OR (LT s1 1) (LT s5 1) (LT s11 1)) (OR (LT s2 1) (LT s6 1) (LT s8 1)) (OR (LT s1 1) (LT s4 1) (LT s9 1)) (OR (LT s3 1) (LT s7 1) (LT s11 1)) (OR (LT s3 1) (LT s6 1) (LT s9 1)))], nbAcceptance=1, 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 22214 reset in 240 ms.
Product exploration explored 100000 steps with 22242 reset in 163 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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 : [(F (G p0)), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Sudoku-PT-AN02-02 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Sudoku-PT-AN02-02 finished in 736 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(!p1)||p0)))], workingDir=/home/mcc/execution]
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:14:58] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 06:14:58] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:14:58] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 06:14:58] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:14:58] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 06:14:58] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN02-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(AND (OR (LT s0 1) (LT s5 1) (LT s10 1)) (OR (LT s0 1) (LT s4 1) (LT s8 1)) (OR (LT s2 1) (LT s7 1) (LT s10 1)) (OR (LT s1 1) (LT s5 1) (LT s11 1)) (OR (LT s2 1) (LT s6 1) (LT s8 1)) (OR (LT s1 1) (LT s4 1) (LT s9 1)) (OR (LT s3 1) (LT s7 1) (LT s11 1)) (OR (LT s3 1) (LT s6 1) (LT s9 1))), p0:(OR (AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1)) (AND (GEQ s0 1) (GEQ s4 1) (GEQ s8 1)) (AND (GEQ s2 1) (GEQ s7 1) (GEQ s10 1)) (AND (GEQ s1 1) (GEQ s5 1) (GEQ s11 1)) (AND (GEQ s2 1) (GEQ s6 1) (GEQ s8 1)) (AND (GEQ s1 1) (GEQ s4 1) (GEQ s9 1)) (AND (GEQ s3 1) (GEQ s7 1) (GEQ s11 1)) (AND (GEQ s3 1) (GEQ s6 1) (GEQ s9 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 159 ms.
Product exploration explored 100000 steps with 50000 reset in 185 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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 : [(F (G p1)), (F (G (NOT p0))), (NOT p1), p0]
Stuttering acceptance computed with spot in 81 ms :[(AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 94 ms.
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 80 ms :[(AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
Support contains 12 out of 12 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2021-05-17 06:14:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:14:59] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-17 06:14:59] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 8/8 transitions.
Product exploration explored 100000 steps with 50000 reset in 190 ms.
Product exploration explored 100000 steps with 50000 reset in 194 ms.
[2021-05-17 06:14:59] [INFO ] Flatten gal took : 2 ms
[2021-05-17 06:14:59] [INFO ] Flatten gal took : 2 ms
[2021-05-17 06:14:59] [INFO ] Time to serialize gal into /tmp/LTL13282987174199586943.gal : 1 ms
[2021-05-17 06:14:59] [INFO ] Time to serialize properties into /tmp/LTL11912373671080459802.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13282987174199586943.gal, -t, CGAL, -LTL, /tmp/LTL11912373671080459802.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13282987174199586943.gal -t CGAL -LTL /tmp/LTL11912373671080459802.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(((((((((F("((((((((((Rows_0_0>=1)&&(Cells_0_1>=1))&&(Columns_1_0>=1))||(((Rows_0_0>=1)&&(Cells_0_0>=1))&&(Columns_0_0>=1)))||(((Rows_1_0>=1)&&(Cells_1_1>=1))&&(Columns_1_0>=1)))||(((Rows_0_1>=1)&&(Cells_0_1>=1))&&(Columns_1_1>=1)))||(((Rows_1_0>=1)&&(Cells_1_0>=1))&&(Columns_0_0>=1)))||(((Rows_0_1>=1)&&(Cells_0_0>=1))&&(Columns_0_1>=1)))||(((Rows_1_1>=1)&&(Cells_1_1>=1))&&(Columns_1_1>=1)))||(((Rows_1_1>=1)&&(Cells_1_0>=1))&&(Columns_0_1>=1)))"))||("(((Rows_0_0>=1)&&(Cells_0_1>=1))&&(Columns_1_0>=1))"))||("(((Rows_0_0>=1)&&(Cells_0_0>=1))&&(Columns_0_0>=1))"))||("(((Rows_1_0>=1)&&(Cells_1_1>=1))&&(Columns_1_0>=1))"))||("(((Rows_0_1>=1)&&(Cells_0_1>=1))&&(Columns_1_1>=1))"))||("(((Rows_1_0>=1)&&(Cells_1_0>=1))&&(Columns_0_0>=1))"))||("(((Rows_0_1>=1)&&(Cells_0_0>=1))&&(Columns_0_1>=1))"))||("(((Rows_1_1>=1)&&(Cells_1_1>=1))&&(Columns_1_1>=1))"))||("(((Rows_1_1>=1)&&(Cells_1_0>=1))&&(Columns_0_1>=1))"))))
Formula 0 simplified : !X("(((Rows_0_0>=1)&&(Cells_0_0>=1))&&(Columns_0_0>=1))" | "(((Rows_0_0>=1)&&(Cells_0_1>=1))&&(Columns_1_0>=1))" | "(((Rows_0_1>=1)&&(Cells_0_0>=1))&&(Columns_0_1>=1))" | "(((Rows_0_1>=1)&&(Cells_0_1>=1))&&(Columns_1_1>=1))" | "(((Rows_1_0>=1)&&(Cells_1_0>=1))&&(Columns_0_0>=1))" | "(((Rows_1_0>=1)&&(Cells_1_1>=1))&&(Columns_1_0>=1))" | "(((Rows_1_1>=1)&&(Cells_1_0>=1))&&(Columns_0_1>=1))" | "(((Rows_1_1>=1)&&(Cells_1_1>=1))&&(Columns_1_1>=1))" | F"((((((((((Rows_0_0>=1)&&(Cells_0_1>=1))&&(Columns_1_0>=1))||(((Rows_0_0>=1)&&(Cells_0_0>=1))&&(Columns_0_0>=1)))||(((Rows_1_0>=1)&&(Cells_1_1>=1))&&(Columns_1_0>=1)))||(((Rows_0_1>=1)&&(Cells_0_1>=1))&&(Columns_1_1>=1)))||(((Rows_1_0>=1)&&(Cells_1_0>=1))&&(Columns_0_0>=1)))||(((Rows_0_1>=1)&&(Cells_0_0>=1))&&(Columns_0_1>=1)))||(((Rows_1_1>=1)&&(Cells_1_1>=1))&&(Columns_1_1>=1)))||(((Rows_1_1>=1)&&(Cells_1_0>=1))&&(Columns_0_1>=1)))")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/0/8/8
Computing Next relation with stutter on 5 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.021244,16752,1,0,30,890,63,12,327,586,24
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Sudoku-PT-AN02-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Sudoku-PT-AN02-03 finished in 1604 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((!p0&&X(!p0))))], workingDir=/home/mcc/execution]
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:14:59] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 06:14:59] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:14:59] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 06:14:59] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:14:59] [INFO ] Computed 5 place invariants in 9 ms
[2021-05-17 06:14:59] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 31 ms :[true, p0]
Running random walk in product with property : Sudoku-PT-AN02-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (OR (LT s0 1) (LT s5 1) (LT s10 1)) (OR (LT s0 1) (LT s4 1) (LT s8 1)) (OR (LT s2 1) (LT s7 1) (LT s10 1)) (OR (LT s1 1) (LT s5 1) (LT s11 1)) (OR (LT s2 1) (LT s6 1) (LT s8 1)) (OR (LT s1 1) (LT s4 1) (LT s9 1)) (OR (LT s3 1) (LT s7 1) (LT s11 1)) (OR (LT s3 1) (LT s6 1) (LT s9 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN02-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN02-06 finished in 110 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p1)&&p0)))], workingDir=/home/mcc/execution]
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:14:59] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 06:14:59] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:14:59] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 06:14:59] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2021-05-17 06:14:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:14:59] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 06:14:59] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN02-07 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s5 1) (LT s10 1)) (OR (LT s0 1) (LT s4 1) (LT s8 1)) (OR (LT s2 1) (LT s7 1) (LT s10 1)) (OR (LT s1 1) (LT s5 1) (LT s11 1)) (OR (LT s2 1) (LT s6 1) (LT s8 1)) (OR (LT s1 1) (LT s4 1) (LT s9 1)) (OR (LT s3 1) (LT s7 1) (LT s11 1)) (OR (LT s3 1) (LT s6 1) (LT s9 1))), p1:(AND (OR (LT s0 1) (LT s5 1) (LT s10 1)) (OR (LT s0 1) (LT s4 1) (LT s8 1)) (OR (LT s2 1) (LT s7 1) (LT s10 1)) (OR (LT s1 1) (LT s5 1) (LT s11 1)) (OR (LT s2 1) (LT s6 1) (LT s8 1)) (OR (LT s1 1) (LT s4 1) (LT s9 1)) (OR (LT s3 1) (LT s7 1) (LT s11 1)) (OR (LT s3 1) (LT s6 1) (LT s9 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22231 reset in 219 ms.
Product exploration explored 100000 steps with 22204 reset in 193 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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 : [(F (G p0)), (F (G p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 22168 reset in 136 ms.
Product exploration explored 100000 steps with 22207 reset in 165 ms.
[2021-05-17 06:15:00] [INFO ] Flatten gal took : 4 ms
[2021-05-17 06:15:00] [INFO ] Flatten gal took : 1 ms
[2021-05-17 06:15:00] [INFO ] Time to serialize gal into /tmp/LTL591620568335271806.gal : 0 ms
[2021-05-17 06:15:00] [INFO ] Time to serialize properties into /tmp/LTL12212360734376189532.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL591620568335271806.gal, -t, CGAL, -LTL, /tmp/LTL12212360734376189532.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL591620568335271806.gal -t CGAL -LTL /tmp/LTL12212360734376189532.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(((((((((G("((((((((((Rows_0_0<1)||(Cells_0_1<1))||(Columns_1_0<1))&&(((Rows_0_0<1)||(Cells_0_0<1))||(Columns_0_0<1)))&&(((Rows_1_0<1)||(Cells_1_1<1))||(Columns_1_0<1)))&&(((Rows_0_1<1)||(Cells_0_1<1))||(Columns_1_1<1)))&&(((Rows_1_0<1)||(Cells_1_0<1))||(Columns_0_0<1)))&&(((Rows_0_1<1)||(Cells_0_0<1))||(Columns_0_1<1)))&&(((Rows_1_1<1)||(Cells_1_1<1))||(Columns_1_1<1)))&&(((Rows_1_1<1)||(Cells_1_0<1))||(Columns_0_1<1)))"))&&("(((Rows_0_0<1)||(Cells_0_1<1))||(Columns_1_0<1))"))&&("(((Rows_0_0<1)||(Cells_0_0<1))||(Columns_0_0<1))"))&&("(((Rows_1_0<1)||(Cells_1_1<1))||(Columns_1_0<1))"))&&("(((Rows_0_1<1)||(Cells_0_1<1))||(Columns_1_1<1))"))&&("(((Rows_1_0<1)||(Cells_1_0<1))||(Columns_0_0<1))"))&&("(((Rows_0_1<1)||(Cells_0_0<1))||(Columns_0_1<1))"))&&("(((Rows_1_1<1)||(Cells_1_1<1))||(Columns_1_1<1))"))&&("(((Rows_1_1<1)||(Cells_1_0<1))||(Columns_0_1<1))"))))
Formula 0 simplified : !F("(((Rows_0_0<1)||(Cells_0_0<1))||(Columns_0_0<1))" & "(((Rows_0_0<1)||(Cells_0_1<1))||(Columns_1_0<1))" & "(((Rows_0_1<1)||(Cells_0_0<1))||(Columns_0_1<1))" & "(((Rows_0_1<1)||(Cells_0_1<1))||(Columns_1_1<1))" & "(((Rows_1_0<1)||(Cells_1_0<1))||(Columns_0_0<1))" & "(((Rows_1_0<1)||(Cells_1_1<1))||(Columns_1_0<1))" & "(((Rows_1_1<1)||(Cells_1_0<1))||(Columns_0_1<1))" & "(((Rows_1_1<1)||(Cells_1_1<1))||(Columns_1_1<1))" & G"((((((((((Rows_0_0<1)||(Cells_0_1<1))||(Columns_1_0<1))&&(((Rows_0_0<1)||(Cells_0_0<1))||(Columns_0_0<1)))&&(((Rows_1_0<1)||(Cells_1_1<1))||(Columns_1_0<1)))&&(((Rows_0_1<1)||(Cells_0_1<1))||(Columns_1_1<1)))&&(((Rows_1_0<1)||(Cells_1_0<1))||(Columns_0_0<1)))&&(((Rows_0_1<1)||(Cells_0_0<1))||(Columns_0_1<1)))&&(((Rows_1_1<1)||(Cells_1_1<1))||(Columns_1_1<1)))&&(((Rows_1_1<1)||(Cells_1_0<1))||(Columns_0_1<1)))")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/0/8/8
Computing Next relation with stutter on 5 deadlock states
7 unique states visited
0 strongly connected components in search stack
10 transitions explored
6 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.031933,19172,1,0,42,1300,94,24,369,1472,83
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Sudoku-PT-AN02-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Sudoku-PT-AN02-07 finished in 1889 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F(p0)) U G(p1))))], workingDir=/home/mcc/execution]
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:15:01] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 06:15:01] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:15:01] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 06:15:01] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:15:01] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 06:15:01] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : Sudoku-PT-AN02-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s0 1) (LT s4 1) (LT s8 1)), p0:(AND (GEQ s2 1) (GEQ s7 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 14 steps with 2 reset in 1 ms.
FORMULA Sudoku-PT-AN02-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN02-08 finished in 449 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:15:02] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 06:15:02] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:15:02] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 06:15:02] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:15:02] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 06:15:02] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN02-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s4 1) (LT s8 1) (AND (GEQ s3 1) (GEQ s7 1) (GEQ s11 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 35843 reset in 161 ms.
Product exploration explored 100000 steps with 35990 reset in 125 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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 : [(F (G p0)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Sudoku-PT-AN02-09 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Sudoku-PT-AN02-09 finished in 516 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((X(F(p1))||p0)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:15:02] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 06:15:02] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:15:02] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 06:15:02] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:15:02] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 06:15:02] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN02-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s4 1) (GEQ s8 1)) (AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1))), p1:(AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN02-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN02-10 finished in 162 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(!p0)||(p1&&X(p2)))))], workingDir=/home/mcc/execution]
Support contains 8 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:15:02] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 06:15:02] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:15:02] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 06:15:02] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:15:02] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 06:15:02] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 82 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, (AND p0 p1 (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN02-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s7 1) (GEQ s10 1)), p1:(OR (LT s3 1) (LT s7 1) (LT s11 1)), p2:(AND (OR (LT s0 1) (LT s4 1) (LT s8 1)) (OR (LT s2 1) (LT s7 1) (LT s10 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 28456 reset in 95 ms.
Product exploration explored 100000 steps with 28385 reset in 106 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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 : [(F (G (NOT p0))), (F (G p1)), (F (G p2)), p0, (NOT p1), (NOT p2)]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
FORMULA Sudoku-PT-AN02-11 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Sudoku-PT-AN02-11 finished in 395 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:15:03] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 06:15:03] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:15:03] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-17 06:15:03] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2021-05-17 06:15:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:15:03] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 06:15:03] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN02-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 1))], 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 2 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN02-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN02-12 finished in 130 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:15:03] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 06:15:03] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:15:03] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 06:15:03] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:15:03] [INFO ] Computed 5 place invariants in 13 ms
[2021-05-17 06:15:03] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 8/8 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN02-15 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s2 1) (GEQ s6 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN02-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN02-15 finished in 148 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621232104810

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-PT-AN02"
export BK_EXAMINATION="LTLFireability"
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-4028"
echo " Executing tool itstools"
echo " Input is Sudoku-PT-AN02, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-162106746200565"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN02.tgz
mv Sudoku-PT-AN02 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;