Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 7.3K Apr 30 10:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 30 10:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 30 10:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 30 10:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 9 09:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 09:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 09:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 09:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 09:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 4.6K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLFireability-00
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLFireability-01
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLFireability-02
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLFireability-03
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLFireability-04
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLFireability-05
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLFireability-06
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLFireability-07
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLFireability-08
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLFireability-09
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLFireability-10
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLFireability-11
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLFireability-12
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLFireability-13
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLFireability-14
FORMULA_NAME TwoPhaseLocking-PT-nC05000vN-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653201642680

Running Version 202205111006
[2022-05-22 06:40:43] [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]
[2022-05-22 06:40:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-22 06:40:43] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2022-05-22 06:40:43] [INFO ] Transformed 8 places.
[2022-05-22 06:40:43] [INFO ] Transformed 6 transitions.
[2022-05-22 06:40:44] [INFO ] Parsed PT model containing 8 places and 6 transitions in 138 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA TwoPhaseLocking-PT-nC05000vN-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC05000vN-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC05000vN-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC05000vN-LTLFireability-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 7 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:40:44] [INFO ] Computed 3 place invariants in 6 ms
[2022-05-22 06:40:44] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:40:44] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-22 06:40:44] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:40:44] [INFO ] Computed 3 place invariants in 8 ms
[2022-05-22 06:40:44] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Support contains 8 out of 8 places after structural reductions.
[2022-05-22 06:40:44] [INFO ] Flatten gal took : 13 ms
[2022-05-22 06:40:44] [INFO ] Flatten gal took : 3 ms
[2022-05-22 06:40:44] [INFO ] Input system was already deterministic with 6 transitions.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :5
Finished Best-First random walk after 57 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=57 )
FORMULA TwoPhaseLocking-PT-nC05000vN-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))||F(X((F(G(p1))&&p2)))||!p0)))'
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
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 7 transition count 5
Applied a total of 2 rules in 4 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:40:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:40:44] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:40:44] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:40:44] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-22 06:40:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:40:44] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:40:44] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/8 places, 5/6 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 309 ms :[false, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vN-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s1 1)), p2:(GEQ s6 1), p1:(GEQ s5 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 215 ms.
Stack based approach found an accepted trace after 106 steps with 0 reset with depth 107 and stack size 98 in 1 ms.
FORMULA TwoPhaseLocking-PT-nC05000vN-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC05000vN-LTLFireability-01 finished in 685 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(X(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.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:40:45] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:40:45] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:40:45] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:40:45] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:40:45] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:40:45] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vN-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s3 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 105 ms.
Product exploration explored 100000 steps with 33333 reset in 89 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 43 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA TwoPhaseLocking-PT-nC05000vN-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TwoPhaseLocking-PT-nC05000vN-LTLFireability-03 finished in 458 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0 U F(p1)) U F(!p0))||p1)))'
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.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:40:45] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:40:45] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:40:45] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:40:45] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:40:45] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:40:46] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vN-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(GEQ s2 1), p1:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 109 ms.
Product exploration explored 100000 steps with 50000 reset in 114 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 p0) (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) p0)))
Knowledge based reduction with 3 factoid took 47 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA TwoPhaseLocking-PT-nC05000vN-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TwoPhaseLocking-PT-nC05000vN-LTLFireability-04 finished in 514 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X((F(G(p1))||X(p2)||p0))))))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:40:46] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:40:46] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:40:46] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:40:46] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:40:46] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:40:46] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vN-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s5 1)), p2:(LT s7 1), p1:(OR (LT s3 1) (LT s5 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 32007 reset in 147 ms.
Stack based approach found an accepted trace after 4723 steps with 1526 reset with depth 19 and stack size 19 in 5 ms.
FORMULA TwoPhaseLocking-PT-nC05000vN-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC05000vN-LTLFireability-06 finished in 321 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X(X(p1))&&(X(F(G(p2)))||p3))))'
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:40:46] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:40:46] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:40:46] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-22 06:40:46] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:40:46] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:40:46] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 571 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p2), (NOT p1), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p1), true, (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vN-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 8}, { cond=p0, acceptance={} source=3 dest: 9}, { cond=(AND (NOT p3) p0), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0} source=4 dest: 4}, { cond=(AND p3 (NOT p0)), acceptance={} source=4 dest: 11}, { cond=(AND p3 p2 p0), acceptance={} source=4 dest: 12}, { cond=(AND p3 (NOT p2) p0), acceptance={0} source=4 dest: 12}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 5}], [{ cond=(NOT p1), acceptance={} source=8 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=9 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={0} source=9 dest: 9}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=10 dest: 2}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=10 dest: 4}, { cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={0} source=10 dest: 4}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=10 dest: 11}, { cond=(AND p3 p2 p0 (NOT p1)), acceptance={} source=10 dest: 12}, { cond=(AND p3 (NOT p2) p0 (NOT p1)), acceptance={0} source=10 dest: 12}], [{ cond=true, acceptance={} source=11 dest: 8}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=12 dest: 8}, { cond=(AND (NOT p3) p2 p0), acceptance={} source=12 dest: 10}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0} source=12 dest: 10}, { cond=(AND p3 (NOT p0)), acceptance={} source=12 dest: 13}, { cond=(AND p3 p2 p0), acceptance={} source=12 dest: 14}, { cond=(AND p3 (NOT p2) p0), acceptance={0} source=12 dest: 14}], [{ cond=(NOT p1), acceptance={} source=13 dest: 8}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=14 dest: 8}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=14 dest: 10}, { cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={0} source=14 dest: 10}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=14 dest: 13}, { cond=(AND p3 p2 p0 (NOT p1)), acceptance={} source=14 dest: 14}, { cond=(AND p3 (NOT p2) p0 (NOT p1)), acceptance={0} source=14 dest: 14}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s5 1)), p3:(AND (GEQ s0 1) (GEQ s1 1)), p2:(OR (AND (GEQ s3 1) (GEQ s5 1)) (NOT (AND (GEQ s0 1) (GEQ s1 1)))), p1:(AND (GEQ s3 1) ...], 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][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14531 reset in 109 ms.
Product exploration explored 100000 steps with 14516 reset in 112 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 p0 (NOT p3) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (AND p3 p2 p0)), (X (NOT (AND p3 (NOT p2) p0))), (X p0), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND (NOT p3) p2 p0))), (X (NOT (AND p3 (NOT p0)))), (X (X p2)), (X (X (NOT (AND p3 (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), true, (X (X (NOT (AND p3 (NOT p2) p0)))), (X (X (NOT (AND p3 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p3) p0 (NOT p1)))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (AND (NOT p3) p2 p0))), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (AND (NOT p3) p2 p0 (NOT p1)))), (X (X (NOT (AND (NOT p3) p2 p0 (NOT p1))))), (X (X (AND p3 p2 p0))), (X (X (NOT (AND p3 p2 p0)))), (X (X (AND p3 p2 p0 (NOT p1)))), (X (X (NOT (AND p3 p2 p0 (NOT p1)))))]
Knowledge based reduction with 23 factoid took 1649 ms. Reduced automaton from 15 states, 45 edges and 4 AP to 14 states, 39 edges and 4 AP.
Stuttering acceptance computed with spot in 565 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p2), (NOT p1), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p1), true, (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 17) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:40:50] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:40:50] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p3) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (AND p3 p2 p0)), (X (NOT (AND p3 (NOT p2) p0))), (X p0), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND (NOT p3) p2 p0))), (X (NOT (AND p3 (NOT p0)))), (X (X p2)), (X (X (NOT (AND p3 (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), true, (X (X (NOT (AND p3 (NOT p2) p0)))), (X (X (NOT (AND p3 (NOT p0))))), (G (NOT (AND (NOT p2) p0 (NOT p3)))), (G (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3)))), (G (NOT (AND (NOT p2) p0 p3))), (G (NOT (AND (NOT p2) (NOT p1) p0 p3)))]
False Knowledge obtained : [(X (X (AND (NOT p3) p0 (NOT p1)))), (X (X (NOT (AND (NOT p3) p0 (NOT p1))))), (X (X (AND (NOT p3) p2 p0))), (X (X (NOT (AND (NOT p3) p2 p0)))), (X (X (AND (NOT p3) p2 p0 (NOT p1)))), (X (X (NOT (AND (NOT p3) p2 p0 (NOT p1))))), (X (X (AND p3 p2 p0))), (X (X (NOT (AND p3 p2 p0)))), (X (X (AND p3 p2 p0 (NOT p1)))), (X (X (NOT (AND p3 p2 p0 (NOT p1))))), (F (AND (NOT p1) (NOT p0))), (F p1), (F (AND (NOT p1) (NOT p0) (NOT p3))), (F (AND p2 (NOT p1) p0 p3)), (F (AND (NOT p0) p3)), (F (AND (NOT p1) (NOT p0) p3)), (F (NOT (AND p2 (NOT p1) p0 (NOT p3)))), (F (AND p2 p0 p3)), (F (NOT p2)), (F (NOT (AND p2 p0 (NOT p3)))), (F (AND (NOT p0) (NOT p3))), (F (NOT (AND (NOT p1) p0 (NOT p3)))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 27 factoid took 2128 ms. Reduced automaton from 14 states, 39 edges and 4 AP to 14 states, 31 edges and 4 AP.
Stuttering acceptance computed with spot in 552 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (OR (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 558 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (OR (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:40:53] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:40:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 06:40:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 06:40:53] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-22 06:40:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 06:40:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-22 06:40:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 06:40:53] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-22 06:40:53] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 06:40:53] [INFO ] Added : 1 causal constraints over 1 iterations in 40 ms. Result :sat
Could not prove EG (AND (NOT p1) p2)
Support contains 5 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
[2022-05-22 06:40:53] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:40:53] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:40:53] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:40:53] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:40:53] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:40:53] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p3) (NOT p1)), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND p0 p3)), (X (X p2)), (X (X (OR (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p1) p0 (NOT p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 p3))))]
Knowledge based reduction with 13 factoid took 929 ms. Reduced automaton from 14 states, 31 edges and 4 AP to 14 states, 31 edges and 4 AP.
Stuttering acceptance computed with spot in 546 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (OR (NOT p0) p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2501 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:40:55] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:40:55] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 (NOT p3) (NOT p1)), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND p0 p3)), (X (X p2)), (X (X (OR (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (OR p2 (NOT p0)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND (NOT p1) p0 (NOT p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 p3)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p3) (NOT p0) (NOT p1))), (F (AND p3 (NOT p0))), (F (NOT (AND (NOT p3) p0))), (F (AND p3 p0 (NOT p1))), (F (NOT (OR (AND p2 (NOT p1)) (AND (NOT p0) (NOT p1))))), (F (AND p3 (NOT p0) (NOT p1))), (F (AND p3 p0)), (F (NOT p2)), (F (AND (NOT p3) (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p3) p0 (NOT p1)))), (F (NOT (AND p2 p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 1350 ms. Reduced automaton from 14 states, 31 edges and 4 AP to 14 states, 31 edges and 4 AP.
Stuttering acceptance computed with spot in 517 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (NOT p2), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p1), true, (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 483 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (NOT p2), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p1), true, (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:40:57] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:40:57] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-22 06:40:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 06:40:57] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-22 06:40:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 06:40:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 06:40:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 06:40:57] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-22 06:40:57] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 06:40:57] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p1) p2)
Stuttering acceptance computed with spot in 474 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (NOT p2), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p1), true, (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 14483 reset in 90 ms.
Product exploration explored 100000 steps with 14493 reset in 90 ms.
Applying partial POR strategy [false, true, false, false, true, true, false, true, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 523 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (NOT p2), (AND (NOT p1) p2), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (NOT p1), true, (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2022-05-22 06:40:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:40:59] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:40:59] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Product exploration explored 100000 steps with 14491 reset in 113 ms.
Product exploration explored 100000 steps with 14439 reset in 128 ms.
Built C files in :
/tmp/ltsmin3188193841556618038
[2022-05-22 06:40:59] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3188193841556618038
Running compilation step : cd /tmp/ltsmin3188193841556618038;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 148 ms.
Running link step : cd /tmp/ltsmin3188193841556618038;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3188193841556618038;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8015964720298593824.hoa' '--buchi-type=spotba'
LTSmin run took 885 ms.
FORMULA TwoPhaseLocking-PT-nC05000vN-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TwoPhaseLocking-PT-nC05000vN-LTLFireability-07 finished in 13762 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((F((G((F(p0)||p0)) U p1))||p0))||G(p0)))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 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
[2022-05-22 06:41:00] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:41:00] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:41:00] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:41:00] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-22 06:41:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:41:00] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:41:00] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/8 places, 5/6 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vN-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s6 1), p1:(AND (GEQ s3 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 24973 reset in 50 ms.
Product exploration explored 100000 steps with 25048 reset in 55 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 p0) (NOT p1)), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 2502 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1251 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:41:01] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:41:01] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 06:41:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 06:41:01] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-22 06:41:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 06:41:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-22 06:41:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 06:41:01] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-22 06:41:01] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-22 06:41:01] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:41:01] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:41:01] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:41:01] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:41:01] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-22 06:41:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:41:01] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:41:01] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 5/5 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) (NOT p1)), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 186 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:41:01] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:41:01] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 06:41:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 06:41:01] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-22 06:41:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 06:41:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 06:41:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 06:41:01] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-22 06:41:01] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-22 06:41:01] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 24965 reset in 55 ms.
Product exploration explored 100000 steps with 24963 reset in 54 ms.
Built C files in :
/tmp/ltsmin6779705692519298060
[2022-05-22 06:41:01] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-22 06:41:01] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 06:41:01] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-22 06:41:01] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 06:41:01] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-22 06:41:01] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 06:41:01] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6779705692519298060
Running compilation step : cd /tmp/ltsmin6779705692519298060;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 73 ms.
Running link step : cd /tmp/ltsmin6779705692519298060;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin6779705692519298060;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9006670900766768896.hoa' '--buchi-type=spotba'
LTSmin run took 614 ms.
FORMULA TwoPhaseLocking-PT-nC05000vN-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TwoPhaseLocking-PT-nC05000vN-LTLFireability-08 finished in 2042 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(p1)||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.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:41:02] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:41:02] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:41:02] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:41:02] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:41:02] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:41:02] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vN-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s6 1), p1:(GEQ s2 1)], nbAcceptance=1, 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 11667 reset in 51 ms.
Product exploration explored 100000 steps with 7549 reset in 238 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 p0) (NOT p1)), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 2502 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2502 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 169 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:41:03] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:41:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 06:41:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 06:41:03] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-22 06:41:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 06:41:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 06:41:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 06:41:03] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-22 06:41:03] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 06:41:03] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
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.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:41:03] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:41:03] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:41:03] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:41:03] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:41:03] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:41:03] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 2502 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1251 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:41:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:41:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 06:41:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 06:41:04] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-22 06:41:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 06:41:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 06:41:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 06:41:04] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-22 06:41:04] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-22 06:41:04] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 11087 reset in 65 ms.
Product exploration explored 100000 steps with 8488 reset in 187 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT 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.
Applied a total of 0 rules in 3 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2022-05-22 06:41:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:41:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:41:04] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Product exploration explored 100000 steps with 10609 reset in 111 ms.
Product exploration explored 100000 steps with 5078 reset in 334 ms.
Built C files in :
/tmp/ltsmin4528729231679698871
[2022-05-22 06:41:05] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4528729231679698871
Running compilation step : cd /tmp/ltsmin4528729231679698871;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 58 ms.
Running link step : cd /tmp/ltsmin4528729231679698871;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin4528729231679698871;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17577744458956627214.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 3 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:41:20] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:41:20] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:41:20] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:41:20] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:41:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:41:20] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Built C files in :
/tmp/ltsmin8436509474328562465
[2022-05-22 06:41:20] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8436509474328562465
Running compilation step : cd /tmp/ltsmin8436509474328562465;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 75 ms.
Running link step : cd /tmp/ltsmin8436509474328562465;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin8436509474328562465;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9553810287426411886.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-22 06:41:35] [INFO ] Flatten gal took : 2 ms
[2022-05-22 06:41:35] [INFO ] Flatten gal took : 1 ms
[2022-05-22 06:41:35] [INFO ] Time to serialize gal into /tmp/LTL16168057607375504556.gal : 1 ms
[2022-05-22 06:41:35] [INFO ] Time to serialize properties into /tmp/LTL13131931431616379210.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16168057607375504556.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13131931431616379210.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1616805...268
Read 1 LTL properties
Checking formula 0 : !((G(((F("(haveAandB>=1)"))||(X("(haveA2>=1)")))||("(haveAandB>=1)"))))
Formula 0 simplified : !G("(haveAandB>=1)" | F"(haveAandB>=1)" | X"(haveA2>=1)")
Detected timeout of ITS tools.
[2022-05-22 06:41:50] [INFO ] Flatten gal took : 2 ms
[2022-05-22 06:41:50] [INFO ] Applying decomposition
[2022-05-22 06:41:50] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17455486840618832561.txt' '-o' '/tmp/graph17455486840618832561.bin' '-w' '/tmp/graph17455486840618832561.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17455486840618832561.bin' '-l' '-1' '-v' '-w' '/tmp/graph17455486840618832561.weights' '-q' '0' '-e' '0.001'
[2022-05-22 06:41:50] [INFO ] Decomposing Gal with order
[2022-05-22 06:41:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 06:41:50] [INFO ] Flatten gal took : 31 ms
[2022-05-22 06:41:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-22 06:41:50] [INFO ] Time to serialize gal into /tmp/LTL15541149805515720997.gal : 1 ms
[2022-05-22 06:41:50] [INFO ] Time to serialize properties into /tmp/LTL2252589845343186931.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15541149805515720997.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2252589845343186931.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1554114...246
Read 1 LTL properties
Checking formula 0 : !((G(((F("(u0.haveAandB>=1)"))||(X("(u2.haveA2>=1)")))||("(u0.haveAandB>=1)"))))
Formula 0 simplified : !G("(u0.haveAandB>=1)" | F"(u0.haveAandB>=1)" | X"(u2.haveA2>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1101501515767862434
[2022-05-22 06:42:05] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1101501515767862434
Running compilation step : cd /tmp/ltsmin1101501515767862434;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 73 ms.
Running link step : cd /tmp/ltsmin1101501515767862434;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin1101501515767862434;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))||X((LTLAPp1==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TwoPhaseLocking-PT-nC05000vN-LTLFireability-09 finished in 78271 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--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 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:42:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:42:20] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:42:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:42:20] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:42:20] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:42:20] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vN-LTLFireability-11 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:(OR (LT s3 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA TwoPhaseLocking-PT-nC05000vN-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC05000vN-LTLFireability-11 finished in 188 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((X(G(F(p0)))||G(p1)))))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 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
[2022-05-22 06:42:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:42:21] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:42:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:42:21] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2022-05-22 06:42:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 06:42:21] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:42:21] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/8 places, 5/6 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vN-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LT s6 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][true, true]]
Product exploration explored 100000 steps with 0 reset in 70 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC05000vN-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC05000vN-LTLFireability-12 finished in 224 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:42:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:42:21] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:42:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:42:21] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:42:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:42:21] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vN-LTLFireability-13 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:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC05000vN-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC05000vN-LTLFireability-13 finished in 160 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--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
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 7 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 4 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 06:42:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:42:21] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 06:42:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:42:21] [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.
[2022-05-22 06:42:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 06:42:21] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:42:21] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/8 places, 4/6 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/8 places, 4/6 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vN-LTLFireability-15 automaton TGBA Formula[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 s3 1) (GEQ s5 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 0 reset in 60 ms.
Product exploration explored 100000 steps with 0 reset in 111 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2501 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1250 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 06:42:22] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:42:22] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 06:42:22] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-22 06:42:22] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-22 06:42:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 06:42:22] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:42:22] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 4/4 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2501 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=833 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 59 ms.
Product exploration explored 100000 steps with 0 reset in 149 ms.
Built C files in :
/tmp/ltsmin5754751196057904222
[2022-05-22 06:42:22] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2022-05-22 06:42:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 06:42:22] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2022-05-22 06:42:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 06:42:22] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2022-05-22 06:42:22] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 06:42:22] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5754751196057904222
Running compilation step : cd /tmp/ltsmin5754751196057904222;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 63 ms.
Running link step : cd /tmp/ltsmin5754751196057904222;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin5754751196057904222;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10588609127611085274.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 2 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 06:42:38] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:42:38] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 06:42:38] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:42:38] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-22 06:42:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 06:42:38] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:42:38] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 4/4 transitions.
Built C files in :
/tmp/ltsmin11000636489312876549
[2022-05-22 06:42:38] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2022-05-22 06:42:38] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 06:42:38] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2022-05-22 06:42:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 06:42:38] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2022-05-22 06:42:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 06:42:38] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11000636489312876549
Running compilation step : cd /tmp/ltsmin11000636489312876549;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 72 ms.
Running link step : cd /tmp/ltsmin11000636489312876549;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin11000636489312876549;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8424156909069419407.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-22 06:42:53] [INFO ] Flatten gal took : 2 ms
[2022-05-22 06:42:53] [INFO ] Flatten gal took : 8 ms
[2022-05-22 06:42:53] [INFO ] Time to serialize gal into /tmp/LTL1213479820915611146.gal : 1 ms
[2022-05-22 06:42:53] [INFO ] Time to serialize properties into /tmp/LTL6490211091257354912.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1213479820915611146.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6490211091257354912.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1213479...266
Read 1 LTL properties
Checking formula 0 : !((G(F("((resA>=1)&&(Clients>=1))"))))
Formula 0 simplified : !GF"((resA>=1)&&(Clients>=1))"
Detected timeout of ITS tools.
[2022-05-22 06:43:08] [INFO ] Flatten gal took : 1 ms
[2022-05-22 06:43:08] [INFO ] Applying decomposition
[2022-05-22 06:43:08] [INFO ] Flatten gal took : 0 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3216069403530135250.txt' '-o' '/tmp/graph3216069403530135250.bin' '-w' '/tmp/graph3216069403530135250.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3216069403530135250.bin' '-l' '-1' '-v' '-w' '/tmp/graph3216069403530135250.weights' '-q' '0' '-e' '0.001'
[2022-05-22 06:43:08] [INFO ] Decomposing Gal with order
[2022-05-22 06:43:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 06:43:08] [INFO ] Flatten gal took : 3 ms
[2022-05-22 06:43:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-22 06:43:08] [INFO ] Time to serialize gal into /tmp/LTL8055198276867164190.gal : 1 ms
[2022-05-22 06:43:08] [INFO ] Time to serialize properties into /tmp/LTL16356018954206289174.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8055198276867164190.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16356018954206289174.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8055198...246
Read 1 LTL properties
Checking formula 0 : !((G(F("((i1.u0.resA>=1)&&(i1.u2.Clients>=1))"))))
Formula 0 simplified : !GF"((i1.u0.resA>=1)&&(i1.u2.Clients>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3088500102577387878
[2022-05-22 06:43:23] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3088500102577387878
Running compilation step : cd /tmp/ltsmin3088500102577387878;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 72 ms.
Running link step : cd /tmp/ltsmin3088500102577387878;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin3088500102577387878;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TwoPhaseLocking-PT-nC05000vN-LTLFireability-15 finished in 77086 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(p1)||p0)))'
Found a SL insensitive property : TwoPhaseLocking-PT-nC05000vN-LTLFireability-09
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:43:38] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:43:38] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:43:38] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:43:38] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:43:38] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:43:38] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Running random walk in product with property : TwoPhaseLocking-PT-nC05000vN-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s6 1), p1:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 10013 reset in 59 ms.
Product exploration explored 100000 steps with 11437 reset in 119 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 p0) (NOT p1)), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 157 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 2502 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=2502 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 188 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:43:39] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:43:39] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-22 06:43:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 06:43:39] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-22 06:43:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 06:43:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-22 06:43:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 06:43:39] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-22 06:43:39] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 06:43:39] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
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
[2022-05-22 06:43:39] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:43:39] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:43:39] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:43:39] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:43:39] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:43:39] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
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) (NOT p1)), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 2502 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1251 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:43:40] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:43:40] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 06:43:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 06:43:40] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-22 06:43:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 06:43:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-22 06:43:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 06:43:40] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-22 06:43:40] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 06:43:40] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 5206 reset in 57 ms.
Product exploration explored 100000 steps with 1922 reset in 241 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT 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.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2022-05-22 06:43:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:43:41] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 06:43:41] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Product exploration explored 100000 steps with 10142 reset in 63 ms.
Product exploration explored 100000 steps with 9564 reset in 211 ms.
Built C files in :
/tmp/ltsmin14646011079759597083
[2022-05-22 06:43:41] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14646011079759597083
Running compilation step : cd /tmp/ltsmin14646011079759597083;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 122 ms.
Running link step : cd /tmp/ltsmin14646011079759597083;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin14646011079759597083;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12038794415665574583.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:43:56] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:43:56] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:43:56] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:43:56] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 06:43:56] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 06:43:56] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Built C files in :
/tmp/ltsmin15546079199272476612
[2022-05-22 06:43:56] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15546079199272476612
Running compilation step : cd /tmp/ltsmin15546079199272476612;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 57 ms.
Running link step : cd /tmp/ltsmin15546079199272476612;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15546079199272476612;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14853560930042378218.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-22 06:44:11] [INFO ] Flatten gal took : 1 ms
[2022-05-22 06:44:11] [INFO ] Flatten gal took : 1 ms
[2022-05-22 06:44:11] [INFO ] Time to serialize gal into /tmp/LTL15880673463243914784.gal : 0 ms
[2022-05-22 06:44:11] [INFO ] Time to serialize properties into /tmp/LTL11078073303613091016.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15880673463243914784.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11078073303613091016.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1588067...268
Read 1 LTL properties
Checking formula 0 : !((G(((F("(haveAandB>=1)"))||(X("(haveA2>=1)")))||("(haveAandB>=1)"))))
Formula 0 simplified : !G("(haveAandB>=1)" | F"(haveAandB>=1)" | X"(haveA2>=1)")
Detected timeout of ITS tools.
[2022-05-22 06:44:26] [INFO ] Flatten gal took : 1 ms
[2022-05-22 06:44:26] [INFO ] Applying decomposition
[2022-05-22 06:44:26] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7527907622716099164.txt' '-o' '/tmp/graph7527907622716099164.bin' '-w' '/tmp/graph7527907622716099164.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7527907622716099164.bin' '-l' '-1' '-v' '-w' '/tmp/graph7527907622716099164.weights' '-q' '0' '-e' '0.001'
[2022-05-22 06:44:26] [INFO ] Decomposing Gal with order
[2022-05-22 06:44:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 06:44:26] [INFO ] Flatten gal took : 2 ms
[2022-05-22 06:44:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-22 06:44:26] [INFO ] Time to serialize gal into /tmp/LTL15745068677146829517.gal : 0 ms
[2022-05-22 06:44:26] [INFO ] Time to serialize properties into /tmp/LTL5019629043175264868.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15745068677146829517.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5019629043175264868.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1574506...246
Read 1 LTL properties
Checking formula 0 : !((G(((F("(u2.haveAandB>=1)"))||(X("(u1.haveA2>=1)")))||("(u2.haveAandB>=1)"))))
Formula 0 simplified : !G("(u2.haveAandB>=1)" | F"(u2.haveAandB>=1)" | X"(u1.haveA2>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8311915443790931332
[2022-05-22 06:44:41] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8311915443790931332
Running compilation step : cd /tmp/ltsmin8311915443790931332;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 70 ms.
Running link step : cd /tmp/ltsmin8311915443790931332;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin8311915443790931332;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))||X((LTLAPp1==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TwoPhaseLocking-PT-nC05000vN-LTLFireability-09 finished in 78312 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2022-05-22 06:44:56] [INFO ] Flatten gal took : 1 ms
Using solver Z3 to compute partial order matrices.
[2022-05-22 06:44:56] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin15068154212797727447
[2022-05-22 06:44:56] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-22 06:44:56] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 06:44:56] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-22 06:44:56] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 06:44:56] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-22 06:44:56] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 06:44:56] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15068154212797727447
Running compilation step : cd /tmp/ltsmin15068154212797727447;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-22 06:44:56] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13647732722108329019.txt' '-o' '/tmp/graph13647732722108329019.bin' '-w' '/tmp/graph13647732722108329019.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13647732722108329019.bin' '-l' '-1' '-v' '-w' '/tmp/graph13647732722108329019.weights' '-q' '0' '-e' '0.001'
[2022-05-22 06:44:56] [INFO ] Decomposing Gal with order
[2022-05-22 06:44:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 06:44:56] [INFO ] Flatten gal took : 1 ms
[2022-05-22 06:44:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-22 06:44:56] [INFO ] Time to serialize gal into /tmp/LTLFireability8386996713842350587.gal : 1 ms
[2022-05-22 06:44:56] [INFO ] Time to serialize properties into /tmp/LTLFireability4456006003355381309.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8386996713842350587.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4456006003355381309.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...267
Read 2 LTL properties
Checking formula 0 : !((G(((F("(u2.haveAandB>=1)"))||(X("(u1.haveA2>=1)")))||("(u2.haveAandB>=1)"))))
Formula 0 simplified : !G("(u2.haveAandB>=1)" | F"(u2.haveAandB>=1)" | X"(u1.haveA2>=1)")
Compilation finished in 78 ms.
Running link step : cd /tmp/ltsmin15068154212797727447;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 20 ms.
Running LTSmin : cd /tmp/ltsmin15068154212797727447;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))||X((LTLAPp1==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: LTL layer: formula: []((<>((LTLAPp0==true))||X((LTLAPp1==true))||(LTLAPp0==true)))
pins2lts-mc-linux64( 0/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: "[]((<>((LTLAPp0==true))||X((LTLAPp1==true))||(LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.063: DFS-FIFO for weak LTL, using special progress label 10
pins2lts-mc-linux64( 0/ 8), 0.063: There are 11 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.063: State length is 9, there are 10 groups
pins2lts-mc-linux64( 0/ 8), 0.063: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.063: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.063: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.063: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.977: ~83 levels ~960 states ~1344 transitions
pins2lts-mc-linux64( 6/ 8), 1.287: ~163 levels ~1920 states ~2608 transitions
pins2lts-mc-linux64( 6/ 8), 1.482: ~324 levels ~3840 states ~5200 transitions
pins2lts-mc-linux64( 6/ 8), 3.720: ~639 levels ~7680 states ~10240 transitions
pins2lts-mc-linux64( 6/ 8), 4.630: ~1279 levels ~15360 states ~20464 transitions
pins2lts-mc-linux64( 6/ 8), 9.684: ~2501 levels ~30720 states ~40008 transitions
pins2lts-mc-linux64( 6/ 8), 10.385: ~2501 levels ~61440 states ~94880 transitions
pins2lts-mc-linux64( 7/ 8), 11.941: ~2503 levels ~122880 states ~289800 transitions
pins2lts-mc-linux64( 7/ 8), 13.789: ~2503 levels ~245760 states ~657776 transitions
pins2lts-mc-linux64( 7/ 8), 15.246: ~2503 levels ~491520 states ~1412712 transitions
pins2lts-mc-linux64( 7/ 8), 18.101: ~2504 levels ~983040 states ~3127144 transitions
pins2lts-mc-linux64( 7/ 8), 22.006: ~2510 levels ~1966080 states ~6311136 transitions
pins2lts-mc-linux64( 5/ 8), 28.062: ~2509 levels ~3932160 states ~12900840 transitions
pins2lts-mc-linux64( 5/ 8), 32.939: ~2514 levels ~7864320 states ~25648512 transitions
pins2lts-mc-linux64( 1/ 8), 40.617: ~2515 levels ~15728640 states ~50785184 transitions
pins2lts-mc-linux64( 5/ 8), 57.483: ~2522 levels ~31457280 states ~103642280 transitions
pins2lts-mc-linux64( 7/ 8), 90.367: ~2529 levels ~62914560 states ~204831168 transitions
pins2lts-mc-linux64( 7/ 8), 147.993: ~2538 levels ~125829120 states ~410502560 transitions
pins2lts-mc-linux64( 7/ 8), 283.474: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 283.499:
pins2lts-mc-linux64( 0/ 8), 283.500: mean standard work distribution: 2.3% (states) 7.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 283.500:
pins2lts-mc-linux64( 0/ 8), 283.500: Explored 221922383 states 778970554 transitions, fanout: 3.510
pins2lts-mc-linux64( 0/ 8), 283.500: Total exploration time 283.420 sec (283.370 sec minimum, 283.403 sec on average)
pins2lts-mc-linux64( 0/ 8), 283.500: States per second: 783016, Transitions per second: 2748467
pins2lts-mc-linux64( 0/ 8), 283.500:
pins2lts-mc-linux64( 0/ 8), 283.500: Progress states detected: 17493444
pins2lts-mc-linux64( 0/ 8), 283.500: Redundant explorations: 65.3457
pins2lts-mc-linux64( 0/ 8), 283.500:
pins2lts-mc-linux64( 0/ 8), 283.500: Queue width: 8B, total height: 1069134, memory: 8.16MB
pins2lts-mc-linux64( 0/ 8), 283.500: Tree memory: 1113.9MB, 8.7 B/state, compr.: 22.9%
pins2lts-mc-linux64( 0/ 8), 283.500: Tree fill ratio (roots/leafs): 99.0%/35.0%
pins2lts-mc-linux64( 0/ 8), 283.500: Stored 6 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 283.500: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 283.500: Est. total memory use: 1122.1MB (~1032.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15068154212797727447;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))||X((LTLAPp1==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15068154212797727447;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))||X((LTLAPp1==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-22 07:06:20] [INFO ] Flatten gal took : 2 ms
[2022-05-22 07:06:20] [INFO ] Time to serialize gal into /tmp/LTLFireability17709170406186547195.gal : 0 ms
[2022-05-22 07:06:20] [INFO ] Time to serialize properties into /tmp/LTLFireability9252342319262251747.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17709170406186547195.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9252342319262251747.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 2 LTL properties
Checking formula 0 : !((G(((F("(haveAandB>=1)"))||(X("(haveA2>=1)")))||("(haveAandB>=1)"))))
Formula 0 simplified : !G("(haveAandB>=1)" | F"(haveAandB>=1)" | X"(haveA2>=1)")
Detected timeout of ITS tools.
[2022-05-22 07:27:45] [INFO ] Flatten gal took : 3 ms
[2022-05-22 07:27:45] [INFO ] Input system was already deterministic with 6 transitions.
[2022-05-22 07:27:45] [INFO ] Transformed 8 places.
[2022-05-22 07:27:45] [INFO ] Transformed 6 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-22 07:27:45] [INFO ] Time to serialize gal into /tmp/LTLFireability1119842939738219072.gal : 0 ms
[2022-05-22 07:27:45] [INFO ] Time to serialize properties into /tmp/LTLFireability5777844851283303967.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1119842939738219072.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5777844851283303967.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...333
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(((F("(haveAandB>=1)"))||(X("(haveA2>=1)")))||("(haveAandB>=1)"))))
Formula 0 simplified : !G("(haveAandB>=1)" | F"(haveAandB>=1)" | X"(haveA2>=1)")

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TwoPhaseLocking-PT-nC05000vN"
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-nC05000vN, 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 r258-tall-165303546300868"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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