Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r083-tall-162048875800725.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Eratosthenes-PT-500, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875800725
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 10:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 10:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 22 18:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 22 18:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1006K May 5 16:51 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-500-00
FORMULA_NAME Eratosthenes-PT-500-01
FORMULA_NAME Eratosthenes-PT-500-02
FORMULA_NAME Eratosthenes-PT-500-03
FORMULA_NAME Eratosthenes-PT-500-04
FORMULA_NAME Eratosthenes-PT-500-05
FORMULA_NAME Eratosthenes-PT-500-06
FORMULA_NAME Eratosthenes-PT-500-07
FORMULA_NAME Eratosthenes-PT-500-08
FORMULA_NAME Eratosthenes-PT-500-09
FORMULA_NAME Eratosthenes-PT-500-10
FORMULA_NAME Eratosthenes-PT-500-11
FORMULA_NAME Eratosthenes-PT-500-12
FORMULA_NAME Eratosthenes-PT-500-13
FORMULA_NAME Eratosthenes-PT-500-14
FORMULA_NAME Eratosthenes-PT-500-15

=== Now, execution of the tool begins

BK_START 1620659445225

Running Version 0
[2021-05-10 15:10:56] [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]
[2021-05-10 15:10:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 15:10:56] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2021-05-10 15:10:56] [INFO ] Transformed 499 places.
[2021-05-10 15:10:56] [INFO ] Transformed 2191 transitions.
[2021-05-10 15:10:56] [INFO ] Parsed PT model containing 499 places and 2191 transitions in 188 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 95 places and 0 transitions.
Ensure Unique test removed 509 transitions
Reduce redundant transitions removed 509 transitions.
Support contains 53 out of 404 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 404/404 places, 1682/1682 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 333 transition count 1611
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 333 transition count 1611
Drop transitions removed 1278 transitions
Redundant transition composition rules discarded 1278 transitions
Iterating global reduction 0 with 1278 rules applied. Total rules applied 1420 place count 333 transition count 333
Discarding 279 places :
Symmetric choice reduction at 0 with 279 rule applications. Total rules 1699 place count 54 transition count 54
Iterating global reduction 0 with 279 rules applied. Total rules applied 1978 place count 54 transition count 54
Applied a total of 1978 rules in 57 ms. Remains 54 /404 variables (removed 350) and now considering 54/1682 (removed 1628) transitions.
// Phase 1: matrix 54 rows 54 cols
[2021-05-10 15:10:56] [INFO ] Computed 0 place invariants in 4 ms
[2021-05-10 15:10:56] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 54 rows 54 cols
[2021-05-10 15:10:56] [INFO ] Computed 0 place invariants in 3 ms
[2021-05-10 15:10:56] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
// Phase 1: matrix 54 rows 54 cols
[2021-05-10 15:10:56] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:10:56] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/404 places, 54/1682 transitions.
[2021-05-10 15:10:56] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-10 15:10:56] [INFO ] Flatten gal took : 21 ms
FORMULA Eratosthenes-PT-500-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-500-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-500-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-500-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-10 15:10:56] [INFO ] Flatten gal took : 6 ms
[2021-05-10 15:10:56] [INFO ] Input system was already deterministic with 54 transitions.
Finished random walk after 404 steps, including 0 resets, run visited all 22 properties in 4 ms. (steps per millisecond=101 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&X((F(p1)&&X(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 54/54 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 6 transition count 6
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 6 transition count 6
Applied a total of 96 rules in 1 ms. Remains 6 /54 variables (removed 48) and now considering 6/54 (removed 48) transitions.
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 15:10:56] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:56] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 15:10:56] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:56] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 15:10:56] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:56] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/54 places, 6/54 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : Eratosthenes-PT-500-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=true, acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 2}]], initial=0, aps=[p0:(GEQ s3 1), p1:(AND (GEQ s1 1) (GEQ s2 1)), p2:(OR (GEQ s2 1) (AND (GEQ s4 1) (GEQ s5 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Eratosthenes-PT-500-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-00 finished in 385 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0 U (p1||G(p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 54/54 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 4 transition count 4
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 4 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 99 place count 3 transition count 3
Applied a total of 99 rules in 7 ms. Remains 3 /54 variables (removed 51) and now considering 3/54 (removed 51) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:10:57] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:57] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:10:57] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:57] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2021-05-10 15:10:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:10:57] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:10:57] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/54 places, 3/54 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Eratosthenes-PT-500-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s2 1) (OR (LT s0 1) (LT s1 1))), p0:(OR (LT s0 1) (LT s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 27895 reset in 181 ms.
Product exploration explored 100000 steps with 27909 reset in 110 ms.
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 : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p1)), (F (G p0)), (NOT p1), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p1))
FORMULA Eratosthenes-PT-500-01 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Eratosthenes-PT-500-01 finished in 446 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X((X((F(p1)&&X(G(p2))))||p0)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 54/54 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 6 transition count 6
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 6 transition count 6
Applied a total of 96 rules in 1 ms. Remains 6 /54 variables (removed 48) and now considering 6/54 (removed 48) transitions.
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 15:10:57] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:10:57] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 15:10:57] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:57] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 15:10:57] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:57] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/54 places, 6/54 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true]
Running random walk in product with property : Eratosthenes-PT-500-02 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 7}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p2), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=6, aps=[p2:(GEQ s5 1), p0:(OR (LT s2 1) (LT s3 1)), p1:(AND (GEQ s1 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-500-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-02 finished in 226 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(G(p0))&&F(p1)) U (G((X(G(p0))&&F(p1)))||(X(G(p0))&&F(p1)&&p2))))], workingDir=/home/mcc/execution]
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 54/54 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 7 transition count 7
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 7 transition count 7
Applied a total of 94 rules in 1 ms. Remains 7 /54 variables (removed 47) and now considering 7/54 (removed 47) transitions.
// Phase 1: matrix 7 rows 7 cols
[2021-05-10 15:10:57] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:57] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-10 15:10:57] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:57] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 7 cols
[2021-05-10 15:10:57] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:57] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/54 places, 7/54 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Eratosthenes-PT-500-03 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s4 1) (GEQ s6 1)), p1:(OR (LT s2 1) (LT s5 1)), p0:(AND (GEQ s1 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14 steps with 2 reset in 1 ms.
FORMULA Eratosthenes-PT-500-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-03 finished in 121 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((X(p0)||F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 54/54 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 4 transition count 4
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 4 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 99 place count 3 transition count 3
Applied a total of 99 rules in 4 ms. Remains 3 /54 variables (removed 51) and now considering 3/54 (removed 51) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:10:57] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:57] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:10:57] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:57] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-10 15:10:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:10:57] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:58] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/54 places, 3/54 transitions.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Eratosthenes-PT-500-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s2 1)), p1:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 26117 reset in 68 ms.
Product exploration explored 100000 steps with 26062 reset in 145 ms.
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 : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), (F (G p1)), p0, (NOT p1)]
Property proved to be true thanks to knowledge :(F (G p1))
FORMULA Eratosthenes-PT-500-05 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Eratosthenes-PT-500-05 finished in 376 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 54/54 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 2 transition count 2
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 2 transition count 2
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 103 place count 1 transition count 1
Applied a total of 103 rules in 2 ms. Remains 1 /54 variables (removed 53) and now considering 1/54 (removed 53) transitions.
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:10:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:58] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:10:58] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:10:58] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2021-05-10 15:10:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:10:58] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:10:58] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1/54 places, 1/54 transitions.
Stuttering acceptance computed with spot in 28 ms :[true, (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-500-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-500-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-06 finished in 99 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 54/54 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 4 transition count 4
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 4 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 99 place count 3 transition count 3
Applied a total of 99 rules in 2 ms. Remains 3 /54 variables (removed 51) and now considering 3/54 (removed 51) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:10:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:58] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:10:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:58] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2021-05-10 15:10:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:10:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:58] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/54 places, 3/54 transitions.
Stuttering acceptance computed with spot in 23 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Eratosthenes-PT-500-07 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} 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 p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 1), p1:(OR (GEQ s0 1) (AND (GEQ s1 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][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-500-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-07 finished in 66 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 54/54 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 3 transition count 3
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 3 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 101 place count 2 transition count 2
Applied a total of 101 rules in 2 ms. Remains 2 /54 variables (removed 52) and now considering 2/54 (removed 52) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:10:58] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:10:58] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:10:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:58] [INFO ] Implicit Places using invariants and state equation in 6 ms returned []
Implicit Place search using SMT with State Equation took 12 ms to find 0 implicit places.
[2021-05-10 15:10:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:10:58] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:10:58] [INFO ] Dead Transitions using invariants and state equation in 5 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/54 places, 2/54 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : Eratosthenes-PT-500-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 33333 reset in 77 ms.
Product exploration explored 100000 steps with 33333 reset in 131 ms.
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 : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Eratosthenes-PT-500-10 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Eratosthenes-PT-500-10 finished in 313 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((F(p1)&&p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 54/54 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 4 transition count 4
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 4 transition count 4
Applied a total of 100 rules in 0 ms. Remains 4 /54 variables (removed 50) and now considering 4/54 (removed 50) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:10:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:58] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:10:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:58] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:10:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:58] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/54 places, 4/54 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Eratosthenes-PT-500-11 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(GEQ s2 1), p0:(AND (GEQ s1 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 404 steps with 0 reset in 1 ms.
FORMULA Eratosthenes-PT-500-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-11 finished in 127 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 54/54 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 3 transition count 3
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 3 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 101 place count 2 transition count 2
Applied a total of 101 rules in 2 ms. Remains 2 /54 variables (removed 52) and now considering 2/54 (removed 52) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:10:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:58] [INFO ] Implicit Places using invariants in 4 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:10:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:58] [INFO ] Implicit Places using invariants and state equation in 6 ms returned []
Implicit Place search using SMT with State Equation took 11 ms to find 0 implicit places.
[2021-05-10 15:10:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:10:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:58] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/54 places, 2/54 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : Eratosthenes-PT-500-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 45 ms.
Product exploration explored 100000 steps with 50000 reset in 55 ms.
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 : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Eratosthenes-PT-500-12 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Eratosthenes-PT-500-12 finished in 198 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 54/54 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 3 transition count 3
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 3 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 101 place count 2 transition count 2
Applied a total of 101 rules in 1 ms. Remains 2 /54 variables (removed 52) and now considering 2/54 (removed 52) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:10:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:59] [INFO ] Implicit Places using invariants in 4 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:10:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:59] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
[2021-05-10 15:10:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:10:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:59] [INFO ] Dead Transitions using invariants and state equation in 5 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/54 places, 2/54 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : Eratosthenes-PT-500-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 33333 reset in 45 ms.
Product exploration explored 100000 steps with 33333 reset in 55 ms.
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 : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Eratosthenes-PT-500-14 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Eratosthenes-PT-500-14 finished in 197 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 54/54 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 2 transition count 2
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 2 transition count 2
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 103 place count 1 transition count 1
Applied a total of 103 rules in 1 ms. Remains 1 /54 variables (removed 53) and now considering 1/54 (removed 53) transitions.
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:10:59] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:10:59] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:10:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:59] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 12 ms to find 0 implicit places.
[2021-05-10 15:10:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:10:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:10:59] [INFO ] Dead Transitions using invariants and state equation in 5 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1/54 places, 1/54 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-500-15 automaton TGBA [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:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-500-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-15 finished in 73 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620659460515

--------------------
content from stderr:

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-500"
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-500, 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 r083-tall-162048875800725"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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