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.r078-tall-165260110400468.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 Eratosthenes-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110400468
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 7.3K Apr 29 15:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 15:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 29 15:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 29 15:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 14K 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 Eratosthenes-PT-020-LTLFireability-00
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-01
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-02
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-03
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-04
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-05
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-06
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-07
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-08
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-09
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-10
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-11
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-12
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-13
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-14
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652686063715

Running Version 202205111006
[2022-05-16 07:27:44] [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-16 07:27:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 07:27:45] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2022-05-16 07:27:45] [INFO ] Transformed 19 places.
[2022-05-16 07:27:45] [INFO ] Transformed 27 transitions.
[2022-05-16 07:27:45] [INFO ] Parsed PT model containing 19 places and 27 transitions in 148 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
FORMULA Eratosthenes-PT-020-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-020-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-020-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-020-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 20/20 transitions.
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 11 transition count 11
Applied a total of 9 rules in 9 ms. Remains 11 /11 variables (removed 0) and now considering 11/20 (removed 9) transitions.
// Phase 1: matrix 11 rows 11 cols
[2022-05-16 07:27:45] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-16 07:27:45] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 11 rows 11 cols
[2022-05-16 07:27:45] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:27:45] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2022-05-16 07:27:45] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:27:45] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 11/11 places, 11/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/11 places, 11/20 transitions.
Support contains 10 out of 11 places after structural reductions.
[2022-05-16 07:27:45] [INFO ] Flatten gal took : 12 ms
[2022-05-16 07:27:45] [INFO ] Flatten gal took : 3 ms
[2022-05-16 07:27:45] [INFO ] Input system was already deterministic with 11 transitions.
Finished random walk after 11 steps, including 0 resets, run visited all 17 properties in 13 ms. (steps per millisecond=0 )
FORMULA Eratosthenes-PT-020-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Eratosthenes-PT-020-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 11 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 11
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((!G(X(p0)) U p1)))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Graph (complete) has 0 edges and 11 vertex of which 3 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 5 ms. Remains 3 /11 variables (removed 8) and now considering 3/11 (removed 8) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:27:45] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:27:45] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:27:45] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:27:45] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-16 07:27:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:27:45] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:27:46] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/11 places, 3/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/11 places, 3/11 transitions.
Stuttering acceptance computed with spot in 247 ms :[(NOT p1), (OR (NOT p1) p0), p0]
Running random walk in product with property : Eratosthenes-PT-020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s2 1)), p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 2 ms.
FORMULA Eratosthenes-PT-020-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-020-LTLFireability-00 finished in 394 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(G(X(F(X(p0))))))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Graph (complete) has 0 edges and 11 vertex of which 2 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Applied a total of 1 rules in 0 ms. Remains 2 /11 variables (removed 9) and now considering 2/11 (removed 9) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:27:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:27:46] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:27:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:27:46] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2022-05-16 07:27:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:27:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:27:46] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/11 places, 2/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/11 places, 2/11 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-020-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 39905 reset in 158 ms.
Product exploration explored 100000 steps with 40026 reset in 78 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
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 p0), (X (X 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 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Eratosthenes-PT-020-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-020-LTLFireability-01 finished in 514 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((!F(!G(!p0)) U !(F(p1) U p0))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Graph (complete) has 0 edges and 11 vertex of which 3 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 1 ms. Remains 3 /11 variables (removed 8) and now considering 3/11 (removed 8) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:27:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:27:46] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:27:46] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:27:46] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2022-05-16 07:27:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:27:46] [INFO ] Computed 0 place invariants in 6 ms
[2022-05-16 07:27:46] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/11 places, 3/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/11 places, 3/11 transitions.
Stuttering acceptance computed with spot in 66 ms :[p0, (AND p1 p0)]
Running random walk in product with property : Eratosthenes-PT-020-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s2 1)), p0:(AND (GEQ s0 1) (GEQ s2 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 25000 reset in 179 ms.
Product exploration explored 100000 steps with 25000 reset in 177 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0))]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 9 factoid took 689 ms. Reduced automaton from 2 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Eratosthenes-PT-020-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-020-LTLFireability-03 finished in 1253 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&(G((G(p1)&&p1))||G(p2)))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Graph (complete) has 0 edges and 11 vertex of which 2 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Applied a total of 1 rules in 1 ms. Remains 2 /11 variables (removed 9) and now considering 2/11 (removed 9) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:27:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:27:48] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:27:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:27:48] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2022-05-16 07:27:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:27:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:27:48] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/11 places, 2/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/11 places, 2/11 transitions.
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Eratosthenes-PT-020-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={1, 2} source=0 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 2} source=0 dest: 3}, { cond=(AND p0 p1 p2), acceptance={0} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=1 dest: 0}, { cond=p0, acceptance={1, 2} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={1, 2} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 2} source=2 dest: 3}, { cond=(AND p0 p1 p2), acceptance={0} source=2 dest: 4}, { cond=(AND p0 p1 p2), acceptance={1} source=2 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={1, 2} source=3 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND p1 (NOT p2))), acceptance={0, 2} source=3 dest: 3}, { cond=(AND p0 p1 p2), acceptance={0} source=3 dest: 4}, { cond=(AND p0 p1 p2), acceptance={2} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 2} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1, 2} source=5 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=5 dest: 2}, { cond=(AND p0 p2), acceptance={1} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=6 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1, 2} source=6 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 2} source=6 dest: 3}, { cond=(AND p0 p1), acceptance={2} source=6 dest: 6}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s0 1)), p1:(GEQ s0 1), p2:(AND (GEQ s0 1) (GEQ s1 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA Eratosthenes-PT-020-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-020-LTLFireability-04 finished in 379 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2 transition count 2
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2 transition count 2
Applied a total of 18 rules in 1 ms. Remains 2 /11 variables (removed 9) and now considering 2/11 (removed 9) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:27:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:27:48] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:27:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:27:48] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
// Phase 1: matrix 2 rows 2 cols
[2022-05-16 07:27:48] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:27:48] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/11 places, 2/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/11 places, 2/11 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-020-LTLFireability-05 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:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-020-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-020-LTLFireability-05 finished in 176 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(p0))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3 transition count 3
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3 transition count 3
Applied a total of 16 rules in 1 ms. Remains 3 /11 variables (removed 8) and now considering 3/11 (removed 8) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:27:48] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:27:48] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:27:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:27:48] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:27:48] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:27:48] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/11 places, 3/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/11 places, 3/11 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-020-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s2 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]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-020-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-020-LTLFireability-07 finished in 176 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))&&G(X(p1))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 3 transition count 3
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 3 transition count 3
Applied a total of 16 rules in 1 ms. Remains 3 /11 variables (removed 8) and now considering 3/11 (removed 8) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:27:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:27:48] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:27:48] [INFO ] Computed 0 place invariants in 3 ms
[2022-05-16 07:27:48] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:27:48] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:27:48] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/11 places, 3/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/11 places, 3/11 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Eratosthenes-PT-020-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(GEQ s2 1), p0:(LT s1 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 0 ms.
FORMULA Eratosthenes-PT-020-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-020-LTLFireability-09 finished in 195 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 4 transition count 4
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 4 transition count 4
Applied a total of 14 rules in 1 ms. Remains 4 /11 variables (removed 7) and now considering 4/11 (removed 7) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:27:48] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:27:48] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:27:48] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:27:49] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:27:49] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:27:49] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/11 places, 4/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/11 places, 4/11 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Eratosthenes-PT-020-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s2 1) (GEQ s3 1)), p1:(GEQ s1 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 0 ms.
FORMULA Eratosthenes-PT-020-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-020-LTLFireability-10 finished in 214 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X(F(X(F(!(F(p0) U (G(p2)&&p1))))))))))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Graph (complete) has 0 edges and 11 vertex of which 4 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Applied a total of 1 rules in 1 ms. Remains 4 /11 variables (removed 7) and now considering 4/11 (removed 7) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:27:49] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:27:49] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:27:49] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:27:49] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2022-05-16 07:27:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 07:27:49] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:27:49] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/11 places, 4/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/11 places, 4/11 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2 p0)]
Running random walk in product with property : Eratosthenes-PT-020-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 p2), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 p2), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s2 1)), p2:(AND (GEQ s0 1) (GEQ s3 1)), p0:(AND (GEQ s0 1) (GEQ s1 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 26795 reset in 65 ms.
Product exploration explored 100000 steps with 26661 reset in 60 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 9 factoid took 414 ms. Reduced automaton from 3 states, 9 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Eratosthenes-PT-020-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-020-LTLFireability-14 finished in 741 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((F(p0)||G((F(p1) U p2)))) U (p1 U !p2))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Graph (complete) has 0 edges and 11 vertex of which 3 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 3 ms. Remains 3 /11 variables (removed 8) and now considering 3/11 (removed 8) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:27:49] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 07:27:49] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:27:49] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:27:49] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2022-05-16 07:27:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-16 07:27:49] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 07:27:50] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/11 places, 3/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/11 places, 3/11 transitions.
Stuttering acceptance computed with spot in 192 ms :[p2, (AND (NOT p0) (NOT p2)), p2, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Eratosthenes-PT-020-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s0 1), p1:(GEQ s1 1), p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 21 steps with 6 reset in 0 ms.
FORMULA Eratosthenes-PT-020-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-020-LTLFireability-15 finished in 302 ms.
All properties solved by simple procedures.
Total runtime 5330 ms.

BK_STOP 1652686070591

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="Eratosthenes-PT-020"
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 Eratosthenes-PT-020, 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 r078-tall-165260110400468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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