fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r204-oct2-165281599200396
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for SemanticWebServices-PT-S128P12

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
200.592 3824.00 6143.00 42.80 TFTFFTTFTFFFTTTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2022-input.r204-oct2-165281599200396.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SemanticWebServices-PT-S128P12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281599200396
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 5.5K Apr 29 12:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Apr 29 12:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 29 12:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 29 12:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 8 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 224K May 10 09:34 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 SemanticWebServices-PT-S128P12-LTLFireability-00
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLFireability-01
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLFireability-02
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLFireability-03
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLFireability-04
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLFireability-05
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLFireability-06
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLFireability-07
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLFireability-08
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLFireability-09
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLFireability-10
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLFireability-11
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLFireability-12
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLFireability-13
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLFireability-14
FORMULA_NAME SemanticWebServices-PT-S128P12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652966712877

Running Version 202205111006
[2022-05-19 13:25:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 13:25:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 13:25:14] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2022-05-19 13:25:14] [INFO ] Transformed 191 places.
[2022-05-19 13:25:14] [INFO ] Transformed 414 transitions.
[2022-05-19 13:25:14] [INFO ] Parsed PT model containing 191 places and 414 transitions in 189 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 208 transitions
Reduce redundant transitions removed 208 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 13 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 204/204 transitions.
Ensure Unique test removed 28 places
Reduce places removed 117 places and 0 transitions.
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 72 transition count 80
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 248 place count 65 transition count 73
Iterating global reduction 1 with 7 rules applied. Total rules applied 255 place count 65 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 256 place count 65 transition count 72
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 261 place count 60 transition count 67
Iterating global reduction 2 with 5 rules applied. Total rules applied 266 place count 60 transition count 67
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 270 place count 56 transition count 63
Iterating global reduction 2 with 4 rules applied. Total rules applied 274 place count 56 transition count 63
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 277 place count 53 transition count 60
Iterating global reduction 2 with 3 rules applied. Total rules applied 280 place count 53 transition count 60
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 282 place count 51 transition count 58
Iterating global reduction 2 with 2 rules applied. Total rules applied 284 place count 51 transition count 58
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 286 place count 51 transition count 56
Applied a total of 286 rules in 19 ms. Remains 51 /189 variables (removed 138) and now considering 56/204 (removed 148) transitions.
[2022-05-19 13:25:14] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
// Phase 1: matrix 49 rows 51 cols
[2022-05-19 13:25:14] [INFO ] Computed 5 place invariants in 5 ms
[2022-05-19 13:25:14] [INFO ] Implicit Places using invariants in 134 ms returned []
[2022-05-19 13:25:14] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
// Phase 1: matrix 49 rows 51 cols
[2022-05-19 13:25:14] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-19 13:25:14] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-05-19 13:25:14] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2022-05-19 13:25:14] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
// Phase 1: matrix 49 rows 51 cols
[2022-05-19 13:25:14] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-19 13:25:14] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/189 places, 56/204 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/189 places, 56/204 transitions.
Support contains 13 out of 51 places after structural reductions.
[2022-05-19 13:25:14] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2022-05-19 13:25:14] [INFO ] Flatten gal took : 37 ms
[2022-05-19 13:25:14] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 13:25:14] [INFO ] Flatten gal took : 5 ms
[2022-05-19 13:25:14] [INFO ] Input system was already deterministic with 56 transitions.
Finished random walk after 98 steps, including 0 resets, run visited all 8 properties in 13 ms. (steps per millisecond=7 )
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 56/56 transitions.
Graph (complete) has 122 edges and 51 vertex of which 45 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 38 transition count 49
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 38 transition count 49
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 10 place count 35 transition count 46
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 35 transition count 46
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 17 place count 31 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 21 place count 31 transition count 42
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 25 place count 27 transition count 38
Iterating global reduction 0 with 4 rules applied. Total rules applied 29 place count 27 transition count 38
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 33 place count 23 transition count 34
Iterating global reduction 0 with 4 rules applied. Total rules applied 37 place count 23 transition count 34
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 41 place count 23 transition count 30
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 23 transition count 28
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 48 edges and 22 vertex of which 21 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 21 transition count 27
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 20 transition count 26
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 20 transition count 26
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 19 transition count 25
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 19 transition count 25
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 18 transition count 24
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 18 transition count 24
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 17 transition count 23
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 17 transition count 23
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 17 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 17 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 16 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 57 place count 16 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 58 place count 15 transition count 20
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 59 place count 14 transition count 19
Iterating global reduction 5 with 1 rules applied. Total rules applied 60 place count 14 transition count 19
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 61 place count 13 transition count 18
Iterating global reduction 5 with 1 rules applied. Total rules applied 62 place count 13 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 63 place count 13 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 64 place count 13 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 65 place count 12 transition count 16
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 66 place count 11 transition count 15
Iterating global reduction 7 with 1 rules applied. Total rules applied 67 place count 11 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 68 place count 11 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 69 place count 11 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 70 place count 10 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 71 place count 10 transition count 12
Applied a total of 71 rules in 25 ms. Remains 10 /51 variables (removed 41) and now considering 12/56 (removed 44) transitions.
// Phase 1: matrix 12 rows 10 cols
[2022-05-19 13:25:14] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:25:15] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 12 rows 10 cols
[2022-05-19 13:25:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:25:15] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-19 13:25:15] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2022-05-19 13:25:15] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 12 rows 10 cols
[2022-05-19 13:25:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:25:15] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/51 places, 12/56 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/51 places, 12/56 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s6 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLFireability-01 finished in 310 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((G(p0) U p0)))))'
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 56/56 transitions.
Graph (complete) has 122 edges and 51 vertex of which 45 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 4 places
Reduce places removed 5 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 37 transition count 49
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 37 transition count 49
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 10 place count 34 transition count 46
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 34 transition count 46
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 17 place count 30 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 21 place count 30 transition count 42
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 25 place count 26 transition count 38
Iterating global reduction 0 with 4 rules applied. Total rules applied 29 place count 26 transition count 38
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 33 place count 22 transition count 34
Iterating global reduction 0 with 4 rules applied. Total rules applied 37 place count 22 transition count 34
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 41 place count 22 transition count 30
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 22 transition count 28
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 43 edges and 21 vertex of which 20 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 20 transition count 27
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 19 transition count 26
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 19 transition count 26
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 18 transition count 25
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 18 transition count 25
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 17 transition count 24
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 17 transition count 24
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 16 transition count 23
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 16 transition count 23
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 16 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 16 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 15 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 57 place count 15 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 58 place count 14 transition count 20
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 59 place count 13 transition count 19
Iterating global reduction 5 with 1 rules applied. Total rules applied 60 place count 13 transition count 19
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 61 place count 12 transition count 18
Iterating global reduction 5 with 1 rules applied. Total rules applied 62 place count 12 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 63 place count 12 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 64 place count 12 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 65 place count 11 transition count 16
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 66 place count 10 transition count 15
Iterating global reduction 7 with 1 rules applied. Total rules applied 67 place count 10 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 68 place count 10 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 69 place count 10 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 70 place count 9 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 71 place count 9 transition count 12
Applied a total of 71 rules in 11 ms. Remains 9 /51 variables (removed 42) and now considering 12/56 (removed 44) transitions.
// Phase 1: matrix 12 rows 9 cols
[2022-05-19 13:25:15] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:25:15] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 12 rows 9 cols
[2022-05-19 13:25:15] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:25:15] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-19 13:25:15] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2022-05-19 13:25:15] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 12 rows 9 cols
[2022-05-19 13:25:15] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:25:15] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/51 places, 12/56 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/51 places, 12/56 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s3 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 SemanticWebServices-PT-S128P12-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLFireability-04 finished in 160 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1))))'
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 56/56 transitions.
Graph (complete) has 122 edges and 51 vertex of which 45 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 4 places
Reduce places removed 5 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 37 transition count 49
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 37 transition count 49
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 10 place count 34 transition count 46
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 34 transition count 46
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 17 place count 30 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 21 place count 30 transition count 42
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 24 place count 27 transition count 39
Iterating global reduction 0 with 3 rules applied. Total rules applied 27 place count 27 transition count 39
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 30 place count 24 transition count 36
Iterating global reduction 0 with 3 rules applied. Total rules applied 33 place count 24 transition count 36
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 36 place count 24 transition count 33
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 24 transition count 31
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 48 edges and 23 vertex of which 22 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 22 transition count 30
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 21 transition count 29
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 21 transition count 29
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 20 transition count 28
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 20 transition count 28
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 19 transition count 27
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 19 transition count 27
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 18 transition count 26
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 18 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 18 transition count 25
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 18 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 17 transition count 24
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 52 place count 17 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 53 place count 16 transition count 23
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 54 place count 15 transition count 22
Iterating global reduction 5 with 1 rules applied. Total rules applied 55 place count 15 transition count 22
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 56 place count 14 transition count 21
Iterating global reduction 5 with 1 rules applied. Total rules applied 57 place count 14 transition count 21
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 58 place count 14 transition count 20
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 60 place count 14 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 61 place count 13 transition count 18
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 62 place count 12 transition count 17
Iterating global reduction 7 with 1 rules applied. Total rules applied 63 place count 12 transition count 17
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 64 place count 12 transition count 16
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 65 place count 12 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 66 place count 11 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 67 place count 11 transition count 14
Applied a total of 67 rules in 19 ms. Remains 11 /51 variables (removed 40) and now considering 14/56 (removed 42) transitions.
// Phase 1: matrix 14 rows 11 cols
[2022-05-19 13:25:15] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-19 13:25:15] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 14 rows 11 cols
[2022-05-19 13:25:15] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-19 13:25:15] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-19 13:25:15] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-19 13:25:15] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 14 rows 11 cols
[2022-05-19 13:25:15] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-19 13:25:15] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/51 places, 14/56 transitions.
Finished structural reductions, in 1 iterations. Remains : 11/51 places, 14/56 transitions.
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(GEQ s0 1), p0:(LT s5 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, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 121 ms.
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLFireability-09 finished in 296 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(F(p0))))'
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 56/56 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 47 transition count 56
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 45 transition count 54
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 45 transition count 54
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 43 transition count 52
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 43 transition count 52
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 41 transition count 50
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 41 transition count 50
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 40 transition count 49
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 40 transition count 49
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 39 transition count 48
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 39 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 39 transition count 47
Applied a total of 21 rules in 4 ms. Remains 39 /51 variables (removed 12) and now considering 47/56 (removed 9) transitions.
[2022-05-19 13:25:15] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
// Phase 1: matrix 41 rows 39 cols
[2022-05-19 13:25:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:25:15] [INFO ] Implicit Places using invariants in 23 ms returned []
[2022-05-19 13:25:15] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
// Phase 1: matrix 41 rows 39 cols
[2022-05-19 13:25:15] [INFO ] Computed 1 place invariants in 5 ms
[2022-05-19 13:25:15] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-05-19 13:25:15] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2022-05-19 13:25:15] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
// Phase 1: matrix 41 rows 39 cols
[2022-05-19 13:25:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 13:25:15] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 39/51 places, 47/56 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/51 places, 47/56 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 35 steps with 17 reset in 1 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLFireability-11 finished in 214 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p1 U p2)||p0)))'
Support contains 5 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 56/56 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 49 transition count 56
Applied a total of 2 rules in 1 ms. Remains 49 /51 variables (removed 2) and now considering 56/56 (removed 0) transitions.
[2022-05-19 13:25:15] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
// Phase 1: matrix 49 rows 49 cols
[2022-05-19 13:25:15] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 13:25:15] [INFO ] Implicit Places using invariants in 21 ms returned []
[2022-05-19 13:25:15] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
// Phase 1: matrix 49 rows 49 cols
[2022-05-19 13:25:15] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 13:25:15] [INFO ] State equation strengthened by 39 read => feed constraints.
[2022-05-19 13:25:15] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2022-05-19 13:25:15] [INFO ] Flow matrix only has 49 transitions (discarded 7 similar events)
// Phase 1: matrix 49 rows 49 cols
[2022-05-19 13:25:15] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 13:25:15] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/51 places, 56/56 transitions.
Finished structural reductions, in 1 iterations. Remains : 49/51 places, 56/56 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(AND (GEQ s6 1) (GEQ s47 1)), p1:(GEQ s12 1), p0:(OR (LT s7 1) (LT s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 153 ms.
Product exploration explored 100000 steps with 50000 reset in 158 ms.
Computed a total of 8 stabilizing places and 9 stable transitions
Detected a total of 8/49 stabilizing places and 9/56 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), true, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))
Knowledge based reduction with 5 factoid took 192 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SemanticWebServices-PT-S128P12-LTLFireability-12 finished in 773 ms.
All properties solved by simple procedures.
Total runtime 2770 ms.

BK_STOP 1652966716701

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SemanticWebServices-PT-S128P12"
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 SemanticWebServices-PT-S128P12, 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 r204-oct2-165281599200396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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