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.r439-smll-171690585800222.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 gold2023
Input is TwoPhaseLocking-PT-nC00200vD, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r439-smll-171690585800222
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 07:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 13 07:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 07:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Apr 13 07:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 08:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.6K 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 TwoPhaseLocking-PT-nC00200vD-LTLCardinality-00
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-LTLCardinality-01
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-LTLCardinality-02
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-LTLCardinality-03
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-LTLCardinality-04
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-LTLCardinality-05
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-LTLCardinality-06
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-LTLCardinality-07
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-LTLCardinality-08
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-LTLCardinality-09
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-LTLCardinality-10
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-LTLCardinality-11
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-LTLCardinality-12
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-LTLCardinality-13
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-LTLCardinality-14
FORMULA_NAME TwoPhaseLocking-PT-nC00200vD-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717043797762

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TwoPhaseLocking-PT-nC00200vD
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-30 04:36:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 04:36:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 04:36:40] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2024-05-30 04:36:40] [INFO ] Transformed 8 places.
[2024-05-30 04:36:40] [INFO ] Transformed 6 transitions.
[2024-05-30 04:36:40] [INFO ] Parsed PT model containing 8 places and 6 transitions and 18 arcs in 244 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA TwoPhaseLocking-PT-nC00200vD-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00200vD-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00200vD-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00200vD-LTLCardinality-14 TRUE 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 15 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-05-30 04:36:41] [INFO ] Computed 3 invariants in 4 ms
[2024-05-30 04:36:41] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-30 04:36:41] [INFO ] Invariant cache hit.
[2024-05-30 04:36:41] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2024-05-30 04:36:41] [INFO ] Invariant cache hit.
[2024-05-30 04:36:41] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 251 ms. Remains : 8/8 places, 6/6 transitions.
Support contains 8 out of 8 places after structural reductions.
[2024-05-30 04:36:41] [INFO ] Flatten gal took : 19 ms
[2024-05-30 04:36:41] [INFO ] Flatten gal took : 5 ms
[2024-05-30 04:36:41] [INFO ] Input system was already deterministic with 6 transitions.
Incomplete random walk after 10017 steps, including 12 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 25) seen :23
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-30 04:36:41] [INFO ] Invariant cache hit.
[2024-05-30 04:36:41] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 04:36:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-30 04:36:42] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U ((F(p1) U X(p0))||G(p2))))'
Support contains 6 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 2 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-05-30 04:36:42] [INFO ] Invariant cache hit.
[2024-05-30 04:36:42] [INFO ] Implicit Places using invariants in 40 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47 ms. Remains : 7/8 places, 6/6 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 548 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : TwoPhaseLocking-PT-nC00200vD-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(OR p2 p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ s5 s6), p2:(LEQ s1 s0), p0:(LEQ s3 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5284 reset in 376 ms.
Product exploration explored 100000 steps with 5337 reset in 287 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 p1 p2 (NOT p0)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 12 factoid took 671 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 359 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10017 steps, including 12 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 6 rows 7 cols
[2024-05-30 04:36:45] [INFO ] Computed 2 invariants in 1 ms
[2024-05-30 04:36:45] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-30 04:36:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-30 04:36:45] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p0) p2))), (F (NOT p1)), (F (AND (NOT p0) p2 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F p0), (F (AND p2 (NOT p1))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 14 factoid took 1146 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Support contains 6 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-05-30 04:36:46] [INFO ] Invariant cache hit.
[2024-05-30 04:36:46] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-30 04:36:46] [INFO ] Invariant cache hit.
[2024-05-30 04:36:46] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-30 04:36:47] [INFO ] Invariant cache hit.
[2024-05-30 04:36:47] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 7/7 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 p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 239 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Finished random walk after 9155 steps, including 10 resets, run visited all 5 properties in 8 ms. (steps per millisecond=1144 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2))), (F p0), (F (NOT p1)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 387 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 293 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 463 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 6108 reset in 170 ms.
Stack based approach found an accepted trace after 38895 steps with 2067 reset with depth 3891 and stack size 3803 in 72 ms.
FORMULA TwoPhaseLocking-PT-nC00200vD-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC00200vD-LTLCardinality-02 finished in 6773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 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 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 10 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2024-05-30 04:36:49] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 04:36:49] [INFO ] Implicit Places using invariants in 43 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/8 places, 4/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 55 ms. Remains : 5/8 places, 4/6 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00200vD-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s0 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][true]]
Product exploration explored 100000 steps with 20 reset in 122 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC00200vD-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC00200vD-LTLCardinality-03 finished in 247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U !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
[2024-05-30 04:36:49] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 04:36:49] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-30 04:36:49] [INFO ] Invariant cache hit.
[2024-05-30 04:36:49] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-05-30 04:36:49] [INFO ] Invariant cache hit.
[2024-05-30 04:36:49] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 170 ms :[p1, p1, (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00200vD-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (LEQ 3 s7) (LEQ s1 s5)), p0:(GT 1 s4)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 419 ms.
Product exploration explored 100000 steps with 50000 reset in 372 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 p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 16 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TwoPhaseLocking-PT-nC00200vD-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TwoPhaseLocking-PT-nC00200vD-LTLCardinality-04 finished in 1152 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(F(!p0)))))'
Support contains 2 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 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-05-30 04:36:50] [INFO ] Invariant cache hit.
[2024-05-30 04:36:50] [INFO ] Implicit Places using invariants in 45 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48 ms. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, true, (NOT p0), p0]
Running random walk in product with property : TwoPhaseLocking-PT-nC00200vD-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s1 s4)], 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 4505 reset in 82 ms.
Stack based approach found an accepted trace after 46 steps with 8 reset with depth 16 and stack size 16 in 1 ms.
FORMULA TwoPhaseLocking-PT-nC00200vD-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC00200vD-LTLCardinality-05 finished in 289 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U X(p1))) U (G(p2)||X(G(p3)))))'
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 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-05-30 04:36:51] [INFO ] Invariant cache hit.
[2024-05-30 04:36:51] [INFO ] Implicit Places using invariants in 26 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30 ms. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 759 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), true, (NOT p3), (NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p1) p3), (AND (NOT p1) (NOT p2) p3)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00200vD-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p1) p3), acceptance={} source=0 dest: 6}], [{ cond=(AND p2 (NOT p0) p3), acceptance={} source=1 dest: 0}, { cond=(AND p2 p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=1 dest: 7}, { cond=(NOT p3), acceptance={} source=1 dest: 8}, { cond=(AND p0 (NOT p3)), acceptance={} source=1 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=(AND p2 p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=3 dest: 6}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 10}, { cond=(AND p2 (NOT p1) p3), acceptance={} source=3 dest: 11}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={} source=4 dest: 9}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=4 dest: 12}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 13}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 5}], [{ cond=(NOT p0), acceptance={} source=8 dest: 7}, { cond=true, acceptance={} source=8 dest: 8}, { cond=p0, acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=9 dest: 9}], [{ cond=(NOT p2), acceptance={} source=10 dest: 5}, { cond=p2, acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=11 dest: 5}, { cond=(AND (NOT p2) p3), acceptance={} source=11 dest: 6}, { cond=(AND p2 (NOT p3)), acceptance={} source=11 dest: 10}, { cond=(AND p2 p3), acceptance={} source=11 dest: 11}], [{ cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=12 dest: 5}, { cond=(AND p2 (NOT p1) p3), acceptance={} source=12 dest: 10}], [{ cond=(AND (NOT p2) (NOT p0) p3), acceptance={} source=13 dest: 7}, { cond=(AND (NOT p2) p3), acceptance={} source=13 dest: 8}, { cond=(AND (NOT p2) p0 p3), acceptance={} source=13 dest: 9}, { cond=(AND p2 (NOT p0) p3), acceptance={} source=13 dest: 12}, { cond=(AND p2 p3), acceptance={} source=13 dest: 13}]], initial=2, aps=[p1:(LEQ 2 s0), p3:(GT 2 s2), p2:(LEQ s3 s0), p0:(LEQ s1 s2)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 35392 reset in 479 ms.
Product exploration explored 100000 steps with 35554 reset in 461 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 p1 p3 p2 p0), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X p3), (X (AND p2 (NOT p0) p3)), (X (AND p2 p3)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) p3))), (X (NOT (AND p2 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND p2 (NOT p1) p3))), (X (NOT (AND (NOT p2) p0 (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), true, (X (X p2)), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p3)), (X (X (AND p2 p3))), (X (X (NOT (AND (NOT p2) p0 p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) p3))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 (NOT p0) p3))), (X (X (NOT (AND p2 (NOT p0) p3))))]
Knowledge based reduction with 45 factoid took 1040 ms. Reduced automaton from 14 states, 46 edges and 4 AP (stutter sensitive) to 14 states, 46 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 743 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), true, (NOT p3), (NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p1) p3), (AND (NOT p1) (NOT p2) p3)]
Incomplete random walk after 10007 steps, including 8 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 26) seen :18
Finished Best-First random walk after 2415 steps, including 0 resets, run visited all 8 properties in 53 ms. (steps per millisecond=45 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p3 p2 p0), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p3)))), (X (AND p2 (NOT p0))), (X (NOT (AND p2 (NOT p1) (NOT p3)))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X p3), (X (AND p2 (NOT p0) p3)), (X (AND p2 p3)), (X p2), (X (NOT (AND (NOT p2) (NOT p1) p3))), (X (NOT (AND p2 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND p2 (NOT p1) p3))), (X (NOT (AND (NOT p2) p0 (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), true, (X (X p2)), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p3)), (X (X (AND p2 p3))), (X (X (NOT (AND (NOT p2) p0 p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) p3))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 (NOT p0) p3))), (X (X (NOT (AND p2 (NOT p0) p3)))), (F (AND (NOT p3) (NOT p0))), (F (AND p3 p0 (NOT p2))), (F (NOT (AND p3 p2))), (F (AND (NOT p3) p0)), (F (AND p3 (NOT p0) (NOT p2))), (F (AND (NOT p1) p0)), (F (NOT p3)), (F (AND (NOT p1) (NOT p3))), (F (AND p3 (NOT p0) p2)), (F (AND (NOT p1) p3)), (F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT p1)), (F (NOT p2)), (F (AND (NOT p0) (NOT p2))), (F (AND p3 (NOT p2))), (F (AND (NOT p1) (NOT p3) p2)), (F (AND (NOT p1) p3 (NOT p2))), (F (AND (NOT p1) (NOT p3) (NOT p2))), (F (AND (NOT p0) p2)), (F (AND (NOT p3) (NOT p0) p2)), (F (AND (NOT p3) p0 (NOT p2))), (F (AND (NOT p3) (NOT p0) (NOT p2))), (F (AND (NOT p1) p3 p2)), (F (AND (NOT p3) (NOT p2))), (F (AND (NOT p3) p2))]
Knowledge based reduction with 45 factoid took 3882 ms. Reduced automaton from 14 states, 46 edges and 4 AP (stutter sensitive) to 14 states, 46 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 841 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), true, (NOT p3), (NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p1) p3), (AND (NOT p1) (NOT p2) p3)]
Stuttering acceptance computed with spot in 789 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), true, (NOT p3), (NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p1) p3), (AND (NOT p1) (NOT p2) p3)]
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-05-30 04:37:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-30 04:37:00] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-30 04:37:00] [INFO ] Invariant cache hit.
[2024-05-30 04:37:00] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-30 04:37:00] [INFO ] Invariant cache hit.
[2024-05-30 04:37:00] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 7/7 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 p1 p3 p0 p2), (X (NOT (AND (NOT p1) (NOT p3)))), (X (AND p3 p2)), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p0 (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) p3 (NOT p2)))), (X (AND (NOT p0) p2)), (X p3), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X (AND p3 (NOT p0) p2)), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p0) p2))), (X (NOT (AND (NOT p1) p3 p2))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p3 p0 (NOT p2))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), true, (X (X (NOT (AND p3 (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p3 p2))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3) p2))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p3 (NOT p0) p2))), (X (X (NOT (AND p3 (NOT p0) p2))))]
Knowledge based reduction with 45 factoid took 1138 ms. Reduced automaton from 14 states, 46 edges and 4 AP (stutter sensitive) to 14 states, 46 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 680 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), true, (NOT p3), (NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p1) p3), (AND (NOT p1) (NOT p2) p3)]
Incomplete random walk after 10007 steps, including 8 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 26) seen :18
Finished Best-First random walk after 2694 steps, including 0 resets, run visited all 8 properties in 43 ms. (steps per millisecond=62 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p3 p0 p2), (X (NOT (AND (NOT p1) (NOT p3)))), (X (AND p3 p2)), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p3) p0 (NOT p2)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) p3 (NOT p2)))), (X (AND (NOT p0) p2)), (X p3), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X (AND p3 (NOT p0) p2)), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p0) p2))), (X (NOT (AND (NOT p1) p3 p2))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p3 p0 (NOT p2))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND (NOT p3) p0 (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), true, (X (X (NOT (AND p3 (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND p3 p2))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3) p2))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p3 (NOT p0) p2))), (X (X (NOT (AND p3 (NOT p0) p2)))), (F (AND (NOT p3) (NOT p0))), (F (AND p3 p0 (NOT p2))), (F (NOT (AND p3 p2))), (F (AND (NOT p3) p0)), (F (AND p3 (NOT p0) (NOT p2))), (F (AND (NOT p1) p0)), (F (NOT p3)), (F (AND (NOT p1) (NOT p3))), (F (AND p3 (NOT p0) p2)), (F (AND (NOT p1) p3)), (F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (NOT p1)), (F (NOT p2)), (F (AND (NOT p0) (NOT p2))), (F (AND p3 (NOT p2))), (F (AND (NOT p1) (NOT p3) p2)), (F (AND (NOT p1) p3 (NOT p2))), (F (AND (NOT p1) (NOT p3) (NOT p2))), (F (AND (NOT p0) p2)), (F (AND (NOT p3) (NOT p0) p2)), (F (AND (NOT p3) p0 (NOT p2))), (F (AND (NOT p3) (NOT p0) (NOT p2))), (F (AND (NOT p1) p3 p2)), (F (AND (NOT p3) (NOT p2))), (F (AND (NOT p3) p2))]
Knowledge based reduction with 45 factoid took 3396 ms. Reduced automaton from 14 states, 46 edges and 4 AP (stutter sensitive) to 14 states, 46 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 760 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), true, (NOT p3), (NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p1) p3), (AND (NOT p1) (NOT p2) p3)]
Stuttering acceptance computed with spot in 711 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), true, (NOT p3), (NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p1) p3), (AND (NOT p1) (NOT p2) p3)]
Stuttering acceptance computed with spot in 756 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), true, (NOT p3), (NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p1) p3), (AND (NOT p1) (NOT p2) p3)]
Product exploration explored 100000 steps with 35640 reset in 213 ms.
Product exploration explored 100000 steps with 35531 reset in 221 ms.
Applying partial POR strategy [true, false, false, true, false, true, true, true, false, false, true, true, true, false]
Stuttering acceptance computed with spot in 753 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), true, (NOT p3), (NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p1) p3), (AND (NOT p1) (NOT p2) p3)]
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 3 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-05-30 04:37:09] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-30 04:37:09] [INFO ] Invariant cache hit.
[2024-05-30 04:37:09] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58 ms. Remains : 7/7 places, 6/6 transitions.
Built C files in :
/tmp/ltsmin6066827149427433446
[2024-05-30 04:37:09] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6066827149427433446
Running compilation step : cd /tmp/ltsmin6066827149427433446;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 361 ms.
Running link step : cd /tmp/ltsmin6066827149427433446;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin6066827149427433446;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11514436996064606111.hoa' '--buchi-type=spotba'
LTSmin run took 587 ms.
FORMULA TwoPhaseLocking-PT-nC00200vD-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TwoPhaseLocking-PT-nC00200vD-LTLCardinality-06 finished in 19580 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 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
[2024-05-30 04:37:10] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 04:37:10] [INFO ] Implicit Places using invariants in 27 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30 ms. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00200vD-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s4 s0)], 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 1 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC00200vD-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00200vD-LTLCardinality-08 finished in 138 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||p0))))'
Support contains 6 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.
[2024-05-30 04:37:10] [INFO ] Invariant cache hit.
[2024-05-30 04:37:10] [INFO ] Implicit Places using invariants in 28 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33 ms. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TwoPhaseLocking-PT-nC00200vD-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 2 s5) (LEQ s2 s0) (LEQ 3 s6)), p1:(LEQ s1 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 3 reset in 130 ms.
Stack based approach found an accepted trace after 37669 steps with 0 reset with depth 37670 and stack size 3101 in 127 ms.
FORMULA TwoPhaseLocking-PT-nC00200vD-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC00200vD-LTLCardinality-09 finished in 390 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(!p0))||(X(p1)&&F(p2))))'
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.
[2024-05-30 04:37:11] [INFO ] Invariant cache hit.
[2024-05-30 04:37:11] [INFO ] Implicit Places using invariants in 28 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30 ms. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (AND p0 (NOT p1)), (AND (NOT p2) p0), true, p0, (NOT p2)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00200vD-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ 1 s5), p1:(GT s1 s6), p0:(LEQ s5 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33470 reset in 108 ms.
Product exploration explored 100000 steps with 33292 reset in 115 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) (NOT p1) p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), true, (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 344 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p2)]
Finished random walk after 102 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=102 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p2) p0)), true, (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (F p2)]
Knowledge based reduction with 7 factoid took 376 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p2)]
// Phase 1: matrix 6 rows 7 cols
[2024-05-30 04:37:12] [INFO ] Computed 2 invariants in 0 ms
[2024-05-30 04:37:12] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-30 04:37:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 04:37:12] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-30 04:37:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 04:37:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-30 04:37:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 04:37:12] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-30 04:37:12] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-30 04:37:12] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 7 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 6 transition count 5
Applied a total of 2 rules in 3 ms. Remains 6 /7 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 6 cols
[2024-05-30 04:37:12] [INFO ] Computed 2 invariants in 0 ms
[2024-05-30 04:37:12] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-30 04:37:12] [INFO ] Invariant cache hit.
[2024-05-30 04:37:12] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-30 04:37:12] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-30 04:37:12] [INFO ] Invariant cache hit.
[2024-05-30 04:37:12] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/7 places, 5/6 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 6/7 places, 5/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 : [(NOT p2), (X (NOT p2))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 151 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p2)]
Finished random walk after 102 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=102 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p2), (X (NOT p2))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p2)]
[2024-05-30 04:37:13] [INFO ] Invariant cache hit.
[2024-05-30 04:37:13] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-30 04:37:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 04:37:13] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-30 04:37:13] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-30 04:37:13] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 47 ms :[(NOT p2)]
Product exploration explored 100000 steps with 24972 reset in 57 ms.
Product exploration explored 100000 steps with 24892 reset in 72 ms.
Built C files in :
/tmp/ltsmin2581243224040225600
[2024-05-30 04:37:13] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2024-05-30 04:37:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 04:37:13] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2024-05-30 04:37:13] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 04:37:13] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2024-05-30 04:37:13] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 04:37:13] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2581243224040225600
Running compilation step : cd /tmp/ltsmin2581243224040225600;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 129 ms.
Running link step : cd /tmp/ltsmin2581243224040225600;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2581243224040225600;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10486630666244851544.hoa' '--buchi-type=spotba'
LTSmin run took 71 ms.
FORMULA TwoPhaseLocking-PT-nC00200vD-LTLCardinality-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TwoPhaseLocking-PT-nC00200vD-LTLCardinality-10 finished in 2664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&(F(p1) U X(X(G(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 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-05-30 04:37:13] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 04:37:13] [INFO ] Implicit Places using invariants in 35 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37 ms. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 416 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00200vD-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 4}, { cond=(NOT p1), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 7}], [{ cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}, { cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(LEQ 1 s5), p0:(GT s2 s6), p2:(LEQ 2 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5025 reset in 96 ms.
Stack based approach found an accepted trace after 11 steps with 1 reset with depth 9 and stack size 9 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC00200vD-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC00200vD-LTLCardinality-11 finished in 590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1)) U X((X(!p0)&&F(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 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-05-30 04:37:14] [INFO ] Invariant cache hit.
[2024-05-30 04:37:14] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-30 04:37:14] [INFO ] Invariant cache hit.
[2024-05-30 04:37:14] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-30 04:37:14] [INFO ] Invariant cache hit.
[2024-05-30 04:37:14] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 898 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (AND p0 (NOT p1)), (OR (NOT p2) p0), (AND p0 (NOT p1)), p0, (NOT p2), true, (AND p0 (NOT p1)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0), p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00200vD-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 5}, { cond=(NOT p2), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 9}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 10}], [{ cond=(NOT p2), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 11}, { cond=p0, acceptance={} source=3 dest: 12}, { cond=(OR p1 p0), acceptance={} source=3 dest: 13}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 14}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 10}], [{ cond=p0, acceptance={} source=5 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=p0, acceptance={} source=8 dest: 15}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p1) p0), acceptance={} source=10 dest: 7}, { cond=(AND p1 p0), acceptance={} source=10 dest: 16}], [{ cond=p0, acceptance={} source=11 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=11 dest: 6}], [{ cond=p0, acceptance={} source=12 dest: 8}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=12 dest: 9}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=13 dest: 6}, { cond=p0, acceptance={} source=13 dest: 12}, { cond=p0, acceptance={0} source=13 dest: 13}], [{ cond=(AND (NOT p1) p0), acceptance={} source=14 dest: 5}, { cond=(AND p1 p0), acceptance={} source=14 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=15 dest: 7}, { cond=(AND p1 p0), acceptance={} source=15 dest: 15}, { cond=(AND (NOT p1) p0), acceptance={0} source=15 dest: 15}, { cond=(AND p1 (NOT p0)), acceptance={} source=15 dest: 16}], [{ cond=(NOT p1), acceptance={} source=16 dest: 7}, { cond=p1, acceptance={} source=16 dest: 16}]], initial=0, aps=[p1:(LEQ s5 s3), p0:(LEQ 2 s7), p2:(LEQ 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19822 reset in 72 ms.
Stack based approach found an accepted trace after 21 steps with 4 reset with depth 8 and stack size 8 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC00200vD-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC00200vD-LTLCardinality-12 finished in 1122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(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.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 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
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
[2024-05-30 04:37:15] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 04:37:15] [INFO ] Implicit Places using invariants in 35 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/8 places, 5/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 39 ms. Remains : 6/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00200vD-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 12825 steps with 0 reset in 15 ms.
FORMULA TwoPhaseLocking-PT-nC00200vD-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00200vD-LTLCardinality-13 finished in 120 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 2 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
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
[2024-05-30 04:37:15] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 04:37:15] [INFO ] Implicit Places using invariants in 30 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/8 places, 5/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 35 ms. Remains : 6/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 88 ms :[p0, p0]
Running random walk in product with property : TwoPhaseLocking-PT-nC00200vD-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1 s3)], 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 29 reset in 73 ms.
Stack based approach found an accepted trace after 55 steps with 0 reset with depth 56 and stack size 56 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC00200vD-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC00200vD-LTLCardinality-15 finished in 216 ms.
All properties solved by simple procedures.
Total runtime 35113 ms.

BK_STOP 1717043837028

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="TwoPhaseLocking-PT-nC00200vD"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is TwoPhaseLocking-PT-nC00200vD, 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 r439-smll-171690585800222"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TwoPhaseLocking-PT-nC00200vD.tgz
mv TwoPhaseLocking-PT-nC00200vD 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;