About the Execution of ITS-Tools for TwoPhaseLocking-PT-nC00500vN
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5862.104 | 3600000.00 | 4058098.00 | 6992.40 | FF?FFTTFFTFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r258-tall-165303546200819.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is TwoPhaseLocking-PT-nC00500vN, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303546200819
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 7.0K Apr 30 10:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 30 10:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 30 10:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 30 10:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 9 09:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 09:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 09:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 09:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 09:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 09:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 4.6K May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-LTLCardinality-00
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-LTLCardinality-01
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-LTLCardinality-02
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-LTLCardinality-03
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-LTLCardinality-04
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-LTLCardinality-05
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-LTLCardinality-06
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-LTLCardinality-07
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-LTLCardinality-08
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-LTLCardinality-09
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-LTLCardinality-10
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-LTLCardinality-11
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-LTLCardinality-12
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-LTLCardinality-13
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-LTLCardinality-14
FORMULA_NAME TwoPhaseLocking-PT-nC00500vN-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1653187147732
Running Version 202205111006
[2022-05-22 02:39:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-22 02:39:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-22 02:39:09] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2022-05-22 02:39:09] [INFO ] Transformed 8 places.
[2022-05-22 02:39:09] [INFO ] Transformed 6 transitions.
[2022-05-22 02:39:09] [INFO ] Parsed PT model containing 8 places and 6 transitions in 134 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA TwoPhaseLocking-PT-nC00500vN-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00500vN-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00500vN-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00500vN-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00500vN-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00500vN-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00500vN-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00500vN-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 7 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 02:39:09] [INFO ] Computed 3 place invariants in 7 ms
[2022-05-22 02:39:09] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 02:39:09] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-22 02:39:09] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 02:39:09] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 02:39:09] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Support contains 8 out of 8 places after structural reductions.
[2022-05-22 02:39:09] [INFO ] Flatten gal took : 13 ms
[2022-05-22 02:39:09] [INFO ] Flatten gal took : 3 ms
[2022-05-22 02:39:09] [INFO ] Input system was already deterministic with 6 transitions.
Finished random walk after 1008 steps, including 0 resets, run visited all 17 properties in 16 ms. (steps per millisecond=63 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G((X(G(p0))||p1))))'
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 02:39:09] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 02:39:09] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 02:39:09] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 02:39:09] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 02:39:09] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 02:39:09] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00500vN-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GT s7 s6), p0:(GT s3 s4)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 18816 steps with 0 reset in 65 ms.
FORMULA TwoPhaseLocking-PT-nC00500vN-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00500vN-LTLCardinality-01 finished in 418 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!X(p0)) U G(F(p1)))||F(p2)))'
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 6 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 02:39:10] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 02:39:10] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 02:39:10] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 02:39:10] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2022-05-22 02:39:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 02:39:10] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 02:39:10] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : TwoPhaseLocking-PT-nC00500vN-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(LEQ s5 s6), p1:(OR (LEQ s1 s3) (LEQ 1 s2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1 reset in 146 ms.
Product exploration explored 100000 steps with 3 reset in 246 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Finished random walk after 502 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=502 )
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 188 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 02:39:11] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 02:39:11] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 02:39:11] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 02:39:11] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2022-05-22 02:39:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 02:39:11] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 02:39:11] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Finished random walk after 502 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=251 )
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 213 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 5 reset in 137 ms.
Product exploration explored 100000 steps with 3 reset in 118 ms.
Built C files in :
/tmp/ltsmin5032601685795418522
[2022-05-22 02:39:12] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-22 02:39:12] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 02:39:12] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-22 02:39:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 02:39:12] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-22 02:39:12] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 02:39:12] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5032601685795418522
Running compilation step : cd /tmp/ltsmin5032601685795418522;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 144 ms.
Running link step : cd /tmp/ltsmin5032601685795418522;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin5032601685795418522;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15843534499210174191.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 02:39:27] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 02:39:27] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 02:39:27] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-22 02:39:27] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2022-05-22 02:39:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 02:39:27] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 02:39:27] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Built C files in :
/tmp/ltsmin1341901029904506761
[2022-05-22 02:39:27] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-22 02:39:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 02:39:27] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-22 02:39:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 02:39:27] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-22 02:39:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 02:39:27] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1341901029904506761
Running compilation step : cd /tmp/ltsmin1341901029904506761;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 306 ms.
Running link step : cd /tmp/ltsmin1341901029904506761;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin1341901029904506761;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13480892988697646269.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-22 02:39:42] [INFO ] Flatten gal took : 2 ms
[2022-05-22 02:39:42] [INFO ] Flatten gal took : 2 ms
[2022-05-22 02:39:42] [INFO ] Time to serialize gal into /tmp/LTL7499004085183151103.gal : 0 ms
[2022-05-22 02:39:42] [INFO ] Time to serialize properties into /tmp/LTL17704953141473119142.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7499004085183151103.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17704953141473119142.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7499004...267
Read 1 LTL properties
Checking formula 0 : !((((X(!(X("(Clients>=1)"))))U(G(F("((haveA<=resA)||(haveA2>=1))"))))||(F("(Clients<=haveAandB)"))))
Formula 0 simplified : !((X!X"(Clients>=1)" U GF"((haveA<=resA)||(haveA2>=1))") | F"(Clients<=haveAandB)")
Detected timeout of ITS tools.
[2022-05-22 02:39:57] [INFO ] Flatten gal took : 5 ms
[2022-05-22 02:39:57] [INFO ] Applying decomposition
[2022-05-22 02:39:57] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17049520009622361213.txt' '-o' '/tmp/graph17049520009622361213.bin' '-w' '/tmp/graph17049520009622361213.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17049520009622361213.bin' '-l' '-1' '-v' '-w' '/tmp/graph17049520009622361213.weights' '-q' '0' '-e' '0.001'
[2022-05-22 02:39:57] [INFO ] Decomposing Gal with order
[2022-05-22 02:39:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 02:39:57] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-22 02:39:57] [INFO ] Flatten gal took : 26 ms
[2022-05-22 02:39:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-22 02:39:57] [INFO ] Time to serialize gal into /tmp/LTL15879679579115897638.gal : 1 ms
[2022-05-22 02:39:57] [INFO ] Time to serialize properties into /tmp/LTL6481499620040904521.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15879679579115897638.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6481499620040904521.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1587967...267
Read 1 LTL properties
Checking formula 0 : !((((X(!(X("(gu1.Clients>=1)"))))U(G(F("((gu0.haveA<=gu0.resA)||(gu2.haveA2>=1))"))))||(F("(gu1.Clients<=gu1.haveAandB)"))))
Formula 0 simplified : !((X!X"(gu1.Clients>=1)" U GF"((gu0.haveA<=gu0.resA)||(gu2.haveA2>=1))") | F"(gu1.Clients<=gu1.haveAandB)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4644575537754338816
[2022-05-22 02:40:12] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4644575537754338816
Running compilation step : cd /tmp/ltsmin4644575537754338816;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 59 ms.
Running link step : cd /tmp/ltsmin4644575537754338816;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin4644575537754338816;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X(!X((LTLAPp0==true))) U [](<>((LTLAPp1==true))))||<>((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TwoPhaseLocking-PT-nC00500vN-LTLCardinality-02 finished in 77887 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(G(!((p0 U p1) U p2))))))'
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 02:40:28] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 02:40:28] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 02:40:28] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 02:40:28] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-22 02:40:28] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 02:40:28] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-22 02:40:28] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 40 ms :[p2]
Running random walk in product with property : TwoPhaseLocking-PT-nC00500vN-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(OR (LEQ s3 s1) (GT s2 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 78 ms.
Stack based approach found an accepted trace after 36 steps with 0 reset with depth 37 and stack size 37 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC00500vN-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC00500vN-LTLCardinality-03 finished in 216 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!(F(G(p0)) U X(!X(p0))))))'
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 7 transition count 4
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 4 place count 6 transition count 4
Applied a total of 4 rules in 4 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 02:40:28] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 02:40:28] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 02:40:28] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 02:40:28] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2022-05-22 02:40:28] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 02:40:28] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 02:40:28] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/8 places, 4/6 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/8 places, 4/6 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00500vN-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 86 ms.
Stack based approach found an accepted trace after 17719 steps with 0 reset with depth 17720 and stack size 13551 in 16 ms.
FORMULA TwoPhaseLocking-PT-nC00500vN-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC00500vN-LTLCardinality-04 finished in 240 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(F(!p0)||p1))))'
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 02:40:28] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 02:40:28] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 02:40:28] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 02:40:28] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-22 02:40:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 02:40:28] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 02:40:28] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND p0 (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : TwoPhaseLocking-PT-nC00500vN-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(GT s6 s7), p1:(LEQ s3 s1)], 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, null][true, true]]
Product exploration explored 100000 steps with 7263 reset in 122 ms.
Stack based approach found an accepted trace after 74 steps with 9 reset with depth 14 and stack size 14 in 1 ms.
FORMULA TwoPhaseLocking-PT-nC00500vN-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC00500vN-LTLCardinality-07 finished in 351 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U X(p1))))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 02:40:28] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-22 02:40:28] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 02:40:28] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 02:40:28] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 02:40:28] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 02:40:28] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00500vN-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s6 s0), p1:(LEQ s6 s2)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 16342 reset in 58 ms.
Stack based approach found an accepted trace after 345 steps with 79 reset with depth 20 and stack size 20 in 1 ms.
FORMULA TwoPhaseLocking-PT-nC00500vN-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC00500vN-LTLCardinality-10 finished in 342 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(F(p0))&&F(p1)) U p2)))'
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 02:40:29] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 02:40:29] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 02:40:29] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 02:40:29] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 02:40:29] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 02:40:29] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p2), (NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00500vN-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ s0 s3), p0:(LEQ s5 s7), p1:(LEQ 2 s0)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 61 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC00500vN-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC00500vN-LTLCardinality-11 finished in 287 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(X(!(X(p0) U X(p1)))))))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 2 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 02:40:29] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 02:40:29] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 02:40:29] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 02:40:29] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2022-05-22 02:40:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 02:40:29] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-22 02:40:29] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/8 places, 5/6 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 64 ms :[p1, p1]
Running random walk in product with property : TwoPhaseLocking-PT-nC00500vN-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT s4 s6), p0:(LEQ 3 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2 reset in 62 ms.
Stack based approach found an accepted trace after 102 steps with 0 reset with depth 103 and stack size 93 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC00500vN-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC00500vN-LTLCardinality-13 finished in 238 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!X(p0)) U G(F(p1)))||F(p2)))'
[2022-05-22 02:40:29] [INFO ] Flatten gal took : 5 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5268571933309570176
[2022-05-22 02:40:29] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-22 02:40:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 02:40:29] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-22 02:40:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 02:40:29] [INFO ] Applying decomposition
[2022-05-22 02:40:29] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-22 02:40:29] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 02:40:29] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5268571933309570176
Running compilation step : cd /tmp/ltsmin5268571933309570176;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-22 02:40:29] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1556837408684822828.txt' '-o' '/tmp/graph1556837408684822828.bin' '-w' '/tmp/graph1556837408684822828.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1556837408684822828.bin' '-l' '-1' '-v' '-w' '/tmp/graph1556837408684822828.weights' '-q' '0' '-e' '0.001'
[2022-05-22 02:40:29] [INFO ] Decomposing Gal with order
[2022-05-22 02:40:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 02:40:29] [INFO ] Removed a total of 1 redundant transitions.
[2022-05-22 02:40:29] [INFO ] Flatten gal took : 2 ms
[2022-05-22 02:40:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-22 02:40:29] [INFO ] Time to serialize gal into /tmp/LTLCardinality10387459781552523251.gal : 1 ms
[2022-05-22 02:40:29] [INFO ] Time to serialize properties into /tmp/LTLCardinality4474759222243397822.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10387459781552523251.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4474759222243397822.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !((((X(!(X("(gu1.Clients>=1)"))))U(G(F("((gu0.haveA<=gu0.resA)||(gu2.haveA2>=1))"))))||(F("(gu1.Clients<=gu1.haveAandB)"))))
Formula 0 simplified : !((X!X"(gu1.Clients>=1)" U GF"((gu0.haveA<=gu0.resA)||(gu2.haveA2>=1))") | F"(gu1.Clients<=gu1.haveAandB)")
Compilation finished in 68 ms.
Running link step : cd /tmp/ltsmin5268571933309570176;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin5268571933309570176;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X(!X((LTLAPp0==true))) U [](<>((LTLAPp1==true))))||<>((LTLAPp2==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: LTL layer: formula: ((X(!X((LTLAPp0==true))) U [](<>((LTLAPp1==true))))||<>((LTLAPp2==true)))
pins2lts-mc-linux64( 0/ 8), 0.003: "((X(!X((LTLAPp0==true))) U [](<>((LTLAPp1==true))))||<>((LTLAPp2==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: buchi has 2 states
pins2lts-mc-linux64( 0/ 8), 0.016: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.070: DFS-FIFO for weak LTL, using special progress label 10
pins2lts-mc-linux64( 0/ 8), 0.070: There are 11 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.070: State length is 9, there are 9 groups
pins2lts-mc-linux64( 0/ 8), 0.070: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.070: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.070: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.070: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.097: ~1 levels ~960 states ~2952 transitions
pins2lts-mc-linux64( 6/ 8), 0.102: ~1 levels ~1920 states ~6464 transitions
pins2lts-mc-linux64( 6/ 8), 0.122: ~1 levels ~3840 states ~13792 transitions
pins2lts-mc-linux64( 6/ 8), 0.151: ~1 levels ~7680 states ~28896 transitions
pins2lts-mc-linux64( 6/ 8), 0.201: ~1 levels ~15360 states ~61792 transitions
pins2lts-mc-linux64( 6/ 8), 0.310: ~1 levels ~30720 states ~137312 transitions
pins2lts-mc-linux64( 0/ 8), 0.499: ~1 levels ~61440 states ~303296 transitions
pins2lts-mc-linux64( 7/ 8), 0.790: ~1 levels ~122880 states ~629440 transitions
pins2lts-mc-linux64( 7/ 8), 1.252: ~1 levels ~245760 states ~1282096 transitions
pins2lts-mc-linux64( 7/ 8), 1.837: ~1 levels ~491520 states ~2610696 transitions
pins2lts-mc-linux64( 7/ 8), 2.579: ~1 levels ~983040 states ~5305808 transitions
pins2lts-mc-linux64( 3/ 8), 3.545: ~1 levels ~1966080 states ~10525544 transitions
pins2lts-mc-linux64( 4/ 8), 5.096: ~879 levels ~3932160 states ~17385856 transitions
pins2lts-mc-linux64( 4/ 8), 7.213: ~879 levels ~7864320 states ~26705504 transitions
pins2lts-mc-linux64( 4/ 8), 11.656: ~879 levels ~15728640 states ~45604248 transitions
pins2lts-mc-linux64( 4/ 8), 20.651: ~879 levels ~31457280 states ~83639312 transitions
pins2lts-mc-linux64( 4/ 8), 39.556: ~879 levels ~62914560 states ~160708320 transitions
pins2lts-mc-linux64( 4/ 8), 88.865: ~879 levels ~125829120 states ~316772584 transitions
pins2lts-mc-linux64( 3/ 8), 96.208: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 96.230:
pins2lts-mc-linux64( 0/ 8), 96.230: mean standard work distribution: 16.9% (states) 13.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 96.230:
pins2lts-mc-linux64( 0/ 8), 96.230: Explored 103109644 states 406776359 transitions, fanout: 3.945
pins2lts-mc-linux64( 0/ 8), 96.230: Total exploration time 96.150 sec (96.110 sec minimum, 96.135 sec on average)
pins2lts-mc-linux64( 0/ 8), 96.230: States per second: 1072383, Transitions per second: 4230643
pins2lts-mc-linux64( 0/ 8), 96.245:
pins2lts-mc-linux64( 0/ 8), 96.245: Progress states detected: 48849618
pins2lts-mc-linux64( 0/ 8), 96.245: Redundant explorations: -1.0552
pins2lts-mc-linux64( 0/ 8), 96.245:
pins2lts-mc-linux64( 0/ 8), 96.245: Queue width: 8B, total height: 3286328, memory: 25.07MB
pins2lts-mc-linux64( 0/ 8), 96.245: Tree memory: 1051.1MB, 10.6 B/state, compr.: 27.8%
pins2lts-mc-linux64( 0/ 8), 96.245: Tree fill ratio (roots/leafs): 77.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 96.245: Stored 6 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 96.245: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 96.245: Est. total memory use: 1076.1MB (~1049.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5268571933309570176;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X(!X((LTLAPp0==true))) U [](<>((LTLAPp1==true))))||<>((LTLAPp2==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5268571933309570176;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((X(!X((LTLAPp0==true))) U [](<>((LTLAPp1==true))))||<>((LTLAPp2==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-22 03:00:56] [INFO ] Flatten gal took : 3 ms
[2022-05-22 03:00:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality2208234434590506952.gal : 1 ms
[2022-05-22 03:00:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality7756693730725516519.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2208234434590506952.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7756693730725516519.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 1 LTL properties
Checking formula 0 : !((((X(!(X("(Clients>=1)"))))U(G(F("((haveA<=resA)||(haveA2>=1))"))))||(F("(Clients<=haveAandB)"))))
Formula 0 simplified : !((X!X"(Clients>=1)" U GF"((haveA<=resA)||(haveA2>=1))") | F"(Clients<=haveAandB)")
Detected timeout of ITS tools.
[2022-05-22 03:21:22] [INFO ] Flatten gal took : 4 ms
[2022-05-22 03:21:22] [INFO ] Input system was already deterministic with 6 transitions.
[2022-05-22 03:21:22] [INFO ] Transformed 8 places.
[2022-05-22 03:21:22] [INFO ] Transformed 6 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-22 03:21:22] [INFO ] Time to serialize gal into /tmp/LTLCardinality17518065418042320110.gal : 0 ms
[2022-05-22 03:21:22] [INFO ] Time to serialize properties into /tmp/LTLCardinality4785859046194501081.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17518065418042320110.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4785859046194501081.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((((X(!(X("(Clients>=1)"))))U(G(F("((haveA<=resA)||(haveA2>=1))"))))||(F("(Clients<=haveAandB)"))))
Formula 0 simplified : !((X!X"(Clients>=1)" U GF"((haveA<=resA)||(haveA2>=1))") | F"(Clients<=haveAandB)")
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TwoPhaseLocking-PT-nC00500vN"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is TwoPhaseLocking-PT-nC00500vN, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r258-tall-165303546200819"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TwoPhaseLocking-PT-nC00500vN.tgz
mv TwoPhaseLocking-PT-nC00500vN execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;