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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 300K
-rw-r--r-- 1 mcc users 9.6K May 15 08:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 15 08:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 15 08:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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 3.2K Mar 28 16:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 13 19:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 13 19:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:52 equiv_pt
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 5 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 6.5K 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-COL-AN03-00
FORMULA_NAME Sudoku-COL-AN03-01
FORMULA_NAME Sudoku-COL-AN03-02
FORMULA_NAME Sudoku-COL-AN03-03
FORMULA_NAME Sudoku-COL-AN03-04
FORMULA_NAME Sudoku-COL-AN03-05
FORMULA_NAME Sudoku-COL-AN03-06
FORMULA_NAME Sudoku-COL-AN03-07
FORMULA_NAME Sudoku-COL-AN03-08
FORMULA_NAME Sudoku-COL-AN03-09
FORMULA_NAME Sudoku-COL-AN03-10
FORMULA_NAME Sudoku-COL-AN03-11
FORMULA_NAME Sudoku-COL-AN03-12
FORMULA_NAME Sudoku-COL-AN03-13
FORMULA_NAME Sudoku-COL-AN03-14
FORMULA_NAME Sudoku-COL-AN03-15

=== Now, execution of the tool begins

BK_START 1621194169216

Running Version 0
[2021-05-16 19:42:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-16 19:42:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 19:42:52] [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.
[2021-05-16 19:42:52] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-16 19:42:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 493 ms
[2021-05-16 19:42:52] [WARNING] Unknown color function,Tuple skipping symmetry detection on parameters for transition select
[2021-05-16 19:42:52] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 54 PT places and 27.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
FORMULA Sudoku-COL-AN03-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 19:42:53] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions in 33 ms.
[2021-05-16 19:42:53] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_2797353085818803672.dot
[2021-05-16 19:42:53] [INFO ] Initial state test concluded for 3 properties.
FORMULA Sudoku-COL-AN03-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 100000 steps, including 9090 resets, run finished after 193 ms. (steps per millisecond=518 ) properties (out of 16) seen :13
Running SMT prover for 3 properties.
// Phase 1: matrix 1 rows 4 cols
[2021-05-16 19:42:53] [INFO ] Computed 3 place invariants in 22 ms
[2021-05-16 19:42:53] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2021-05-16 19:42:53] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned unsat
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA Sudoku-COL-AN03-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 19:42:53] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-16 19:42:53] [INFO ] Flatten gal took : 33 ms
[2021-05-16 19:42:53] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA Sudoku-COL-AN03-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN03-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 19:42:53] [INFO ] Flatten gal took : 13 ms
[2021-05-16 19:42:53] [INFO ] Unfolded HLPN to a Petri net with 54 places and 27 transitions in 7 ms.
[2021-05-16 19:42:53] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_4956141114464443976.dot
Support contains 54 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 22 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 54 cols
[2021-05-16 19:42:53] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-16 19:42:53] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 27 rows 54 cols
[2021-05-16 19:42:53] [INFO ] Computed 27 place invariants in 2 ms
[2021-05-16 19:42:53] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 54 cols
[2021-05-16 19:42:53] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-16 19:42:53] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 27/27 transitions.
[2021-05-16 19:42:53] [INFO ] Flatten gal took : 7 ms
[2021-05-16 19:42:53] [INFO ] Flatten gal took : 7 ms
[2021-05-16 19:42:53] [INFO ] Input system was already deterministic with 27 transitions.
Incomplete random walk after 100000 steps, including 11753 resets, run finished after 502 ms. (steps per millisecond=199 ) properties (out of 12) seen :11
Running SMT prover for 1 properties.
// Phase 1: matrix 27 rows 54 cols
[2021-05-16 19:42:54] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-16 19:42:54] [INFO ] [Real]Absence check using 27 positive place invariants in 5 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 18 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 27/27 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 27 transition count 27
Applied a total of 27 rules in 6 ms. Remains 27 /54 variables (removed 27) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:42:54] [INFO ] Computed 8 place invariants in 4 ms
[2021-05-16 19:42:54] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:42:54] [INFO ] Computed 8 place invariants in 2 ms
[2021-05-16 19:42:54] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:42:54] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 19:42:54] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 325 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN03-01 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(GT 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8)), p1:(GT 2 (ADD s9 s10 s11 s12 s13 s14 s15 s16 s17))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN03-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN03-01 finished in 477 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 9 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 27/27 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 27 transition count 27
Applied a total of 27 rules in 1 ms. Remains 27 /54 variables (removed 27) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:42:55] [INFO ] Computed 8 place invariants in 10 ms
[2021-05-16 19:42:55] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:42:55] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 19:42:55] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:42:55] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 19:42:55] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN03-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 16 steps with 1 reset in 1 ms.
FORMULA Sudoku-COL-AN03-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN03-02 finished in 149 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((G(p0)||(p1&&X(F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 36 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 54 cols
[2021-05-16 19:42:55] [INFO ] Computed 27 place invariants in 2 ms
[2021-05-16 19:42:55] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 27 rows 54 cols
[2021-05-16 19:42:55] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-16 19:42:55] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 54 cols
[2021-05-16 19:42:55] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-16 19:42:55] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN03-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GT 1 (ADD 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)), p0:(GT 3 (ADD s45 s46 s47 s48 s49 s50 s51 s52 s53))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN03-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN03-05 finished in 259 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U p1))], workingDir=/home/mcc/execution]
Support contains 45 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 7 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 54 cols
[2021-05-16 19:42:55] [INFO ] Computed 27 place invariants in 0 ms
[2021-05-16 19:42:55] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 27 rows 54 cols
[2021-05-16 19:42:55] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-16 19:42:55] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2021-05-16 19:42:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 54 cols
[2021-05-16 19:42:55] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-16 19:42:55] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN03-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(LEQ (ADD s45 s46 s47 s48 s49 s50 s51 s52 s53) (ADD 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)), p0:(LEQ 3 (ADD s36 s37 s38 s39 s40 s41 s42 s43 s44))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 16666 reset in 534 ms.
Product exploration explored 100000 steps with 16666 reset in 560 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 27
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 (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (NOT p1), p0]
Stuttering acceptance computed with spot in 29 ms :[true, (NOT p1)]
Product exploration explored 100000 steps with 16666 reset in 429 ms.
Product exploration explored 100000 steps with 16666 reset in 462 ms.
[2021-05-16 19:42:57] [INFO ] Flatten gal took : 6 ms
[2021-05-16 19:42:57] [INFO ] Flatten gal took : 4 ms
[2021-05-16 19:42:57] [INFO ] Time to serialize gal into /tmp/LTL5162947310227914743.gal : 1 ms
[2021-05-16 19:42:57] [INFO ] Time to serialize properties into /tmp/LTL7113807729230397537.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/LTL5162947310227914743.gal, -t, CGAL, -LTL, /tmp/LTL7113807729230397537.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/LTL5162947310227914743.gal -t CGAL -LTL /tmp/LTL7113807729230397537.ltl -c -stutter-deadlock --gen-order FOLLOW
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)>=3)")U("(((((((((Columns_0+Columns_1)+Columns_2)+Columns_3)+Columns_4)+Columns_5)+Columns_6)+Columns_7)+Columns_8)<=((((((((((((((((((((((((((Board_0+Board_1)+Board_2)+Board_3)+Board_4)+Board_5)+Board_6)+Board_7)+Board_8)+Board_9)+Board_10)+Board_11)+Board_12)+Board_13)+Board_14)+Board_15)+Board_16)+Board_17)+Board_18)+Board_19)+Board_20)+Board_21)+Board_22)+Board_23)+Board_24)+Board_25)+Board_26))")))
Formula 0 simplified : !("(((((((((Cells_0+Cells_1)+Cells_2)+Cells_3)+Cells_4)+Cells_5)+Cells_6)+Cells_7)+Cells_8)>=3)" U "(((((((((Columns_0+Columns_1)+Columns_2)+Columns_3)+Columns_4)+Columns_5)+Columns_6)+Columns_7)+Columns_8)<=((((((((((((((((((((((((((Board_0+Board_1)+Board_2)+Board_3)+Board_4)+Board_5)+Board_6)+Board_7)+Board_8)+Board_9)+Board_10)+Board_11)+Board_12)+Board_13)+Board_14)+Board_15)+Board_16)+Board_17)+Board_18)+Board_19)+Board_20)+Board_21)+Board_22)+Board_23)+Board_24)+Board_25)+Board_26))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 390 deadlock states
6 unique states visited
0 strongly connected components in search stack
5 transitions explored
6 items max in DFS search stack
112 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,1.14307,56092,1,0,21,189738,23,18,1714,143598,63
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Sudoku-COL-AN03-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Sudoku-COL-AN03-06 finished in 3628 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 45 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 54 cols
[2021-05-16 19:42:59] [INFO ] Computed 27 place invariants in 2 ms
[2021-05-16 19:42:59] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 27 rows 54 cols
[2021-05-16 19:42:59] [INFO ] Computed 27 place invariants in 0 ms
[2021-05-16 19:42:59] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 54 cols
[2021-05-16 19:42:59] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-16 19:42:59] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN03-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8) (ADD 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)), p0:(LEQ 2 (ADD s45 s46 s47 s48 s49 s50 s51 s52 s53))], 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 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN03-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN03-08 finished in 174 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 36 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 54 cols
[2021-05-16 19:42:59] [INFO ] Computed 27 place invariants in 0 ms
[2021-05-16 19:42:59] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 27 rows 54 cols
[2021-05-16 19:42:59] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-16 19:42:59] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2021-05-16 19:42:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 54 cols
[2021-05-16 19:42:59] [INFO ] Computed 27 place invariants in 6 ms
[2021-05-16 19:42:59] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN03-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT (ADD 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 s36 s37 s38 s39 s40 s41 s42 s43 s44))], 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 11746 reset in 466 ms.
Product exploration explored 100000 steps with 11733 reset in 358 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 27
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 (OR (G p0) (G (NOT p0)))), (NOT p0)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11752 reset in 340 ms.
Product exploration explored 100000 steps with 11746 reset in 350 ms.
[2021-05-16 19:43:01] [INFO ] Flatten gal took : 4 ms
[2021-05-16 19:43:01] [INFO ] Flatten gal took : 4 ms
[2021-05-16 19:43:01] [INFO ] Time to serialize gal into /tmp/LTL12203828336243992379.gal : 1 ms
[2021-05-16 19:43:01] [INFO ] Time to serialize properties into /tmp/LTL13178441687104558463.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/LTL12203828336243992379.gal, -t, CGAL, -LTL, /tmp/LTL13178441687104558463.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/LTL12203828336243992379.gal -t CGAL -LTL /tmp/LTL13178441687104558463.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((((((((((((((((((((((((Board_0+Board_1)+Board_2)+Board_3)+Board_4)+Board_5)+Board_6)+Board_7)+Board_8)+Board_9)+Board_10)+Board_11)+Board_12)+Board_13)+Board_14)+Board_15)+Board_16)+Board_17)+Board_18)+Board_19)+Board_20)+Board_21)+Board_22)+Board_23)+Board_24)+Board_25)+Board_26)>((((((((Cells_0+Cells_1)+Cells_2)+Cells_3)+Cells_4)+Cells_5)+Cells_6)+Cells_7)+Cells_8))"))))
Formula 0 simplified : !FG"(((((((((((((((((((((((((((Board_0+Board_1)+Board_2)+Board_3)+Board_4)+Board_5)+Board_6)+Board_7)+Board_8)+Board_9)+Board_10)+Board_11)+Board_12)+Board_13)+Board_14)+Board_15)+Board_16)+Board_17)+Board_18)+Board_19)+Board_20)+Board_21)+Board_22)+Board_23)+Board_24)+Board_25)+Board_26)>((((((((Cells_0+Cells_1)+Cells_2)+Cells_3)+Cells_4)+Cells_5)+Cells_6)+Cells_7)+Cells_8))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 390 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
173 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,1.7365,68988,1,0,50,238787,24,46,1960,247220,144
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Sudoku-COL-AN03-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Sudoku-COL-AN03-11 finished in 3759 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (p1&&(G(!p0) U !p1))))], workingDir=/home/mcc/execution]
Support contains 45 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 54 cols
[2021-05-16 19:43:02] [INFO ] Computed 27 place invariants in 0 ms
[2021-05-16 19:43:02] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 27 rows 54 cols
[2021-05-16 19:43:03] [INFO ] Computed 27 place invariants in 0 ms
[2021-05-16 19:43:03] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2021-05-16 19:43:03] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 27 rows 54 cols
[2021-05-16 19:43:03] [INFO ] Computed 27 place invariants in 4 ms
[2021-05-16 19:43:03] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 85 ms :[p0, (OR p1 p0), true, true]
Running random walk in product with property : Sudoku-COL-AN03-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=3, aps=[p0:(GT (ADD 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 s36 s37 s38 s39 s40 s41 s42 s43 s44)), p1:(LEQ 1 (ADD s45 s46 s47 s48 s49 s50 s51 s52 s53))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN03-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN03-12 finished in 203 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 9 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 27/27 transitions.
Graph (complete) has 81 edges and 54 vertex of which 27 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.2 ms
Discarding 27 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 27 /54 variables (removed 27) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:03] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-16 19:43:03] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:03] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-16 19:43:03] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2021-05-16 19:43:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2021-05-16 19:43:03] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 19:43:03] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN03-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s18 s19 s20 s21 s22 s23 s24 s25 s26))], 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 9 steps with 0 reset in 0 ms.
FORMULA Sudoku-COL-AN03-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN03-15 finished in 117 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621194184643

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-COL-AN03"
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-4028"
echo " Executing tool itstools"
echo " Input is Sudoku-COL-AN03, 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 r254-tall-162106746000412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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