Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r311-tall-162132108100269.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is TwoPhaseLocking-PT-nC00050vN, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-162132108100269
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 336K
-rw-r--r-- 1 mcc users 13K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 12 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 12 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 12 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 12 08:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.8K May 12 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 12 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 11 18:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 11 18:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 10 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 4.6K May 12 08:13 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-nC00050vN-00
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-01
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-02
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-03
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-04
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-05
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-06
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-07
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-08
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-09
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-10
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-11
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-12
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-13
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-14
FORMULA_NAME TwoPhaseLocking-PT-nC00050vN-15

=== Now, execution of the tool begins

BK_START 1621451817140

Running Version 0
[2021-05-19 19:16:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-19 19:16:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 19:16:58] [INFO ] Load time of PNML (sax parser for PT used): 18 ms
[2021-05-19 19:16:58] [INFO ] Transformed 8 places.
[2021-05-19 19:16:58] [INFO ] Transformed 6 transitions.
[2021-05-19 19:16:58] [INFO ] Parsed PT model containing 8 places and 6 transitions in 53 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-19 19:16:58] [INFO ] Initial state test concluded for 2 properties.
FORMULA TwoPhaseLocking-PT-nC00050vN-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-19 19:16:59] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-19 19:16:59] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:16:59] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:16:59] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:16:59] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:16:59] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
[2021-05-19 19:16:59] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-19 19:16:59] [INFO ] Flatten gal took : 16 ms
FORMULA TwoPhaseLocking-PT-nC00050vN-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 19:16:59] [INFO ] Flatten gal took : 2 ms
[2021-05-19 19:16:59] [INFO ] Input system was already deterministic with 6 transitions.
Finished random walk after 682 steps, including 0 resets, run visited all 9 properties in 4 ms. (steps per millisecond=170 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(F(p1))&&p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-19 19:16:59] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:16:59] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:16:59] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:16:59] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:16:59] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:16:59] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : TwoPhaseLocking-PT-nC00050vN-00 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GEQ s6 1), p0:(AND (GEQ s6 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA TwoPhaseLocking-PT-nC00050vN-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00050vN-00 finished in 296 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(F(p0))&&F(!p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-19 19:16:59] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:16:59] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:16:59] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:16:59] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:16:59] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:16:59] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, true, true, (NOT p0), p0, (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00050vN-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA TwoPhaseLocking-PT-nC00050vN-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00050vN-01 finished in 206 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((G(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-19 19:16:59] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:16:59] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:16:59] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:16:59] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:16:59] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:16:59] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : TwoPhaseLocking-PT-nC00050vN-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s2 1), p0:(OR (GEQ s2 1) (AND (GEQ s0 1) (GEQ s1 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 1 ms.
FORMULA TwoPhaseLocking-PT-nC00050vN-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00050vN-03 finished in 130 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0)) U p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-19 19:17:00] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:17:00] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:17:00] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:17:00] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-19 19:17:00] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:17:00] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:17:00] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00050vN-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s1 1)), p0:(OR (LT s3 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1 reset in 221 ms.
Stack based approach found an accepted trace after 118 steps with 2 reset with depth 113 and stack size 113 in 1 ms.
FORMULA TwoPhaseLocking-PT-nC00050vN-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00050vN-04 finished in 354 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions, 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 3 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2021-05-19 19:17:00] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:17:00] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-19 19:17:00] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:17:00] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-19 19:17:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-19 19:17:00] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:17:00] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/8 places, 4/6 transitions.
Stuttering acceptance computed with spot in 32 ms :[true, (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00050vN-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s3 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC00050vN-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00050vN-06 finished in 83 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-19 19:17:00] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:17:00] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:17:00] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:17:00] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:17:00] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:17:00] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : TwoPhaseLocking-PT-nC00050vN-07 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s0 1) (GEQ s1 1)), p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 139 ms.
Product exploration explored 100000 steps with 50000 reset in 116 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 50000 reset in 87 ms.
Product exploration explored 100000 steps with 50000 reset in 168 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), (NOT p1), true]
Support contains 3 out of 8 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 3 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-19 19:17:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:17:01] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:17:01] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Product exploration explored 100000 steps with 50000 reset in 211 ms.
Product exploration explored 100000 steps with 50000 reset in 219 ms.
[2021-05-19 19:17:01] [INFO ] Flatten gal took : 2 ms
[2021-05-19 19:17:01] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:17:01] [INFO ] Time to serialize gal into /tmp/LTL18224701710651543365.gal : 1 ms
[2021-05-19 19:17:01] [INFO ] Time to serialize properties into /tmp/LTL4224541307551889980.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL18224701710651543365.gal, -t, CGAL, -LTL, /tmp/LTL4224541307551889980.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL18224701710651543365.gal -t CGAL -LTL /tmp/LTL4224541307551889980.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(haveA2>=1)")U("((resB>=1)&&(haveA>=1))"))))
Formula 0 simplified : !X("(haveA2>=1)" U "((resB>=1)&&(haveA>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
842 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.43526,126832,1,0,6,512000,21,0,405,598989,9
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA TwoPhaseLocking-PT-nC00050vN-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property TwoPhaseLocking-PT-nC00050vN-07 finished in 10077 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((!p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-19 19:17:10] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:17:10] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:17:10] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:17:10] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:17:10] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:17:10] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00050vN-08 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (GEQ s0 1) (GEQ s1 1)), p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 85 ms.
Product exploration explored 100000 steps with 50000 reset in 67 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 50000 reset in 55 ms.
Product exploration explored 100000 steps with 50000 reset in 67 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 3 out of 8 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-19 19:17:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:17:11] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:17:11] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Product exploration explored 100000 steps with 50000 reset in 114 ms.
Product exploration explored 100000 steps with 50000 reset in 143 ms.
[2021-05-19 19:17:11] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:17:11] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:17:11] [INFO ] Time to serialize gal into /tmp/LTL211030064289777338.gal : 0 ms
[2021-05-19 19:17:11] [INFO ] Time to serialize properties into /tmp/LTL13493905158644236104.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL211030064289777338.gal, -t, CGAL, -LTL, /tmp/LTL13493905158644236104.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL211030064289777338.gal -t CGAL -LTL /tmp/LTL13493905158644236104.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(haveAandB<1)")||(G("((resB>=1)&&(haveA>=1))"))))))
Formula 0 simplified : !XF("(haveAandB<1)" | G"((resB>=1)&&(haveA>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
838 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.39343,127212,1,0,6,512000,30,0,405,598989,13
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA TwoPhaseLocking-PT-nC00050vN-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property TwoPhaseLocking-PT-nC00050vN-08 finished in 9502 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions, 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 2 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2021-05-19 19:17:20] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:17:20] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-19 19:17:20] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:17:20] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2021-05-19 19:17:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-19 19:17:20] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:17:20] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/8 places, 4/6 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00050vN-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2557 reset in 84 ms.
Product exploration explored 100000 steps with 2712 reset in 97 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2431 reset in 79 ms.
Product exploration explored 100000 steps with 2680 reset in 88 ms.
[2021-05-19 19:17:20] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:17:20] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:17:20] [INFO ] Time to serialize gal into /tmp/LTL15266067879260257081.gal : 1 ms
[2021-05-19 19:17:20] [INFO ] Time to serialize properties into /tmp/LTL13491950562580322393.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15266067879260257081.gal, -t, CGAL, -LTL, /tmp/LTL13491950562580322393.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15266067879260257081.gal -t CGAL -LTL /tmp/LTL13491950562580322393.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((resB>=1)&&(haveA>=1))"))))
Formula 0 simplified : !GF"((resB>=1)&&(haveA>=1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
33 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.347837,25488,1,0,110,27409,24,1,316,24594,279
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA TwoPhaseLocking-PT-nC00050vN-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property TwoPhaseLocking-PT-nC00050vN-09 finished in 925 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((F(!p0)&&(!p1||G(!p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions, 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 1 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 7 cols
[2021-05-19 19:17:20] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:17:20] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-19 19:17:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:17:21] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2021-05-19 19:17:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-19 19:17:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:17:21] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 47 ms :[p0, p0]
Running random walk in product with property : TwoPhaseLocking-PT-nC00050vN-10 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s6 1), p1:(OR (LT s3 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4558 reset in 71 ms.
Stack based approach found an accepted trace after 490 steps with 63 reset with depth 15 and stack size 15 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC00050vN-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00050vN-10 finished in 159 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(!p0)&&X(F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-19 19:17:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:17:21] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:17:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:17:21] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:17:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:17:21] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 86 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : TwoPhaseLocking-PT-nC00050vN-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1)), p1:(OR (LT s3 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC00050vN-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00050vN-11 finished in 129 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-19 19:17:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:17:21] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:17:21] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:17:21] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:17:21] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:17:21] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00050vN-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 7389 reset in 64 ms.
Product exploration explored 100000 steps with 7428 reset in 72 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7425 reset in 64 ms.
Product exploration explored 100000 steps with 7487 reset in 73 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 8 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-19 19:17:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:17:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:17:21] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Product exploration explored 100000 steps with 10192 reset in 159 ms.
Product exploration explored 100000 steps with 10181 reset in 80 ms.
[2021-05-19 19:17:22] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:17:22] [INFO ] Flatten gal took : 0 ms
[2021-05-19 19:17:22] [INFO ] Time to serialize gal into /tmp/LTL16402321172289705164.gal : 0 ms
[2021-05-19 19:17:22] [INFO ] Time to serialize properties into /tmp/LTL17782637053130547589.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16402321172289705164.gal, -t, CGAL, -LTL, /tmp/LTL17782637053130547589.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16402321172289705164.gal -t CGAL -LTL /tmp/LTL17782637053130547589.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(haveA2>=1)"))))
Formula 0 simplified : !XF"(haveA2>=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-19 19:17:37] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:17:37] [INFO ] Applying decomposition
[2021-05-19 19:17:37] [INFO ] Flatten gal took : 0 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12398395248019061638.txt, -o, /tmp/graph12398395248019061638.bin, -w, /tmp/graph12398395248019061638.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12398395248019061638.bin, -l, -1, -v, -w, /tmp/graph12398395248019061638.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-19 19:17:37] [INFO ] Decomposing Gal with order
[2021-05-19 19:17:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-19 19:17:37] [INFO ] Flatten gal took : 37 ms
[2021-05-19 19:17:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-19 19:17:37] [INFO ] Time to serialize gal into /tmp/LTL7896592744202944156.gal : 0 ms
[2021-05-19 19:17:37] [INFO ] Time to serialize properties into /tmp/LTL10019715386815491572.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7896592744202944156.gal, -t, CGAL, -LTL, /tmp/LTL10019715386815491572.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7896592744202944156.gal -t CGAL -LTL /tmp/LTL10019715386815491572.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(u1.haveA2>=1)"))))
Formula 0 simplified : !XF"(u1.haveA2>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11507853496853651049
[2021-05-19 19:17:52] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11507853496853651049
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11507853496853651049]
Compilation finished in 152 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11507853496853651049]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin11507853496853651049]
LTSmin run took 639 ms.
FORMULA TwoPhaseLocking-PT-nC00050vN-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TwoPhaseLocking-PT-nC00050vN-12 finished in 31803 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions, 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
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 2 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2021-05-19 19:17:53] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:17:53] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-19 19:17:53] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:17:53] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-19 19:17:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-19 19:17:53] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:17:53] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/8 places, 4/6 transitions.
Stuttering acceptance computed with spot in 26 ms :[p0]
Running random walk in product with property : TwoPhaseLocking-PT-nC00050vN-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s5 1)], 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 72 ms.
Stack based approach found an accepted trace after 33 steps with 0 reset with depth 34 and stack size 34 in 1 ms.
FORMULA TwoPhaseLocking-PT-nC00050vN-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00050vN-13 finished in 151 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||G(!p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions, 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 1 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 7 cols
[2021-05-19 19:17:53] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:17:53] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-19 19:17:53] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-19 19:17:53] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2021-05-19 19:17:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-19 19:17:53] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:17:53] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00050vN-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GEQ s6 1), p1:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 15110 reset in 69 ms.
Product exploration explored 100000 steps with 15078 reset in 80 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 15149 reset in 70 ms.
Product exploration explored 100000 steps with 15035 reset in 80 ms.
[2021-05-19 19:17:53] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:17:53] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:17:53] [INFO ] Time to serialize gal into /tmp/LTL3363362129533310975.gal : 1 ms
[2021-05-19 19:17:53] [INFO ] Time to serialize properties into /tmp/LTL13901166702781659811.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3363362129533310975.gal, -t, CGAL, -LTL, /tmp/LTL13901166702781659811.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3363362129533310975.gal -t CGAL -LTL /tmp/LTL13901166702781659811.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(haveA2andB>=1)"))||(G("(haveA2<1)"))))
Formula 0 simplified : !(F"(haveA2andB>=1)" | G"(haveA2<1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
78 unique states visited
0 strongly connected components in search stack
77 transitions explored
78 items max in DFS search stack
538 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.38931,98140,1,0,385,389332,22,154,357,444597,1005
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA TwoPhaseLocking-PT-nC00050vN-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property TwoPhaseLocking-PT-nC00050vN-14 finished in 6083 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((((!p0 U (p1||G(!p0)))&&G((F(!p2)&&X(p0))))||G(p3))))], workingDir=/home/mcc/execution]
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-19 19:17:59] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:17:59] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:17:59] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:17:59] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:17:59] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:17:59] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3))), (AND (NOT p3) p2), (AND (NOT p0) (NOT p3)), (AND p0 p2 (NOT p3)), (AND p0 (NOT p1) (NOT p3))]
Running random walk in product with property : TwoPhaseLocking-PT-nC00050vN-15 automaton TGBA [mat=[[{ cond=(AND (NOT p3) (NOT p1) p0), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND p3 (NOT p1) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND p2 p1) (AND p2 (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p3) p1) (AND (NOT p3) (NOT p0))), acceptance={0, 1, 2} source=0 dest: 2}, { cond=(OR (AND p3 p1) (AND p3 (NOT p0))), acceptance={0, 1} source=0 dest: 2}, { cond=(OR (AND (NOT p3) p1) (AND (NOT p3) (NOT p0))), acceptance={1, 2} source=0 dest: 3}, { cond=(OR (AND p3 p1) (AND p3 (NOT p0))), acceptance={1} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0, 2} source=0 dest: 4}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p3 p2), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND p3 (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p0)), acceptance={1, 2} source=2 dest: 3}, { cond=(AND p3 (NOT p0)), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0, 2} source=2 dest: 4}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 4}], [{ cond=(AND p2 p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={0, 1, 2} source=3 dest: 2}, { cond=(AND p3 p0), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p3) p0), acceptance={1, 2} source=3 dest: 3}, { cond=(AND p3 p0), acceptance={1} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1) p0), acceptance={0, 1, 2} source=4 dest: 0}, { cond=(AND p3 (NOT p1) p0), acceptance={0, 1} source=4 dest: 0}]], initial=0, aps=[p3:(OR (NOT (AND (GEQ s0 1) (GEQ s1 1))) (AND (OR (LT s3 1) (LT s5 1)) (OR (LT s0 1) (LT s1 1)))), p1:(AND (OR (LT s3 1) (LT s5 1)) (OR (LT s0 1) (LT s1 1))), p0:(AND (GEQ s0 1) (GEQ s1 1)), p2:(GEQ s2 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4022 reset in 398 ms.
Stack based approach found an accepted trace after 93 steps with 0 reset with depth 94 and stack size 94 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC00050vN-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00050vN-15 finished in 607 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621451880834

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-nC00050vN"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is TwoPhaseLocking-PT-nC00050vN, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r311-tall-162132108100269"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TwoPhaseLocking-PT-nC00050vN.tgz
mv TwoPhaseLocking-PT-nC00050vN execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;