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-165303545500284.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-AN11, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545500284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.0M
-rw-r--r-- 1 mcc users 207K Apr 30 12:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 967K Apr 30 12:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 534K Apr 30 12:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.5M Apr 30 12:13 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 178K May 9 09:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 603K May 9 09:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 680K May 9 09:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.5M May 9 09:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 65K May 9 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 161K May 9 09:11 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 746K 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-AN11-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN11-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653107514417

Running Version 202205111006
[2022-05-21 04:31:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-21 04:31:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 04:31:55] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2022-05-21 04:31:55] [INFO ] Transformed 1694 places.
[2022-05-21 04:31:55] [INFO ] Transformed 1331 transitions.
[2022-05-21 04:31:55] [INFO ] Parsed PT model containing 1694 places and 1331 transitions in 283 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 98 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA Sudoku-PT-AN11-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 363 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1331 places and 0 transitions.
Iterating post reduction 0 with 1331 rules applied. Total rules applied 1331 place count 363 transition count 1331
Applied a total of 1331 rules in 45 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:31:57] [INFO ] Computed 32 place invariants in 93 ms
[2022-05-21 04:31:57] [INFO ] Implicit Places using invariants in 564 ms returned []
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:31:57] [INFO ] Computed 32 place invariants in 59 ms
[2022-05-21 04:31:59] [INFO ] Implicit Places using invariants and state equation in 1509 ms returned []
Implicit Place search using SMT with State Equation took 2102 ms to find 0 implicit places.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:31:59] [INFO ] Computed 32 place invariants in 42 ms
[2022-05-21 04:31:59] [INFO ] Dead Transitions using invariants and state equation in 550 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions, in 1 iterations. Remains : 363/1694 places, 1331/1331 transitions.
Support contains 363 out of 363 places after structural reductions.
[2022-05-21 04:32:00] [INFO ] Flatten gal took : 276 ms
[2022-05-21 04:32:01] [INFO ] Flatten gal took : 285 ms
[2022-05-21 04:32:03] [INFO ] Input system was already deterministic with 1331 transitions.
Finished random walk after 103 steps, including 0 resets, run visited all 15 properties in 79 ms. (steps per millisecond=1 )
FORMULA Sudoku-PT-AN11-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p0)))'
Support contains 363 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 4 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:32:04] [INFO ] Computed 32 place invariants in 40 ms
[2022-05-21 04:32:04] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:32:04] [INFO ] Computed 32 place invariants in 32 ms
[2022-05-21 04:32:04] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:32:04] [INFO ] Computed 32 place invariants in 41 ms
[2022-05-21 04:32:05] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 250 ms :[(NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s51 1) (GEQ s172 1) (GEQ s326 1)) (AND (GEQ s104 1) (GEQ s223 1) (GEQ s280 1)) (AND (GEQ s69 1) (GEQ s195 1) (GEQ s333 1)) (AND (GEQ s6 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 83460 steps with 41730 reset in 10002 ms.
Product exploration timeout after 84220 steps with 42110 reset in 10002 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 116 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN11-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN11-LTLFireability-01 finished in 30276 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((((G(p0)&&p0) U X(!F(!p0))) U p0)))'
Support contains 363 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 4 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:32:34] [INFO ] Computed 32 place invariants in 25 ms
[2022-05-21 04:32:34] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:32:34] [INFO ] Computed 32 place invariants in 31 ms
[2022-05-21 04:32:34] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:32:34] [INFO ] Computed 32 place invariants in 26 ms
[2022-05-21 04:32:35] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 347 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-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: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s51 1) (GEQ s172 1) (GEQ s326 1)) (AND (GEQ s104 1) (GEQ s223 1) (GEQ s280 1)) (AND (GEQ s69 1) (GEQ s195 1) (GEQ s333 1)) (AND (GEQ s6 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 86660 steps with 43330 reset in 10001 ms.
Product exploration timeout after 86320 steps with 43160 reset in 10001 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 467 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN11-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN11-LTLFireability-02 finished in 30748 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p0))||(X(p0)&&F(p0)))))'
Support contains 363 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 2 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:33:05] [INFO ] Computed 32 place invariants in 32 ms
[2022-05-21 04:33:05] [INFO ] Implicit Places using invariants in 105 ms returned []
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:33:05] [INFO ] Computed 32 place invariants in 26 ms
[2022-05-21 04:33:05] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:33:05] [INFO ] Computed 32 place invariants in 28 ms
[2022-05-21 04:33:06] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s51 1) (GEQ s172 1) (GEQ s326 1)) (AND (GEQ s104 1) (GEQ s223 1) (GEQ s280 1)) (AND (GEQ s69 1) (GEQ s195 1) (GEQ s333 1)) (AND (GEQ s6 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration timeout after 85630 steps with 42815 reset in 10001 ms.
Product exploration timeout after 86070 steps with 43035 reset in 10001 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN11-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN11-LTLFireability-05 finished in 29819 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X(G(F((G(p0)||p0))))))))'
Support contains 363 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 18 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:33:34] [INFO ] Computed 32 place invariants in 31 ms
[2022-05-21 04:33:34] [INFO ] Implicit Places using invariants in 119 ms returned []
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:33:35] [INFO ] Computed 32 place invariants in 27 ms
[2022-05-21 04:33:35] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
[2022-05-21 04:33:35] [INFO ] Redundant transitions in 80 ms returned []
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:33:35] [INFO ] Computed 32 place invariants in 34 ms
[2022-05-21 04:33:36] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s51 1) (LT s172 1) (LT s326 1)) (OR (LT s104 1) (LT s223 1) (LT s280 1)) (OR (LT s69 1) (LT s195 1) (LT s333 1)) (OR (LT s6 1) (LT s130 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 945 reset in 7618 ms.
Product exploration explored 100000 steps with 945 reset in 7739 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN11-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN11-LTLFireability-06 finished in 25426 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U F(X((G(X(p0))||p1))))))'
Support contains 363 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 4 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:34:00] [INFO ] Computed 32 place invariants in 26 ms
[2022-05-21 04:34:00] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:34:00] [INFO ] Computed 32 place invariants in 25 ms
[2022-05-21 04:34:00] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:34:00] [INFO ] Computed 32 place invariants in 29 ms
[2022-05-21 04:34:01] [INFO ] Dead Transitions using invariants and state equation in 457 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s51 1) (GEQ s172 1) (GEQ s326 1)) (AND (GEQ s104 1) (GEQ s223 1) (GEQ s280 1)) (AND (GEQ s69 1) (GEQ s195 1) (GEQ s333 1)) (AND (GEQ s6 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 65970 steps with 21990 reset in 10003 ms.
Product exploration timeout after 65460 steps with 21820 reset in 10001 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 5 factoid took 164 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN11-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN11-LTLFireability-07 finished in 31278 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(p1)&&p0))))'
Support contains 6 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 80 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:34:31] [INFO ] Computed 32 place invariants in 32 ms
[2022-05-21 04:34:32] [INFO ] Implicit Places using invariants in 380 ms returned []
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:34:32] [INFO ] Computed 32 place invariants in 34 ms
[2022-05-21 04:34:33] [INFO ] Implicit Places using invariants and state equation in 1270 ms returned []
Implicit Place search using SMT with State Equation took 1666 ms to find 0 implicit places.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:34:33] [INFO ] Computed 32 place invariants in 25 ms
[2022-05-21 04:34:33] [INFO ] Dead Transitions using invariants and state equation in 435 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s74 1) (GEQ s187 1) (GEQ s250 1)), p1:(AND (GEQ s97 1) (GEQ s218 1) (GEQ s350 1))], 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 10 steps with 0 reset in 3 ms.
FORMULA Sudoku-PT-AN11-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLFireability-12 finished in 2329 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X((p0 U p1)))||p2)))'
Support contains 12 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 26 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:34:33] [INFO ] Computed 32 place invariants in 29 ms
[2022-05-21 04:34:34] [INFO ] Implicit Places using invariants in 427 ms returned []
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:34:34] [INFO ] Computed 32 place invariants in 34 ms
[2022-05-21 04:34:35] [INFO ] Implicit Places using invariants and state equation in 1306 ms returned []
Implicit Place search using SMT with State Equation took 1735 ms to find 0 implicit places.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:34:35] [INFO ] Computed 32 place invariants in 25 ms
[2022-05-21 04:34:36] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), true]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (OR (LT s65 1) (LT s181 1) (LT s307 1)) (OR (LT s33 1) (LT s155 1) (LT s253 1))), p1:(AND (GEQ s56 1) (GEQ s179 1) (GEQ s276 1)), p0:(AND (GEQ s65...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 132 steps with 27 reset in 26 ms.
FORMULA Sudoku-PT-AN11-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLFireability-13 finished in 2404 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(F(p1))||(!F(p2)&&F(p3)))))'
Support contains 12 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 32 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:34:36] [INFO ] Computed 32 place invariants in 31 ms
[2022-05-21 04:34:36] [INFO ] Implicit Places using invariants in 354 ms returned []
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:34:36] [INFO ] Computed 32 place invariants in 30 ms
[2022-05-21 04:34:37] [INFO ] Implicit Places using invariants and state equation in 1298 ms returned []
Implicit Place search using SMT with State Equation took 1654 ms to find 0 implicit places.
[2022-05-21 04:34:38] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:34:38] [INFO ] Computed 32 place invariants in 31 ms
[2022-05-21 04:34:38] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 398 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2)), (NOT p1), (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p1) p2), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2))]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 8}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=0 dest: 9}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 1}, { cond=p2, acceptance={} source=5 dest: 2}, { cond=(NOT p2), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(NOT p3), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=7 dest: 9}], [{ cond=(AND p2 p0), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=8 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p2:(AND (GEQ s53 1) (GEQ s172 1) (GEQ s328 1)), p0:(AND (GEQ s25 1) (GEQ s146 1) (GEQ s278 1)), p1:(AND (GEQ s111 1) (GEQ s237 1) (GEQ s309 1)), p3:(AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 102 steps with 0 reset in 12 ms.
FORMULA Sudoku-PT-AN11-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLFireability-14 finished in 2638 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(p1)&&p0))||X((X(X(p2)) U F(p2))))))'
Support contains 9 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 24 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:34:38] [INFO ] Computed 32 place invariants in 30 ms
[2022-05-21 04:34:39] [INFO ] Implicit Places using invariants in 355 ms returned []
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:34:39] [INFO ] Computed 32 place invariants in 31 ms
[2022-05-21 04:34:40] [INFO ] Implicit Places using invariants and state equation in 1413 ms returned []
Implicit Place search using SMT with State Equation took 1784 ms to find 0 implicit places.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:34:40] [INFO ] Computed 32 place invariants in 35 ms
[2022-05-21 04:34:41] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 363/363 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Sudoku-PT-AN11-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p2:(AND (GEQ s69 1) (GEQ s187 1) (GEQ s245 1)), p1:(AND (GEQ s16 1) (GEQ s142 1) (GEQ s357 1)), p0:(AND (GEQ s1 1) (GEQ s129 1) (GEQ s331 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 104 steps with 1 reset in 15 ms.
FORMULA Sudoku-PT-AN11-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLFireability-15 finished in 2542 ms.
All properties solved by simple procedures.
Total runtime 165908 ms.

BK_STOP 1653107681850

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ 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 LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@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-AN11"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Sudoku-PT-AN11, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r258-tall-165303545500284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN11.tgz
mv Sudoku-PT-AN11 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;