About the Execution of ITS-Tools for Eratosthenes-PT-050
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 294.399 | 6437.00 | 11443.00 | 281.60 | TTFFTFFFFTFFFFTF | normal |
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-162048875700701.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-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875700701
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K 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 26K Mar 28 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 10:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 10:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 22 18:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K Mar 22 18:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 50K 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-050-00
FORMULA_NAME Eratosthenes-PT-050-01
FORMULA_NAME Eratosthenes-PT-050-02
FORMULA_NAME Eratosthenes-PT-050-03
FORMULA_NAME Eratosthenes-PT-050-04
FORMULA_NAME Eratosthenes-PT-050-05
FORMULA_NAME Eratosthenes-PT-050-06
FORMULA_NAME Eratosthenes-PT-050-07
FORMULA_NAME Eratosthenes-PT-050-08
FORMULA_NAME Eratosthenes-PT-050-09
FORMULA_NAME Eratosthenes-PT-050-10
FORMULA_NAME Eratosthenes-PT-050-11
FORMULA_NAME Eratosthenes-PT-050-12
FORMULA_NAME Eratosthenes-PT-050-13
FORMULA_NAME Eratosthenes-PT-050-14
FORMULA_NAME Eratosthenes-PT-050-15
=== Now, execution of the tool begins
BK_START 1620659245278
Running Version 0
[2021-05-10 15:07:26] [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:07:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 15:07:27] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2021-05-10 15:07:27] [INFO ] Transformed 49 places.
[2021-05-10 15:07:27] [INFO ] Transformed 108 transitions.
[2021-05-10 15:07:27] [INFO ] Parsed PT model containing 49 places and 108 transitions in 80 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-10 15:07:27] [INFO ] Initial state test concluded for 2 properties.
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Support contains 22 out of 34 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 34/34 places, 80/80 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 29 transition count 75
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 29 transition count 75
Drop transitions removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 0 with 46 rules applied. Total rules applied 56 place count 29 transition count 29
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 23 transition count 23
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 23 transition count 23
Applied a total of 68 rules in 12 ms. Remains 23 /34 variables (removed 11) and now considering 23/80 (removed 57) transitions.
// Phase 1: matrix 23 rows 23 cols
[2021-05-10 15:07:27] [INFO ] Computed 0 place invariants in 4 ms
[2021-05-10 15:07:27] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2021-05-10 15:07:27] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:07:27] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 23 cols
[2021-05-10 15:07:27] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:07:27] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/34 places, 23/80 transitions.
[2021-05-10 15:07:27] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-10 15:07:27] [INFO ] Flatten gal took : 18 ms
FORMULA Eratosthenes-PT-050-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-10 15:07:27] [INFO ] Flatten gal took : 4 ms
[2021-05-10 15:07:27] [INFO ] Input system was already deterministic with 23 transitions.
Finished random walk after 33 steps, including 0 resets, run visited all 20 properties in 2 ms. (steps per millisecond=16 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 23/23 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 3 transition count 3
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 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 39 place count 2 transition count 2
Applied a total of 39 rules in 6 ms. Remains 2 /23 variables (removed 21) and now considering 2/23 (removed 21) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:07:27] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:27] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:07:27] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:27] [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:07:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:07:27] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:27] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/23 places, 2/23 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0)]
Running random walk in product with property : Eratosthenes-PT-050-00 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 253 ms.
Product exploration explored 100000 steps with 33333 reset in 138 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-050-00 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Eratosthenes-PT-050-00 finished in 745 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 23/23 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 5 transition count 5
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 5 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 35 place count 4 transition count 4
Applied a total of 35 rules in 8 ms. Remains 4 /23 variables (removed 19) and now considering 4/23 (removed 19) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:07:28] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:07:28] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:07:28] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:28] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
[2021-05-10 15:07:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:07:28] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:28] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/23 places, 4/23 transitions.
Stuttering acceptance computed with spot in 32 ms :[true, (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-050-02 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:(AND (GEQ s1 1) (GEQ s2 1) (GEQ s0 1) (GEQ s3 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-050-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-02 finished in 101 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||X(F((p1&&(p0 U p2))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 23/23 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 5 transition count 5
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 5 transition count 5
Applied a total of 36 rules in 1 ms. Remains 5 /23 variables (removed 18) and now considering 5/23 (removed 18) transitions.
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:07:28] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:28] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:07:28] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:28] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:07:28] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:07:28] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/23 places, 5/23 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : Eratosthenes-PT-050-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s3 1), p1:(GEQ s2 1), p2:(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][false, false, false]]
Stuttering criterion allowed to conclude after 38 steps with 2 reset in 0 ms.
FORMULA Eratosthenes-PT-050-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-05 finished in 149 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X(X(X(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 23/23 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 3 transition count 3
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 3 transition count 3
Applied a total of 40 rules in 1 ms. Remains 3 /23 variables (removed 20) and now considering 3/23 (removed 20) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:07:28] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:28] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:07:28] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:28] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:07:28] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-10 15:07:28] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/23 places, 3/23 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-050-06 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 5}], [{ cond=p0, acceptance={0} source=2 dest: 6}, { cond=(NOT p0), acceptance={0} source=2 dest: 7}], [{ cond=p0, acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={0} source=4 dest: 5}], [{ cond=p0, acceptance={0} source=5 dest: 2}, { cond=(NOT p0), acceptance={0} source=5 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 1}]], initial=4, aps=[p0:(GEQ s2 1), p1:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-050-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-06 finished in 257 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((p0 U p1)&&(X(F(p2))||G(p0))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 23/23 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 5 transition count 5
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 5 transition count 5
Applied a total of 36 rules in 0 ms. Remains 5 /23 variables (removed 18) and now considering 5/23 (removed 18) transitions.
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:07:28] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:28] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:07:28] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:28] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:07:28] [INFO ] Computed 0 place invariants in 11 ms
[2021-05-10 15:07:28] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/23 places, 5/23 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Eratosthenes-PT-050-07 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s2 1), p0:(GEQ s1 1), p2:(AND (OR (LT s3 1) (LT s4 1)) (GEQ s1 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-050-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-07 finished in 190 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((F(G(p0))&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 23/23 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 3 transition count 3
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 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 39 place count 2 transition count 2
Applied a total of 39 rules in 1 ms. Remains 2 /23 variables (removed 21) and now considering 2/23 (removed 21) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:07:28] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:28] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:07:28] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:28] [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:07:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:07:28] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:28] [INFO ] Dead Transitions using invariants and state equation in 5 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/23 places, 2/23 transitions.
Stuttering acceptance computed with spot in 49 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-050-08 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s1 1)), p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-050-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-08 finished in 82 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 23/23 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 5 transition count 5
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 5 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 35 place count 4 transition count 4
Applied a total of 35 rules in 1 ms. Remains 4 /23 variables (removed 19) and now considering 4/23 (removed 19) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:07:29] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:29] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:07:29] [INFO ] Computed 0 place invariants in 6 ms
[2021-05-10 15:07:29] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2021-05-10 15:07:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:07:29] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:29] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/23 places, 4/23 transitions.
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-050-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s3 1)), p1:(AND (GEQ s1 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-050-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-10 finished in 114 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(G(p0))) U (G(p0)||X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 23/23 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 4 transition count 4
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 4 transition count 4
Applied a total of 38 rules in 0 ms. Remains 4 /23 variables (removed 19) and now considering 4/23 (removed 19) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:07:29] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:07:29] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:07:29] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:07:29] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:07:29] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:29] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/23 places, 4/23 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Eratosthenes-PT-050-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s1 1), p0:(AND (GEQ s2 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 38 steps with 2 reset in 0 ms.
FORMULA Eratosthenes-PT-050-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-11 finished in 123 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G((X(X(X(p1)))||p0))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 23/23 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 5 transition count 5
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 5 transition count 5
Applied a total of 36 rules in 0 ms. Remains 5 /23 variables (removed 18) and now considering 5/23 (removed 18) transitions.
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:07:29] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:29] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:07:29] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:29] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:07:29] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:29] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/23 places, 5/23 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : Eratosthenes-PT-050-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (GEQ s2 1) (AND (GEQ s1 1) (GEQ s4 1))), p1:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, terminal, 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 6 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-050-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-12 finished in 224 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(((p0 U G(!p0))&&F(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 23/23 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 3 transition count 3
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 3 transition count 3
Applied a total of 40 rules in 1 ms. Remains 3 /23 variables (removed 20) and now considering 3/23 (removed 20) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:07:29] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:29] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:07:29] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:29] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:07:29] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:07:29] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/23 places, 3/23 transitions.
Stuttering acceptance computed with spot in 180 ms :[p0, p0, (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true, (OR (NOT p1) p0)]
Running random walk in product with property : Eratosthenes-PT-050-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=7 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 7}]], initial=5, aps=[p0:(GEQ s1 1), p1:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-050-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-13 finished in 215 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 23/23 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 4 transition count 4
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 4 transition count 4
Applied a total of 38 rules in 1 ms. Remains 4 /23 variables (removed 19) and now considering 4/23 (removed 19) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:07:29] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:29] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:07:29] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:29] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:07:29] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:29] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/23 places, 4/23 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-050-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s2 1), p1:(OR (LT s1 1) (LT 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]]
Product exploration explored 100000 steps with 18132 reset in 170 ms.
Product exploration explored 100000 steps with 17561 reset in 116 ms.
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 : 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-050-14 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Eratosthenes-PT-050-14 finished in 502 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 23/23 places, 23/23 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 5 transition count 5
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 5 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 35 place count 4 transition count 4
Applied a total of 35 rules in 2 ms. Remains 4 /23 variables (removed 19) and now considering 4/23 (removed 19) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:07:30] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:07:30] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:07:30] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:30] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2021-05-10 15:07:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:07:30] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:07:30] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/23 places, 4/23 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-050-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s3 1)), p1:(OR (LT s1 1) (LT s2 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 4 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-050-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-050-15 finished in 141 ms.
All properties solved without resorting to model-checking.
BK_STOP 1620659251715
--------------------
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-050"
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-050, 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-162048875700701"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Eratosthenes-PT-050.tgz
mv Eratosthenes-PT-050 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 '
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 ;