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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 29M
-rw-r--r-- 1 mcc users 1.2M Apr 30 12:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 5.6M Apr 30 12:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3M Apr 30 11:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 11M Apr 30 11:41 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 460K May 9 09:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.5M May 9 09:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M May 9 09:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 4.1M May 9 09:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 107K May 9 09:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 261K 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 1.2M 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-AN13-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653111434829

Running Version 202205111006
[2022-05-21 05:37:15] [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 05:37:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 05:37:16] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2022-05-21 05:37:16] [INFO ] Transformed 2704 places.
[2022-05-21 05:37:16] [INFO ] Transformed 2197 transitions.
[2022-05-21 05:37:16] [INFO ] Parsed PT model containing 2704 places and 2197 transitions in 315 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 215 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-PT-AN13-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 507 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 68 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:37:23] [INFO ] Computed 38 place invariants in 121 ms
[2022-05-21 05:37:23] [INFO ] Implicit Places using invariants in 319 ms returned []
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:37:23] [INFO ] Computed 38 place invariants in 67 ms
[2022-05-21 05:37:24] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1280 ms to find 0 implicit places.
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:37:24] [INFO ] Computed 38 place invariants in 59 ms
[2022-05-21 05:37:25] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions, in 1 iterations. Remains : 507/2704 places, 2197/2197 transitions.
Support contains 507 out of 507 places after structural reductions.
[2022-05-21 05:37:26] [INFO ] Flatten gal took : 561 ms
[2022-05-21 05:37:30] [INFO ] Flatten gal took : 677 ms
[2022-05-21 05:37:34] [INFO ] Input system was already deterministic with 2197 transitions.
Finished random walk after 146 steps, including 0 resets, run visited all 13 properties in 72 ms. (steps per millisecond=2 )
FORMULA Sudoku-PT-AN13-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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' '!(X(((X(p0) U ((p0 U p0)&&p0))&&p0)))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 4 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:37:37] [INFO ] Computed 38 place invariants in 53 ms
[2022-05-21 05:37:37] [INFO ] Implicit Places using invariants in 141 ms returned []
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:37:37] [INFO ] Computed 38 place invariants in 46 ms
[2022-05-21 05:37:38] [INFO ] Implicit Places using invariants and state equation in 669 ms returned []
Implicit Place search using SMT with State Equation took 814 ms to find 0 implicit places.
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:37:38] [INFO ] Computed 38 place invariants in 47 ms
[2022-05-21 05:37:39] [INFO ] Dead Transitions using invariants and state equation in 774 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s82 1) (GEQ s258 1) (GEQ s485 1)) (AND (GEQ s136 1) (GEQ s302 1) (GEQ s383 1)) (AND (GEQ s116 1) (GEQ s285 1) (GEQ s506 1)) (AND (GEQ s48...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 47330 steps with 23665 reset in 10002 ms.
Product exploration timeout after 47150 steps with 23575 reset in 10001 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN13-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLFireability-00 finished in 24731 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(X(X(X(p0))))) U X(((G(F(p0))||p1) U p0))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 6 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:38:02] [INFO ] Computed 38 place invariants in 51 ms
[2022-05-21 05:38:02] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:38:02] [INFO ] Computed 38 place invariants in 54 ms
[2022-05-21 05:38:02] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:38:02] [INFO ] Computed 38 place invariants in 69 ms
[2022-05-21 05:38:03] [INFO ] Dead Transitions using invariants and state equation in 748 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s82 1) (GEQ s258 1) (GEQ s485 1)) (AND (GEQ s136 1) (GEQ s302 1) (GEQ s383 1)) (AND (GEQ s116 1) (GEQ s285 1) (GEQ s506 1)) (AND (GEQ s48...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 48080 steps with 24040 reset in 10001 ms.
Product exploration timeout after 47640 steps with 23820 reset in 10001 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 122 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN13-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLFireability-01 finished in 24780 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!((p0 U G(!G(p0))) U (p0 U !p0))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 7 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:38:26] [INFO ] Computed 38 place invariants in 50 ms
[2022-05-21 05:38:27] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:38:27] [INFO ] Computed 38 place invariants in 44 ms
[2022-05-21 05:38:27] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:38:27] [INFO ] Computed 38 place invariants in 47 ms
[2022-05-21 05:38:28] [INFO ] Dead Transitions using invariants and state equation in 688 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s82 1) (GEQ s258 1) (GEQ s485 1)) (AND (GEQ s136 1) (GEQ s302 1) (GEQ s383 1)) (AND (GEQ s116 1) (GEQ s285 1) (GEQ s506 1)) (AND (GEQ s48...], 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 145 steps with 0 reset in 22 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-02 finished in 1589 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||X((F(!p0)&&X(G(p0))))))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 22 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:38:28] [INFO ] Computed 38 place invariants in 46 ms
[2022-05-21 05:38:28] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:38:28] [INFO ] Computed 38 place invariants in 44 ms
[2022-05-21 05:38:29] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
[2022-05-21 05:38:29] [INFO ] Redundant transitions in 122 ms returned []
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:38:29] [INFO ] Computed 38 place invariants in 50 ms
[2022-05-21 05:38:30] [INFO ] Dead Transitions using invariants and state equation in 692 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s82 1) (LT s258 1) (LT s485 1)) (OR (LT s136 1) (LT s302 1) (LT s383 1)) (OR (LT s116 1) (LT s285 1) (LT s506 1)) (OR (LT s48 1) (LT s218 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 72830 steps with 491 reset in 10001 ms.
Product exploration timeout after 72180 steps with 486 reset in 10002 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN13-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLFireability-04 finished in 23364 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(G(F(X(G((F(G(p0))||p0)))))))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 15 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:38:51] [INFO ] Computed 38 place invariants in 49 ms
[2022-05-21 05:38:52] [INFO ] Implicit Places using invariants in 151 ms returned []
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:38:52] [INFO ] Computed 38 place invariants in 48 ms
[2022-05-21 05:38:52] [INFO ] Implicit Places using invariants and state equation in 656 ms returned []
Implicit Place search using SMT with State Equation took 809 ms to find 0 implicit places.
[2022-05-21 05:38:52] [INFO ] Redundant transitions in 104 ms returned []
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:38:52] [INFO ] Computed 38 place invariants in 48 ms
[2022-05-21 05:38:53] [INFO ] Dead Transitions using invariants and state equation in 720 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-05 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 (OR (LT s82 1) (LT s258 1) (LT s485 1)) (OR (LT s136 1) (LT s302 1) (LT s383 1)) (OR (LT s116 1) (LT s285 1) (LT s506 1)) (OR (LT s48 1) (LT s218 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 72910 steps with 491 reset in 10003 ms.
Product exploration timeout after 72450 steps with 488 reset in 10001 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN13-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLFireability-05 finished in 23532 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U (X(F(!G(p0))) U F(p0)))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 5 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:39:15] [INFO ] Computed 38 place invariants in 42 ms
[2022-05-21 05:39:15] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:39:15] [INFO ] Computed 38 place invariants in 42 ms
[2022-05-21 05:39:16] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:39:16] [INFO ] Computed 38 place invariants in 43 ms
[2022-05-21 05:39:16] [INFO ] Dead Transitions using invariants and state equation in 717 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, p0, p0]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s82 1) (GEQ s258 1) (GEQ s485 1)) (AND (GEQ s136 1) (GEQ s302 1) (GEQ s383 1)) (AND (GEQ s116 1) (GEQ s285 1) (GEQ s506 1)) (AND (GEQ s48...], 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-AN13-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-06 finished in 1628 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!X(!(X((G(p0)&&p0))&&G(X(p0)))) U p0)))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 6 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:39:17] [INFO ] Computed 38 place invariants in 41 ms
[2022-05-21 05:39:17] [INFO ] Implicit Places using invariants in 122 ms returned []
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:39:17] [INFO ] Computed 38 place invariants in 44 ms
[2022-05-21 05:39:17] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:39:17] [INFO ] Computed 38 place invariants in 44 ms
[2022-05-21 05:39:18] [INFO ] Dead Transitions using invariants and state equation in 711 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(OR (AND (GEQ s82 1) (GEQ s258 1) (GEQ s485 1)) (AND (GEQ s136 1) (GEQ s302 1) (GEQ s383 1)) (AND (GEQ s116 1) (GEQ s285 1) (GEQ s506 1)) (AND (GEQ s48...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 48030 steps with 24015 reset in 10001 ms.
Product exploration timeout after 47670 steps with 23835 reset in 10002 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN13-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLFireability-07 finished in 23261 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X((G(X(X(p2)))||p3))&&p1)||p0)))'
Support contains 9 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 108 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:39:40] [INFO ] Computed 38 place invariants in 50 ms
[2022-05-21 05:39:40] [INFO ] Implicit Places using invariants in 568 ms returned []
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:39:41] [INFO ] Computed 38 place invariants in 45 ms
[2022-05-21 05:39:50] [INFO ] Implicit Places using invariants and state equation in 9690 ms returned []
Implicit Place search using SMT with State Equation took 10272 ms to find 0 implicit places.
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:39:50] [INFO ] Computed 38 place invariants in 43 ms
[2022-05-21 05:39:51] [INFO ] Dead Transitions using invariants and state equation in 707 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p3) (NOT p2)), (NOT p2), (NOT p2), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p3), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=5, aps=[p0:(OR (LT s92 1) (LT s269 1) (LT s456 1)), p1:(AND (GEQ s48 1) (GEQ s216 1) (GEQ s451 1)), p3:(AND (GEQ s48 1) (GEQ s216 1) (GEQ s451 1) (GEQ s60 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 55 steps with 17 reset in 22 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-08 finished in 11314 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&p1)))'
Support contains 9 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 53 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:39:51] [INFO ] Computed 38 place invariants in 52 ms
[2022-05-21 05:39:52] [INFO ] Implicit Places using invariants in 541 ms returned []
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:39:52] [INFO ] Computed 38 place invariants in 45 ms
[2022-05-21 05:39:58] [INFO ] Implicit Places using invariants and state equation in 6692 ms returned []
Implicit Place search using SMT with State Equation took 7236 ms to find 0 implicit places.
[2022-05-21 05:39:58] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:39:58] [INFO ] Computed 38 place invariants in 50 ms
[2022-05-21 05:39:59] [INFO ] Dead Transitions using invariants and state equation in 694 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (AND (GEQ s71 1) (GEQ s235 1) (GEQ s357 1) (GEQ s67 1) (GEQ s240 1) (GEQ s418 1)) (LT s71 1) (LT s235 1) (LT s357 1)), p1:(OR (LT s61 1) (LT s227 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, null][true, true]]
Product exploration timeout after 41680 steps with 882 reset in 10002 ms.
Product exploration timeout after 42280 steps with 808 reset in 10004 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X p0), (X (NOT p1)), (X p1)]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN13-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLFireability-10 finished in 28634 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X(G(X(p0)))))||F(p0))))'
Support contains 3 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 104 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:40:20] [INFO ] Computed 38 place invariants in 44 ms
[2022-05-21 05:40:20] [INFO ] Implicit Places using invariants in 549 ms returned []
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:40:20] [INFO ] Computed 38 place invariants in 43 ms
[2022-05-21 05:40:32] [INFO ] Implicit Places using invariants and state equation in 12113 ms returned []
Implicit Place search using SMT with State Equation took 12664 ms to find 0 implicit places.
[2022-05-21 05:40:33] [INFO ] Redundant transitions in 37 ms returned []
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:40:33] [INFO ] Computed 38 place invariants in 48 ms
[2022-05-21 05:40:33] [INFO ] Dead Transitions using invariants and state equation in 744 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-13 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 s51 1) (GEQ s218 1) (GEQ s480 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 148 steps with 0 reset in 23 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-13 finished in 13662 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(G((F(p0) U X(p1)))))||X(p2)))'
Support contains 9 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 43 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:40:33] [INFO ] Computed 38 place invariants in 47 ms
[2022-05-21 05:40:34] [INFO ] Implicit Places using invariants in 525 ms returned []
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:40:34] [INFO ] Computed 38 place invariants in 47 ms
[2022-05-21 05:40:41] [INFO ] Implicit Places using invariants and state equation in 7138 ms returned []
Implicit Place search using SMT with State Equation took 7665 ms to find 0 implicit places.
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:40:41] [INFO ] Computed 38 place invariants in 41 ms
[2022-05-21 05:40:42] [INFO ] Dead Transitions using invariants and state equation in 737 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1)), (NOT p1), false, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p2:(OR (LT s34 1) (LT s197 1) (LT s372 1)), p0:(AND (GEQ s34 1) (GEQ s197 1) (GEQ s372 1) (GEQ s62 1) (GEQ s231 1) (GEQ s478 1)), p1:(AND (GEQ s88 1) (GEQ...], 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]]
Product exploration timeout after 44470 steps with 5520 reset in 10002 ms.
Product exploration timeout after 44270 steps with 5526 reset in 10002 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) p0 p1), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p2)), (X p2)]
Knowledge based reduction with 4 factoid took 326 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1)), (NOT p1), false, (AND (NOT p1) (NOT p2))]
Finished random walk after 304 steps, including 2 resets, run visited all 5 properties in 50 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p2) p0 p1), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p2)), (X p2), (F (AND (NOT p1) (NOT p0))), (F (NOT p1)), (F p2), (F (AND p1 (NOT p0))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 4 factoid took 334 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1)), (NOT p1), false, (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1)), (NOT p1), false, (AND (NOT p1) (NOT p2))]
Support contains 9 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 42 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:41:04] [INFO ] Computed 38 place invariants in 42 ms
[2022-05-21 05:41:04] [INFO ] Implicit Places using invariants in 531 ms returned []
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:41:04] [INFO ] Computed 38 place invariants in 52 ms
[2022-05-21 05:41:08] [INFO ] Implicit Places using invariants and state equation in 4040 ms returned []
Implicit Place search using SMT with State Equation took 4573 ms to find 0 implicit places.
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:41:08] [INFO ] Computed 38 place invariants in 49 ms
[2022-05-21 05:41:09] [INFO ] Dead Transitions using invariants and state equation in 686 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 507/507 places, 2197/2197 transitions.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) p0 p1), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p2)), (X p2)]
Knowledge based reduction with 4 factoid took 251 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1)), (NOT p1), false, (AND (NOT p1) (NOT p2))]
Finished random walk after 173 steps, including 1 resets, run visited all 5 properties in 32 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p2) p0 p1), (F (G p2)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p2)), (X p2), (F (AND (NOT p1) (NOT p0))), (F (NOT p1)), (F p2), (F (AND p1 (NOT p0))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 4 factoid took 356 ms. Reduced automaton from 6 states, 13 edges and 3 AP to 6 states, 13 edges and 3 AP.
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1)), (NOT p1), false, (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1)), (NOT p1), false, (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1)), (NOT p1), false, (AND (NOT p1) (NOT p2))]
Product exploration timeout after 43390 steps with 5761 reset in 10002 ms.
Product exploration timeout after 44300 steps with 5452 reset in 10002 ms.
Applying partial POR strategy [true, true, true, true, true, false]
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1)), (NOT p1), false, (AND (NOT p1) (NOT p2))]
Support contains 9 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 107 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2022-05-21 05:41:31] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:41:31] [INFO ] Computed 38 place invariants in 48 ms
[2022-05-21 05:41:32] [INFO ] Dead Transitions using invariants and state equation in 683 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 507/507 places, 2197/2197 transitions.
Product exploration timeout after 43730 steps with 5496 reset in 10001 ms.
Product exploration timeout after 44940 steps with 5168 reset in 10001 ms.
Built C files in :
/tmp/ltsmin13643769135653090476
[2022-05-21 05:41:52] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13643769135653090476
Running compilation step : cd /tmp/ltsmin13643769135653090476;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13643769135653090476;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13643769135653090476;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 9 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 38 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:41:55] [INFO ] Computed 38 place invariants in 61 ms
[2022-05-21 05:41:56] [INFO ] Implicit Places using invariants in 512 ms returned []
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:41:56] [INFO ] Computed 38 place invariants in 42 ms
[2022-05-21 05:42:01] [INFO ] Implicit Places using invariants and state equation in 5449 ms returned []
Implicit Place search using SMT with State Equation took 5962 ms to find 0 implicit places.
// Phase 1: matrix 2197 rows 507 cols
[2022-05-21 05:42:01] [INFO ] Computed 38 place invariants in 70 ms
[2022-05-21 05:42:02] [INFO ] Dead Transitions using invariants and state equation in 698 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 507/507 places, 2197/2197 transitions.
Built C files in :
/tmp/ltsmin18408045768390990772
[2022-05-21 05:42:02] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18408045768390990772
Running compilation step : cd /tmp/ltsmin18408045768390990772;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18408045768390990772;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18408045768390990772;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-21 05:42:06] [INFO ] Flatten gal took : 262 ms
[2022-05-21 05:42:06] [INFO ] Flatten gal took : 84 ms
[2022-05-21 05:42:06] [INFO ] Time to serialize gal into /tmp/LTL12352031345318809987.gal : 28 ms
[2022-05-21 05:42:06] [INFO ] Time to serialize properties into /tmp/LTL13599434846554252616.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12352031345318809987.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13599434846554252616.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1235203...268
Read 1 LTL properties
Checking formula 0 : !(((X(F(G((F("((((Rows_2_8>=1)&&(Cells_2_2>=1))&&((Columns_2_8>=1)&&(Rows_4_10>=1)))&&((Cells_4_10>=1)&&(Columns_10_10>=1)))"))U(X("((...272
Formula 0 simplified : !(XFG(F"((((Rows_2_8>=1)&&(Cells_2_2>=1))&&((Columns_2_8>=1)&&(Rows_4_10>=1)))&&((Cells_4_10>=1)&&(Columns_10_10>=1)))" U X"(((Rows_...257
Detected timeout of ITS tools.
[2022-05-21 05:42:21] [INFO ] Flatten gal took : 107 ms
[2022-05-21 05:42:21] [INFO ] Applying decomposition
[2022-05-21 05:42:21] [INFO ] Flatten gal took : 78 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13358603233108534716.txt' '-o' '/tmp/graph13358603233108534716.bin' '-w' '/tmp/graph13358603233108534716.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13358603233108534716.bin' '-l' '-1' '-v' '-w' '/tmp/graph13358603233108534716.weights' '-q' '0' '-e' '0.001'
[2022-05-21 05:42:21] [INFO ] Decomposing Gal with order
[2022-05-21 05:42:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 05:42:22] [INFO ] Removed a total of 6084 redundant transitions.
[2022-05-21 05:42:22] [INFO ] Flatten gal took : 189 ms
[2022-05-21 05:42:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 17 ms.
[2022-05-21 05:42:22] [INFO ] Time to serialize gal into /tmp/LTL1800966311732779364.gal : 14 ms
[2022-05-21 05:42:22] [INFO ] Time to serialize properties into /tmp/LTL489648642876903360.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1800966311732779364.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL489648642876903360.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1800966...244
Read 1 LTL properties
Checking formula 0 : !(((X(F(G((F("((((u34.Rows_2_8>=1)&&(u197.Cells_2_2>=1))&&((u372.Columns_2_8>=1)&&(u62.Rows_4_10>=1)))&&((u231.Cells_4_10>=1)&&(u478.C...328
Formula 0 simplified : !(XFG(F"((((u34.Rows_2_8>=1)&&(u197.Cells_2_2>=1))&&((u372.Columns_2_8>=1)&&(u62.Rows_4_10>=1)))&&((u231.Cells_4_10>=1)&&(u478.Colum...313
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11194011604153379973
[2022-05-21 05:42:37] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11194011604153379973
Running compilation step : cd /tmp/ltsmin11194011604153379973;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11194011604153379973;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11194011604153379973;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Sudoku-PT-AN13-LTLFireability-15 finished in 126439 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(G((F(p0) U X(p1)))))||X(p2)))'
[2022-05-21 05:42:40] [INFO ] Flatten gal took : 77 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin264273007382424856
[2022-05-21 05:42:40] [INFO ] Too many transitions (2197) to apply POR reductions. Disabling POR matrices.
[2022-05-21 05:42:40] [INFO ] Applying decomposition
[2022-05-21 05:42:40] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin264273007382424856
Running compilation step : cd /tmp/ltsmin264273007382424856;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-21 05:42:40] [INFO ] Flatten gal took : 88 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15791164051811272546.txt' '-o' '/tmp/graph15791164051811272546.bin' '-w' '/tmp/graph15791164051811272546.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15791164051811272546.bin' '-l' '-1' '-v' '-w' '/tmp/graph15791164051811272546.weights' '-q' '0' '-e' '0.001'
[2022-05-21 05:42:40] [INFO ] Decomposing Gal with order
[2022-05-21 05:42:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 05:42:41] [INFO ] Removed a total of 6084 redundant transitions.
[2022-05-21 05:42:41] [INFO ] Flatten gal took : 138 ms
[2022-05-21 05:42:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 26 ms.
[2022-05-21 05:42:41] [INFO ] Time to serialize gal into /tmp/LTLFireability13260328848541572715.gal : 12 ms
[2022-05-21 05:42:41] [INFO ] Time to serialize properties into /tmp/LTLFireability14179415322861132885.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13260328848541572715.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14179415322861132885.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !(((X(F(G((F("((((u34.Rows_2_8>=1)&&(u197.Cells_2_2>=1))&&((u372.Columns_2_8>=1)&&(u62.Rows_4_10>=1)))&&((u231.Cells_4_10>=1)&&(u478.C...328
Formula 0 simplified : !(XFG(F"((((u34.Rows_2_8>=1)&&(u197.Cells_2_2>=1))&&((u372.Columns_2_8>=1)&&(u62.Rows_4_10>=1)))&&((u231.Cells_4_10>=1)&&(u478.Colum...313
Compilation finished in 4602 ms.
Running link step : cd /tmp/ltsmin264273007382424856;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin264273007382424856;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>([]((<>((LTLAPp0==true)) U X((LTLAPp1==true))))))||X((LTLAPp2==true)))' '--buchi-type=spotba'
LTSmin run took 2455 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 331803 ms.

BK_STOP 1653111767775

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

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