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.r060-tall-165254772500780.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 Diffusion2D-PT-D30N010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254772500780
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 8.0K Apr 30 04:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 30 04:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 30 04:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 30 04:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 9 07:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 07:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 3.0M May 10 09:33 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 Diffusion2D-PT-D30N010-LTLFireability-00
FORMULA_NAME Diffusion2D-PT-D30N010-LTLFireability-01
FORMULA_NAME Diffusion2D-PT-D30N010-LTLFireability-02
FORMULA_NAME Diffusion2D-PT-D30N010-LTLFireability-03
FORMULA_NAME Diffusion2D-PT-D30N010-LTLFireability-04
FORMULA_NAME Diffusion2D-PT-D30N010-LTLFireability-05
FORMULA_NAME Diffusion2D-PT-D30N010-LTLFireability-06
FORMULA_NAME Diffusion2D-PT-D30N010-LTLFireability-07
FORMULA_NAME Diffusion2D-PT-D30N010-LTLFireability-08
FORMULA_NAME Diffusion2D-PT-D30N010-LTLFireability-09
FORMULA_NAME Diffusion2D-PT-D30N010-LTLFireability-10
FORMULA_NAME Diffusion2D-PT-D30N010-LTLFireability-11
FORMULA_NAME Diffusion2D-PT-D30N010-LTLFireability-12
FORMULA_NAME Diffusion2D-PT-D30N010-LTLFireability-13
FORMULA_NAME Diffusion2D-PT-D30N010-LTLFireability-14
FORMULA_NAME Diffusion2D-PT-D30N010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652652997606

Running Version 202205111006
[2022-05-15 22:16:38] [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-15 22:16:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 22:16:39] [INFO ] Load time of PNML (sax parser for PT used): 301 ms
[2022-05-15 22:16:39] [INFO ] Transformed 900 places.
[2022-05-15 22:16:39] [INFO ] Transformed 6844 transitions.
[2022-05-15 22:16:39] [INFO ] Parsed PT model containing 900 places and 6844 transitions in 422 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Diffusion2D-PT-D30N010-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N010-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N010-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N010-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D30N010-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 198 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 22:16:39] [INFO ] Computed 1 place invariants in 76 ms
[2022-05-15 22:16:39] [INFO ] Implicit Places using invariants in 308 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 22:16:39] [INFO ] Computed 1 place invariants in 49 ms
[2022-05-15 22:16:40] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1162 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 22:16:40] [INFO ] Computed 1 place invariants in 39 ms
[2022-05-15 22:16:42] [INFO ] Dead Transitions using invariants and state equation in 1977 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Support contains 33 out of 900 places after structural reductions.
[2022-05-15 22:16:43] [INFO ] Flatten gal took : 282 ms
[2022-05-15 22:16:43] [INFO ] Flatten gal took : 161 ms
[2022-05-15 22:16:43] [INFO ] Input system was already deterministic with 6844 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 261 ms. (steps per millisecond=38 ) properties (out of 29) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 22:16:44] [INFO ] Computed 1 place invariants in 27 ms
[2022-05-15 22:16:44] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2022-05-15 22:16:47] [INFO ] After 2652ms SMT Verify possible using state equation in real domain returned unsat :0 sat :9 real:5
[2022-05-15 22:16:49] [INFO ] After 4717ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:14
[2022-05-15 22:16:49] [INFO ] After 5276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2022-05-15 22:16:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 7 ms returned sat
[2022-05-15 22:16:52] [INFO ] After 2760ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2022-05-15 22:16:55] [INFO ] After 5680ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 1665 ms.
[2022-05-15 22:16:57] [INFO ] After 7837ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Finished Parikh walk after 3795 steps, including 1 resets, run visited all 14 properties in 61 ms. (steps per millisecond=62 )
Parikh walk visited 14 properties in 65 ms.
FORMULA Diffusion2D-PT-D30N010-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Diffusion2D-PT-D30N010-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F((G(F(p0))||p1))&&X(p2)&&p3))))'
Support contains 4 out of 900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Graph (trivial) has 6780 edges and 900 vertex of which 896 / 900 are part of one of the 1 SCC in 9 ms
Free SCC test removed 895 places
Ensure Unique test removed 6835 transitions
Reduce isomorphic transitions removed 6835 transitions.
Applied a total of 1 rules in 24 ms. Remains 5 /900 variables (removed 895) and now considering 9/6844 (removed 6835) transitions.
// Phase 1: matrix 9 rows 5 cols
[2022-05-15 22:16:57] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 22:16:57] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2022-05-15 22:16:57] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-15 22:16:57] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2022-05-15 22:16:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 5 cols
[2022-05-15 22:16:57] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 22:16:57] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/900 places, 9/6844 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/900 places, 9/6844 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p3) (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D30N010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p3 p2), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p3 p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p3:(GEQ s0 1), p2:(GEQ s3 1), p0:(GEQ s1 1), p1:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D30N010-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N010-LTLFireability-01 finished in 366 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (G((!p0 U p1))&&G(!(p2 U F(p2))))))'
Support contains 3 out of 900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Graph (trivial) has 6796 edges and 900 vertex of which 897 / 900 are part of one of the 1 SCC in 7 ms
Free SCC test removed 896 places
Ensure Unique test removed 6837 transitions
Reduce isomorphic transitions removed 6837 transitions.
Applied a total of 1 rules in 17 ms. Remains 4 /900 variables (removed 896) and now considering 7/6844 (removed 6837) transitions.
// Phase 1: matrix 7 rows 4 cols
[2022-05-15 22:16:58] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 22:16:58] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2022-05-15 22:16:58] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 22:16:58] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2022-05-15 22:16:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2022-05-15 22:16:58] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 22:16:58] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/900 places, 7/6844 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/900 places, 7/6844 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p1) p2), (NOT p0), (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D30N010-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))), acceptance={} source=0 dest: 0}, { cond=(OR p2 (AND (NOT p1) p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s1 1), p1:(GEQ s2 1), p0:(LT s0 1)], 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 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D30N010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N010-LTLFireability-03 finished in 192 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)||X(G((G(p2)&&!p1)))))'
Support contains 3 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 164 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 22:16:58] [INFO ] Computed 1 place invariants in 40 ms
[2022-05-15 22:16:58] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 22:16:58] [INFO ] Computed 1 place invariants in 21 ms
[2022-05-15 22:16:59] [INFO ] Implicit Places using invariants and state equation in 721 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 22:16:59] [INFO ] Computed 1 place invariants in 26 ms
[2022-05-15 22:17:01] [INFO ] Dead Transitions using invariants and state equation in 1840 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, (OR (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D30N010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(OR p1 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(GEQ s738 1), p1:(GEQ s471 1), p2:(LT s101 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 351 steps with 0 reset in 5 ms.
FORMULA Diffusion2D-PT-D30N010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N010-LTLFireability-04 finished in 3137 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(F(p0))) U X(!X((G(p2)||p1)))))'
Support contains 4 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 49 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 22:17:01] [INFO ] Computed 1 place invariants in 28 ms
[2022-05-15 22:17:01] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 22:17:01] [INFO ] Computed 1 place invariants in 24 ms
[2022-05-15 22:17:02] [INFO ] Implicit Places using invariants and state equation in 711 ms returned []
Implicit Place search using SMT with State Equation took 834 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 22:17:02] [INFO ] Computed 1 place invariants in 21 ms
[2022-05-15 22:17:04] [INFO ] Dead Transitions using invariants and state equation in 1823 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR p1 p2), (OR p2 p1), (OR p1 p2), (NOT p0), (NOT p0), p2]
Running random walk in product with property : Diffusion2D-PT-D30N010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=p1, acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=p2, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (GEQ s113 1) (GEQ s407 1)), p0:(GEQ s743 1), p2:(LT s435 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50 reset in 664 ms.
Stack based approach found an accepted trace after 46 steps with 0 reset with depth 47 and stack size 47 in 0 ms.
FORMULA Diffusion2D-PT-D30N010-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D30N010-LTLFireability-06 finished in 3658 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(X(F((G(p0)||G(p1)))))))'
Support contains 2 out of 900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Graph (trivial) has 6812 edges and 900 vertex of which 898 / 900 are part of one of the 1 SCC in 11 ms
Free SCC test removed 897 places
Ensure Unique test removed 6839 transitions
Reduce isomorphic transitions removed 6839 transitions.
Applied a total of 1 rules in 21 ms. Remains 3 /900 variables (removed 897) and now considering 5/6844 (removed 6839) transitions.
// Phase 1: matrix 5 rows 3 cols
[2022-05-15 22:17:05] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 22:17:05] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2022-05-15 22:17:05] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 22:17:05] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2022-05-15 22:17:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2022-05-15 22:17:05] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 22:17:05] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/900 places, 5/6844 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/900 places, 5/6844 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D30N010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 1), p1:(GEQ s1 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D30N010-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N010-LTLFireability-07 finished in 152 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0))||p1)))'
Support contains 3 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 51 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 22:17:05] [INFO ] Computed 1 place invariants in 24 ms
[2022-05-15 22:17:05] [INFO ] Implicit Places using invariants in 117 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 22:17:05] [INFO ] Computed 1 place invariants in 26 ms
[2022-05-15 22:17:06] [INFO ] Implicit Places using invariants and state equation in 683 ms returned []
Implicit Place search using SMT with State Equation took 801 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 22:17:06] [INFO ] Computed 1 place invariants in 24 ms
[2022-05-15 22:17:07] [INFO ] Dead Transitions using invariants and state equation in 1824 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D30N010-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(GEQ s809 1), p0:(OR (GEQ s568 1) (GEQ s615 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D30N010-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N010-LTLFireability-08 finished in 2824 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U F((G((G(X(p1))&&X(!p0)))&&X(G(p2))))))'
Support contains 3 out of 900 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Graph (trivial) has 6796 edges and 900 vertex of which 897 / 900 are part of one of the 1 SCC in 9 ms
Free SCC test removed 896 places
Ensure Unique test removed 6837 transitions
Reduce isomorphic transitions removed 6837 transitions.
Applied a total of 1 rules in 14 ms. Remains 4 /900 variables (removed 896) and now considering 7/6844 (removed 6837) transitions.
// Phase 1: matrix 7 rows 4 cols
[2022-05-15 22:17:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 22:17:08] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2022-05-15 22:17:08] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-15 22:17:08] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2022-05-15 22:17:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2022-05-15 22:17:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 22:17:08] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/900 places, 7/6844 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/900 places, 7/6844 transitions.
Stuttering acceptance computed with spot in 45 ms :[(OR (NOT p1) (NOT p2) p0)]
Running random walk in product with property : Diffusion2D-PT-D30N010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(GEQ s1 1), p1:(GEQ s0 1), p0:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D30N010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D30N010-LTLFireability-11 finished in 139 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((X(p1)||p0))||F(p1)))'
Support contains 4 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 45 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 22:17:08] [INFO ] Computed 1 place invariants in 26 ms
[2022-05-15 22:17:08] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 22:17:08] [INFO ] Computed 1 place invariants in 20 ms
[2022-05-15 22:17:09] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 809 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 22:17:09] [INFO ] Computed 1 place invariants in 22 ms
[2022-05-15 22:17:10] [INFO ] Dead Transitions using invariants and state equation in 1821 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D30N010-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s463 1), p0:(OR (AND (GEQ s749 1) (GEQ s519 1)) (GEQ s680 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 67 reset in 644 ms.
Stack based approach found an accepted trace after 125 steps with 0 reset with depth 126 and stack size 126 in 1 ms.
FORMULA Diffusion2D-PT-D30N010-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D30N010-LTLFireability-12 finished in 3452 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&!((F(p1)&&!p0) U p2)))))'
Support contains 3 out of 900 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 900/900 places, 6844/6844 transitions.
Applied a total of 0 rules in 51 ms. Remains 900 /900 variables (removed 0) and now considering 6844/6844 (removed 0) transitions.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 22:17:11] [INFO ] Computed 1 place invariants in 28 ms
[2022-05-15 22:17:11] [INFO ] Implicit Places using invariants in 129 ms returned []
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 22:17:11] [INFO ] Computed 1 place invariants in 19 ms
[2022-05-15 22:17:12] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 808 ms to find 0 implicit places.
// Phase 1: matrix 6844 rows 900 cols
[2022-05-15 22:17:12] [INFO ] Computed 1 place invariants in 26 ms
[2022-05-15 22:17:14] [INFO ] Dead Transitions using invariants and state equation in 1801 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 900/900 places, 6844/6844 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (AND p1 p2), (NOT p0), p2, (OR (AND (NOT p0) p1) (AND p1 p2)), (AND (NOT p0) p1)]
Running random walk in product with property : Diffusion2D-PT-D30N010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 4}], [{ cond=(AND p1 p2), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={1} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0, 1} source=3 dest: 3}], [{ cond=p2, acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p2), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={1} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(GEQ s107 1), p0:(LT s682 1), p1:(GEQ s737 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 752 ms.
Product exploration explored 100000 steps with 50000 reset in 798 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p2) p0 (NOT p1))
Knowledge based reduction with 12 factoid took 371 ms. Reduced automaton from 7 states, 21 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Diffusion2D-PT-D30N010-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Diffusion2D-PT-D30N010-LTLFireability-15 finished in 4918 ms.
All properties solved by simple procedures.
Total runtime 37859 ms.

BK_STOP 1652653036597

--------------------
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="Diffusion2D-PT-D30N010"
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 Diffusion2D-PT-D30N010, 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 r060-tall-165254772500780"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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