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-165303546300876.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-nC10000vD, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303546300876
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 8.6K Apr 30 10:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 30 10:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 10:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 30 10:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 9 09:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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-nC10000vD-LTLFireability-00
FORMULA_NAME TwoPhaseLocking-PT-nC10000vD-LTLFireability-01
FORMULA_NAME TwoPhaseLocking-PT-nC10000vD-LTLFireability-02
FORMULA_NAME TwoPhaseLocking-PT-nC10000vD-LTLFireability-03
FORMULA_NAME TwoPhaseLocking-PT-nC10000vD-LTLFireability-04
FORMULA_NAME TwoPhaseLocking-PT-nC10000vD-LTLFireability-05
FORMULA_NAME TwoPhaseLocking-PT-nC10000vD-LTLFireability-06
FORMULA_NAME TwoPhaseLocking-PT-nC10000vD-LTLFireability-07
FORMULA_NAME TwoPhaseLocking-PT-nC10000vD-LTLFireability-08
FORMULA_NAME TwoPhaseLocking-PT-nC10000vD-LTLFireability-09
FORMULA_NAME TwoPhaseLocking-PT-nC10000vD-LTLFireability-10
FORMULA_NAME TwoPhaseLocking-PT-nC10000vD-LTLFireability-11
FORMULA_NAME TwoPhaseLocking-PT-nC10000vD-LTLFireability-12
FORMULA_NAME TwoPhaseLocking-PT-nC10000vD-LTLFireability-13
FORMULA_NAME TwoPhaseLocking-PT-nC10000vD-LTLFireability-14
FORMULA_NAME TwoPhaseLocking-PT-nC10000vD-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653203362672

Running Version 202205111006
[2022-05-22 07:09:23] [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 07:09:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-22 07:09:23] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2022-05-22 07:09:23] [INFO ] Transformed 8 places.
[2022-05-22 07:09:23] [INFO ] Transformed 6 transitions.
[2022-05-22 07:09:23] [INFO ] Parsed PT model containing 8 places and 6 transitions in 153 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 1 formulas.
FORMULA TwoPhaseLocking-PT-nC10000vD-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC10000vD-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 9 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 07:09:24] [INFO ] Computed 3 place invariants in 7 ms
[2022-05-22 07:09:24] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 07:09:24] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-22 07:09:24] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 07:09:24] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 07:09:24] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Support contains 8 out of 8 places after structural reductions.
[2022-05-22 07:09:24] [INFO ] Flatten gal took : 13 ms
[2022-05-22 07:09:24] [INFO ] Flatten gal took : 3 ms
[2022-05-22 07:09:24] [INFO ] Input system was already deterministic with 6 transitions.
Incomplete random walk after 10003 steps, including 1 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :4
Finished Best-First random walk after 73 steps, including 0 resets, run visited all 7 properties in 8 ms. (steps per millisecond=9 )
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' '!(X((G(X((G(p2)||p1)))&&p0)))'
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 07:09:24] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-22 07:09:24] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 07:09:24] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 07:09:24] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 07:09:24] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 07:09:24] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 311 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLFireability-00 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: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s3 1) (GEQ s5 1)), p2:(LT s6 1), p1:(OR (LT s7 1) (LT s3 1) (LT s5 1) (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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 2 ms.
FORMULA TwoPhaseLocking-PT-nC10000vD-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLFireability-00 finished in 478 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((F(p0) U X(p0)) U p0))))'
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 6 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 07:09:25] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 07:09:25] [INFO ] Implicit Places using invariants in 42 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/8 places, 5/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 6/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLFireability-01 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:(GEQ s2 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 10112 reset in 174 ms.
Product exploration explored 100000 steps with 10076 reset in 102 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 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)]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 7 ms. (steps per millisecond=1429 ) properties (out of 1) seen :0
Finished Best-First random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 106 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 5 rows 6 cols
[2022-05-22 07:09:26] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-22 07:09:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-22 07:09:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 07:09:26] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-22 07:09:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 07:09:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-22 07:09:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 07:09:26] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-22 07:09:26] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-22 07:09:26] [INFO ] Added : 2 causal constraints over 1 iterations in 15 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
// Phase 1: matrix 5 rows 6 cols
[2022-05-22 07:09:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 07:09:26] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2022-05-22 07:09:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 07:09:26] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2022-05-22 07:09:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2022-05-22 07:09:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-22 07:09:26] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 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 69 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=3334 ) properties (out of 1) seen :0
Finished Best-First random walk after 25 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 120 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 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 5 rows 6 cols
[2022-05-22 07:09:26] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 07:09:26] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-22 07:09:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 07:09:26] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-22 07:09:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 07:09:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-22 07:09:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 07:09:26] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-22 07:09:26] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-22 07:09:26] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10128 reset in 125 ms.
Product exploration explored 100000 steps with 10058 reset in 115 ms.
Built C files in :
/tmp/ltsmin6041154746797393122
[2022-05-22 07:09:27] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-22 07:09:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 07:09:27] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-22 07:09:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 07:09:27] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-22 07:09:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 07:09:27] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6041154746797393122
Running compilation step : cd /tmp/ltsmin6041154746797393122;'/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 173 ms.
Running link step : cd /tmp/ltsmin6041154746797393122;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin6041154746797393122;'/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/stateBased15393194400781849448.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 2 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
// Phase 1: matrix 5 rows 6 cols
[2022-05-22 07:09:42] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-22 07:09:42] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2022-05-22 07:09:42] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 07:09:42] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2022-05-22 07:09:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2022-05-22 07:09:42] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 07:09:42] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 5/5 transitions.
Built C files in :
/tmp/ltsmin18273947285414978538
[2022-05-22 07:09:42] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-22 07:09:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 07:09:42] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-22 07:09:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 07:09:42] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-22 07:09:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 07:09:42] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18273947285414978538
Running compilation step : cd /tmp/ltsmin18273947285414978538;'/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 76 ms.
Running link step : cd /tmp/ltsmin18273947285414978538;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin18273947285414978538;'/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/stateBased16477325947720552787.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-22 07:09:57] [INFO ] Flatten gal took : 1 ms
[2022-05-22 07:09:57] [INFO ] Flatten gal took : 1 ms
[2022-05-22 07:09:57] [INFO ] Time to serialize gal into /tmp/LTL17537107224415117586.gal : 1 ms
[2022-05-22 07:09:57] [INFO ] Time to serialize properties into /tmp/LTL9087674524425812724.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/LTL17537107224415117586.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9087674524425812724.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/LTL1753710...267
Read 1 LTL properties
Checking formula 0 : !((X(G(((F("(haveA2>=1)"))U(X("(haveA2>=1)")))U("(haveA2>=1)")))))
Formula 0 simplified : !XG((F"(haveA2>=1)" U X"(haveA2>=1)") U "(haveA2>=1)")
Detected timeout of ITS tools.
[2022-05-22 07:10:12] [INFO ] Flatten gal took : 3 ms
[2022-05-22 07:10:12] [INFO ] Applying decomposition
[2022-05-22 07:10:12] [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/graph7015728403475555525.txt' '-o' '/tmp/graph7015728403475555525.bin' '-w' '/tmp/graph7015728403475555525.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7015728403475555525.bin' '-l' '-1' '-v' '-w' '/tmp/graph7015728403475555525.weights' '-q' '0' '-e' '0.001'
[2022-05-22 07:10:12] [INFO ] Decomposing Gal with order
[2022-05-22 07:10:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 07:10:12] [INFO ] Flatten gal took : 70 ms
[2022-05-22 07:10:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-22 07:10:12] [INFO ] Time to serialize gal into /tmp/LTL3067219306082828932.gal : 88 ms
[2022-05-22 07:10:12] [INFO ] Time to serialize properties into /tmp/LTL17287723794945448612.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/LTL3067219306082828932.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17287723794945448612.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/LTL3067219...246
Read 1 LTL properties
Checking formula 0 : !((X(G(((F("(u1.haveA2>=1)"))U(X("(u1.haveA2>=1)")))U("(u1.haveA2>=1)")))))
Formula 0 simplified : !XG((F"(u1.haveA2>=1)" U X"(u1.haveA2>=1)") U "(u1.haveA2>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8820866156556752157
[2022-05-22 07:10:27] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8820866156556752157
Running compilation step : cd /tmp/ltsmin8820866156556752157;'/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 64 ms.
Running link step : cd /tmp/ltsmin8820866156556752157;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin8820866156556752157;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((<>((LTLAPp0==true)) U X((LTLAPp0==true))) U (LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLFireability-01 finished in 77677 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F((X((F(p0)&&p1))&&G(p0)&&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 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 07:10:42] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 07:10:42] [INFO ] Implicit Places using invariants in 24 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LT s6 1), p1:(OR (LT s3 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 24 reset in 126 ms.
Stack based approach found an accepted trace after 107 steps with 3 reset with depth 82 and stack size 82 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC10000vD-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLFireability-02 finished in 350 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||F(p1)||G(p2)))'
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 07:10:43] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 07:10:43] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 07:10:43] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 07:10:43] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 07:10:43] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 07:10:43] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (GEQ s3 1) (GEQ s4 1)), p2:(GEQ s6 1), 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 15097 reset in 113 ms.
Product exploration explored 100000 steps with 15094 reset in 94 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0))))]
Knowledge based reduction with 12 factoid took 490 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=3334 ) properties (out of 3) seen :2
Finished Best-First random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 12 factoid took 746 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 124 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 8 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 07:10:45] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 07:10:45] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 07:10:45] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-22 07:10:45] [INFO ] Implicit Places using invariants and state equation in 27 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 07:10:45] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 07:10:45] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 229 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 :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 3) seen :2
Finished Best-First random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 241 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 107 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 15034 reset in 76 ms.
Product exploration explored 100000 steps with 15122 reset in 77 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT 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: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 8 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 9 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2022-05-22 07:10:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 07:10:46] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 07:10:46] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/8 places, 6/6 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Product exploration explored 100000 steps with 24974 reset in 129 ms.
Product exploration explored 100000 steps with 25055 reset in 122 ms.
Built C files in :
/tmp/ltsmin4378776154695298149
[2022-05-22 07:10:47] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4378776154695298149
Running compilation step : cd /tmp/ltsmin4378776154695298149;'/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 79 ms.
Running link step : cd /tmp/ltsmin4378776154695298149;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin4378776154695298149;'/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/stateBased554232990196401417.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 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 07:11:02] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-22 07:11:02] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 07:11:02] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 07:11:02] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 07:11:02] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 07:11:02] [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.
Built C files in :
/tmp/ltsmin5246173590063752873
[2022-05-22 07:11:02] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5246173590063752873
Running compilation step : cd /tmp/ltsmin5246173590063752873;'/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/ltsmin5246173590063752873;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin5246173590063752873;'/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/stateBased16882735759830880909.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-22 07:11:17] [INFO ] Flatten gal took : 2 ms
[2022-05-22 07:11:17] [INFO ] Flatten gal took : 1 ms
[2022-05-22 07:11:17] [INFO ] Time to serialize gal into /tmp/LTL15123971683810834063.gal : 1 ms
[2022-05-22 07:11:17] [INFO ] Time to serialize properties into /tmp/LTL15422173584482538347.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/LTL15123971683810834063.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15422173584482538347.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/LTL1512397...268
Read 1 LTL properties
Checking formula 0 : !((((G(X("((resA>=1)&&(Clients>=1))")))||(F("((resA>=1)&&(haveB>=1))")))||(G("(haveAandB>=1)"))))
Formula 0 simplified : !(GX"((resA>=1)&&(Clients>=1))" | F"((resA>=1)&&(haveB>=1))" | G"(haveAandB>=1)")
Detected timeout of ITS tools.
[2022-05-22 07:11:32] [INFO ] Flatten gal took : 1 ms
[2022-05-22 07:11:32] [INFO ] Applying decomposition
[2022-05-22 07:11:32] [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/graph9150191971621068999.txt' '-o' '/tmp/graph9150191971621068999.bin' '-w' '/tmp/graph9150191971621068999.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9150191971621068999.bin' '-l' '-1' '-v' '-w' '/tmp/graph9150191971621068999.weights' '-q' '0' '-e' '0.001'
[2022-05-22 07:11:32] [INFO ] Decomposing Gal with order
[2022-05-22 07:11:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 07:11:32] [INFO ] Flatten gal took : 2 ms
[2022-05-22 07:11:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-22 07:11:32] [INFO ] Time to serialize gal into /tmp/LTL2663812054793856814.gal : 2 ms
[2022-05-22 07:11:32] [INFO ] Time to serialize properties into /tmp/LTL8569063348123636595.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/LTL2663812054793856814.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8569063348123636595.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/LTL2663812...245
Read 1 LTL properties
Checking formula 0 : !((((G(X("((u0.resA>=1)&&(u1.Clients>=1))")))||(F("((u0.resA>=1)&&(u2.haveB>=1))")))||(G("(u2.haveAandB>=1)"))))
Formula 0 simplified : !(GX"((u0.resA>=1)&&(u1.Clients>=1))" | F"((u0.resA>=1)&&(u2.haveB>=1))" | G"(u2.haveAandB>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin392060928319879154
[2022-05-22 07:11:47] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin392060928319879154
Running compilation step : cd /tmp/ltsmin392060928319879154;'/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/ltsmin392060928319879154;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin392060928319879154;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](X((LTLAPp0==true)))||<>((LTLAPp1==true))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLFireability-03 finished in 79304 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 3 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 07:12:02] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 07:12:02] [INFO ] Implicit Places using invariants in 26 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/8 places, 4/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 5/8 places, 4/6 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLFireability-04 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:(LT s4 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 3053 reset in 61 ms.
Stack based approach found an accepted trace after 19 steps with 1 reset with depth 8 and stack size 8 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC10000vD-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLFireability-04 finished in 192 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(X(p1))&&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
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 1 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 07:12:02] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 07:12:02] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 07:12:02] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 07:12:02] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2022-05-22 07:12:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 07:12:02] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 07:12:02] [INFO ] Dead Transitions using invariants and state equation in 22 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 80 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s4 1)), p1:(AND (GEQ s3 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 85 ms.
Product exploration explored 100000 steps with 0 reset in 177 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) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 8 factoid took 313 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 7 ms. (steps per millisecond=1429 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 07:12:03] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 07:12:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 07:12:03] [INFO ] After 25ms 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 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 369 ms. Reduced automaton from 2 states, 5 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 07:12:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 07:12:04] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-22 07:12:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 07:12:04] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-22 07:12:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 07:12:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 07:12:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 07:12:04] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-22 07:12:04] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-22 07:12:04] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in 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 07:12:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 07:12:04] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 07:12:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 07:12:04] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 07:12:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 07:12:04] [INFO ] Dead Transitions using invariants and state equation in 19 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 : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 204 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 2) seen :1
Finished Best-First random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 220 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 07:12:05] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 07:12:05] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 07:12:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 07:12:05] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-22 07:12:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 07:12:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 07:12:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 07:12:05] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-22 07:12:05] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-22 07:12:05] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 61 ms.
Product exploration explored 100000 steps with 0 reset in 88 ms.
Built C files in :
/tmp/ltsmin17170190422126115045
[2022-05-22 07:12:05] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17170190422126115045
Running compilation step : cd /tmp/ltsmin17170190422126115045;'/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 81 ms.
Running link step : cd /tmp/ltsmin17170190422126115045;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin17170190422126115045;'/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/stateBased2843291608844383505.hoa' '--buchi-type=spotba'
LTSmin run took 722 ms.
FORMULA TwoPhaseLocking-PT-nC10000vD-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLFireability-05 finished in 3434 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&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 07:12:06] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 07:12:06] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 07:12:06] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 07:12:06] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2022-05-22 07:12:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 07:12:06] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 07:12:06] [INFO ] Dead Transitions using invariants and state equation in 17 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 65 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s3 1) (GEQ s5 1)), p1:(GEQ s6 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, null][true, true]]
Product exploration explored 100000 steps with 25046 reset in 51 ms.
Product exploration explored 100000 steps with 25066 reset in 54 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 p1)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 6 factoid took 221 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 6 ms. (steps per millisecond=1667 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 07:12:06] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 07:12:06] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 07:12:06] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-22 07:12:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 07:12:06] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-22 07:12:06] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-22 07:12:06] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 19998 steps, including 0 resets, run visited all 1 properties in 52 ms. (steps per millisecond=384 )
Parikh walk visited 1 properties in 52 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F p1), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 6 factoid took 273 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 07:12:07] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 07:12:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 07:12:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 07:12:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-22 07:12:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 07:12:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 07:12:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 07:12:07] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-22 07:12:07] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 07:12:07] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (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 0 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 07:12:07] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 07:12:07] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 07:12:07] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 07:12:07] [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 07:12:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 07:12:07] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 07:12:07] [INFO ] Dead Transitions using invariants and state equation in 16 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 p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 6 factoid took 252 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=3334 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 07:12:07] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 07:12:07] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-22 07:12:07] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-22 07:12:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-22 07:12:07] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-22 07:12:07] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-22 07:12:07] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 19998 steps, including 0 resets, run visited all 1 properties in 26 ms. (steps per millisecond=769 )
Parikh walk visited 1 properties in 25 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F p1), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 6 factoid took 262 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 07:12:08] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 07:12:08] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-22 07:12:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 07:12:08] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-22 07:12:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 07:12:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 07:12:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 07:12:08] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-22 07:12:08] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-22 07:12:08] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 24942 reset in 50 ms.
Product exploration explored 100000 steps with 25020 reset in 53 ms.
Built C files in :
/tmp/ltsmin7120232890032248781
[2022-05-22 07:12:08] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-22 07:12:08] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 07:12:08] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-22 07:12:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 07:12:08] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-22 07:12:08] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 07:12:08] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7120232890032248781
Running compilation step : cd /tmp/ltsmin7120232890032248781;'/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/ltsmin7120232890032248781;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7120232890032248781;'/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/stateBased4585809329676306981.hoa' '--buchi-type=spotba'
LTSmin run took 715 ms.
FORMULA TwoPhaseLocking-PT-nC10000vD-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLFireability-06 finished in 3125 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U (G(p1)&&G(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
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 2 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 07:12:09] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 07:12:09] [INFO ] Implicit Places using invariants in 23 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/8 places, 5/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 6/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 32 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(GEQ s5 1), p2:(AND (GEQ s0 1) (GEQ s1 1)), p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10284 reset in 66 ms.
Product exploration explored 100000 steps with 10259 reset in 70 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 1 states, 2 edges and 3 AP to 1 states, 2 edges and 3 AP.
Stuttering acceptance computed with spot in 29 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 2) seen :0
Finished Best-First random walk after 14 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 1 states, 2 edges and 3 AP to 1 states, 2 edges and 3 AP.
Stuttering acceptance computed with spot in 40 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 36 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
// Phase 1: matrix 5 rows 6 cols
[2022-05-22 07:12:10] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 07:12:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-22 07:12:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 07:12:10] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-22 07:12:10] [INFO ] Solution in real domain found non-integer solution.
Proved EG (AND (NOT p0) (NOT p1))
// Phase 1: matrix 5 rows 6 cols
[2022-05-22 07:12:10] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-22 07:12:10] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-22 07:12:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 07:12:10] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-22 07:12:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 07:12:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-22 07:12:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 07:12:10] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-22 07:12:10] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 07:12:10] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2)), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (G (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 5 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 3 AP to 1 states, 1 edges and 0 AP.
FORMULA TwoPhaseLocking-PT-nC10000vD-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLFireability-07 finished in 956 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||(F((X(F(p1))||p2))&&F(p0)&&p1))))'
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 07:12:10] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-22 07:12:10] [INFO ] Implicit Places using invariants in 23 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s6 1), p2:(AND (GEQ s3 1) (GEQ s4 1)), p0:(AND (GEQ s0 1) (GEQ s1 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 45 ms.
Product exploration explored 100000 steps with 50000 reset in 45 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X p0)]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 3 states, 4 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA TwoPhaseLocking-PT-nC10000vD-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLFireability-08 finished in 406 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U p0)&&!(X(!p0) U 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
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 5 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 07:12:10] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 07:12:10] [INFO ] Implicit Places using invariants in 28 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/8 places, 4/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 5/8 places, 4/6 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (OR p1 p0), (AND (NOT p0) p1)]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s4 1), p1:(AND (GEQ s0 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC10000vD-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLFireability-09 finished in 228 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U F(X(F((X(p1)||p2))))))||G(p0)))'
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 07:12:10] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 07:12:10] [INFO ] Implicit Places using invariants in 19 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p2:(AND (GEQ s5 1) (GEQ s3 1) (GEQ s4 1)), p1:(GEQ s2 1), p0:(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, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 11591 reset in 52 ms.
Product exploration explored 100000 steps with 11560 reset in 62 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 3 factoid took 206 ms. Reduced automaton from 7 states, 11 edges and 3 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Finished Best-First random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 3 factoid took 189 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 07:12:12] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 07:12:12] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-22 07:12:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 07:12:12] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-22 07:12:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 07:12:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-22 07:12:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 07:12:12] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-22 07:12:12] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 07:12:12] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 07:12:12] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 07:12:12] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 07:12:12] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-22 07:12:12] [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 7 cols
[2022-05-22 07:12:12] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 07:12:12] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=3334 ) properties (out of 1) seen :0
Finished Best-First random walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 07:12:12] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 07:12:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-22 07:12:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 07:12:13] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-22 07:12:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 07:12:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-22 07:12:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 07:12:13] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-22 07:12:13] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-22 07:12:13] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 11550 reset in 59 ms.
Product exploration explored 100000 steps with 11599 reset in 69 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2022-05-22 07:12:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 07:12:13] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 07:12:13] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 6/6 transitions.
Product exploration explored 100000 steps with 11551 reset in 93 ms.
Product exploration explored 100000 steps with 11607 reset in 134 ms.
Built C files in :
/tmp/ltsmin6738182373062499470
[2022-05-22 07:12:13] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6738182373062499470
Running compilation step : cd /tmp/ltsmin6738182373062499470;'/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 69 ms.
Running link step : cd /tmp/ltsmin6738182373062499470;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin6738182373062499470;'/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/stateBased4721820093431725497.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 07:12:28] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-22 07:12:28] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 07:12:28] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 07:12:28] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 07:12:28] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-22 07:12:28] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 6/6 transitions.
Built C files in :
/tmp/ltsmin2278145813461848055
[2022-05-22 07:12:28] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2278145813461848055
Running compilation step : cd /tmp/ltsmin2278145813461848055;'/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/ltsmin2278145813461848055;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2278145813461848055;'/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/stateBased16224104854652306015.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-22 07:12:44] [INFO ] Flatten gal took : 1 ms
[2022-05-22 07:12:44] [INFO ] Flatten gal took : 2 ms
[2022-05-22 07:12:44] [INFO ] Time to serialize gal into /tmp/LTL15381938077017036619.gal : 0 ms
[2022-05-22 07:12:44] [INFO ] Time to serialize properties into /tmp/LTL10095295774792503082.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/LTL15381938077017036619.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10095295774792503082.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/LTL1538193...268
Read 1 LTL properties
Checking formula 0 : !(((X(("(haveAandB>=1)")U(F(X(F((X("(haveA2>=1)"))||("(((haveAandB>=1)&&(resA>=1))&&(haveB>=1))")))))))||(G("(haveAandB>=1)"))))
Formula 0 simplified : !(X("(haveAandB>=1)" U FXF("(((haveAandB>=1)&&(resA>=1))&&(haveB>=1))" | X"(haveA2>=1)")) | G"(haveAandB>=1)")
Detected timeout of ITS tools.
[2022-05-22 07:12:59] [INFO ] Flatten gal took : 1 ms
[2022-05-22 07:12:59] [INFO ] Applying decomposition
[2022-05-22 07:12:59] [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/graph8599057279479105236.txt' '-o' '/tmp/graph8599057279479105236.bin' '-w' '/tmp/graph8599057279479105236.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8599057279479105236.bin' '-l' '-1' '-v' '-w' '/tmp/graph8599057279479105236.weights' '-q' '0' '-e' '0.001'
[2022-05-22 07:12:59] [INFO ] Decomposing Gal with order
[2022-05-22 07:12:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 07:12:59] [INFO ] Flatten gal took : 1 ms
[2022-05-22 07:12:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-22 07:12:59] [INFO ] Time to serialize gal into /tmp/LTL13489687565020234515.gal : 0 ms
[2022-05-22 07:12:59] [INFO ] Time to serialize properties into /tmp/LTL2436336158518230309.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/LTL13489687565020234515.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2436336158518230309.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/LTL1348968...246
Read 1 LTL properties
Checking formula 0 : !(((X(("(i0.u2.haveAandB>=1)")U(F(X(F((X("(u1.haveA2>=1)"))||("(((i0.u2.haveAandB>=1)&&(u1.resA>=1))&&(i0.u2.haveB>=1))")))))))||(G("(...179
Formula 0 simplified : !(X("(i0.u2.haveAandB>=1)" U FXF("(((i0.u2.haveAandB>=1)&&(u1.resA>=1))&&(i0.u2.haveB>=1))" | X"(u1.haveA2>=1)")) | G"(i0.u2.haveAan...163
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1720569309949361585
[2022-05-22 07:13:14] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1720569309949361585
Running compilation step : cd /tmp/ltsmin1720569309949361585;'/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 64 ms.
Running link step : cd /tmp/ltsmin1720569309949361585;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin1720569309949361585;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(((LTLAPp0==true) U <>(X(<>((X((LTLAPp1==true))||(LTLAPp2==true)))))))||[]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLFireability-11 finished in 78325 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((!p0 U (G(p0)||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
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 6 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 07:13:29] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 07:13:29] [INFO ] Implicit Places using invariants in 25 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/8 places, 5/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 6/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s4 1), p0:(AND (GEQ s0 1) (GEQ s1 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 83 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC10000vD-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLFireability-12 finished in 269 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(X(!(X(p0) U p1))))||p2)))'
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 07:13:29] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 07:13:29] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 07:13:29] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 07:13:29] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 07:13:29] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 07:13:29] [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 175 ms :[(AND p1 (NOT p2)), p1, p1, (AND p1 p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(LT s7 1), p1:(GEQ s2 1), p0:(AND (GEQ s3 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 77 ms.
Stack based approach found an accepted trace after 154 steps with 0 reset with depth 155 and stack size 154 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC10000vD-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLFireability-14 finished in 339 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(F(p1))))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 07:13:29] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 07:13:29] [INFO ] Implicit Places using invariants in 55 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1)), p1:(OR (GEQ s2 1) (AND (GEQ s0 1) (GEQ s1 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 44 ms.
Product exploration explored 100000 steps with 50000 reset in 41 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 p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA TwoPhaseLocking-PT-nC10000vD-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLFireability-15 finished in 311 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((F(p0) U X(p0)) U p0))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||F(p1)||G(p2)))'
Found a SL insensitive property : TwoPhaseLocking-PT-nC10000vD-LTLFireability-03
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 2 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 07:13:30] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 07:13:30] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 07:13:30] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 07:13:30] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 07:13:30] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 07:13:30] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 7/8 places, 5/6 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/8 places, 5/6 transitions.
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (GEQ s3 1) (GEQ s4 1)), p2:(GEQ s6 1), 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, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 15124 reset in 80 ms.
Product exploration explored 100000 steps with 15069 reset in 83 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0))))]
Knowledge based reduction with 12 factoid took 615 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 3) seen :2
Finished Best-First random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 12 factoid took 587 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 79 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 7 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in 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 07:13:32] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 07:13:32] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 07:13:32] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 07:13:32] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 07:13:32] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 07:13:32] [INFO ] Dead Transitions using invariants and state equation in 16 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 p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 187 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 83 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 3) seen :2
Finished Best-First random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 238 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 :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 15072 reset in 62 ms.
Product exploration explored 100000 steps with 15088 reset in 75 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
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.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 7 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 7 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2022-05-22 07:13:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 07:13:33] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 07:13:33] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/7 places, 5/5 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 5/5 transitions.
Product exploration explored 100000 steps with 25015 reset in 86 ms.
Product exploration explored 100000 steps with 24924 reset in 86 ms.
Built C files in :
/tmp/ltsmin4730859205659030355
[2022-05-22 07:13:33] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4730859205659030355
Running compilation step : cd /tmp/ltsmin4730859205659030355;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 59 ms.
Running link step : cd /tmp/ltsmin4730859205659030355;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin4730859205659030355;'/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/stateBased1050861508923415650.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 2 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 07:13:48] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 07:13:48] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 07:13:48] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 07:13:48] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 07:13:48] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 07:13:48] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 5/5 transitions.
Built C files in :
/tmp/ltsmin5008542984768548061
[2022-05-22 07:13:48] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5008542984768548061
Running compilation step : cd /tmp/ltsmin5008542984768548061;'/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/ltsmin5008542984768548061;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin5008542984768548061;'/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/stateBased15467774749724683625.hoa' '--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( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.001: LTL layer using automaton file : /tmp/stateBased15467774749724683625.hoa
pins2lts-mc-linux64( 1/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.001: Using Spin LTL semantics
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( 6/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.007: "(LTLAPp1==true)&&(LTLAPp0==true)" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.008: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.079: DFS-FIFO for weak LTL, using special progress label 8
pins2lts-mc-linux64( 0/ 8), 0.079: There are 9 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.079: State length is 8, there are 9 groups
pins2lts-mc-linux64( 0/ 8), 0.079: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.079: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.079: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.079: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.090: ~1 levels ~960 states ~1512 transitions
pins2lts-mc-linux64( 2/ 8), 0.108: ~1 levels ~1920 states ~2992 transitions
pins2lts-mc-linux64( 2/ 8), 0.117: ~1 levels ~3840 states ~5928 transitions
pins2lts-mc-linux64( 7/ 8), 0.171: ~1 levels ~7680 states ~11896 transitions
pins2lts-mc-linux64( 7/ 8), 0.219: ~1 levels ~15360 states ~23112 transitions
pins2lts-mc-linux64( 7/ 8), 0.362: ~1 levels ~30720 states ~46256 transitions
pins2lts-mc-linux64( 2/ 8), 0.530: ~1 levels ~61440 states ~91368 transitions
pins2lts-mc-linux64( 2/ 8), 0.741: ~1 levels ~122880 states ~183120 transitions
pins2lts-mc-linux64( 2/ 8), 1.042: ~1 levels ~245760 states ~366816 transitions
pins2lts-mc-linux64( 2/ 8), 1.426: ~1 levels ~491520 states ~734536 transitions
pins2lts-mc-linux64( 1/ 8), 1.797: ~1 levels ~983040 states ~1480456 transitions
pins2lts-mc-linux64( 2/ 8), 2.196: ~1 levels ~1966080 states ~2942896 transitions
pins2lts-mc-linux64( 6/ 8), 2.914: ~1 levels ~3932160 states ~5900448 transitions
pins2lts-mc-linux64( 6/ 8), 4.449: ~1 levels ~7864320 states ~11799384 transitions
pins2lts-mc-linux64( 6/ 8), 8.127: ~1 levels ~15728640 states ~23596584 transitions
pins2lts-mc-linux64( 1/ 8), 11.551: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 11.607:
pins2lts-mc-linux64( 0/ 8), 11.607: mean standard work distribution: 5.0% (states) 5.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 11.607:
pins2lts-mc-linux64( 0/ 8), 11.607: Explored 16761829 states 25141862 transitions, fanout: 1.500
pins2lts-mc-linux64( 0/ 8), 11.607: Total exploration time 11.520 sec (11.460 sec minimum, 11.491 sec on average)
pins2lts-mc-linux64( 0/ 8), 11.607: States per second: 1455020, Transitions per second: 2182453
pins2lts-mc-linux64( 0/ 8), 11.607:
pins2lts-mc-linux64( 0/ 8), 11.607: Progress states detected: 16756003
pins2lts-mc-linux64( 0/ 8), 11.607: Redundant explorations: -0.0251
pins2lts-mc-linux64( 0/ 8), 11.607:
pins2lts-mc-linux64( 0/ 8), 11.607: Queue width: 8B, total height: 17275, memory: 0.13MB
pins2lts-mc-linux64( 0/ 8), 11.607: Tree memory: 383.9MB, 24.0 B/state, compr.: 70.6%
pins2lts-mc-linux64( 0/ 8), 11.607: Tree fill ratio (roots/leafs): 12.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 11.607: Stored 5 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 11.607: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 11.607: Est. total memory use: 384.0MB (~1024.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5008542984768548061;'/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/stateBased15467774749724683625.hoa' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5008542984768548061;'/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/stateBased15467774749724683625.hoa' '--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.run(LTSminRunner.java:117)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-22 07:14:00] [INFO ] Flatten gal took : 3 ms
[2022-05-22 07:14:00] [INFO ] Flatten gal took : 1 ms
[2022-05-22 07:14:00] [INFO ] Time to serialize gal into /tmp/LTL2102772224562970287.gal : 1 ms
[2022-05-22 07:14:00] [INFO ] Time to serialize properties into /tmp/LTL13489874573294027266.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/LTL2102772224562970287.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13489874573294027266.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/LTL2102772...267
Read 1 LTL properties
Checking formula 0 : !((((G(X("((resA>=1)&&(Clients>=1))")))||(F("((resA>=1)&&(haveB>=1))")))||(G("(haveAandB>=1)"))))
Formula 0 simplified : !(GX"((resA>=1)&&(Clients>=1))" | F"((resA>=1)&&(haveB>=1))" | G"(haveAandB>=1)")
Detected timeout of ITS tools.
[2022-05-22 07:14:15] [INFO ] Flatten gal took : 0 ms
[2022-05-22 07:14:15] [INFO ] Applying decomposition
[2022-05-22 07:14:15] [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/graph11044538456692723046.txt' '-o' '/tmp/graph11044538456692723046.bin' '-w' '/tmp/graph11044538456692723046.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11044538456692723046.bin' '-l' '-1' '-v' '-w' '/tmp/graph11044538456692723046.weights' '-q' '0' '-e' '0.001'
[2022-05-22 07:14:15] [INFO ] Decomposing Gal with order
[2022-05-22 07:14:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 07:14:15] [INFO ] Flatten gal took : 1 ms
[2022-05-22 07:14:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-22 07:14:15] [INFO ] Time to serialize gal into /tmp/LTL3052805149360196791.gal : 1 ms
[2022-05-22 07:14:15] [INFO ] Time to serialize properties into /tmp/LTL10647527360701719017.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/LTL3052805149360196791.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10647527360701719017.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/LTL3052805...246
Read 1 LTL properties
Checking formula 0 : !((((G(X("((i0.u1.resA>=1)&&(i0.u0.Clients>=1))")))||(F("((i0.u1.resA>=1)&&(u2.haveB>=1))")))||(G("(u2.haveAandB>=1)"))))
Formula 0 simplified : !(GX"((i0.u1.resA>=1)&&(i0.u0.Clients>=1))" | F"((i0.u1.resA>=1)&&(u2.haveB>=1))" | G"(u2.haveAandB>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5980338767288632846
[2022-05-22 07:14:30] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5980338767288632846
Running compilation step : cd /tmp/ltsmin5980338767288632846;'/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 76 ms.
Running link step : cd /tmp/ltsmin5980338767288632846;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin5980338767288632846;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](X((LTLAPp0==true)))||<>((LTLAPp1==true))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: LTL layer: formula: ([](X((LTLAPp0==true)))||<>((LTLAPp1==true))||[]((LTLAPp2==true)))
pins2lts-mc-linux64( 1/ 8), 0.004: "([](X((LTLAPp0==true)))||<>((LTLAPp1==true))||[]((LTLAPp2==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.068: DFS-FIFO for weak LTL, using special progress label 9
pins2lts-mc-linux64( 0/ 8), 0.068: There are 10 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.068: State length is 8, there are 16 groups
pins2lts-mc-linux64( 0/ 8), 0.068: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.068: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.068: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.068: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.080: ~1 levels ~960 states ~1536 transitions
pins2lts-mc-linux64( 0/ 8), 0.093: ~1 levels ~1920 states ~3008 transitions
pins2lts-mc-linux64( 2/ 8), 0.117: ~1 levels ~3840 states ~5896 transitions
pins2lts-mc-linux64( 2/ 8), 0.135: ~1 levels ~7680 states ~11672 transitions
pins2lts-mc-linux64( 2/ 8), 0.170: ~1 levels ~15360 states ~23296 transitions
pins2lts-mc-linux64( 2/ 8), 0.237: ~1 levels ~30720 states ~46256 transitions
pins2lts-mc-linux64( 2/ 8), 0.441: ~1 levels ~61440 states ~92040 transitions
pins2lts-mc-linux64( 2/ 8), 0.720: ~1 levels ~122880 states ~184464 transitions
pins2lts-mc-linux64( 4/ 8), 1.277: ~1 levels ~245760 states ~369584 transitions
pins2lts-mc-linux64( 4/ 8), 2.030: ~1 levels ~491520 states ~738464 transitions
pins2lts-mc-linux64( 4/ 8), 2.904: ~1 levels ~983040 states ~1476128 transitions
pins2lts-mc-linux64( 4/ 8), 3.626: ~1 levels ~1966080 states ~2951192 transitions
pins2lts-mc-linux64( 1/ 8), 4.395: ~1 levels ~3932160 states ~5890848 transitions
pins2lts-mc-linux64( 1/ 8), 6.015: ~1 levels ~7864320 states ~11784320 transitions
pins2lts-mc-linux64( 1/ 8), 9.808: ~1 levels ~15728640 states ~23576176 transitions
pins2lts-mc-linux64( 2/ 8), 13.540: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 13.640:
pins2lts-mc-linux64( 0/ 8), 13.640: mean standard work distribution: 4.5% (states) 4.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 13.640:
pins2lts-mc-linux64( 0/ 8), 13.640: Explored 16761777 states 25141945 transitions, fanout: 1.500
pins2lts-mc-linux64( 0/ 8), 13.640: Total exploration time 13.570 sec (13.490 sec minimum, 13.531 sec on average)
pins2lts-mc-linux64( 0/ 8), 13.640: States per second: 1235208, Transitions per second: 1852759
pins2lts-mc-linux64( 0/ 8), 13.640:
pins2lts-mc-linux64( 0/ 8), 13.640: Progress states detected: 16755998
pins2lts-mc-linux64( 0/ 8), 13.640: Redundant explorations: -0.0253
pins2lts-mc-linux64( 0/ 8), 13.640:
pins2lts-mc-linux64( 0/ 8), 13.640: Queue width: 8B, total height: 17548, memory: 0.13MB
pins2lts-mc-linux64( 0/ 8), 13.640: Tree memory: 383.9MB, 24.0 B/state, compr.: 70.6%
pins2lts-mc-linux64( 0/ 8), 13.640: Tree fill ratio (roots/leafs): 12.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 13.640: Stored 5 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 13.640: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 13.640: Est. total memory use: 384.0MB (~1024.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5980338767288632846;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](X((LTLAPp0==true)))||<>((LTLAPp1==true))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5980338767288632846;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](X((LTLAPp0==true)))||<>((LTLAPp1==true))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLFireability-03 finished in 74409 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U F(X(F((X(p1)||p2))))))||G(p0)))'
Found a CL insensitive property : TwoPhaseLocking-PT-nC10000vD-LTLFireability-11
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 4 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 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 07:14:45] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 07:14:45] [INFO ] Implicit Places using invariants in 27 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/8 places, 6/6 transitions.
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p2:(AND (GEQ s5 1) (GEQ s3 1) (GEQ s4 1)), p1:(GEQ s2 1), p0:(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, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 11582 reset in 56 ms.
Product exploration explored 100000 steps with 11563 reset in 71 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 3 factoid took 221 ms. Reduced automaton from 7 states, 11 edges and 3 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=3334 ) properties (out of 1) seen :0
Finished Best-First random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 07:14:46] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 07:14:46] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-22 07:14:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 07:14:46] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-22 07:14:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 07:14:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-22 07:14:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 07:14:46] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-22 07:14:46] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 07:14:46] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 07:14:46] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 07:14:46] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 07:14:46] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 07:14:46] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 07:14:46] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 07:14:46] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=3334 ) properties (out of 1) seen :0
Finished Best-First random walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), true]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 4 states, 4 edges and 2 AP to 4 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 07:14:46] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 07:14:46] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-22 07:14:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 07:14:46] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-22 07:14:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 07:14:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-22 07:14:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 07:14:46] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-22 07:14:46] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-22 07:14:46] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 11525 reset in 56 ms.
Product exploration explored 100000 steps with 11608 reset in 57 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2022-05-22 07:14:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 07:14:47] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 07:14:47] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 6/6 transitions.
Product exploration explored 100000 steps with 11605 reset in 62 ms.
Product exploration explored 100000 steps with 11522 reset in 65 ms.
Built C files in :
/tmp/ltsmin10068223659473089891
[2022-05-22 07:14:47] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10068223659473089891
Running compilation step : cd /tmp/ltsmin10068223659473089891;'/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/ltsmin10068223659473089891;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin10068223659473089891;'/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/stateBased17377931081999768302.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 3 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 07:15:02] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 07:15:02] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 07:15:02] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 07:15:02] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 07:15:02] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 07:15:02] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 6/6 transitions.
Built C files in :
/tmp/ltsmin15634800149511841264
[2022-05-22 07:15:02] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15634800149511841264
Running compilation step : cd /tmp/ltsmin15634800149511841264;'/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 65 ms.
Running link step : cd /tmp/ltsmin15634800149511841264;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin15634800149511841264;'/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/stateBased17465486793617949667.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-22 07:15:17] [INFO ] Flatten gal took : 2 ms
[2022-05-22 07:15:17] [INFO ] Flatten gal took : 1 ms
[2022-05-22 07:15:17] [INFO ] Time to serialize gal into /tmp/LTL14295472574799661605.gal : 1 ms
[2022-05-22 07:15:17] [INFO ] Time to serialize properties into /tmp/LTL11470220529821093874.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/LTL14295472574799661605.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11470220529821093874.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/LTL1429547...268
Read 1 LTL properties
Checking formula 0 : !(((X(("(haveAandB>=1)")U(F(X(F((X("(haveA2>=1)"))||("(((haveAandB>=1)&&(resA>=1))&&(haveB>=1))")))))))||(G("(haveAandB>=1)"))))
Formula 0 simplified : !(X("(haveAandB>=1)" U FXF("(((haveAandB>=1)&&(resA>=1))&&(haveB>=1))" | X"(haveA2>=1)")) | G"(haveAandB>=1)")
Detected timeout of ITS tools.
[2022-05-22 07:15:32] [INFO ] Flatten gal took : 3 ms
[2022-05-22 07:15:32] [INFO ] Applying decomposition
[2022-05-22 07:15:32] [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/graph6053967826098230652.txt' '-o' '/tmp/graph6053967826098230652.bin' '-w' '/tmp/graph6053967826098230652.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6053967826098230652.bin' '-l' '-1' '-v' '-w' '/tmp/graph6053967826098230652.weights' '-q' '0' '-e' '0.001'
[2022-05-22 07:15:32] [INFO ] Decomposing Gal with order
[2022-05-22 07:15:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 07:15:32] [INFO ] Flatten gal took : 1 ms
[2022-05-22 07:15:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-22 07:15:32] [INFO ] Time to serialize gal into /tmp/LTL270212209178020308.gal : 1 ms
[2022-05-22 07:15:32] [INFO ] Time to serialize properties into /tmp/LTL3371142708704117668.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/LTL270212209178020308.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3371142708704117668.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/LTL2702122...244
Read 1 LTL properties
Checking formula 0 : !(((X(("(i1.u1.haveAandB>=1)")U(F(X(F((X("(u0.haveA2>=1)"))||("(((i1.u1.haveAandB>=1)&&(u0.resA>=1))&&(i1.u1.haveB>=1))")))))))||(G("(...179
Formula 0 simplified : !(X("(i1.u1.haveAandB>=1)" U FXF("(((i1.u1.haveAandB>=1)&&(u0.resA>=1))&&(i1.u1.haveB>=1))" | X"(u0.haveA2>=1)")) | G"(i1.u1.haveAan...163
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10548957263251329779
[2022-05-22 07:15:47] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10548957263251329779
Running compilation step : cd /tmp/ltsmin10548957263251329779;'/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 76 ms.
Running link step : cd /tmp/ltsmin10548957263251329779;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10548957263251329779;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(((LTLAPp0==true) U <>(X(<>((X((LTLAPp1==true))||(LTLAPp2==true)))))))||[]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLFireability-11 finished in 78260 ms.
[2022-05-22 07:16:02] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10763790933540429715
[2022-05-22 07:16:02] [INFO ] Applying decomposition
[2022-05-22 07:16:02] [INFO ] Flatten gal took : 0 ms
[2022-05-22 07:16:02] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-22 07:16:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 07:16:02] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-22 07:16:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 07:16:02] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-22 07:16:02] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 07:16:02] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10763790933540429715
Running compilation step : cd /tmp/ltsmin10763790933540429715;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' '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'
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/graph9151047935375634435.txt' '-o' '/tmp/graph9151047935375634435.bin' '-w' '/tmp/graph9151047935375634435.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9151047935375634435.bin' '-l' '-1' '-v' '-w' '/tmp/graph9151047935375634435.weights' '-q' '0' '-e' '0.001'
[2022-05-22 07:16:02] [INFO ] Decomposing Gal with order
[2022-05-22 07:16:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 07:16:02] [INFO ] Flatten gal took : 1 ms
[2022-05-22 07:16:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-22 07:16:02] [INFO ] Time to serialize gal into /tmp/LTLFireability3053512193458444917.gal : 1 ms
[2022-05-22 07:16:02] [INFO ] Time to serialize properties into /tmp/LTLFireability3365355723844951445.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/LTLFireability3053512193458444917.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3365355723844951445.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 3 LTL properties
Checking formula 0 : !((X(G(((F("(u2.haveA2>=1)"))U(X("(u2.haveA2>=1)")))U("(u2.haveA2>=1)")))))
Formula 0 simplified : !XG((F"(u2.haveA2>=1)" U X"(u2.haveA2>=1)") U "(u2.haveA2>=1)")
Compilation finished in 86 ms.
Running link step : cd /tmp/ltsmin10763790933540429715;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin10763790933540429715;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((<>((LTLAPp0==true)) U X((LTLAPp0==true))) U (LTLAPp0==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: LTL layer: formula: X([](((<>((LTLAPp0==true)) U X((LTLAPp0==true))) U (LTLAPp0==true))))
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: "X([](((<>((LTLAPp0==true)) U X((LTLAPp0==true))) U (LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.065: DFS-FIFO for weak LTL, using special progress label 12
pins2lts-mc-linux64( 0/ 8), 0.065: There are 13 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.066: State length is 9, there are 9 groups
pins2lts-mc-linux64( 0/ 8), 0.066: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.066: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.066: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.066: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.087: ~97 levels ~960 states ~3168 transitions
pins2lts-mc-linux64( 6/ 8), 0.116: ~193 levels ~1920 states ~6848 transitions
pins2lts-mc-linux64( 6/ 8), 0.173: ~390 levels ~3840 states ~14248 transitions
pins2lts-mc-linux64( 2/ 8), 0.285: ~782 levels ~7680 states ~28584 transitions
pins2lts-mc-linux64( 2/ 8), 0.449: ~1557 levels ~15360 states ~57768 transitions
pins2lts-mc-linux64( 2/ 8), 0.695: ~3141 levels ~30720 states ~117568 transitions
pins2lts-mc-linux64( 6/ 8), 0.989: ~6347 levels ~61440 states ~245888 transitions
pins2lts-mc-linux64( 2/ 8), 1.385: ~12764 levels ~122880 states ~500560 transitions
pins2lts-mc-linux64( 4/ 8), 1.670: ~20002 levels ~245760 states ~885928 transitions
pins2lts-mc-linux64( 5/ 8), 1.892: ~20002 levels ~491520 states ~1369240 transitions
pins2lts-mc-linux64( 4/ 8), 2.184: ~20002 levels ~983040 states ~2338976 transitions
pins2lts-mc-linux64( 3/ 8), 2.796: ~20002 levels ~1966080 states ~4964048 transitions
pins2lts-mc-linux64( 4/ 8), 4.047: ~20002 levels ~3932160 states ~8204696 transitions
pins2lts-mc-linux64( 3/ 8), 6.603: ~20002 levels ~7864320 states ~19198320 transitions
pins2lts-mc-linux64( 3/ 8), 11.790: ~20002 levels ~15728640 states ~38316096 transitions
pins2lts-mc-linux64( 3/ 8), 24.177: ~20002 levels ~31457280 states ~76718368 transitions
pins2lts-mc-linux64( 4/ 8), 51.991: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 52.027:
pins2lts-mc-linux64( 0/ 8), 52.027: mean standard work distribution: 3.1% (states) 3.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 52.027:
pins2lts-mc-linux64( 0/ 8), 52.027: Explored 59987026 states 146718051 transitions, fanout: 2.446
pins2lts-mc-linux64( 0/ 8), 52.027: Total exploration time 51.950 sec (51.880 sec minimum, 51.910 sec on average)
pins2lts-mc-linux64( 0/ 8), 52.027: States per second: 1154707, Transitions per second: 2824216
pins2lts-mc-linux64( 0/ 8), 52.027:
pins2lts-mc-linux64( 0/ 8), 52.027: Progress states detected: 1
pins2lts-mc-linux64( 0/ 8), 52.027: Redundant explorations: -0.9685
pins2lts-mc-linux64( 0/ 8), 52.027:
pins2lts-mc-linux64( 0/ 8), 52.027: Queue width: 8B, total height: 160024, memory: 1.22MB
pins2lts-mc-linux64( 0/ 8), 52.027: Tree memory: 718.1MB, 12.4 B/state, compr.: 32.7%
pins2lts-mc-linux64( 0/ 8), 52.027: Tree fill ratio (roots/leafs): 45.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 52.027: Stored 7 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 52.027: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 52.027: Est. total memory use: 719.4MB (~1025.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10763790933540429715;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((<>((LTLAPp0==true)) U X((LTLAPp0==true))) U (LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10763790933540429715;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](((<>((LTLAPp0==true)) U X((LTLAPp0==true))) U (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:38:16] [INFO ] Flatten gal took : 1 ms
[2022-05-22 07:38:16] [INFO ] Time to serialize gal into /tmp/LTLFireability16224150914040913361.gal : 0 ms
[2022-05-22 07:38:16] [INFO ] Time to serialize properties into /tmp/LTLFireability17635234092836819830.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/LTLFireability16224150914040913361.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17635234092836819830.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...290
Read 3 LTL properties
Checking formula 0 : !((X(G(((F("(haveA2>=1)"))U(X("(haveA2>=1)")))U("(haveA2>=1)")))))
Formula 0 simplified : !XG((F"(haveA2>=1)" U X"(haveA2>=1)") U "(haveA2>=1)")
Detected timeout of ITS tools.
[2022-05-22 08:00:29] [INFO ] Flatten gal took : 3 ms
[2022-05-22 08:00:29] [INFO ] Input system was already deterministic with 6 transitions.
[2022-05-22 08:00:29] [INFO ] Transformed 8 places.
[2022-05-22 08:00:29] [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 08:00:29] [INFO ] Time to serialize gal into /tmp/LTLFireability39684792527201116.gal : 1 ms
[2022-05-22 08:00:29] [INFO ] Time to serialize properties into /tmp/LTLFireability58951955933963083.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/LTLFireability39684792527201116.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability58951955933963083.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...329
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(((F("(haveA2>=1)"))U(X("(haveA2>=1)")))U("(haveA2>=1)")))))
Formula 0 simplified : !XG((F"(haveA2>=1)" U X"(haveA2>=1)") U "(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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination 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-nC10000vD"
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-nC10000vD, 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-165303546300876"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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