Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r096-smll-165260575700052.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/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 FlexibleBarrier-PT-10a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260575700052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 6.6K Apr 29 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 13:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 29 13:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 94K May 10 09:33 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 FlexibleBarrier-PT-10a-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652618333248

Running Version 202205111006
[2022-05-15 12:38:55] [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-15 12:38:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 12:38:55] [INFO ] Load time of PNML (sax parser for PT used): 224 ms
[2022-05-15 12:38:55] [INFO ] Transformed 123 places.
[2022-05-15 12:38:55] [INFO ] Transformed 334 transitions.
[2022-05-15 12:38:55] [INFO ] Found NUPN structural information;
[2022-05-15 12:38:55] [INFO ] Parsed PT model containing 123 places and 334 transitions in 462 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 82 transitions
Reduce redundant transitions removed 82 transitions.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10a-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 252/252 transitions.
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 123 transition count 242
Applied a total of 10 rules in 43 ms. Remains 123 /123 variables (removed 0) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 123 cols
[2022-05-15 12:38:56] [INFO ] Computed 12 place invariants in 12 ms
[2022-05-15 12:38:56] [INFO ] Implicit Places using invariants in 359 ms returned []
// Phase 1: matrix 242 rows 123 cols
[2022-05-15 12:38:56] [INFO ] Computed 12 place invariants in 7 ms
[2022-05-15 12:38:56] [INFO ] State equation strengthened by 141 read => feed constraints.
[2022-05-15 12:38:57] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 123 cols
[2022-05-15 12:38:57] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-15 12:38:57] [INFO ] Dead Transitions using invariants and state equation in 271 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/123 places, 242/252 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 242/252 transitions.
Support contains 33 out of 123 places after structural reductions.
[2022-05-15 12:38:57] [INFO ] Flatten gal took : 68 ms
[2022-05-15 12:38:57] [INFO ] Flatten gal took : 32 ms
[2022-05-15 12:38:57] [INFO ] Input system was already deterministic with 242 transitions.
Finished random walk after 1820 steps, including 0 resets, run visited all 29 properties in 104 ms. (steps per millisecond=17 )
Computed a total of 3 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(G((G(p1)||p0))))&&p2)))'
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 8 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2022-05-15 12:38:58] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-15 12:38:58] [INFO ] Implicit Places using invariants in 134 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 138 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 7 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 122/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 444 ms :[true, (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(OR (EQ s36 0) (EQ s59 0) (EQ s121 0) (EQ s82 0)), p1:(EQ s82 1), p0:(OR (EQ s36 0) (EQ s59 0) (EQ s121 0))], 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]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-01 finished in 677 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 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 94 edges and 123 vertex of which 24 / 123 are part of one of the 8 SCC in 4 ms
Free SCC test removed 16 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 138 edges and 104 vertex of which 90 / 104 are part of one of the 12 SCC in 0 ms
Free SCC test removed 78 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 26 transition count 202
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 173 transitions
Reduce isomorphic transitions removed 173 transitions.
Graph (trivial) has 20 edges and 16 vertex of which 4 / 16 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 186 rules applied. Total rules applied 192 place count 14 transition count 27
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 197 place count 12 transition count 24
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 199 place count 10 transition count 20
Iterating global reduction 3 with 2 rules applied. Total rules applied 201 place count 10 transition count 20
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 205 place count 10 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 209 place count 8 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 211 place count 6 transition count 14
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 218 place count 6 transition count 7
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 220 place count 6 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 222 place count 4 transition count 5
Applied a total of 222 rules in 26 ms. Remains 4 /123 variables (removed 119) and now considering 5/242 (removed 237) transitions.
// Phase 1: matrix 5 rows 4 cols
[2022-05-15 12:38:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 12:38:59] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2022-05-15 12:38:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 12:38:59] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-15 12:38:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2022-05-15 12:38:59] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 12:38:59] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/123 places, 5/242 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/123 places, 5/242 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-02 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=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s0 0), p0:(EQ s2 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, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-02 finished in 277 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(p0)))'
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 95 edges and 123 vertex of which 24 / 123 are part of one of the 8 SCC in 1 ms
Free SCC test removed 16 places
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 61 place count 77 transition count 168
Drop transitions removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 0 with 52 rules applied. Total rules applied 113 place count 77 transition count 116
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 113 place count 77 transition count 115
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 115 place count 76 transition count 115
Applied a total of 115 rules in 55 ms. Remains 76 /123 variables (removed 47) and now considering 115/242 (removed 127) transitions.
[2022-05-15 12:38:59] [INFO ] Flow matrix only has 98 transitions (discarded 17 similar events)
// Phase 1: matrix 98 rows 76 cols
[2022-05-15 12:38:59] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-15 12:38:59] [INFO ] Implicit Places using invariants in 161 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 165 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/123 places, 115/242 transitions.
Graph (trivial) has 97 edges and 75 vertex of which 24 / 75 are part of one of the 8 SCC in 1 ms
Free SCC test removed 16 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 59 transition count 73
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 49 transition count 73
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 21 place count 49 transition count 63
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 41 place count 39 transition count 63
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 65 place count 27 transition count 51
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 74 place count 27 transition count 42
Applied a total of 74 rules in 24 ms. Remains 27 /75 variables (removed 48) and now considering 42/115 (removed 73) transitions.
[2022-05-15 12:38:59] [INFO ] Flow matrix only has 31 transitions (discarded 11 similar events)
// Phase 1: matrix 31 rows 27 cols
[2022-05-15 12:38:59] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 12:38:59] [INFO ] Implicit Places using invariants in 38 ms returned []
[2022-05-15 12:38:59] [INFO ] Flow matrix only has 31 transitions (discarded 11 similar events)
// Phase 1: matrix 31 rows 27 cols
[2022-05-15 12:38:59] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-15 12:38:59] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-15 12:38:59] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/123 places, 42/242 transitions.
Finished structural reductions, in 2 iterations. Remains : 27/123 places, 42/242 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s24 1) (EQ s26 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 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-03 finished in 407 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&F((X(F(p1))&&X(p2)))))'
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 9 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2022-05-15 12:38:59] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-15 12:38:59] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 242 rows 123 cols
[2022-05-15 12:38:59] [INFO ] Computed 12 place invariants in 7 ms
[2022-05-15 12:39:00] [INFO ] State equation strengthened by 141 read => feed constraints.
[2022-05-15 12:39:00] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 123 cols
[2022-05-15 12:39:00] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-15 12:39:00] [INFO ] Dead Transitions using invariants and state equation in 302 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p1), true]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s64 0) (EQ s122 0)), p1:(AND (EQ s47 1) (EQ s60 1) (EQ s121 1)), p0:(AND (EQ s60 1) (EQ s95 1) (EQ s121 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 23 steps with 4 reset in 2 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-04 finished in 1045 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 97 edges and 123 vertex of which 27 / 123 are part of one of the 9 SCC in 3 ms
Free SCC test removed 18 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 139 edges and 102 vertex of which 95 / 102 are part of one of the 11 SCC in 1 ms
Free SCC test removed 84 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 18 transition count 194
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 180 transitions
Reduce isomorphic transitions removed 180 transitions.
Graph (trivial) has 10 edges and 8 vertex of which 2 / 8 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 192 rules applied. Total rules applied 197 place count 7 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 199 place count 6 transition count 12
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 200 place count 5 transition count 10
Iterating global reduction 3 with 1 rules applied. Total rules applied 201 place count 5 transition count 10
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 203 place count 5 transition count 8
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 205 place count 4 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 206 place count 3 transition count 7
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 209 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 210 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 211 place count 2 transition count 3
Applied a total of 211 rules in 21 ms. Remains 2 /123 variables (removed 121) and now considering 3/242 (removed 239) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-15 12:39:00] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 12:39:00] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-15 12:39:00] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-15 12:39:00] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2022-05-15 12:39:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-15 12:39:00] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 12:39:00] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/123 places, 3/242 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/123 places, 3/242 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s0 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 FlexibleBarrier-PT-10a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-05 finished in 157 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 95 edges and 123 vertex of which 24 / 123 are part of one of the 8 SCC in 0 ms
Free SCC test removed 16 places
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 61 place count 77 transition count 168
Drop transitions removed 52 transitions
Redundant transition composition rules discarded 52 transitions
Iterating global reduction 0 with 52 rules applied. Total rules applied 113 place count 77 transition count 116
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 113 place count 77 transition count 115
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 115 place count 76 transition count 115
Applied a total of 115 rules in 37 ms. Remains 76 /123 variables (removed 47) and now considering 115/242 (removed 127) transitions.
[2022-05-15 12:39:00] [INFO ] Flow matrix only has 98 transitions (discarded 17 similar events)
// Phase 1: matrix 98 rows 76 cols
[2022-05-15 12:39:00] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-15 12:39:01] [INFO ] Implicit Places using invariants in 120 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 122 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/123 places, 115/242 transitions.
Graph (trivial) has 97 edges and 75 vertex of which 24 / 75 are part of one of the 8 SCC in 1 ms
Free SCC test removed 16 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 59 transition count 73
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 49 transition count 73
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 21 place count 49 transition count 63
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 41 place count 39 transition count 63
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 65 place count 27 transition count 51
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 74 place count 27 transition count 42
Applied a total of 74 rules in 11 ms. Remains 27 /75 variables (removed 48) and now considering 42/115 (removed 73) transitions.
[2022-05-15 12:39:01] [INFO ] Flow matrix only has 31 transitions (discarded 11 similar events)
// Phase 1: matrix 31 rows 27 cols
[2022-05-15 12:39:01] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 12:39:01] [INFO ] Implicit Places using invariants in 32 ms returned []
[2022-05-15 12:39:01] [INFO ] Flow matrix only has 31 transitions (discarded 11 similar events)
// Phase 1: matrix 31 rows 27 cols
[2022-05-15 12:39:01] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 12:39:01] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-05-15 12:39:01] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/123 places, 42/242 transitions.
Finished structural reductions, in 2 iterations. Remains : 27/123 places, 42/242 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s24 1) (EQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-07 finished in 380 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X((X(F((G(p1)&&p2))) U X(p3)))||p0))))'
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2022-05-15 12:39:01] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-15 12:39:01] [INFO ] Implicit Places using invariants in 143 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 146 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 122/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 276 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (OR (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p1))), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=3 dest: 5}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p2 p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s78 0) (EQ s121 0)), p3:(AND (EQ s24 1) (EQ s95 1) (EQ s121 1)), p2:(EQ s82 1), p1:(AND (EQ s78 1) (EQ s121 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 579 ms.
Stack based approach found an accepted trace after 137 steps with 0 reset with depth 138 and stack size 135 in 2 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-08 finished in 1048 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U G(p1)))||X(G(F(p2)))))'
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 93 edges and 123 vertex of which 24 / 123 are part of one of the 8 SCC in 1 ms
Free SCC test removed 16 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 136 edges and 104 vertex of which 85 / 104 are part of one of the 13 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 32 transition count 200
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 158 transitions
Reduce isomorphic transitions removed 158 transitions.
Graph (trivial) has 26 edges and 21 vertex of which 2 / 21 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 171 rules applied. Total rules applied 179 place count 20 transition count 41
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 182 place count 19 transition count 39
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 185 place count 16 transition count 33
Iterating global reduction 3 with 3 rules applied. Total rules applied 188 place count 16 transition count 33
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 7 rules applied. Total rules applied 195 place count 16 transition count 26
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 200 place count 12 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 201 place count 11 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 203 place count 10 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 204 place count 10 transition count 23
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 216 place count 10 transition count 11
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 7 with 3 rules applied. Total rules applied 219 place count 10 transition count 8
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 222 place count 7 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 222 place count 7 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 224 place count 6 transition count 7
Applied a total of 224 rules in 9 ms. Remains 6 /123 variables (removed 117) and now considering 7/242 (removed 235) transitions.
// Phase 1: matrix 7 rows 6 cols
[2022-05-15 12:39:02] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-15 12:39:02] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 7 rows 6 cols
[2022-05-15 12:39:02] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-15 12:39:02] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-15 12:39:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 6 cols
[2022-05-15 12:39:02] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-15 12:39:02] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/123 places, 7/242 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/123 places, 7/242 transitions.
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s4 1), p1:(EQ s0 1), p2:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-09 finished in 370 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(G((G(F(G(F(p0))))||p1)))))'
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2022-05-15 12:39:02] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-15 12:39:02] [INFO ] Implicit Places using invariants in 170 ms returned [121]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 172 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 122/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s83 0) (OR (EQ s50 0) (EQ s121 0))), p0:(AND (EQ s115 1) (EQ s121 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 304 reset in 546 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 2 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-10 finished in 941 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p1)&&p0))||G(F(G(p2)))))'
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 13 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2022-05-15 12:39:03] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-15 12:39:03] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 242 rows 123 cols
[2022-05-15 12:39:03] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-15 12:39:03] [INFO ] State equation strengthened by 141 read => feed constraints.
[2022-05-15 12:39:04] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 123 cols
[2022-05-15 12:39:04] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-15 12:39:04] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s98 1) (EQ s122 1)), p2:(EQ s106 1), p1:(OR (AND (EQ s35 1) (EQ s121 1)) (AND (EQ s98 1) (EQ s122 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 255 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-11 finished in 1026 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F((X(X(!p0))||p1))&&G(p0)&&p2) U X(p1)))'
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2022-05-15 12:39:04] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-15 12:39:04] [INFO ] Implicit Places using invariants in 117 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 118 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 122/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p1), (NOT p0), true, (NOT p1), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 p0), acceptance={0} source=5 dest: 1}, { cond=(NOT p0), acceptance={0} source=5 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=5 dest: 6}], [{ cond=(AND p1 p0), acceptance={} source=6 dest: 1}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=6 dest: 2}]], initial=3, aps=[p1:(AND (EQ s6 1) (EQ s121 1)), p0:(AND (EQ s84 1) (EQ s107 1) (EQ s121 1)), p2:(EQ s61 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, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-12 finished in 399 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!(X(X(p0)) U p1)&&X(p2)&&p2))))'
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 92 edges and 123 vertex of which 21 / 123 are part of one of the 7 SCC in 1 ms
Free SCC test removed 14 places
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 61 place count 79 transition count 183
Drop transitions removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 0 with 54 rules applied. Total rules applied 115 place count 79 transition count 129
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 116 place count 79 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 117 place count 78 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 118 place count 78 transition count 128
Applied a total of 118 rules in 26 ms. Remains 78 /123 variables (removed 45) and now considering 128/242 (removed 114) transitions.
[2022-05-15 12:39:05] [INFO ] Flow matrix only has 107 transitions (discarded 21 similar events)
// Phase 1: matrix 107 rows 78 cols
[2022-05-15 12:39:05] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-15 12:39:05] [INFO ] Implicit Places using invariants in 103 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 104 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/123 places, 128/242 transitions.
Graph (trivial) has 97 edges and 77 vertex of which 21 / 77 are part of one of the 7 SCC in 1 ms
Free SCC test removed 14 places
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 63 transition count 90
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 53 transition count 90
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 21 place count 53 transition count 80
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 41 place count 43 transition count 80
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 67 place count 30 transition count 67
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 77 place count 30 transition count 57
Applied a total of 77 rules in 9 ms. Remains 30 /77 variables (removed 47) and now considering 57/128 (removed 71) transitions.
[2022-05-15 12:39:05] [INFO ] Flow matrix only has 40 transitions (discarded 17 similar events)
// Phase 1: matrix 40 rows 30 cols
[2022-05-15 12:39:05] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-15 12:39:05] [INFO ] Implicit Places using invariants in 27 ms returned []
[2022-05-15 12:39:05] [INFO ] Flow matrix only has 40 transitions (discarded 17 similar events)
// Phase 1: matrix 40 rows 30 cols
[2022-05-15 12:39:05] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 12:39:05] [INFO ] State equation strengthened by 18 read => feed constraints.
[2022-05-15 12:39:05] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 30/123 places, 57/242 transitions.
Finished structural reductions, in 2 iterations. Remains : 30/123 places, 57/242 transitions.
Stuttering acceptance computed with spot in 52 ms :[(OR (NOT p2) p1)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(OR p1 (NOT p2)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(EQ s11 1), p2:(OR (EQ s5 0) (EQ s26 0) (EQ s29 0))], 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 9 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-13 finished in 302 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(X(p0)) U p1)) U (X(G(p0)) U p2)))'
Support contains 7 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2022-05-15 12:39:05] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-15 12:39:05] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 242 rows 123 cols
[2022-05-15 12:39:05] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-15 12:39:05] [INFO ] State equation strengthened by 141 read => feed constraints.
[2022-05-15 12:39:05] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 123 cols
[2022-05-15 12:39:05] [INFO ] Computed 12 place invariants in 9 ms
[2022-05-15 12:39:06] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 328 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p1)), true, (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(NOT p0), acceptance={} source=2 dest: 6}, { cond=(AND p2 p1 p0), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=(AND p1 p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=true, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=(AND p1 p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(AND (EQ s24 1) (EQ s95 1) (EQ s121 1)), p1:(AND (EQ s33 1) (EQ s122 1) (EQ s24 1) (EQ s95 1) (EQ s121 1)), p0:(AND (EQ s71 1) (EQ s84 1) (EQ s121 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-14 finished in 990 ms.
All properties solved by simple procedures.
Total runtime 10989 ms.

BK_STOP 1652618346471

--------------------
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="FlexibleBarrier-PT-10a"
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 FlexibleBarrier-PT-10a, 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 r096-smll-165260575700052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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