Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 31K Apr 30 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 199K Apr 30 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K Apr 30 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 109K Apr 30 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.3K May 9 09:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K May 9 09:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 9 09:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 9 09:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.7K May 9 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.4K May 9 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 21K May 10 09:34 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-AN03-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653092019620

Running Version 202205111006
[2022-05-21 00:13:40] [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]
[2022-05-21 00:13:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 00:13:40] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2022-05-21 00:13:40] [INFO ] Transformed 54 places.
[2022-05-21 00:13:40] [INFO ] Transformed 27 transitions.
[2022-05-21 00:13:40] [INFO ] Parsed PT model containing 54 places and 27 transitions in 163 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-PT-AN03-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Applied a total of 0 rules in 6 ms. Remains 54 /54 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 54 cols
[2022-05-21 00:13:41] [INFO ] Computed 27 place invariants in 9 ms
[2022-05-21 00:13:41] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 27 rows 54 cols
[2022-05-21 00:13:41] [INFO ] Computed 27 place invariants in 2 ms
[2022-05-21 00:13:41] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 54 cols
[2022-05-21 00:13:41] [INFO ] Computed 27 place invariants in 3 ms
[2022-05-21 00:13:41] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 27/27 transitions.
Support contains 54 out of 54 places after structural reductions.
[2022-05-21 00:13:41] [INFO ] Flatten gal took : 21 ms
[2022-05-21 00:13:41] [INFO ] Flatten gal took : 8 ms
[2022-05-21 00:13:41] [INFO ] Input system was already deterministic with 27 transitions.
Incomplete random walk after 10000 steps, including 1171 resets, run finished after 481 ms. (steps per millisecond=20 ) properties (out of 18) seen :10
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 27 rows 54 cols
[2022-05-21 00:13:42] [INFO ] Computed 27 place invariants in 1 ms
[2022-05-21 00:13:42] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:7
[2022-05-21 00:13:42] [INFO ] [Nat]Absence check using 27 positive place invariants in 4 ms returned sat
[2022-05-21 00:13:42] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 8 atomic propositions for a total of 10 simplifications.
FORMULA Sudoku-PT-AN03-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 54 stabilizing places and 27 stable transitions
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 (and all enablings converge to false).
FORMULA Sudoku-PT-AN03-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN03-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 9 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-21 00:13:42] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 00:13:42] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:13:42] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-21 00:13:42] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:13:42] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-21 00:13:42] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 27/54 places, 27/27 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN03-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (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, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 25 steps with 2 reset in 3 ms.
FORMULA Sudoku-PT-AN03-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-LTLCardinality-02 finished in 367 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(p0)))'
Support contains 9 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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.4 ms
Discarding 27 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 27 /54 variables (removed 27) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:13:42] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-21 00:13:43] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:13:43] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-21 00:13:43] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2022-05-21 00:13:43] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 27 rows 27 cols
[2022-05-21 00:13:43] [INFO ] Computed 8 place invariants in 5 ms
[2022-05-21 00:13:43] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/54 places, 27/27 transitions.
Finished structural reductions, in 1 iterations. Remains : 27/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN03-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, 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, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 57 steps with 6 reset in 2 ms.
FORMULA Sudoku-PT-AN03-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-LTLCardinality-04 finished in 284 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 28 transition count 27
Applied a total of 26 rules in 1 ms. Remains 28 /54 variables (removed 26) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 28 cols
[2022-05-21 00:13:43] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-21 00:13:43] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 27 rows 28 cols
[2022-05-21 00:13:43] [INFO ] Computed 8 place invariants in 2 ms
[2022-05-21 00:13:43] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
// Phase 1: matrix 27 rows 28 cols
[2022-05-21 00:13:43] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 00:13:43] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 28/54 places, 27/27 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN03-LTLCardinality-09 automaton TGBA Formula[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:(LEQ s8 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 1 reset in 0 ms.
FORMULA Sudoku-PT-AN03-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-LTLCardinality-09 finished in 262 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U G(p1)))'
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Graph (complete) has 81 edges and 54 vertex of which 28 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.0 ms
Discarding 26 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 28 /54 variables (removed 26) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 28 cols
[2022-05-21 00:13:43] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 00:13:43] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 27 rows 28 cols
[2022-05-21 00:13:43] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 00:13:43] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2022-05-21 00:13:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 28 cols
[2022-05-21 00:13:43] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-21 00:13:43] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/54 places, 27/27 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : Sudoku-PT-AN03-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 1 s8), p0:(GT s1 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN03-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-LTLCardinality-12 finished in 374 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((G(F(F(p0))) U p1)||p1)))'
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Graph (complete) has 81 edges and 54 vertex of which 28 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.0 ms
Discarding 26 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 28 /54 variables (removed 26) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 28 cols
[2022-05-21 00:13:43] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 00:13:43] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 27 rows 28 cols
[2022-05-21 00:13:43] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 00:13:43] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2022-05-21 00:13:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 28 cols
[2022-05-21 00:13:43] [INFO ] Computed 8 place invariants in 0 ms
[2022-05-21 00:13:44] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/54 places, 27/27 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN03-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s22 s3), p0:(LEQ s3 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 298 steps with 36 reset in 5 ms.
FORMULA Sudoku-PT-AN03-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-LTLCardinality-13 finished in 305 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Graph (complete) has 81 edges and 54 vertex of which 28 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.0 ms
Discarding 26 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 28 /54 variables (removed 26) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 28 cols
[2022-05-21 00:13:44] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 00:13:44] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 27 rows 28 cols
[2022-05-21 00:13:44] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-21 00:13:44] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2022-05-21 00:13:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 27 rows 28 cols
[2022-05-21 00:13:44] [INFO ] Computed 8 place invariants in 3 ms
[2022-05-21 00:13:44] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/54 places, 27/27 transitions.
Finished structural reductions, in 1 iterations. Remains : 28/54 places, 27/27 transitions.
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN03-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s9 s25)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 31 steps with 3 reset in 0 ms.
FORMULA Sudoku-PT-AN03-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-LTLCardinality-14 finished in 161 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((false U false)))'
Support contains 0 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 27/27 transitions.
Graph (complete) has 81 edges and 54 vertex of which 0 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.1 ms
Discarding 54 places :
Also discarding 27 output transitions
Drop transitions removed 27 transitions
Applied a total of 1 rules in 1 ms. Remains 0 /54 variables (removed 54) and now considering 0/27 (removed 27) transitions.
[2022-05-21 00:13:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-21 00:13:44] [INFO ] Implicit Places using invariants in 6 ms returned []
[2022-05-21 00:13:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-21 00:13:44] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2022-05-21 00:13:44] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-21 00:13:44] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-21 00:13:44] [INFO ] Dead Transitions using invariants and state equation in 4 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 0/54 places, 0/27 transitions.
Finished structural reductions, in 1 iterations. Remains : 0/54 places, 0/27 transitions.
Stuttering acceptance computed with spot in 9 ms :[true]
Running random walk in product with property : Sudoku-PT-AN03-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}]], initial=0, aps=[], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN03-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN03-LTLCardinality-15 finished in 50 ms.
All properties solved by simple procedures.
Total runtime 3685 ms.

BK_STOP 1653092024444

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-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-PT-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 r258-tall-165303545400219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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