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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 8.4K Apr 30 12:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 30 12:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 30 11:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 30 11:39 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 4.1K May 9 09:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 09:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 09:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 09:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 6.5K 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-COL-AN09-LTLFireability-00
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-01
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-02
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-03
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-04
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-05
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-06
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-07
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-08
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-09
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-10
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-11
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-12
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-13
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-14
FORMULA_NAME Sudoku-COL-AN09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653073070243

Running Version 202205111006
[2022-05-20 18:57:51] [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-20 18:57:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 18:57:51] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-20 18:57:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 18:57:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 538 ms
[2022-05-20 18:57:52] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 972 PT places and 729.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2022-05-20 18:57:52] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 8 ms.
[2022-05-20 18:57:52] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Domain [N(9), N(9)] of place Rows breaks symmetries in sort N
[2022-05-20 18:57:52] [INFO ] Unfolded HLPN to a Petri net with 972 places and 729 transitions 2916 arcs in 31 ms.
[2022-05-20 18:57:52] [INFO ] Unfolded 16 HLPN properties in 6 ms.
Initial state reduction rules removed 5 formulas.
FORMULA Sudoku-COL-AN09-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN09-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 243 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Reduce places removed 729 places and 0 transitions.
Iterating post reduction 0 with 729 rules applied. Total rules applied 729 place count 243 transition count 729
Applied a total of 729 rules in 26 ms. Remains 243 /972 variables (removed 729) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:57:53] [INFO ] Computed 26 place invariants in 81 ms
[2022-05-20 18:57:53] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:57:53] [INFO ] Computed 26 place invariants in 28 ms
[2022-05-20 18:57:53] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:57:53] [INFO ] Computed 26 place invariants in 17 ms
[2022-05-20 18:57:54] [INFO ] Dead Transitions using invariants and state equation in 319 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 243/972 places, 729/729 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/972 places, 729/729 transitions.
Support contains 243 out of 243 places after structural reductions.
[2022-05-20 18:57:54] [INFO ] Flatten gal took : 267 ms
[2022-05-20 18:57:56] [INFO ] Flatten gal took : 272 ms
[2022-05-20 18:57:57] [INFO ] Input system was already deterministic with 729 transitions.
Finished random walk after 68 steps, including 0 resets, run visited all 4 properties in 34 ms. (steps per millisecond=2 )
FORMULA Sudoku-COL-AN09-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
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 F(X((G((F(p0)&&X(p0)))&&p0)))))'
Support contains 243 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 10 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:57:58] [INFO ] Computed 26 place invariants in 8 ms
[2022-05-20 18:57:58] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:57:58] [INFO ] Computed 26 place invariants in 13 ms
[2022-05-20 18:57:58] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2022-05-20 18:57:58] [INFO ] Redundant transitions in 45 ms returned []
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:57:58] [INFO ] Computed 26 place invariants in 8 ms
[2022-05-20 18:57:58] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 729/729 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN09-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s57 1) (GEQ s143 1) (GEQ s237 1)) (AND (GEQ s6 1) (GEQ s85 1) (GEQ s204 1)) (AND (GEQ s42 1) (GEQ s117 1) (GEQ s168 1)) (AND (GEQ s49 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 72 steps with 0 reset in 10 ms.
FORMULA Sudoku-COL-AN09-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN09-LTLFireability-00 finished in 932 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!F(!p1)||X(p2)||p0) U F(!p1)))'
Support contains 243 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 9 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:57:59] [INFO ] Computed 26 place invariants in 13 ms
[2022-05-20 18:57:59] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:57:59] [INFO ] Computed 26 place invariants in 18 ms
[2022-05-20 18:57:59] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2022-05-20 18:57:59] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:57:59] [INFO ] Computed 26 place invariants in 14 ms
[2022-05-20 18:57:59] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 729/729 transitions.
Stuttering acceptance computed with spot in 37 ms :[p1]
Running random walk in product with property : Sudoku-COL-AN09-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (AND (GEQ s57 1) (GEQ s143 1) (GEQ s237 1)) (AND (GEQ s6 1) (GEQ s85 1) (GEQ s204 1)) (AND (GEQ s42 1) (GEQ s117 1) (GEQ s168 1)) (AND (GEQ s49 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1418 reset in 4221 ms.
Product exploration explored 100000 steps with 1419 reset in 4176 ms.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
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 : [p1, (X p1), (X (X p1)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN09-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN09-LTLFireability-02 finished in 11115 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!(p0 U p0))))'
Support contains 243 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 10 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:58:10] [INFO ] Computed 26 place invariants in 11 ms
[2022-05-20 18:58:10] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:58:10] [INFO ] Computed 26 place invariants in 10 ms
[2022-05-20 18:58:10] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2022-05-20 18:58:10] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:58:10] [INFO ] Computed 26 place invariants in 10 ms
[2022-05-20 18:58:10] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 729/729 transitions.
Stuttering acceptance computed with spot in 70 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-AN09-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s57 1) (GEQ s143 1) (GEQ s237 1)) (AND (GEQ s6 1) (GEQ s85 1) (GEQ s204 1)) (AND (GEQ s42 1) (GEQ s117 1) (GEQ s168 1)) (AND (GEQ s49 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 1419 reset in 4053 ms.
Product exploration explored 100000 steps with 1417 reset in 4136 ms.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
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 :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 2789 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN09-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN09-LTLFireability-05 finished in 13678 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0) U G(X(X(G((X(p0)&&p0))))))))'
Support contains 243 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 10 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:58:23] [INFO ] Computed 26 place invariants in 8 ms
[2022-05-20 18:58:23] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:58:24] [INFO ] Computed 26 place invariants in 13 ms
[2022-05-20 18:58:24] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2022-05-20 18:58:24] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:58:24] [INFO ] Computed 26 place invariants in 10 ms
[2022-05-20 18:58:24] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 729/729 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN09-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s57 1) (GEQ s143 1) (GEQ s237 1)) (AND (GEQ s6 1) (GEQ s85 1) (GEQ s204 1)) (AND (GEQ s42 1) (GEQ s117 1) (GEQ s168 1)) (AND (GEQ s49 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 7 ms.
FORMULA Sudoku-COL-AN09-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN09-LTLFireability-06 finished in 680 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!G(X(p0)) U (X(X((F(p0)||p1)))&&G(p0))))'
Support contains 243 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 11 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:58:24] [INFO ] Computed 26 place invariants in 13 ms
[2022-05-20 18:58:24] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:58:24] [INFO ] Computed 26 place invariants in 9 ms
[2022-05-20 18:58:24] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2022-05-20 18:58:24] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:58:24] [INFO ] Computed 26 place invariants in 8 ms
[2022-05-20 18:58:25] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 729/729 transitions.
Stuttering acceptance computed with spot in 32 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN09-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s57 1) (GEQ s143 1) (GEQ s237 1)) (AND (GEQ s6 1) (GEQ s85 1) (GEQ s204 1)) (AND (GEQ s42 1) (GEQ s117 1) (GEQ s168 1)) (AND (GEQ s49 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1417 reset in 4130 ms.
Product exploration explored 100000 steps with 1420 reset in 4041 ms.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
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 :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN09-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN09-LTLFireability-07 finished in 10662 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 243 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 3 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:58:35] [INFO ] Computed 26 place invariants in 13 ms
[2022-05-20 18:58:35] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:58:35] [INFO ] Computed 26 place invariants in 12 ms
[2022-05-20 18:58:35] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:58:35] [INFO ] Computed 26 place invariants in 11 ms
[2022-05-20 18:58:35] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 729/729 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN09-LTLFireability-10 automaton TGBA Formula[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:(OR (AND (GEQ s57 1) (GEQ s143 1) (GEQ s237 1)) (AND (GEQ s6 1) (GEQ s85 1) (GEQ s204 1)) (AND (GEQ s42 1) (GEQ s117 1) (GEQ s168 1)) (AND (GEQ s49 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 8132 ms.
Product exploration explored 100000 steps with 33333 reset in 8289 ms.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
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 (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 1029 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN09-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN09-LTLFireability-10 finished in 20193 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&F(G(X(G(!p0))))))))'
Support contains 243 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 3 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:58:55] [INFO ] Computed 26 place invariants in 7 ms
[2022-05-20 18:58:55] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:58:55] [INFO ] Computed 26 place invariants in 9 ms
[2022-05-20 18:58:55] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:58:55] [INFO ] Computed 26 place invariants in 14 ms
[2022-05-20 18:58:55] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 729/729 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, true, (NOT p0), p0]
Running random walk in product with property : Sudoku-COL-AN09-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s57 1) (GEQ s143 1) (GEQ s237 1)) (AND (GEQ s6 1) (GEQ s85 1) (GEQ s204 1)) (AND (GEQ s42 1) (GEQ s117 1) (GEQ s168 1)) (AND (GEQ s49 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1418 reset in 4425 ms.
Product exploration explored 100000 steps with 1417 reset in 4393 ms.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
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 :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 4 states, 6 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN09-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN09-LTLFireability-11 finished in 11664 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U !G(p0)) U p0)))'
Support contains 243 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 2 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:59:07] [INFO ] Computed 26 place invariants in 11 ms
[2022-05-20 18:59:07] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:59:07] [INFO ] Computed 26 place invariants in 8 ms
[2022-05-20 18:59:07] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:59:07] [INFO ] Computed 26 place invariants in 17 ms
[2022-05-20 18:59:07] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 729/729 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN09-LTLFireability-12 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 s57 1) (GEQ s143 1) (GEQ s237 1)) (AND (GEQ s6 1) (GEQ s85 1) (GEQ s204 1)) (AND (GEQ s42 1) (GEQ s117 1) (GEQ s168 1)) (AND (GEQ s49 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 explored 100000 steps with 50000 reset in 6383 ms.
Product exploration explored 100000 steps with 50000 reset in 6443 ms.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
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 81 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN09-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN09-LTLFireability-12 finished in 15543 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||(F(p0) U X((p0 U p0)))))'
Support contains 243 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 2 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:59:22] [INFO ] Computed 26 place invariants in 9 ms
[2022-05-20 18:59:22] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:59:22] [INFO ] Computed 26 place invariants in 18 ms
[2022-05-20 18:59:22] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
// Phase 1: matrix 729 rows 243 cols
[2022-05-20 18:59:22] [INFO ] Computed 26 place invariants in 10 ms
[2022-05-20 18:59:23] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 729/729 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN09-LTLFireability-13 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 s57 1) (GEQ s143 1) (GEQ s237 1)) (AND (GEQ s6 1) (GEQ s85 1) (GEQ s204 1)) (AND (GEQ s42 1) (GEQ s117 1) (GEQ s168 1)) (AND (GEQ s49 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 explored 100000 steps with 50000 reset in 6501 ms.
Product exploration explored 100000 steps with 50000 reset in 6717 ms.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
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 1589 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-COL-AN09-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN09-LTLFireability-13 finished in 17464 ms.
All properties solved by simple procedures.
Total runtime 108580 ms.

BK_STOP 1653073180521

--------------------
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-COL-AN09"
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-COL-AN09, 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-165303545300108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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