Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089416000597.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 RefineWMG-PT-005005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089416000597
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 10:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 10:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 25 14:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 25 14:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 14K 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 RefineWMG-PT-005005-00
FORMULA_NAME RefineWMG-PT-005005-01
FORMULA_NAME RefineWMG-PT-005005-02
FORMULA_NAME RefineWMG-PT-005005-03
FORMULA_NAME RefineWMG-PT-005005-04
FORMULA_NAME RefineWMG-PT-005005-05
FORMULA_NAME RefineWMG-PT-005005-06
FORMULA_NAME RefineWMG-PT-005005-07
FORMULA_NAME RefineWMG-PT-005005-08
FORMULA_NAME RefineWMG-PT-005005-09
FORMULA_NAME RefineWMG-PT-005005-10
FORMULA_NAME RefineWMG-PT-005005-11
FORMULA_NAME RefineWMG-PT-005005-12
FORMULA_NAME RefineWMG-PT-005005-13
FORMULA_NAME RefineWMG-PT-005005-14
FORMULA_NAME RefineWMG-PT-005005-15

=== Now, execution of the tool begins

BK_START 1621261507522

Running Version 0
[2021-05-17 14:25:08] [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-17 14:25:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:25:09] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2021-05-17 14:25:09] [INFO ] Transformed 29 places.
[2021-05-17 14:25:09] [INFO ] Transformed 23 transitions.
[2021-05-17 14:25:09] [INFO ] Parsed PT model containing 29 places and 23 transitions in 60 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 14:25:09] [INFO ] Initial state test concluded for 3 properties.
FORMULA RefineWMG-PT-005005-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 9 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:09] [INFO ] Computed 12 place invariants in 6 ms
[2021-05-17 14:25:09] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:09] [INFO ] Computed 12 place invariants in 10 ms
[2021-05-17 14:25:09] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:09] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 14:25:09] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:09] [INFO ] Computed 12 place invariants in 10 ms
[2021-05-17 14:25:09] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 23/23 transitions.
[2021-05-17 14:25:09] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-17 14:25:09] [INFO ] Flatten gal took : 18 ms
FORMULA RefineWMG-PT-005005-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-005005-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-005005-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-005005-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:25:09] [INFO ] Flatten gal took : 5 ms
[2021-05-17 14:25:09] [INFO ] Input system was already deterministic with 23 transitions.
Finished random walk after 234 steps, including 0 resets, run visited all 13 properties in 3 ms. (steps per millisecond=78 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((X(p0)||G(p1))) U (p2 U p3)))], workingDir=/home/mcc/execution]
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:09] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-17 14:25:09] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:09] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 14:25:09] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:09] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 14:25:09] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:09] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-17 14:25:09] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 495 ms :[(NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p1), (NOT p3), (AND p0 (NOT p1) (NOT p3))]
Running random walk in product with property : RefineWMG-PT-005005-01 automaton TGBA [mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 9}, { cond=(AND (NOT p3) p2 p1 (NOT p0)), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=7 dest: 9}], [{ cond=(NOT p1), acceptance={} source=8 dest: 5}, { cond=p1, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=9 dest: 5}, { cond=(AND (NOT p3) p2), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=10 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={} source=10 dest: 8}, { cond=(AND (NOT p3) p2 (NOT p1) p0), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p3) p2 p1 p0), acceptance={} source=10 dest: 10}]], initial=0, aps=[p3:(GEQ s18 1), p2:(GEQ s15 1), p1:(GEQ s17 1), p0:(GEQ s28 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, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 213 steps with 1 reset in 6 ms.
FORMULA RefineWMG-PT-005005-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005005-01 finished in 670 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:10] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 14:25:10] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:10] [INFO ] Computed 12 place invariants in 6 ms
[2021-05-17 14:25:10] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:10] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 14:25:10] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:10] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 14:25:10] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-005005-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(GEQ s13 1), p0:(GEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-005005-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005005-02 finished in 253 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((!p0&&(p1 U (p2&&X(p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:10] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 14:25:10] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:10] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 14:25:10] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:10] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 14:25:10] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:10] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 14:25:10] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (OR (NOT p0) (NOT p2)), true]
Running random walk in product with property : RefineWMG-PT-005005-03 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=p2, acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(OR p0 (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(GEQ s17 1), p2:(LT s10 1), p1:(GEQ s23 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][false, false, false]]
Product exploration explored 100000 steps with 898 reset in 384 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 1 ms.
FORMULA RefineWMG-PT-005005-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005005-03 finished in 626 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||F((!p1||G(!p0)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:11] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 14:25:11] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:11] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-17 14:25:11] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:11] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 14:25:11] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:11] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 14:25:11] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 93 ms :[false, false, (AND p0 p1)]
Running random walk in product with property : RefineWMG-PT-005005-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s4 5), p1:(GEQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 201 reset in 242 ms.
Stack based approach found an accepted trace after 518 steps with 1 reset with depth 300 and stack size 260 in 1 ms.
FORMULA RefineWMG-PT-005005-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005005-04 finished in 494 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X((G(F(!p0))||(F(!p0)&&F(p1))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:11] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 14:25:11] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:11] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 14:25:11] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:11] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 14:25:11] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:11] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 14:25:11] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 251 ms :[p0, p0, p0, p0, p0, p0, (AND (NOT p1) p0), (AND p0 (NOT p1))]
Running random walk in product with property : RefineWMG-PT-005005-07 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: 4}], [{ cond=p0, acceptance={} source=4 dest: 5}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=p0, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(GEQ s13 1), p1:(LT s4 5)], 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, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2139 reset in 279 ms.
Stack based approach found an accepted trace after 49 steps with 6 reset with depth 13 and stack size 13 in 0 ms.
FORMULA RefineWMG-PT-005005-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005005-07 finished in 685 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:12] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 14:25:12] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:12] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 14:25:12] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:12] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 14:25:12] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:12] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 14:25:12] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-005005-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s11 1) (GEQ s12 1) (GEQ s14 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][false, false]]
Product exploration explored 100000 steps with 2141 reset in 156 ms.
Stack based approach found an accepted trace after 25 steps with 0 reset with depth 26 and stack size 26 in 0 ms.
FORMULA RefineWMG-PT-005005-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005005-09 finished in 318 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(!p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 13 edges and 29 vertex of which 8 / 29 are part of one of the 4 SCC in 3 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 21 transition count 16
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 15 rules applied. Total rules applied 19 place count 11 transition count 11
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 11 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 23 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 23 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 8 transition count 8
Applied a total of 25 rules in 21 ms. Remains 8 /29 variables (removed 21) and now considering 8/23 (removed 15) transitions.
// Phase 1: matrix 8 rows 8 cols
[2021-05-17 14:25:12] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:25:12] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2021-05-17 14:25:12] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:25:12] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2021-05-17 14:25:12] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:25:12] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2021-05-17 14:25:12] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2021-05-17 14:25:12] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:25:12] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/29 places, 8/23 transitions.
Stuttering acceptance computed with spot in 57 ms :[(OR (NOT p1) p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-005005-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s7 1), p1:(AND (LT s7 1) (GEQ s4 5))], 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 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-005005-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005005-11 finished in 162 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 13 edges and 29 vertex of which 8 / 29 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 21 transition count 16
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 15 rules applied. Total rules applied 19 place count 11 transition count 11
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 11 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 23 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 23 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 7 transition count 7
Applied a total of 27 rules in 3 ms. Remains 7 /29 variables (removed 22) and now considering 7/23 (removed 16) transitions.
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:25:12] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:25:12] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:25:12] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:25:12] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:25:12] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:25:12] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2021-05-17 14:25:12] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:25:12] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:25:12] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/29 places, 7/23 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-005005-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-005005-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005005-12 finished in 93 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 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 15 edges and 29 vertex of which 10 / 29 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 19 transition count 14
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 15 rules applied. Total rules applied 20 place count 9 transition count 9
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 24 place count 9 transition count 5
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 28 place count 5 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 4 transition count 4
Applied a total of 30 rules in 2 ms. Remains 4 /29 variables (removed 25) and now considering 4/23 (removed 19) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-17 14:25:12] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-17 14:25:12] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-17 14:25:12] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-17 14:25:12] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-17 14:25:12] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-17 14:25:12] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2021-05-17 14:25:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-17 14:25:12] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-17 14:25:12] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/29 places, 4/23 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-005005-13 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 s2 3)], 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 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-005005-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005005-13 finished in 119 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(((!p0||G(p1)) U X(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:13] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 14:25:13] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:13] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 14:25:13] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:13] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 14:25:13] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:13] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 14:25:13] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : RefineWMG-PT-005005-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(OR (NOT p0) p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(GEQ s28 1), p1:(LT s22 1), p2:(GEQ s15 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, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-005005-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005005-14 finished in 301 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U X(!p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:13] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 14:25:13] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:13] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 14:25:13] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:13] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 14:25:13] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:13] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 14:25:13] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 90 ms :[p1, p1, p1]
Running random walk in product with property : RefineWMG-PT-005005-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s8 1), p1:(AND (GEQ s11 1) (GEQ s12 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33158 reset in 133 ms.
Stack based approach found an accepted trace after 88029 steps with 29361 reset with depth 23 and stack size 23 in 223 ms.
FORMULA RefineWMG-PT-005005-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005005-15 finished in 551 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621261514313

--------------------
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="RefineWMG-PT-005005"
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 RefineWMG-PT-005005, 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 r178-tajo-162089416000597"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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