Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r400-tall-171690533000724.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is Sudoku-PT-BN16, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690533000724
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 95M
-rw-r--r-- 1 mcc users 1.7M Apr 12 13:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 7.3M Apr 12 13:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5M Apr 12 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 23M Apr 12 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 717K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.4M Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4M Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.4M Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 903K Apr 12 15:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.9M Apr 12 15:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4M Apr 12 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31M Apr 12 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 29K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 72K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.7M May 18 16:43 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 Sudoku-PT-BN16-LTLFireability-00
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-01
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-02
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-03
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-04
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-05
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-06
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-07
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-08
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-09
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-10
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-11
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-12
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-13
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-14
FORMULA_NAME Sudoku-PT-BN16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717070812568

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-BN16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-30 12:06:53] [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]
[2024-05-30 12:06:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 12:06:54] [INFO ] Load time of PNML (sax parser for PT used): 352 ms
[2024-05-30 12:06:54] [INFO ] Transformed 5120 places.
[2024-05-30 12:06:54] [INFO ] Transformed 4096 transitions.
[2024-05-30 12:06:54] [INFO ] Found NUPN structural information;
[2024-05-30 12:06:54] [INFO ] Parsed PT model containing 5120 places and 4096 transitions and 20480 arcs in 485 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 322 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-PT-BN16-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN16-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-BN16-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1024 out of 5120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5120/5120 places, 4096/4096 transitions.
Reduce places removed 4096 places and 0 transitions.
Iterating post reduction 0 with 4096 rules applied. Total rules applied 4096 place count 1024 transition count 4096
Applied a total of 4096 rules in 100 ms. Remains 1024 /5120 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 1024 cols
[2024-05-30 12:07:00] [INFO ] Computed 168 invariants in 818 ms
[2024-05-30 12:07:01] [INFO ] Implicit Places using invariants in 1789 ms returned []
[2024-05-30 12:07:01] [INFO ] Invariant cache hit.
[2024-05-30 12:07:55] [INFO ] Implicit Places using invariants and state equation in 53574 ms returned []
Implicit Place search using SMT with State Equation took 55395 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 2ms
Starting structural reductions in LTL mode, iteration 1 : 1024/5120 places, 4096/4096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55530 ms. Remains : 1024/5120 places, 4096/4096 transitions.
Support contains 1024 out of 1024 places after structural reductions.
[2024-05-30 12:07:58] [INFO ] Flatten gal took : 1004 ms
[2024-05-30 12:08:03] [INFO ] Flatten gal took : 1034 ms
[2024-05-30 12:08:09] [INFO ] Input system was already deterministic with 4096 transitions.
Reduction of identical properties reduced properties to check from 23 to 17
RANDOM walk for 3186 steps (14 resets) in 1929 ms. (1 steps per ms) remains 0/17 properties
FORMULA Sudoku-PT-BN16-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1024 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 32 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 12:08:11] [INFO ] Invariant cache hit.
[2024-05-30 12:08:12] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-30 12:08:12] [INFO ] Invariant cache hit.
[2024-05-30 12:09:08] [INFO ] Implicit Places using invariants and state equation in 56214 ms returned []
Implicit Place search using SMT with State Equation took 56500 ms to find 0 implicit places.
[2024-05-30 12:09:08] [INFO ] Redundant transitions in 247 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56805 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-02
Stuttering criterion allowed to conclude after 208 steps with 0 reset in 95 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-02 finished in 57181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p1)||p0) U G(p1)))'
Support contains 1024 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 9 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 12:09:08] [INFO ] Invariant cache hit.
[2024-05-30 12:09:09] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-30 12:09:09] [INFO ] Invariant cache hit.
[2024-05-30 12:10:06] [INFO ] Implicit Places using invariants and state equation in 56867 ms returned []
Implicit Place search using SMT with State Equation took 57197 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 57210 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-03
Stuttering criterion allowed to conclude after 212 steps with 0 reset in 74 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-03 finished in 57495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1024 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 27 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 12:10:06] [INFO ] Invariant cache hit.
[2024-05-30 12:10:06] [INFO ] Implicit Places using invariants in 281 ms returned []
[2024-05-30 12:10:06] [INFO ] Invariant cache hit.
[2024-05-30 12:11:01] [INFO ] Implicit Places using invariants and state equation in 54917 ms returned []
Implicit Place search using SMT with State Equation took 55210 ms to find 0 implicit places.
[2024-05-30 12:11:01] [INFO ] Redundant transitions in 234 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55492 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-05
Stuttering criterion allowed to conclude after 205 steps with 0 reset in 67 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-05 finished in 55696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X((F(G((X(p3)||p2)))&&p1))&&p0)))'
Support contains 1024 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 7 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 12:11:02] [INFO ] Invariant cache hit.
[2024-05-30 12:11:02] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-30 12:11:02] [INFO ] Invariant cache hit.
[2024-05-30 12:11:56] [INFO ] Implicit Places using invariants and state equation in 54441 ms returned []
Implicit Place search using SMT with State Equation took 54743 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 54751 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-06
Stuttering criterion allowed to conclude after 213 steps with 0 reset in 70 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-06 finished in 55075 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0&&X(p0))))||F(p1)))'
Support contains 1024 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 7 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 12:11:57] [INFO ] Invariant cache hit.
[2024-05-30 12:11:57] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-05-30 12:11:57] [INFO ] Invariant cache hit.
[2024-05-30 12:12:51] [INFO ] Implicit Places using invariants and state equation in 54161 ms returned []
Implicit Place search using SMT with State Equation took 54525 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 54539 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-07
Product exploration timeout after 30630 steps with 145 reset in 10003 ms.
Product exploration timeout after 30610 steps with 145 reset in 10001 ms.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X p0), (X (NOT p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 27 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN16-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN16-LTLFireability-07 finished in 81734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p1||G(p2)))||p0)))'
Support contains 12 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 263 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 12:13:19] [INFO ] Invariant cache hit.
[2024-05-30 12:13:28] [INFO ] Implicit Places using invariants in 9654 ms returned []
[2024-05-30 12:13:28] [INFO ] Invariant cache hit.
[2024-05-30 12:14:55] [INFO ] Performed 1/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-30 12:15:28] [INFO ] Performed 3/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-30 12:16:00] [INFO ] Performed 5/1024 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-30 12:16:08] [INFO ] Implicit Places with SMT raised an exceptionSMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... after 160045 ms
Implicit Place search using SMT with State Equation took 169714 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 169982 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-08
Product exploration timeout after 19940 steps with 9970 reset in 10004 ms.
Product exploration timeout after 19770 steps with 9885 reset in 10005 ms.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (F (G (NOT p0))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 28 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN16-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN16-LTLFireability-08 finished in 191173 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 8 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 244 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 12:16:30] [INFO ] Invariant cache hit.
[2024-05-30 12:16:39] [INFO ] Implicit Places using invariants in 9601 ms returned []
[2024-05-30 12:16:39] [INFO ] Invariant cache hit.
[2024-05-30 12:18:08] [INFO ] Performed 1/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-30 12:18:41] [INFO ] Performed 3/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-30 12:19:13] [INFO ] Performed 5/1024 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-30 12:19:19] [INFO ] Implicit Places using invariants and state equation in 160031 ms returned []
Implicit Place search using SMT with State Equation took 169637 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 169888 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1496 steps with 7 reset in 461 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-09 finished in 170483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(p0)&&X(p1)))))))'
Support contains 8 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 208 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 12:19:20] [INFO ] Invariant cache hit.
[2024-05-30 12:19:29] [INFO ] Implicit Places using invariants in 9126 ms returned []
[2024-05-30 12:19:29] [INFO ] Invariant cache hit.
[2024-05-30 12:20:58] [INFO ] Performed 1/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-30 12:21:30] [INFO ] Performed 3/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-30 12:22:02] [INFO ] Performed 5/1024 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-30 12:22:09] [INFO ] Implicit Places using invariants and state equation in 160037 ms returned []
Implicit Place search using SMT with State Equation took 169165 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 169375 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-10
Product exploration timeout after 30880 steps with 184 reset in 10005 ms.
Product exploration timeout after 30970 steps with 178 reset in 10001 ms.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 1812 steps (8 resets) in 651 ms. (2 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F p0)]
Knowledge based reduction with 3 factoid took 222 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-30 12:22:32] [INFO ] Invariant cache hit.
[2024-05-30 12:22:41] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 5452 ms returned sat
[2024-05-30 12:22:47] [INFO ] [Real]Absence check using state equation in 6267 ms returned unknown
Could not prove EG (NOT p0)
Support contains 8 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 250 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 12:22:47] [INFO ] Invariant cache hit.
[2024-05-30 12:22:57] [INFO ] Implicit Places using invariants in 9479 ms returned []
[2024-05-30 12:22:57] [INFO ] Invariant cache hit.
[2024-05-30 12:24:25] [INFO ] Performed 1/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-30 12:24:57] [INFO ] Performed 3/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-30 12:25:29] [INFO ] Performed 5/1024 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-30 12:25:37] [INFO ] Implicit Places using invariants and state equation in 160041 ms returned []
Implicit Place search using SMT with State Equation took 169530 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 169782 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 1211 steps (5 resets) in 914 ms. (1 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F p0)]
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2024-05-30 12:25:39] [INFO ] Invariant cache hit.
[2024-05-30 12:25:48] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 5480 ms returned sat
[2024-05-30 12:25:54] [INFO ] [Real]Absence check using state equation in 6225 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering criterion allowed to conclude after 11426 steps with 61 reset in 3496 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-10 finished in 398015 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((!p1 U (p2 U X(p2)))&&p0))))'
Support contains 12 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 208 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 12:25:58] [INFO ] Invariant cache hit.
[2024-05-30 12:26:07] [INFO ] Implicit Places using invariants in 9097 ms returned []
[2024-05-30 12:26:07] [INFO ] Invariant cache hit.
[2024-05-30 12:27:35] [INFO ] Performed 1/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-30 12:28:07] [INFO ] Performed 3/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-30 12:28:39] [INFO ] Performed 5/1024 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-30 12:28:47] [INFO ] Implicit Places using invariants and state equation in 160035 ms returned []
Implicit Place search using SMT with State Equation took 169133 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 169346 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-11
Stuttering criterion allowed to conclude after 258 steps with 17 reset in 96 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-11 finished in 169670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(p0)))&&(F(p2)||p1))))'
Support contains 12 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 213 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 12:28:48] [INFO ] Invariant cache hit.
[2024-05-30 12:28:57] [INFO ] Implicit Places using invariants in 9262 ms returned []
[2024-05-30 12:28:57] [INFO ] Invariant cache hit.
[2024-05-30 12:30:25] [INFO ] Performed 1/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-30 12:30:57] [INFO ] Performed 3/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-30 12:31:30] [INFO ] Performed 5/1024 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-30 12:31:37] [INFO ] Implicit Places using invariants and state equation in 160032 ms returned []
Implicit Place search using SMT with State Equation took 169301 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 169517 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2899 steps with 78 reset in 1808 ms.
FORMULA Sudoku-PT-BN16-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-BN16-LTLFireability-13 finished in 171606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1))))'
Support contains 8 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 209 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 12:31:40] [INFO ] Invariant cache hit.
[2024-05-30 12:31:49] [INFO ] Implicit Places using invariants in 9102 ms returned []
[2024-05-30 12:31:49] [INFO ] Invariant cache hit.
[2024-05-30 12:33:16] [INFO ] Performed 1/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-30 12:33:48] [INFO ] Performed 3/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-30 12:34:21] [INFO ] Performed 5/1024 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-30 12:34:29] [INFO ] Implicit Places using invariants and state equation in 160030 ms returned []
Implicit Place search using SMT with State Equation took 169135 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 169350 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-14
Product exploration timeout after 18950 steps with 6659 reset in 10007 ms.
Product exploration timeout after 18840 steps with 6494 reset in 10003 ms.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN16-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN16-LTLFireability-14 finished in 190543 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F((p1&&F(p2))))||p0)))'
Support contains 12 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 4096/4096 transitions.
Applied a total of 0 rules in 228 ms. Remains 1024 /1024 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 12:34:50] [INFO ] Invariant cache hit.
[2024-05-30 12:34:59] [INFO ] Implicit Places using invariants in 8663 ms returned []
[2024-05-30 12:34:59] [INFO ] Invariant cache hit.
[2024-05-30 12:36:26] [INFO ] Performed 1/1024 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-30 12:36:59] [INFO ] Performed 4/1024 implicitness test of which 0 returned IMPLICIT in 64 seconds.
[2024-05-30 12:37:31] [INFO ] Performed 6/1024 implicitness test of which 0 returned IMPLICIT in 96 seconds.
[2024-05-30 12:37:39] [INFO ] Implicit Places using invariants and state equation in 160031 ms returned []
Implicit Place search using SMT with State Equation took 168696 ms to find 0 implicit places.
[2024-05-30 12:37:39] [INFO ] Redundant transitions in 165 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 169096 ms. Remains : 1024/1024 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Sudoku-PT-BN16-LTLFireability-15
Product exploration timeout after 17390 steps with 262 reset in 10005 ms.
Product exploration timeout after 17480 steps with 266 reset in 10001 ms.
Computed a total of 1024 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1024 transition count 4096
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X p2), (X (NOT p2)), (X (NOT p1)), (X p1)]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-BN16-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-BN16-LTLFireability-15 finished in 190450 ms.
All properties solved by simple procedures.
Total runtime 1867075 ms.

BK_STOP 1717072681149

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="Sudoku-PT-BN16"
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-5568"
echo " Executing tool itstools"
echo " Input is Sudoku-PT-BN16, 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 r400-tall-171690533000724"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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