fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r361-smll-167891811400396
Last Updated
May 14, 2023

About the Execution of LTSMin+red for SemanticWebServices-PT-S128P12

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
207.907 6877.00 11651.00 426.00 FFTTFTFFTTTFTFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r361-smll-167891811400396.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
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 r361-smll-167891811400396
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 652K
-rw-r--r-- 1 mcc users 6.7K Feb 26 10:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 10:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 10:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 10:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 10:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 10:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 10:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 224K Mar 5 18:23 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 1679247279298

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SemanticWebServices-PT-S128P12
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-19 17:34:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 17:34:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 17:34:42] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2023-03-19 17:34:42] [INFO ] Transformed 191 places.
[2023-03-19 17:34:42] [INFO ] Transformed 414 transitions.
[2023-03-19 17:34:42] [INFO ] Parsed PT model containing 191 places and 414 transitions and 1559 arcs in 310 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 2 places in 2 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 2 formulas.
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5 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 31 places
Reduce places removed 120 places and 0 transitions.
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 0 with 244 rules applied. Total rules applied 244 place count 69 transition count 80
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 252 place count 61 transition count 72
Iterating global reduction 1 with 8 rules applied. Total rules applied 260 place count 61 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 261 place count 61 transition count 71
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 267 place count 55 transition count 65
Iterating global reduction 2 with 6 rules applied. Total rules applied 273 place count 55 transition count 65
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 278 place count 50 transition count 60
Iterating global reduction 2 with 5 rules applied. Total rules applied 283 place count 50 transition count 60
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 286 place count 47 transition count 57
Iterating global reduction 2 with 3 rules applied. Total rules applied 289 place count 47 transition count 57
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 291 place count 45 transition count 55
Iterating global reduction 2 with 2 rules applied. Total rules applied 293 place count 45 transition count 55
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 295 place count 45 transition count 53
Applied a total of 295 rules in 38 ms. Remains 45 /189 variables (removed 144) and now considering 53/204 (removed 151) transitions.
[2023-03-19 17:34:42] [INFO ] Flow matrix only has 46 transitions (discarded 7 similar events)
// Phase 1: matrix 46 rows 45 cols
[2023-03-19 17:34:42] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-19 17:34:42] [INFO ] Implicit Places using invariants in 196 ms returned []
[2023-03-19 17:34:42] [INFO ] Flow matrix only has 46 transitions (discarded 7 similar events)
[2023-03-19 17:34:42] [INFO ] Invariant cache hit.
[2023-03-19 17:34:42] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-19 17:34:42] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2023-03-19 17:34:42] [INFO ] Flow matrix only has 46 transitions (discarded 7 similar events)
[2023-03-19 17:34:42] [INFO ] Invariant cache hit.
[2023-03-19 17:34:42] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 45/189 places, 53/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 461 ms. Remains : 45/189 places, 53/204 transitions.
Support contains 5 out of 45 places after structural reductions.
[2023-03-19 17:34:43] [INFO ] Flatten gal took : 28 ms
[2023-03-19 17:34:43] [INFO ] Flatten gal took : 19 ms
[2023-03-19 17:34:43] [INFO ] Input system was already deterministic with 53 transitions.
Finished random walk after 6738 steps, including 3 resets, run visited all 4 properties in 258 ms. (steps per millisecond=26 )
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 53/53 transitions.
Graph (complete) has 97 edges and 45 vertex of which 39 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 37 transition count 48
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 37 transition count 48
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 7 place count 35 transition count 46
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 35 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 35 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 34 transition count 44
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 34 transition count 44
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 33 transition count 43
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 33 transition count 43
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 33 transition count 40
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 64 edges and 32 vertex of which 31 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 19 place count 31 transition count 39
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 30 transition count 38
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 30 transition count 38
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 28 transition count 36
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 28 transition count 36
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 26 transition count 34
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 26 transition count 34
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 32 place count 23 transition count 31
Iterating global reduction 2 with 3 rules applied. Total rules applied 35 place count 23 transition count 31
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 38 place count 23 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 23 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 40 place count 22 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 41 place count 22 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 42 place count 21 transition count 26
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 43 place count 20 transition count 25
Iterating global reduction 5 with 1 rules applied. Total rules applied 44 place count 20 transition count 25
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 45 place count 19 transition count 24
Iterating global reduction 5 with 1 rules applied. Total rules applied 46 place count 19 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 47 place count 19 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 48 place count 19 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 49 place count 18 transition count 22
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 50 place count 17 transition count 21
Iterating global reduction 7 with 1 rules applied. Total rules applied 51 place count 17 transition count 21
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 52 place count 17 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 53 place count 17 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 54 place count 16 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 55 place count 16 transition count 18
Applied a total of 55 rules in 57 ms. Remains 16 /45 variables (removed 29) and now considering 18/53 (removed 35) transitions.
// Phase 1: matrix 18 rows 16 cols
[2023-03-19 17:34:43] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-19 17:34:43] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-19 17:34:43] [INFO ] Invariant cache hit.
[2023-03-19 17:34:43] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-19 17:34:43] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-19 17:34:43] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-19 17:34:43] [INFO ] Invariant cache hit.
[2023-03-19 17:34:43] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/45 places, 18/53 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 252 ms. Remains : 16/45 places, 18/53 transitions.
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s4 1), p1:(OR (LT s2 1) (LT s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLFireability-01 finished in 647 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 53/53 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 53
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 42 transition count 51
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 42 transition count 51
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 40 transition count 49
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 40 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 40 transition count 48
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 39 transition count 47
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 39 transition count 47
Applied a total of 12 rules in 9 ms. Remains 39 /45 variables (removed 6) and now considering 47/53 (removed 6) transitions.
[2023-03-19 17:34:44] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
// Phase 1: matrix 41 rows 39 cols
[2023-03-19 17:34:44] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 17:34:44] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-19 17:34:44] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
[2023-03-19 17:34:44] [INFO ] Invariant cache hit.
[2023-03-19 17:34:44] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-19 17:34:44] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-19 17:34:44] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
[2023-03-19 17:34:44] [INFO ] Invariant cache hit.
[2023-03-19 17:34:44] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 39/45 places, 47/53 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 198 ms. Remains : 39/45 places, 47/53 transitions.
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
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 375 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 53/53 transitions.
Graph (complete) has 97 edges and 45 vertex of which 39 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 35 transition count 47
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 35 transition count 47
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 7 place count 33 transition count 45
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 33 transition count 45
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 12 place count 30 transition count 42
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 30 transition count 42
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 18 place count 27 transition count 39
Iterating global reduction 0 with 3 rules applied. Total rules applied 21 place count 27 transition count 39
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 23 place count 25 transition count 37
Iterating global reduction 0 with 2 rules applied. Total rules applied 25 place count 25 transition count 37
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 27 place count 25 transition count 35
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 25 transition count 33
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 51 edges and 24 vertex of which 23 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 31 place count 23 transition count 32
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 22 transition count 31
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 22 transition count 31
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 21 transition count 30
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 21 transition count 30
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 20 transition count 29
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 20 transition count 29
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 18 transition count 27
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 18 transition count 27
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 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 44 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 45 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 46 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 47 place count 16 transition count 23
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 48 place count 15 transition count 22
Iterating global reduction 5 with 1 rules applied. Total rules applied 49 place count 15 transition count 22
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 50 place count 14 transition count 21
Iterating global reduction 5 with 1 rules applied. Total rules applied 51 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 52 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 54 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 55 place count 13 transition count 18
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 56 place count 12 transition count 17
Iterating global reduction 7 with 1 rules applied. Total rules applied 57 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 58 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 59 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 60 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 61 place count 11 transition count 14
Applied a total of 61 rules in 25 ms. Remains 11 /45 variables (removed 34) and now considering 14/53 (removed 39) transitions.
// Phase 1: matrix 14 rows 11 cols
[2023-03-19 17:34:44] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-19 17:34:44] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-19 17:34:44] [INFO ] Invariant cache hit.
[2023-03-19 17:34:44] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-19 17:34:44] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-19 17:34:44] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-19 17:34:44] [INFO ] Invariant cache hit.
[2023-03-19 17:34:44] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/45 places, 14/53 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 145 ms. Remains : 11/45 places, 14/53 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s2 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 0 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLFireability-11 finished in 200 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 53/53 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 53
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 42 transition count 51
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 42 transition count 51
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 40 transition count 49
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 40 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 40 transition count 48
Applied a total of 10 rules in 6 ms. Remains 40 /45 variables (removed 5) and now considering 48/53 (removed 5) transitions.
[2023-03-19 17:34:44] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
// Phase 1: matrix 42 rows 40 cols
[2023-03-19 17:34:44] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 17:34:44] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-19 17:34:44] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
[2023-03-19 17:34:44] [INFO ] Invariant cache hit.
[2023-03-19 17:34:44] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-19 17:34:44] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2023-03-19 17:34:44] [INFO ] Flow matrix only has 42 transitions (discarded 6 similar events)
[2023-03-19 17:34:44] [INFO ] Invariant cache hit.
[2023-03-19 17:34:45] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 40/45 places, 48/53 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 218 ms. Remains : 40/45 places, 48/53 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s27 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SemanticWebServices-PT-S128P12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLFireability-13 finished in 356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 53/53 transitions.
Graph (complete) has 97 edges and 45 vertex of which 39 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 1 places
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 35 transition count 47
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 35 transition count 47
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 10 place count 32 transition count 44
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 32 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 14 place count 32 transition count 43
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 29 transition count 40
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 29 transition count 40
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 26 transition count 37
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 26 transition count 37
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 24 transition count 35
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 24 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 24 transition count 33
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 24 transition count 31
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 47 edges and 23 vertex of which 22 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 2 with 2 rules applied. Total rules applied 36 place count 22 transition count 30
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 37 place count 21 transition count 29
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 21 transition count 29
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 20 transition count 28
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 20 transition count 28
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 19 transition count 27
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 19 transition count 27
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 44 place count 17 transition count 25
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 17 transition count 25
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 48 place count 17 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 17 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 50 place count 16 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 51 place count 16 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 52 place count 15 transition count 21
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 53 place count 14 transition count 20
Iterating global reduction 6 with 1 rules applied. Total rules applied 54 place count 14 transition count 20
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 55 place count 13 transition count 19
Iterating global reduction 6 with 1 rules applied. Total rules applied 56 place count 13 transition count 19
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 57 place count 13 transition count 18
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 58 place count 13 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 59 place count 12 transition count 17
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 60 place count 11 transition count 16
Iterating global reduction 8 with 1 rules applied. Total rules applied 61 place count 11 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 62 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 63 place count 11 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 64 place count 10 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 65 place count 10 transition count 13
Applied a total of 65 rules in 21 ms. Remains 10 /45 variables (removed 35) and now considering 13/53 (removed 40) transitions.
// Phase 1: matrix 13 rows 10 cols
[2023-03-19 17:34:45] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-19 17:34:45] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-19 17:34:45] [INFO ] Invariant cache hit.
[2023-03-19 17:34:45] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-19 17:34:45] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-19 17:34:45] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-19 17:34:45] [INFO ] Invariant cache hit.
[2023-03-19 17:34:45] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/45 places, 13/53 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 142 ms. Remains : 10/45 places, 13/53 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : SemanticWebServices-PT-S128P12-LTLFireability-15 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-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SemanticWebServices-PT-S128P12-LTLFireability-15 finished in 193 ms.
All properties solved by simple procedures.
Total runtime 3539 ms.
ITS solved all properties within timeout

BK_STOP 1679247286175

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
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 r361-smll-167891811400396"
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 ;