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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.4M
-rw-r--r-- 1 mcc users 99K Apr 30 11:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 508K Apr 30 11:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 263K Apr 30 11:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 30 11:38 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 84K May 9 09:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 294K May 9 09:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 137K May 9 09:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 500K May 9 09:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K May 9 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K May 9 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 204K 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-AN07-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN07-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN07-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN07-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN07-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN07-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN07-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN07-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN07-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN07-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN07-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN07-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN07-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN07-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN07-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653098728941

Running Version 202205111006
[2022-05-21 02:05:30] [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 02:05:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 02:05:30] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2022-05-21 02:05:30] [INFO ] Transformed 490 places.
[2022-05-21 02:05:30] [INFO ] Transformed 343 transitions.
[2022-05-21 02:05:30] [INFO ] Parsed PT model containing 490 places and 343 transitions in 269 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 39 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Sudoku-PT-AN07-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN07-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN07-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN07-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN07-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 147 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Reduce places removed 343 places and 0 transitions.
Iterating post reduction 0 with 343 rules applied. Total rules applied 343 place count 147 transition count 343
Applied a total of 343 rules in 16 ms. Remains 147 /490 variables (removed 343) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:30] [INFO ] Computed 20 place invariants in 34 ms
[2022-05-21 02:05:30] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:30] [INFO ] Computed 20 place invariants in 14 ms
[2022-05-21 02:05:30] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:31] [INFO ] Computed 20 place invariants in 13 ms
[2022-05-21 02:05:31] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 147/490 places, 343/343 transitions.
Finished structural reductions, in 1 iterations. Remains : 147/490 places, 343/343 transitions.
Support contains 147 out of 147 places after structural reductions.
[2022-05-21 02:05:31] [INFO ] Flatten gal took : 91 ms
[2022-05-21 02:05:31] [INFO ] Flatten gal took : 90 ms
[2022-05-21 02:05:32] [INFO ] Input system was already deterministic with 343 transitions.
Finished random walk after 41 steps, including 0 resets, run visited all 17 properties in 16 ms. (steps per millisecond=2 )
Computed a total of 147 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 147 transition count 343
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' '!((F(p0)||G(p0)))'
Support contains 147 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 343/343 transitions.
Applied a total of 0 rules in 10 ms. Remains 147 /147 variables (removed 0) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:32] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-21 02:05:32] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:32] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-21 02:05:32] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2022-05-21 02:05:32] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:32] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-21 02:05:33] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 147/147 places, 343/343 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN07-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s4 1) (LT s49 1) (LT s102 1)) (OR (LT s30 1) (LT s78 1) (LT s107 1)) (OR (LT s23 1) (LT s76 1) (LT s142 1)) (OR (LT s45 1) (LT s97 1) (LT ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2349 reset in 2115 ms.
Product exploration explored 100000 steps with 2348 reset in 2115 ms.
Computed a total of 147 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 147 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 1292 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN07-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN07-LTLFireability-02 finished in 6427 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((!G(p0) U F(!X(p0)))&&F(F(!p0)))))'
Support contains 147 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 343/343 transitions.
Applied a total of 0 rules in 7 ms. Remains 147 /147 variables (removed 0) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:39] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-21 02:05:39] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:39] [INFO ] Computed 20 place invariants in 8 ms
[2022-05-21 02:05:39] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2022-05-21 02:05:39] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:39] [INFO ] Computed 20 place invariants in 6 ms
[2022-05-21 02:05:39] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 147/147 places, 343/343 transitions.
Stuttering acceptance computed with spot in 90 ms :[p0, p0]
Running random walk in product with property : Sudoku-PT-AN07-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s4 1) (GEQ s49 1) (GEQ s102 1)) (AND (GEQ s30 1) (GEQ s78 1) (GEQ s107 1)) (AND (GEQ s23 1) (GEQ s76 1) (GEQ s142 1)) (AND (GEQ s45 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2350 reset in 1951 ms.
Product exploration explored 100000 steps with 2347 reset in 1966 ms.
Computed a total of 147 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 147 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 277 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN07-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN07-LTLFireability-03 finished in 4970 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(F((X(p0)||(X(G(p1))&&!p1)))))))'
Support contains 147 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 343/343 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:44] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-21 02:05:44] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:44] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-21 02:05:44] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2022-05-21 02:05:44] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:44] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-21 02:05:44] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 147/147 places, 343/343 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN07-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (LT s4 1) (LT s49 1) (LT s102 1)) (OR (LT s30 1) (LT s78 1) (LT s107 1)) (OR (LT s23 1) (LT s76 1) (LT s142 1)) (OR (LT s45 1) (LT s97 1) (LT ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 4 ms.
FORMULA Sudoku-PT-AN07-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN07-LTLFireability-04 finished in 700 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p0)))'
Support contains 147 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 343/343 transitions.
Applied a total of 0 rules in 7 ms. Remains 147 /147 variables (removed 0) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:44] [INFO ] Computed 20 place invariants in 7 ms
[2022-05-21 02:05:44] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:44] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-21 02:05:44] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2022-05-21 02:05:44] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:44] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-21 02:05:45] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 147/147 places, 343/343 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN07-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s4 1) (LT s49 1) (LT s102 1)) (OR (LT s30 1) (LT s78 1) (LT s107 1)) (OR (LT s23 1) (LT s76 1) (LT s142 1)) (OR (LT s45 1) (LT s97 1) (LT ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2346 reset in 2017 ms.
Product exploration explored 100000 steps with 2350 reset in 2061 ms.
Computed a total of 147 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 147 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN07-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN07-LTLFireability-06 finished in 4836 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&!(X(F(p0)) U X(!p0)))))'
Support contains 147 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 343/343 transitions.
Applied a total of 0 rules in 3 ms. Remains 147 /147 variables (removed 0) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:49] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-21 02:05:49] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:49] [INFO ] Computed 20 place invariants in 10 ms
[2022-05-21 02:05:49] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:49] [INFO ] Computed 20 place invariants in 10 ms
[2022-05-21 02:05:49] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 147/147 places, 343/343 transitions.
Stuttering acceptance computed with spot in 258 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN07-LTLFireability-07 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 s4 1) (LT s49 1) (LT s102 1)) (OR (LT s30 1) (LT s78 1) (LT s107 1)) (OR (LT s23 1) (LT s76 1) (LT s142 1)) (OR (LT s45 1) (LT s97 1) (LT ...], 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 0 ms.
FORMULA Sudoku-PT-AN07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN07-LTLFireability-07 finished in 599 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(X((G(p1)||G(p2)||p2)))))'
Support contains 8 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 343/343 transitions.
Applied a total of 0 rules in 30 ms. Remains 147 /147 variables (removed 0) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:50] [INFO ] Computed 20 place invariants in 6 ms
[2022-05-21 02:05:50] [INFO ] Implicit Places using invariants in 113 ms returned []
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:50] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-21 02:05:50] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:50] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-21 02:05:50] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 147/147 places, 343/343 transitions.
Stuttering acceptance computed with spot in 161 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN07-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s2 1) (GEQ s50 1) (GEQ s107 1)), p2:(AND (GEQ s25 1) (GEQ s71 1) (GEQ s109 1)), p0:(OR (LT s25 1) (LT s76 1) (LT s144 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 27 steps with 0 reset in 3 ms.
FORMULA Sudoku-PT-AN07-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN07-LTLFireability-08 finished in 716 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&F(p2))))'
Support contains 8 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 343/343 transitions.
Applied a total of 0 rules in 7 ms. Remains 147 /147 variables (removed 0) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:50] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-21 02:05:51] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:51] [INFO ] Computed 20 place invariants in 6 ms
[2022-05-21 02:05:51] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:51] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-21 02:05:51] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 147/147 places, 343/343 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p2), (NOT p1), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN07-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p2:(AND (GEQ s24 1) (GEQ s72 1) (GEQ s115 1)), p1:(AND (GEQ s42 1) (GEQ s96 1) (GEQ s133 1)), p0:(AND (GEQ s38 1) (GEQ s86 1) (GEQ s115 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 37 steps with 3 reset in 3 ms.
FORMULA Sudoku-PT-AN07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN07-LTLFireability-09 finished in 707 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(G(p1)))&&p0)))'
Support contains 6 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 343/343 transitions.
Applied a total of 0 rules in 13 ms. Remains 147 /147 variables (removed 0) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:51] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-21 02:05:51] [INFO ] Implicit Places using invariants in 113 ms returned []
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:51] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-21 02:05:52] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2022-05-21 02:05:52] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:52] [INFO ] Computed 20 place invariants in 6 ms
[2022-05-21 02:05:52] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 147/147 places, 343/343 transitions.
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN07-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s32 1) (GEQ s83 1) (GEQ s144 1)), p1:(AND (OR (AND (GEQ s32 1) (GEQ s83 1) (GEQ s144 1)) (LT s41 1) (LT s84 1) (LT s104 1)) (GEQ s41 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN07-LTLFireability-10 finished in 580 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||!(F(G(p1)) U p2)||(G(!p0)&&p3))))'
Support contains 12 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 343/343 transitions.
Applied a total of 0 rules in 11 ms. Remains 147 /147 variables (removed 0) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:52] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-21 02:05:52] [INFO ] Implicit Places using invariants in 116 ms returned []
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:52] [INFO ] Computed 20 place invariants in 9 ms
[2022-05-21 02:05:52] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:52] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-21 02:05:52] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 147/147 places, 343/343 transitions.
Stuttering acceptance computed with spot in 1585 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), (NOT p0), (AND p2 (NOT p0) p1), false, false, true, p1, p1, (AND p1 p2), (AND p1 p2 p0), (AND p1 p0), p0]
Running random walk in product with property : Sudoku-PT-AN07-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p2 (NOT p3)) (AND p2 p0)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p2 p3 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 7}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 10}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 11}], [{ cond=(NOT p0), acceptance={} source=5 dest: 12}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p1, acceptance={0} source=7 dest: 7}], [{ cond=p1, acceptance={} source=8 dest: 7}, { cond=true, acceptance={} source=8 dest: 8}], [{ cond=(AND p1 p2), acceptance={} source=9 dest: 7}, { cond=p2, acceptance={} source=9 dest: 8}, { cond=(NOT p2), acceptance={} source=9 dest: 9}], [{ cond=(AND p1 p2 p0), acceptance={} source=10 dest: 7}, { cond=(AND p2 p0), acceptance={} source=10 dest: 8}, { cond=(AND (NOT p2) p0), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=10 dest: 10}, { cond=(AND p2 (NOT p0)), acceptance={} source=10 dest: 11}], [{ cond=(AND p1 p0), acceptance={} source=11 dest: 7}, { cond=p0, acceptance={} source=11 dest: 8}, { cond=(NOT p0), acceptance={} source=11 dest: 11}], [{ cond=p0, acceptance={} source=12 dest: 6}, { cond=(NOT p0), acceptance={} source=12 dest: 12}]], initial=0, aps=[p2:(AND (GEQ s0 1) (GEQ s54 1) (GEQ s133 1)), p3:(AND (GEQ s28 1) (GEQ s78 1) (GEQ s105 1)), p0:(OR (LT s44 1) (LT s94 1) (LT s121 1)), p1:(AND (GEQ s11 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-AN07-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN07-LTLFireability-11 finished in 2131 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 343/343 transitions.
Applied a total of 0 rules in 13 ms. Remains 147 /147 variables (removed 0) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:54] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-21 02:05:54] [INFO ] Implicit Places using invariants in 113 ms returned []
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:54] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-21 02:05:54] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2022-05-21 02:05:54] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:54] [INFO ] Computed 20 place invariants in 7 ms
[2022-05-21 02:05:54] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 147/147 places, 343/343 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN07-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s24 1) (LT s71 1) (LT s108 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2350 reset in 1859 ms.
Product exploration explored 100000 steps with 2347 reset in 1889 ms.
Computed a total of 147 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 147 transition count 343
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), (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Sudoku-PT-AN07-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN07-LTLFireability-13 finished in 4889 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(X(G(X(G(p1)))))&&p0) U G(p1)))'
Support contains 6 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 343/343 transitions.
Applied a total of 0 rules in 6 ms. Remains 147 /147 variables (removed 0) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:59] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-21 02:05:59] [INFO ] Implicit Places using invariants in 118 ms returned []
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:59] [INFO ] Computed 20 place invariants in 10 ms
[2022-05-21 02:05:59] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
// Phase 1: matrix 343 rows 147 cols
[2022-05-21 02:05:59] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-21 02:05:59] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 147/147 places, 343/343 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN07-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(OR p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s9 1) (GEQ s62 1) (GEQ s142 1)), p0:(AND (GEQ s13 1) (GEQ s57 1) (GEQ s111 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN07-LTLFireability-14 finished in 646 ms.
All properties solved by simple procedures.
Total runtime 29871 ms.

BK_STOP 1653098760306

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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-AN07"
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-AN07, 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-165303545500252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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