About the Execution of ITS-Tools for AutonomousCar-PT-06a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
355.228 | 20468.00 | 41148.00 | 41.10 | FFFFFFFFTFFFFFFF | 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.r005-oct2-167813593400612.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is AutonomousCar-PT-06a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813593400612
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 6.6K Feb 25 12:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 12:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 12:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 163K Feb 25 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 177K Mar 5 18:22 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 AutonomousCar-PT-06a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678521063843
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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-06a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 07:51:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 07:51:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 07:51:07] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2023-03-11 07:51:07] [INFO ] Transformed 65 places.
[2023-03-11 07:51:07] [INFO ] Transformed 417 transitions.
[2023-03-11 07:51:07] [INFO ] Found NUPN structural information;
[2023-03-11 07:51:07] [INFO ] Parsed PT model containing 65 places and 417 transitions and 3356 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 159 transitions
Reduce redundant transitions removed 159 transitions.
FORMULA AutonomousCar-PT-06a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 258/258 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 62 transition count 243
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 62 transition count 243
Applied a total of 6 rules in 49 ms. Remains 62 /65 variables (removed 3) and now considering 243/258 (removed 15) transitions.
// Phase 1: matrix 243 rows 62 cols
[2023-03-11 07:51:07] [INFO ] Computed 10 place invariants in 8 ms
[2023-03-11 07:51:07] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-03-11 07:51:07] [INFO ] Invariant cache hit.
[2023-03-11 07:51:07] [INFO ] State equation strengthened by 135 read => feed constraints.
[2023-03-11 07:51:08] [INFO ] Implicit Places using invariants and state equation in 298 ms returned [58, 60]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 707 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/65 places, 243/258 transitions.
Applied a total of 0 rules in 12 ms. Remains 60 /60 variables (removed 0) and now considering 243/243 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 770 ms. Remains : 60/65 places, 243/258 transitions.
Support contains 36 out of 60 places after structural reductions.
[2023-03-11 07:51:08] [INFO ] Flatten gal took : 93 ms
[2023-03-11 07:51:08] [INFO ] Flatten gal took : 51 ms
[2023-03-11 07:51:08] [INFO ] Input system was already deterministic with 243 transitions.
Incomplete random walk after 10000 steps, including 529 resets, run finished after 525 ms. (steps per millisecond=19 ) properties (out of 32) seen :27
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 243 rows 60 cols
[2023-03-11 07:51:09] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-11 07:51:09] [INFO ] [Real]Absence check using 8 positive place invariants in 23 ms returned sat
[2023-03-11 07:51:09] [INFO ] After 332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 07:51:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2023-03-11 07:51:09] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 07:51:09] [INFO ] State equation strengthened by 135 read => feed constraints.
[2023-03-11 07:51:09] [INFO ] After 47ms SMT Verify possible using 135 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 07:51:09] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-11 07:51:10] [INFO ] After 422ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 5 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 243/243 transitions.
Graph (complete) has 502 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 59 transition count 231
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 20 place count 51 transition count 231
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 51 transition count 230
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 50 transition count 230
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 25 place count 47 transition count 215
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 47 transition count 215
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 44 transition count 212
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 44 transition count 206
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 82 place count 38 transition count 170
Applied a total of 82 rules in 47 ms. Remains 38 /60 variables (removed 22) and now considering 170/243 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 38/60 places, 170/243 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 90 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Finished probabilistic random walk after 56259 steps, run visited all 2 properties in 137 ms. (steps per millisecond=410 )
Probabilistic random walk after 56259 steps, saw 9326 distinct states, run finished after 137 ms. (steps per millisecond=410 ) properties seen :2
Computed a total of 3 stabilizing places and 2 stable transitions
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 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 60 transition count 236
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 53 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 52 transition count 235
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 52 transition count 234
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 51 transition count 234
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 22 place count 47 transition count 206
Iterating global reduction 3 with 4 rules applied. Total rules applied 26 place count 47 transition count 206
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 45 transition count 204
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 44 transition count 204
Applied a total of 32 rules in 80 ms. Remains 44 /60 variables (removed 16) and now considering 204/243 (removed 39) transitions.
// Phase 1: matrix 204 rows 44 cols
[2023-03-11 07:51:11] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-11 07:51:11] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-11 07:51:11] [INFO ] Invariant cache hit.
[2023-03-11 07:51:11] [INFO ] State equation strengthened by 113 read => feed constraints.
[2023-03-11 07:51:11] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2023-03-11 07:51:11] [INFO ] Redundant transitions in 75 ms returned []
[2023-03-11 07:51:11] [INFO ] Invariant cache hit.
[2023-03-11 07:51:11] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/60 places, 204/243 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 770 ms. Remains : 44/60 places, 204/243 transitions.
Stuttering acceptance computed with spot in 252 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s6 1) (EQ s32 1) (EQ s40 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 9 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-01 finished in 1119 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' '!((((p0||G(p1)) U X(p2)) U p3))'
Support contains 13 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 57 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 57 transition count 222
Applied a total of 6 rules in 2 ms. Remains 57 /60 variables (removed 3) and now considering 222/243 (removed 21) transitions.
// Phase 1: matrix 222 rows 57 cols
[2023-03-11 07:51:12] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-11 07:51:12] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-11 07:51:12] [INFO ] Invariant cache hit.
[2023-03-11 07:51:12] [INFO ] State equation strengthened by 117 read => feed constraints.
[2023-03-11 07:51:12] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2023-03-11 07:51:12] [INFO ] Invariant cache hit.
[2023-03-11 07:51:12] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 57/60 places, 222/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 764 ms. Remains : 57/60 places, 222/243 transitions.
Stuttering acceptance computed with spot in 388 ms :[(NOT p3), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={0} source=0 dest: 2}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p1)), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(AND (EQ s15 1) (EQ s19 1) (EQ s28 1) (EQ s32 1) (EQ s40 1) (EQ s44 1) (EQ s53 1)), p0:(AND (EQ s1 1) (EQ s8 1) (EQ s39 1) (EQ s52 1)), p1:(AND (EQ s15...], nbAcceptance=1, 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 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-02 finished in 1182 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&&X(G((G(p1) U X(p2)))))))'
Support contains 15 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 57 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 57 transition count 222
Applied a total of 6 rules in 2 ms. Remains 57 /60 variables (removed 3) and now considering 222/243 (removed 21) transitions.
// Phase 1: matrix 222 rows 57 cols
[2023-03-11 07:51:13] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 07:51:13] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-11 07:51:13] [INFO ] Invariant cache hit.
[2023-03-11 07:51:13] [INFO ] State equation strengthened by 117 read => feed constraints.
[2023-03-11 07:51:13] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2023-03-11 07:51:13] [INFO ] Invariant cache hit.
[2023-03-11 07:51:13] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 57/60 places, 222/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 621 ms. Remains : 57/60 places, 222/243 transitions.
Stuttering acceptance computed with spot in 467 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={0, 1} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=1 dest: 3}, { cond=p1, acceptance={0, 1} source=1 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 5}, { cond=(AND p0 p1), acceptance={1} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=3 dest: 7}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=3 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=5 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=6 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=6 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=7 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=7 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=7 dest: 7}, { cond=(AND p0 p1), acceptance={1} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=8 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=8 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=8 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=8 dest: 5}, { cond=(AND p0 p1), acceptance={1} source=8 dest: 6}, { cond=p1, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(OR (NEQ s1 1) (NEQ s2 1) (NEQ s44 1) (NEQ s52 1)), p1:(AND (EQ s13 1) (EQ s21 1) (EQ s25 1) (EQ s33 1) (EQ s37 1) (EQ s43 1) (EQ s53 1)), p2:(AND (EQ ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-03 finished in 1108 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' '!(((p0||X((G(p2)&&p1))) U p3))'
Support contains 8 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 58 transition count 229
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 58 transition count 229
Applied a total of 4 rules in 3 ms. Remains 58 /60 variables (removed 2) and now considering 229/243 (removed 14) transitions.
// Phase 1: matrix 229 rows 58 cols
[2023-03-11 07:51:14] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 07:51:14] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-11 07:51:14] [INFO ] Invariant cache hit.
[2023-03-11 07:51:14] [INFO ] State equation strengthened by 123 read => feed constraints.
[2023-03-11 07:51:14] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2023-03-11 07:51:14] [INFO ] Invariant cache hit.
[2023-03-11 07:51:15] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/60 places, 229/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 617 ms. Remains : 58/60 places, 229/243 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p3), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(AND (EQ s1 1) (EQ s9 1) (EQ s12 1) (EQ s53 1)), p0:(AND (EQ s1 1) (EQ s8 1) (EQ s27 1) (EQ s53 1)), p1:(AND (EQ s1 1) (EQ s5 1) (EQ s15 1) (EQ s53 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-04 finished in 855 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 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 56 transition count 215
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 56 transition count 215
Applied a total of 8 rules in 3 ms. Remains 56 /60 variables (removed 4) and now considering 215/243 (removed 28) transitions.
// Phase 1: matrix 215 rows 56 cols
[2023-03-11 07:51:15] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-11 07:51:15] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-11 07:51:15] [INFO ] Invariant cache hit.
[2023-03-11 07:51:15] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-11 07:51:15] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2023-03-11 07:51:15] [INFO ] Invariant cache hit.
[2023-03-11 07:51:15] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 56/60 places, 215/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 572 ms. Remains : 56/60 places, 215/243 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-05 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:(OR (NEQ s1 1) (NEQ s2 1) (NEQ s26 1) (NEQ s51 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-05 finished in 764 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' '!(G((F(p0)&&F((p1||X(p2))))))'
Support contains 12 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 60 transition count 238
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 55 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 54 transition count 237
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 54 transition count 235
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 52 transition count 235
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 19 place count 49 transition count 214
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 49 transition count 214
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 48 transition count 213
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 47 transition count 213
Applied a total of 26 rules in 21 ms. Remains 47 /60 variables (removed 13) and now considering 213/243 (removed 30) transitions.
// Phase 1: matrix 213 rows 47 cols
[2023-03-11 07:51:16] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 07:51:16] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-11 07:51:16] [INFO ] Invariant cache hit.
[2023-03-11 07:51:16] [INFO ] State equation strengthened by 119 read => feed constraints.
[2023-03-11 07:51:16] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2023-03-11 07:51:16] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-11 07:51:16] [INFO ] Invariant cache hit.
[2023-03-11 07:51:16] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/60 places, 213/243 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 543 ms. Remains : 47/60 places, 213/243 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-06 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=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s16 1) (EQ s23 1) (EQ s26 1) (EQ s31 1) (EQ s39 1) (EQ s44 1)), p1:(EQ s38 1), p2:(AND (EQ s1 1) (EQ s7 1) (EQ s37 1) (EQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-06 finished in 740 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' '!(G((F(p0)&&(X(p1) U ((X(p1)&&G(!p2))||X(G(p1)))))))'
Support contains 7 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 57 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 57 transition count 222
Applied a total of 6 rules in 18 ms. Remains 57 /60 variables (removed 3) and now considering 222/243 (removed 21) transitions.
// Phase 1: matrix 222 rows 57 cols
[2023-03-11 07:51:16] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 07:51:16] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-11 07:51:16] [INFO ] Invariant cache hit.
[2023-03-11 07:51:17] [INFO ] State equation strengthened by 117 read => feed constraints.
[2023-03-11 07:51:17] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2023-03-11 07:51:17] [INFO ] Invariant cache hit.
[2023-03-11 07:51:17] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 57/60 places, 222/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 560 ms. Remains : 57/60 places, 222/243 transitions.
Stuttering acceptance computed with spot in 492 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p1) p2), (NOT p1), true, (AND p2 (NOT p1)), (AND p2 p1)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={1} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=3 dest: 4}, { cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={1} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=4 dest: 4}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND p2 p1), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s7 1) (EQ s45 1) (EQ s52 1)), p2:(AND (EQ s1 1) (EQ s2 1) (EQ s24 1) (EQ s52 1)), p1:(NEQ s30 1)], nbAcceptance=2, 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]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-07 finished in 1071 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((p1 U X(p2)))&&p0))||G(p2)))'
Support contains 6 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 57 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 57 transition count 222
Applied a total of 6 rules in 3 ms. Remains 57 /60 variables (removed 3) and now considering 222/243 (removed 21) transitions.
[2023-03-11 07:51:17] [INFO ] Invariant cache hit.
[2023-03-11 07:51:18] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-11 07:51:18] [INFO ] Invariant cache hit.
[2023-03-11 07:51:18] [INFO ] State equation strengthened by 117 read => feed constraints.
[2023-03-11 07:51:18] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
[2023-03-11 07:51:18] [INFO ] Invariant cache hit.
[2023-03-11 07:51:18] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 57/60 places, 222/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 901 ms. Remains : 57/60 places, 222/243 transitions.
Stuttering acceptance computed with spot in 272 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p0 p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s6 1) (EQ s24 1) (EQ s52 1)), p2:(AND (EQ s1 1) (EQ s6 1) (EQ s24 1) (EQ s52 1)), p1:(OR (AND (EQ s1 1) (EQ s6 1) (EQ s24 1) (EQ s52...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-09 finished in 1192 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((X(p1)&&p0))&&X(G(p2))))'
Support contains 6 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 57 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 57 transition count 222
Applied a total of 6 rules in 3 ms. Remains 57 /60 variables (removed 3) and now considering 222/243 (removed 21) transitions.
// Phase 1: matrix 222 rows 57 cols
[2023-03-11 07:51:19] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 07:51:19] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-11 07:51:19] [INFO ] Invariant cache hit.
[2023-03-11 07:51:19] [INFO ] State equation strengthened by 117 read => feed constraints.
[2023-03-11 07:51:19] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2023-03-11 07:51:19] [INFO ] Invariant cache hit.
[2023-03-11 07:51:19] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 57/60 places, 222/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 569 ms. Remains : 57/60 places, 222/243 transitions.
Stuttering acceptance computed with spot in 250 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p2), acceptance={0} source=4 dest: 1}, { cond=(NOT p2), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(AND (EQ s1 1) (EQ s9 1) (EQ s23 1) (EQ s52 1)), p1:(AND (EQ s1 1) (EQ s2 1) (EQ s18 1) (EQ s52 1)), p0:(AND (EQ s1 1) (EQ s9 1) (EQ s23 1) (EQ s52 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-10 finished in 836 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 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 60 transition count 235
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 52 transition count 235
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 52 transition count 234
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 51 transition count 234
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 21 place count 48 transition count 213
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 48 transition count 213
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 46 transition count 211
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 45 transition count 211
Applied a total of 30 rules in 65 ms. Remains 45 /60 variables (removed 15) and now considering 211/243 (removed 32) transitions.
// Phase 1: matrix 211 rows 45 cols
[2023-03-11 07:51:19] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 07:51:20] [INFO ] Implicit Places using invariants in 386 ms returned []
[2023-03-11 07:51:20] [INFO ] Invariant cache hit.
[2023-03-11 07:51:20] [INFO ] State equation strengthened by 119 read => feed constraints.
[2023-03-11 07:51:20] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 810 ms to find 0 implicit places.
[2023-03-11 07:51:20] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-11 07:51:20] [INFO ] Invariant cache hit.
[2023-03-11 07:51:21] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/60 places, 211/243 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1468 ms. Remains : 45/60 places, 211/243 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s4 1) (EQ s17 1) (EQ s41 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 10 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-12 finished in 1562 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 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 60 transition count 236
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 53 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 52 transition count 235
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 52 transition count 234
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 51 transition count 234
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 22 place count 47 transition count 206
Iterating global reduction 3 with 4 rules applied. Total rules applied 26 place count 47 transition count 206
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 45 transition count 204
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 44 transition count 204
Applied a total of 32 rules in 18 ms. Remains 44 /60 variables (removed 16) and now considering 204/243 (removed 39) transitions.
// Phase 1: matrix 204 rows 44 cols
[2023-03-11 07:51:21] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 07:51:21] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-11 07:51:21] [INFO ] Invariant cache hit.
[2023-03-11 07:51:21] [INFO ] State equation strengthened by 113 read => feed constraints.
[2023-03-11 07:51:22] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
[2023-03-11 07:51:22] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-11 07:51:22] [INFO ] Invariant cache hit.
[2023-03-11 07:51:22] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/60 places, 204/243 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 863 ms. Remains : 44/60 places, 204/243 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s8 1) (EQ s37 1) (EQ s40 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 11 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-13 finished in 922 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(F(p0))))'
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 56 transition count 215
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 56 transition count 215
Applied a total of 8 rules in 2 ms. Remains 56 /60 variables (removed 4) and now considering 215/243 (removed 28) transitions.
// Phase 1: matrix 215 rows 56 cols
[2023-03-11 07:51:22] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 07:51:22] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-11 07:51:22] [INFO ] Invariant cache hit.
[2023-03-11 07:51:22] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-11 07:51:22] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2023-03-11 07:51:22] [INFO ] Invariant cache hit.
[2023-03-11 07:51:22] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 56/60 places, 215/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 612 ms. Remains : 56/60 places, 215/243 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s1 1) (EQ s9 1) (EQ s26 1) (EQ s51 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][false, false, false]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-14 finished in 804 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(F(((!p2 U (p3||G(!p2)))||p1)))&&p0))))'
Support contains 13 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 57 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 57 transition count 222
Applied a total of 6 rules in 2 ms. Remains 57 /60 variables (removed 3) and now considering 222/243 (removed 21) transitions.
// Phase 1: matrix 222 rows 57 cols
[2023-03-11 07:51:23] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 07:51:23] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-11 07:51:23] [INFO ] Invariant cache hit.
[2023-03-11 07:51:23] [INFO ] State equation strengthened by 117 read => feed constraints.
[2023-03-11 07:51:23] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-11 07:51:23] [INFO ] Invariant cache hit.
[2023-03-11 07:51:23] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 57/60 places, 222/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 508 ms. Remains : 57/60 places, 222/243 transitions.
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), true, (AND (NOT p1) (NOT p3) p2)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s5 1) (EQ s14 1) (EQ s52 1)), p1:(OR (EQ s1 0) (EQ s8 0) (EQ s23 0) (EQ s52 0)), p3:(AND (NOT (AND (EQ s13 1) (EQ s20 1) (EQ s26 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-15 finished in 820 ms.
All properties solved by simple procedures.
Total runtime 17099 ms.
BK_STOP 1678521084311
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="AutonomousCar-PT-06a"
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-5348"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-06a, 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 r005-oct2-167813593400612"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-06a.tgz
mv AutonomousCar-PT-06a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;