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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.3M
-rw-r--r-- 1 mcc users 341K Apr 30 11:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.7M Apr 30 11:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 493K Apr 30 11:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.1M Apr 30 11:37 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 111K May 9 09:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 368K May 9 09:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 400K May 9 09:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M May 9 09:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 9 09:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 47K May 9 09:12 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 499K 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-BN09-LTLFireability-00
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-01
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-02
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-03
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-04
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-05
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-06
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-07
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-08
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-09
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-10
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-11
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-12
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-13
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-14
FORMULA_NAME Sudoku-PT-BN09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653120617843

Running Version 202205111006
[2022-05-21 08:10:18] [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 08:10:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 08:10:19] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2022-05-21 08:10:19] [INFO ] Transformed 1053 places.
[2022-05-21 08:10:19] [INFO ] Transformed 729 transitions.
[2022-05-21 08:10:19] [INFO ] Parsed PT model containing 1053 places and 729 transitions in 278 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 106 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-PT-BN09-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN09-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN09-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN09-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN09-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 324 out of 1053 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1053/1053 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 324 transition count 729
Applied a total of 729 rules in 30 ms. Remains 324 /1053 variables (removed 729) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2022-05-21 08:10:20] [INFO ] Computed 75 place invariants in 63 ms
[2022-05-21 08:10:21] [INFO ] Implicit Places using invariants in 330 ms returned []
// Phase 1: matrix 729 rows 324 cols
[2022-05-21 08:10:21] [INFO ] Computed 75 place invariants in 28 ms
[2022-05-21 08:10:21] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
// Phase 1: matrix 729 rows 324 cols
[2022-05-21 08:10:21] [INFO ] Computed 75 place invariants in 16 ms
[2022-05-21 08:10:22] [INFO ] Dead Transitions using invariants and state equation in 422 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 324/1053 places, 729/729 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/1053 places, 729/729 transitions.
Support contains 324 out of 324 places after structural reductions.
[2022-05-21 08:10:22] [INFO ] Flatten gal took : 199 ms
[2022-05-21 08:10:23] [INFO ] Flatten gal took : 181 ms
[2022-05-21 08:10:24] [INFO ] Input system was already deterministic with 729 transitions.
Incomplete random walk after 10000 steps, including 150 resets, run finished after 650 ms. (steps per millisecond=15 ) properties (out of 18) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4050 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 729 rows 324 cols
[2022-05-21 08:10:29] [INFO ] Computed 75 place invariants in 22 ms
[2022-05-21 08:10:32] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 324 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 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' '!(G(G(X(p0))))'
Support contains 324 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 3 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2022-05-21 08:10:33] [INFO ] Computed 75 place invariants in 12 ms
[2022-05-21 08:10:33] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 729 rows 324 cols
[2022-05-21 08:10:33] [INFO ] Computed 75 place invariants in 13 ms
[2022-05-21 08:10:33] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
// Phase 1: matrix 729 rows 324 cols
[2022-05-21 08:10:33] [INFO ] Computed 75 place invariants in 17 ms
[2022-05-21 08:10:33] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 729/729 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN09-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s0 1) (LT s90 1) (LT s166 1) (LT s279 1)) (OR (LT s21 1) (LT s102 1) (LT s188 1) (LT s318 1)) (OR (LT s46 1) (LT s118 1) (LT s212 1) (LT s...], 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 1 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-BN09-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN09-LTLFireability-01 finished in 925 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U G(p0))||(p0 U p0))))'
Support contains 324 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 19 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2022-05-21 08:10:33] [INFO ] Computed 75 place invariants in 23 ms
[2022-05-21 08:10:33] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 729 rows 324 cols
[2022-05-21 08:10:33] [INFO ] Computed 75 place invariants in 13 ms
[2022-05-21 08:10:34] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2022-05-21 08:10:34] [INFO ] Redundant transitions in 42 ms returned []
// Phase 1: matrix 729 rows 324 cols
[2022-05-21 08:10:34] [INFO ] Computed 75 place invariants in 13 ms
[2022-05-21 08:10:34] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 729/729 transitions.
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN09-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s90 1) (GEQ s166 1) (GEQ s279 1)) (AND (GEQ s21 1) (GEQ s102 1) (GEQ s188 1) (GEQ s318 1)) (AND (GEQ s46 1) (GEQ s118 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 67 steps with 0 reset in 6 ms.
FORMULA Sudoku-PT-BN09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN09-LTLFireability-03 finished in 734 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X((!p0 U F(!p0))))))'
Support contains 324 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 2 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2022-05-21 08:10:34] [INFO ] Computed 75 place invariants in 12 ms
[2022-05-21 08:10:34] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 729 rows 324 cols
[2022-05-21 08:10:34] [INFO ] Computed 75 place invariants in 126 ms
[2022-05-21 08:10:34] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
// Phase 1: matrix 729 rows 324 cols
[2022-05-21 08:10:34] [INFO ] Computed 75 place invariants in 12 ms
[2022-05-21 08:10:35] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 729/729 transitions.
Stuttering acceptance computed with spot in 98 ms :[p0, p0, p0]
Running random walk in product with property : Sudoku-PT-BN09-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=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:(AND (OR (LT s0 1) (LT s90 1) (LT s166 1) (LT s279 1)) (OR (LT s21 1) (LT s102 1) (LT s188 1) (LT s318 1)) (OR (LT s46 1) (LT s118 1) (LT s212 1) (LT s...], 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 timeout after 96970 steps with 32323 reset in 10001 ms.
Product exploration timeout after 96420 steps with 32140 reset in 10001 ms.
Computed a total of 324 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 324 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 : [(NOT p0), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-BN09-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN09-LTLFireability-04 finished in 23393 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(F(p1)&&p2))))'
Support contains 16 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 60 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2022-05-21 08:10:58] [INFO ] Computed 75 place invariants in 17 ms
[2022-05-21 08:10:58] [INFO ] Implicit Places using invariants in 332 ms returned []
// Phase 1: matrix 729 rows 324 cols
[2022-05-21 08:10:58] [INFO ] Computed 75 place invariants in 14 ms
[2022-05-21 08:10:59] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 988 ms to find 0 implicit places.
// Phase 1: matrix 729 rows 324 cols
[2022-05-21 08:10:59] [INFO ] Computed 75 place invariants in 12 ms
[2022-05-21 08:10:59] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 729/729 transitions.
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-BN09-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(OR (LT s45 1) (LT s126 1) (LT s215 1) (LT s315 1)), p0:(AND (GEQ s67 1) (GEQ s157 1) (GEQ s232 1) (GEQ s310 1)), p2:(OR (LT s38 1) (LT s119 1) (LT s20...], 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-BN09-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN09-LTLFireability-08 finished in 1551 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(F(p0)))))'
Support contains 4 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Graph (complete) has 0 edges and 324 vertex of which 314 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 55 ms. Remains 314 /324 variables (removed 10) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 314 cols
[2022-05-21 08:10:59] [INFO ] Computed 65 place invariants in 16 ms
[2022-05-21 08:10:59] [INFO ] Implicit Places using invariants in 290 ms returned []
// Phase 1: matrix 729 rows 314 cols
[2022-05-21 08:10:59] [INFO ] Computed 65 place invariants in 15 ms
[2022-05-21 08:11:00] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 926 ms to find 0 implicit places.
[2022-05-21 08:11:00] [INFO ] Redundant transitions in 90 ms returned []
// Phase 1: matrix 729 rows 314 cols
[2022-05-21 08:11:00] [INFO ] Computed 65 place invariants in 11 ms
[2022-05-21 08:11:00] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 314/324 places, 729/729 transitions.
Finished structural reductions, in 1 iterations. Remains : 314/324 places, 729/729 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN09-LTLFireability-09 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 (GEQ s68 1) (GEQ s139 1) (GEQ s219 1) (GEQ s274 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]]
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 6 ms.
FORMULA Sudoku-PT-BN09-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN09-LTLFireability-09 finished in 1437 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Graph (complete) has 0 edges and 324 vertex of which 300 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 300 /324 variables (removed 24) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 300 cols
[2022-05-21 08:11:00] [INFO ] Computed 56 place invariants in 10 ms
[2022-05-21 08:11:01] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 729 rows 300 cols
[2022-05-21 08:11:01] [INFO ] Computed 56 place invariants in 14 ms
[2022-05-21 08:11:01] [INFO ] Implicit Places using invariants and state equation in 686 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
[2022-05-21 08:11:01] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 729 rows 300 cols
[2022-05-21 08:11:01] [INFO ] Computed 56 place invariants in 11 ms
[2022-05-21 08:11:02] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 300/324 places, 729/729 transitions.
Finished structural reductions, in 1 iterations. Remains : 300/324 places, 729/729 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-BN09-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s78 1) (GEQ s135 1) (GEQ s218 1) (GEQ s297 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 66 steps with 0 reset in 5 ms.
FORMULA Sudoku-PT-BN09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN09-LTLFireability-10 finished in 1299 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X(p0)))))'
Support contains 4 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Graph (complete) has 0 edges and 324 vertex of which 308 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 ms. Remains 308 /324 variables (removed 16) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 308 cols
[2022-05-21 08:11:02] [INFO ] Computed 62 place invariants in 19 ms
[2022-05-21 08:11:02] [INFO ] Implicit Places using invariants in 280 ms returned []
// Phase 1: matrix 729 rows 308 cols
[2022-05-21 08:11:02] [INFO ] Computed 62 place invariants in 13 ms
[2022-05-21 08:11:03] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 914 ms to find 0 implicit places.
[2022-05-21 08:11:03] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 729 rows 308 cols
[2022-05-21 08:11:03] [INFO ] Computed 62 place invariants in 15 ms
[2022-05-21 08:11:03] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 308/324 places, 729/729 transitions.
Finished structural reductions, in 1 iterations. Remains : 308/324 places, 729/729 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-BN09-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s58 1) (GEQ s141 1) (GEQ s208 1) (GEQ s303 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 66 steps with 0 reset in 5 ms.
FORMULA Sudoku-PT-BN09-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN09-LTLFireability-11 finished in 1262 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(G(p1)))))'
Support contains 8 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2022-05-21 08:11:03] [INFO ] Computed 75 place invariants in 12 ms
[2022-05-21 08:11:03] [INFO ] Implicit Places using invariants in 305 ms returned []
// Phase 1: matrix 729 rows 324 cols
[2022-05-21 08:11:03] [INFO ] Computed 75 place invariants in 20 ms
[2022-05-21 08:11:04] [INFO ] Implicit Places using invariants and state equation in 641 ms returned []
Implicit Place search using SMT with State Equation took 956 ms to find 0 implicit places.
// Phase 1: matrix 729 rows 324 cols
[2022-05-21 08:11:04] [INFO ] Computed 75 place invariants in 14 ms
[2022-05-21 08:11:04] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 729/729 transitions.
Stuttering acceptance computed with spot in 244 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-BN09-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}, { cond=p0, acceptance={} source=6 dest: 2}]], initial=4, aps=[p1:(OR (LT s80 1) (LT s161 1) (LT s241 1) (LT s314 1)), p0:(AND (GEQ s32 1) (GEQ s131 1) (GEQ s195 1) (GEQ s302 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, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 5 ms.
FORMULA Sudoku-PT-BN09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN09-LTLFireability-12 finished in 1516 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 13 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2022-05-21 08:11:05] [INFO ] Computed 75 place invariants in 16 ms
[2022-05-21 08:11:05] [INFO ] Implicit Places using invariants in 291 ms returned []
// Phase 1: matrix 729 rows 324 cols
[2022-05-21 08:11:05] [INFO ] Computed 75 place invariants in 12 ms
[2022-05-21 08:11:05] [INFO ] Implicit Places using invariants and state equation in 657 ms returned []
Implicit Place search using SMT with State Equation took 949 ms to find 0 implicit places.
// Phase 1: matrix 729 rows 324 cols
[2022-05-21 08:11:06] [INFO ] Computed 75 place invariants in 17 ms
[2022-05-21 08:11:06] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 729/729 transitions.
Stuttering acceptance computed with spot in 364 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN09-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s12 1) (GEQ s84 1) (GEQ s171 1) (GEQ s246 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 5 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-BN09-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN09-LTLFireability-13 finished in 1611 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G(X((!G(p1)&&(X(p2)||G(p2)))))))'
Support contains 12 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 18 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2022-05-21 08:11:06] [INFO ] Computed 75 place invariants in 14 ms
[2022-05-21 08:11:06] [INFO ] Implicit Places using invariants in 291 ms returned []
// Phase 1: matrix 729 rows 324 cols
[2022-05-21 08:11:06] [INFO ] Computed 75 place invariants in 18 ms
[2022-05-21 08:11:07] [INFO ] Implicit Places using invariants and state equation in 642 ms returned []
Implicit Place search using SMT with State Equation took 934 ms to find 0 implicit places.
// Phase 1: matrix 729 rows 324 cols
[2022-05-21 08:11:07] [INFO ] Computed 75 place invariants in 20 ms
[2022-05-21 08:11:07] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 729/729 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), p1, (OR (NOT p2) p1), (NOT p2), true]
Running random walk in product with property : Sudoku-PT-BN09-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s52 1) (GEQ s115 1) (GEQ s207 1) (GEQ s250 1)), p1:(AND (GEQ s74 1) (GEQ s155 1) (GEQ s242 1) (GEQ s317 1)), p2:(AND (GEQ s39 1) (GEQ s111 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 131 steps with 7 reset in 20 ms.
FORMULA Sudoku-PT-BN09-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN09-LTLFireability-14 finished in 1468 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!(X(p0) U X(G(!p1)))&&G(p2)))))'
Support contains 8 out of 324 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 729/729 transitions.
Applied a total of 0 rules in 21 ms. Remains 324 /324 variables (removed 0) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 324 cols
[2022-05-21 08:11:08] [INFO ] Computed 75 place invariants in 22 ms
[2022-05-21 08:11:08] [INFO ] Implicit Places using invariants in 314 ms returned []
// Phase 1: matrix 729 rows 324 cols
[2022-05-21 08:11:08] [INFO ] Computed 75 place invariants in 17 ms
[2022-05-21 08:11:09] [INFO ] Implicit Places using invariants and state equation in 657 ms returned []
Implicit Place search using SMT with State Equation took 973 ms to find 0 implicit places.
[2022-05-21 08:11:09] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 729 rows 324 cols
[2022-05-21 08:11:09] [INFO ] Computed 75 place invariants in 15 ms
[2022-05-21 08:11:09] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 324/324 places, 729/729 transitions.
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-BN09-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (LT s18 1) (LT s81 1) (LT s182 1) (LT s261 1)), p1:(AND (GEQ s21 1) (GEQ s84 1) (GEQ s180 1) (GEQ s246 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 65 steps with 0 reset in 9 ms.
FORMULA Sudoku-PT-BN09-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN09-LTLFireability-15 finished in 1380 ms.
All properties solved by simple procedures.
Total runtime 50528 ms.

BK_STOP 1653120669894

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

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