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

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

Running Version 0
[2021-05-17 06:14:37] [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-17 06:14:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 06:14:37] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2021-05-17 06:14:37] [INFO ] Transformed 20 places.
[2021-05-17 06:14:37] [INFO ] Transformed 8 transitions.
[2021-05-17 06:14:37] [INFO ] Parsed PT model containing 20 places and 8 transitions in 59 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 06:14:37] [INFO ] Initial state test concluded for 4 properties.
FORMULA Sudoku-PT-AN02-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 20 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 20 cols
[2021-05-17 06:14:37] [INFO ] Computed 12 place invariants in 6 ms
[2021-05-17 06:14:37] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 8 rows 20 cols
[2021-05-17 06:14:37] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-17 06:14:37] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 20 cols
[2021-05-17 06:14:37] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 06:14:37] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 8/8 transitions.
[2021-05-17 06:14:37] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 06:14:37] [INFO ] Flatten gal took : 16 ms
FORMULA Sudoku-PT-AN02-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 06:14:38] [INFO ] Flatten gal took : 5 ms
[2021-05-17 06:14:38] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 100000 steps, including 22231 resets, run finished after 313 ms. (steps per millisecond=319 ) properties (out of 22) seen :17
Running SMT prover for 5 properties.
// Phase 1: matrix 8 rows 20 cols
[2021-05-17 06:14:38] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-17 06:14:38] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned unsat
[2021-05-17 06:14:38] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned unsat
[2021-05-17 06:14:38] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned unsat
[2021-05-17 06:14:38] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned unsat
[2021-05-17 06:14:38] [INFO ] [Real]Absence check using 12 positive place invariants in 1 ms returned unsat
Successfully simplified 5 atomic propositions for a total of 10 simplifications.
[2021-05-17 06:14:38] [INFO ] Initial state test concluded for 3 properties.
FORMULA Sudoku-PT-AN02-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 8/8 transitions.
Graph (complete) has 24 edges and 20 vertex of which 12 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 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:38] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 06:14:38] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:14:38] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 06:14:38] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2021-05-17 06:14:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 12 cols
[2021-05-17 06:14:38] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 06:14:38] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN02-01 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}]], initial=1, aps=[p0:(LEQ 3 (ADD s4 s5 s6 s7))], 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 2 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN02-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN02-01 finished in 224 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 16 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 20 cols
[2021-05-17 06:14:38] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 06:14:38] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 8 rows 20 cols
[2021-05-17 06:14:38] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 06:14:38] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2021-05-17 06:14:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 20 cols
[2021-05-17 06:14:38] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-17 06:14:38] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN02-04 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ (ADD s4 s5 s6 s7 s8 s9 s10 s11) (ADD s0 s1 s2 s3)), p0:(LEQ 1 (ADD s12 s13 s14 s15))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 1 reset in 1 ms.
FORMULA Sudoku-PT-AN02-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN02-04 finished in 162 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 8 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 20 cols
[2021-05-17 06:14:38] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 06:14:38] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 8 rows 20 cols
[2021-05-17 06:14:38] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 06:14:38] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 20 cols
[2021-05-17 06:14:38] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 06:14:38] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN02-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT 1 (ADD s4 s5 s6 s7 s8 s9 s10 s11))], 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]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN02-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN02-05 finished in 132 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((X(p0)||G(p1)))||G(p2)))], workingDir=/home/mcc/execution]
Support contains 6 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 8/8 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 13 transition count 8
Applied a total of 7 rules in 0 ms. Remains 13 /20 variables (removed 7) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 13 cols
[2021-05-17 06:14:38] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 06:14:38] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 8 rows 13 cols
[2021-05-17 06:14:38] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-17 06:14:39] [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.
// Phase 1: matrix 8 rows 13 cols
[2021-05-17 06:14:39] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 06:14:39] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 253 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN02-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 5}, { cond=(AND p2 p1), acceptance={} source=4 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=6 dest: 8}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 9}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 9}], [{ cond=(NOT p1), acceptance={} source=8 dest: 0}, { cond=p1, acceptance={} source=8 dest: 8}], [{ cond=(NOT p2), acceptance={} source=9 dest: 0}, { cond=p2, acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=10 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=10 dest: 8}, { cond=(AND p2 (NOT p1)), acceptance={} source=10 dest: 9}, { cond=(AND p2 p1), acceptance={} source=10 dest: 10}]], initial=2, aps=[p0:(LEQ s2 s11), p2:(GT s10 s1), p1:(LEQ s3 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 145 steps with 47 reset in 3 ms.
FORMULA Sudoku-PT-AN02-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN02-08 finished in 325 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 8/8 transitions.
Graph (complete) has 24 edges and 20 vertex of which 13 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 13 /20 variables (removed 7) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 13 cols
[2021-05-17 06:14:39] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 06:14:39] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 8 rows 13 cols
[2021-05-17 06:14:39] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 06:14:39] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2021-05-17 06:14:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 13 cols
[2021-05-17 06:14:39] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 06:14:39] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 23 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN02-11 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s10 s4), p1:(AND (GT s8 s0) (GT 2 s8))], nbAcceptance=2, 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 229 steps with 51 reset in 3 ms.
FORMULA Sudoku-PT-AN02-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN02-11 finished in 94 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F(p0))||(G(p1)&&X(p2))))], workingDir=/home/mcc/execution]
Support contains 6 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 8/8 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 13 transition count 8
Applied a total of 7 rules in 0 ms. Remains 13 /20 variables (removed 7) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 13 cols
[2021-05-17 06:14:39] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 06:14:39] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 8 rows 13 cols
[2021-05-17 06:14:39] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 06:14:39] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 13 cols
[2021-05-17 06:14:39] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 06:14:39] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN02-12 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s2 s12), p0:(GT s4 s9), p2:(GT s6 s10)], 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, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 2 reset in 0 ms.
FORMULA Sudoku-PT-AN02-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN02-12 finished in 157 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 20/20 places, 8/8 transitions.
Graph (complete) has 24 edges and 20 vertex of which 13 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 13 /20 variables (removed 7) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 13 cols
[2021-05-17 06:14:39] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 06:14:39] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 8 rows 13 cols
[2021-05-17 06:14:39] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 06:14:39] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2021-05-17 06:14:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 13 cols
[2021-05-17 06:14:39] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 06:14:39] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/20 places, 8/8 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN02-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s12 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 92 steps with 25 reset in 1 ms.
FORMULA Sudoku-PT-AN02-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN02-13 finished in 110 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621232080616

--------------------
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-PT-AN02"
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-AN02, 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-162106746200564"
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 [ "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 ;