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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 8.0K Apr 30 10:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 30 10:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 30 10:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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 16K 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-nC02000vN-LTLFireability-00
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLFireability-01
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLFireability-02
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLFireability-03
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLFireability-04
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLFireability-05
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLFireability-06
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLFireability-07
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLFireability-08
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLFireability-09
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLFireability-10
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLFireability-11
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLFireability-12
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLFireability-13
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLFireability-14
FORMULA_NAME TwoPhaseLocking-PT-nC02000vN-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653196077711

Running Version 202205111006
[2022-05-22 05:07:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-22 05:07:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-22 05:07:59] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2022-05-22 05:07:59] [INFO ] Transformed 8 places.
[2022-05-22 05:07:59] [INFO ] Transformed 6 transitions.
[2022-05-22 05:07:59] [INFO ] Parsed PT model containing 8 places and 6 transitions in 141 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 3 formulas.
FORMULA TwoPhaseLocking-PT-nC02000vN-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC02000vN-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC02000vN-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 7 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:07:59] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-22 05:07:59] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:07:59] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:07:59] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:07:59] [INFO ] Computed 3 place invariants in 11 ms
[2022-05-22 05:07:59] [INFO ] Dead Transitions using invariants and state equation in 48 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 05:07:59] [INFO ] Flatten gal took : 13 ms
[2022-05-22 05:07:59] [INFO ] Flatten gal took : 3 ms
[2022-05-22 05:07:59] [INFO ] Input system was already deterministic with 6 transitions.
Incomplete random walk after 10012 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=435 ) properties (out of 10) seen :8
Finished Best-First random walk after 49 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=24 )
FORMULA TwoPhaseLocking-PT-nC02000vN-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(X(X(X(!p0)))&&(F(p1) U p0)) U 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 05:07:59] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-22 05:07:59] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:07:59] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:07:59] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:07:59] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:07:59] [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.
Stuttering acceptance computed with spot in 642 ms :[(NOT p0), false, false, (NOT p0), false, false, (AND (NOT p0) p1), (NOT p0), true, false, (AND p1 (NOT p0)), p0, (AND p0 p1), p1]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vN-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 7}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 7}, { cond=(NOT p0), acceptance={} source=4 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 10}], [{ cond=p0, acceptance={} source=5 dest: 7}, { cond=(NOT p0), acceptance={} source=5 dest: 9}], [{ cond=p1, acceptance={} source=6 dest: 7}, { cond=(NOT p1), acceptance={} source=6 dest: 10}], [{ cond=(NOT p0), acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={} source=9 dest: 11}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 12}], [{ cond=(AND (NOT p0) p1), acceptance={} source=10 dest: 8}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=10 dest: 13}], [{ cond=p0, acceptance={} source=11 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=11 dest: 11}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=11 dest: 12}], [{ cond=(AND p0 p1), acceptance={} source=12 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=12 dest: 11}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=12 dest: 12}, { cond=(AND p0 (NOT p1)), acceptance={} source=12 dest: 13}], [{ cond=p1, acceptance={} source=13 dest: 8}, { cond=(NOT p1), acceptance={} source=13 dest: 13}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1)), p1:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 2 ms.
FORMULA TwoPhaseLocking-PT-nC02000vN-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC02000vN-LTLFireability-00 finished in 797 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((X(X(!F(X(p0))))||F(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
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 11 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 05:08:00] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:08:00] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:08:00] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:08:00] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2022-05-22 05:08:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:08:00] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:08:00] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/8 places, 4/6 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/8 places, 4/6 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vN-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 s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7768 reset in 204 ms.
Product exploration explored 100000 steps with 11051 reset in 190 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))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 164 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 52 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1002 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=501 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 119 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 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:08:01] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:01] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 05:08:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 05:08:01] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-22 05:08:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 05:08:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 05:08:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 05:08:01] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-22 05:08:01] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-22 05:08:01] [INFO ] Added : 2 causal constraints over 1 iterations in 26 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, 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 05:08:01] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:01] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:08:01] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:08:01] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2022-05-22 05:08:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:08:01] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:01] [INFO ] Dead Transitions using invariants and state equation in 23 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 102 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 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1002 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=501 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 155 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)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:08:02] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:08:02] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 05:08:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 05:08:02] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-22 05:08:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 05:08:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-22 05:08:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 05:08:02] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-22 05:08:02] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 05:08:02] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11357 reset in 97 ms.
Product exploration explored 100000 steps with 12696 reset in 105 ms.
Built C files in :
/tmp/ltsmin3757548446021433423
[2022-05-22 05:08:02] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2022-05-22 05:08:02] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:08:02] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2022-05-22 05:08:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:08:02] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2022-05-22 05:08:02] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:08:02] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3757548446021433423
Running compilation step : cd /tmp/ltsmin3757548446021433423;'/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 197 ms.
Running link step : cd /tmp/ltsmin3757548446021433423;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin3757548446021433423;'/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/stateBased8563198917916260076.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, 4/4 transitions.
Applied a total of 0 rules in 3 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 05:08:17] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:17] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:08:17] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:08:17] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2022-05-22 05:08:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:08:18] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-22 05:08:18] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 4/4 transitions.
Built C files in :
/tmp/ltsmin4814794991343090029
[2022-05-22 05:08:18] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2022-05-22 05:08:18] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:08:18] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2022-05-22 05:08:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:08:18] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2022-05-22 05:08:18] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:08:18] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4814794991343090029
Running compilation step : cd /tmp/ltsmin4814794991343090029;'/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 71 ms.
Running link step : cd /tmp/ltsmin4814794991343090029;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin4814794991343090029;'/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/stateBased16939980214957679380.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-22 05:08:33] [INFO ] Flatten gal took : 2 ms
[2022-05-22 05:08:33] [INFO ] Flatten gal took : 1 ms
[2022-05-22 05:08:33] [INFO ] Time to serialize gal into /tmp/LTL18425299705838850077.gal : 1 ms
[2022-05-22 05:08:33] [INFO ] Time to serialize properties into /tmp/LTL14734610563763736931.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/LTL18425299705838850077.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14734610563763736931.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/LTL1842529...268
Read 1 LTL properties
Checking formula 0 : !((G((F((X(X(!(F(X("(haveAandB>=1)"))))))||(F("(haveAandB>=1)"))))U("(haveAandB>=1)"))))
Formula 0 simplified : !G(F(XX!FX"(haveAandB>=1)" | F"(haveAandB>=1)") U "(haveAandB>=1)")
Detected timeout of ITS tools.
[2022-05-22 05:08:48] [INFO ] Flatten gal took : 1 ms
[2022-05-22 05:08:48] [INFO ] Applying decomposition
[2022-05-22 05:08:48] [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/graph364855498110274498.txt' '-o' '/tmp/graph364855498110274498.bin' '-w' '/tmp/graph364855498110274498.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph364855498110274498.bin' '-l' '-1' '-v' '-w' '/tmp/graph364855498110274498.weights' '-q' '0' '-e' '0.001'
[2022-05-22 05:08:48] [INFO ] Decomposing Gal with order
[2022-05-22 05:08:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 05:08:48] [INFO ] Flatten gal took : 35 ms
[2022-05-22 05:08:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-22 05:08:48] [INFO ] Time to serialize gal into /tmp/LTL11164682498212818196.gal : 1 ms
[2022-05-22 05:08:48] [INFO ] Time to serialize properties into /tmp/LTL13265519111048566426.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/LTL11164682498212818196.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13265519111048566426.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/LTL1116468...247
Read 1 LTL properties
Checking formula 0 : !((G((F((X(X(!(F(X("(u1.haveAandB>=1)"))))))||(F("(u1.haveAandB>=1)"))))U("(u1.haveAandB>=1)"))))
Formula 0 simplified : !G(F(XX!FX"(u1.haveAandB>=1)" | F"(u1.haveAandB>=1)") U "(u1.haveAandB>=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9966994103217200986
[2022-05-22 05:09:03] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9966994103217200986
Running compilation step : cd /tmp/ltsmin9966994103217200986;'/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 55 ms.
Running link step : cd /tmp/ltsmin9966994103217200986;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9966994103217200986;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((X(X(!<>(X((LTLAPp0==true)))))||<>((LTLAPp0==true)))) U (LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TwoPhaseLocking-PT-nC02000vN-LTLFireability-01 finished in 77797 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((G(p0)||p1))&&X(!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 05:09:18] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:09:18] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:09:18] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:09:18] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:09:18] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:09:18] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (OR (NOT p1) p0), (OR (NOT p1) p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vN-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s3 1) (LT s5 1)), p1:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 1 ms.
FORMULA TwoPhaseLocking-PT-nC02000vN-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC02000vN-LTLFireability-02 finished in 199 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 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 05:09:18] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:09:18] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:09:18] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:09:18] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-22 05:09:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:09:18] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-22 05:09:18] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/8 places, 4/6 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/8 places, 4/6 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vN-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 67 ms.
Product exploration explored 100000 steps with 50000 reset in 77 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 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA TwoPhaseLocking-PT-nC02000vN-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TwoPhaseLocking-PT-nC02000vN-LTLFireability-05 finished in 361 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(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
Applied a total of 2 rules in 5 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 05:09:19] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:09:19] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 05:09:19] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:09:19] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2022-05-22 05:09:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 05:09:19] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:09:19] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/8 places, 5/6 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vN-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10317 reset in 52 ms.
Product exploration explored 100000 steps with 10269 reset in 88 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 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 3004 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1502 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 05:09:19] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:09:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 05:09:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 05:09:19] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-22 05:09:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 05:09:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 05:09:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 05:09:19] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-22 05:09:19] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 05:09:19] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 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 05:09:19] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:09:19] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 05:09:19] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:09:19] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2022-05-22 05:09:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 05:09:19] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-22 05:09:19] [INFO ] Dead Transitions using invariants and state equation in 23 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 3004 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1001 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
// Phase 1: matrix 5 rows 7 cols
[2022-05-22 05:09:20] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:09:20] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 05:09:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 05:09:20] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-22 05:09:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 05:09:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 05:09:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 05:09:20] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-22 05:09:20] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 05:09:20] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10227 reset in 67 ms.
Product exploration explored 100000 steps with 10266 reset in 58 ms.
Built C files in :
/tmp/ltsmin7703034684674919557
[2022-05-22 05:09:20] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-22 05:09:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:09:20] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-22 05:09:20] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:09:20] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-22 05:09:20] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:09:20] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7703034684674919557
Running compilation step : cd /tmp/ltsmin7703034684674919557;'/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 78 ms.
Running link step : cd /tmp/ltsmin7703034684674919557;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin7703034684674919557;'/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/stateBased2940105516397540774.hoa' '--buchi-type=spotba'
LTSmin run took 4408 ms.
FORMULA TwoPhaseLocking-PT-nC02000vN-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TwoPhaseLocking-PT-nC02000vN-LTLFireability-06 finished in 5898 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(G(F(((G(p1)||p2)&&p0)))))||X(X(!p1))))'
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 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 05:09:24] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:09:24] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:09:24] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-22 05:09:24] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:09:24] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:09:24] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vN-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p0))), acceptance={0} source=5 dest: 3}, { cond=(OR (AND p1 (NOT p2)) (AND p1 (NOT p0))), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s1 1)), p0:(AND (GEQ s3 1) (GEQ s5 1)), p2:(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, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 108 ms.
Product exploration explored 100000 steps with 0 reset in 157 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 6 states, 10 edges and 3 AP to 6 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1112 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:09:25] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:09:25] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p2) p0 p1)))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (OR (AND (NOT p2) p1) (AND (NOT p0) p1))), (F (OR (AND (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1)))), (F p1), (F (OR (AND (NOT p2) (NOT p1)) (NOT p0)))]
Knowledge based reduction with 3 factoid took 275 ms. Reduced automaton from 6 states, 9 edges and 3 AP to 5 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 226 ms :[(AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 193 ms :[(AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT 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 05:09:26] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:09:26] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:09:26] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:09:26] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:09:26] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:09:26] [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.
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) p2 p0)]
False Knowledge obtained : [(X (X (AND p1 p2))), (X (X (NOT (AND p1 p2))))]
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 5 states, 6 edges and 3 AP to 5 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 198 ms :[(AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0))]
Finished random walk after 1001 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1001 )
Knowledge obtained : [(AND (NOT p1) p2 p0)]
False Knowledge obtained : [(X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (F (AND p1 p2)), (F (OR (NOT p0) (NOT p2)))]
Knowledge based reduction with 1 factoid took 140 ms. Reduced automaton from 5 states, 6 edges and 3 AP to 5 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 183 ms :[(AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 213 ms :[(AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 194 ms :[(AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 1 reset in 75 ms.
Product exploration explored 100000 steps with 0 reset in 197 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 188 ms :[(AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (AND p1 p2 (NOT p0)), (OR (NOT p0) (NOT p2)), (OR (NOT p2) (NOT 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.
Applied a total of 0 rules in 3 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2022-05-22 05:09:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:09:28] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:09:28] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Product exploration explored 100000 steps with 3 reset in 74 ms.
Product exploration explored 100000 steps with 2 reset in 124 ms.
Built C files in :
/tmp/ltsmin4618793914763940725
[2022-05-22 05:09:28] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4618793914763940725
Running compilation step : cd /tmp/ltsmin4618793914763940725;'/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 68 ms.
Running link step : cd /tmp/ltsmin4618793914763940725;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin4618793914763940725;'/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/stateBased16821262631445880505.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 3 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:09:43] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-22 05:09:43] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:09:43] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:09:43] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:09:43] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:09:43] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Built C files in :
/tmp/ltsmin207689899254146078
[2022-05-22 05:09:43] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin207689899254146078
Running compilation step : cd /tmp/ltsmin207689899254146078;'/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/ltsmin207689899254146078;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin207689899254146078;'/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/stateBased16998592019367401054.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-22 05:09:58] [INFO ] Flatten gal took : 2 ms
[2022-05-22 05:09:58] [INFO ] Flatten gal took : 2 ms
[2022-05-22 05:09:58] [INFO ] Time to serialize gal into /tmp/LTL5559210279904565375.gal : 1 ms
[2022-05-22 05:09:58] [INFO ] Time to serialize properties into /tmp/LTL9624550754489670712.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/LTL5559210279904565375.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9624550754489670712.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/LTL5559210...266
Read 1 LTL properties
Checking formula 0 : !(((G(F(G(F((((G("((resB>=1)&&(haveA>=1))"))||("((resA>=1)&&(Clients>=1))"))&&("(resA>=1)"))&&("(Clients>=1)"))))))||(X(X("((resB<1)||...171
Formula 0 simplified : !(GFGF("(Clients>=1)" & "(resA>=1)" & ("((resA>=1)&&(Clients>=1))" | G"((resB>=1)&&(haveA>=1))")) | XX"((resB<1)||(haveA<1))")
Detected timeout of ITS tools.
[2022-05-22 05:10:14] [INFO ] Flatten gal took : 4 ms
[2022-05-22 05:10:14] [INFO ] Applying decomposition
[2022-05-22 05:10:14] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11948288873957301479.txt' '-o' '/tmp/graph11948288873957301479.bin' '-w' '/tmp/graph11948288873957301479.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11948288873957301479.bin' '-l' '-1' '-v' '-w' '/tmp/graph11948288873957301479.weights' '-q' '0' '-e' '0.001'
[2022-05-22 05:10:14] [INFO ] Decomposing Gal with order
[2022-05-22 05:10:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 05:10:14] [INFO ] Flatten gal took : 2 ms
[2022-05-22 05:10:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-22 05:10:14] [INFO ] Time to serialize gal into /tmp/LTL7563630992300807571.gal : 0 ms
[2022-05-22 05:10:14] [INFO ] Time to serialize properties into /tmp/LTL9606658622987187032.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/LTL7563630992300807571.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9606658622987187032.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/LTL7563630...245
Read 1 LTL properties
Checking formula 0 : !(((G(F(G(F((((G("((u2.resB>=1)&&(u0.haveA>=1))"))||("((u1.resA>=1)&&(u0.Clients>=1))"))&&("(u1.resA>=1)"))&&("(u0.Clients>=1)"))))))|...195
Formula 0 simplified : !(GFGF("(u0.Clients>=1)" & "(u1.resA>=1)" & ("((u1.resA>=1)&&(u0.Clients>=1))" | G"((u2.resB>=1)&&(u0.haveA>=1))")) | XX"((u2.resB<1...173
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4627316905816648882
[2022-05-22 05:10:29] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4627316905816648882
Running compilation step : cd /tmp/ltsmin4627316905816648882;'/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/ltsmin4627316905816648882;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin4627316905816648882;'/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' '([](<>([](<>((([]((LTLAPp1==true))||(LTLAPp2==true))&&(LTLAPp0==true))))))||X(X(!(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TwoPhaseLocking-PT-nC02000vN-LTLFireability-07 finished in 79245 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 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 05:10:44] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:10:44] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:10:44] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:10:44] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:10:44] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:10:44] [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.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vN-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s7 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 10187 reset in 55 ms.
Product exploration explored 100000 steps with 10254 reset in 59 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 88 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1668 ) properties (out of 1) seen :0
Finished Best-First random walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:10:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:10:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 05:10:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 05:10:44] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-22 05:10:44] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-22 05:10:44] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT 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 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 05:10:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:10:44] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:10:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:10:44] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2022-05-22 05:10:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:10:44] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:10:44] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/8 places, 4/6 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/8 places, 4/6 transitions.
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 129 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 2003 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2003 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:10:45] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-22 05:10:45] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-22 05:10:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 05:10:45] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-22 05:10:45] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-22 05:10:45] [INFO ] Added : 1 causal constraints over 1 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 15140 reset in 58 ms.
Product exploration explored 100000 steps with 15141 reset in 65 ms.
Built C files in :
/tmp/ltsmin3756377302971823509
[2022-05-22 05:10:45] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2022-05-22 05:10:45] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:10:45] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2022-05-22 05:10:45] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:10:45] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2022-05-22 05:10:45] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:10:45] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3756377302971823509
Running compilation step : cd /tmp/ltsmin3756377302971823509;'/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 91 ms.
Running link step : cd /tmp/ltsmin3756377302971823509;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3756377302971823509;'/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/stateBased16099869483421247801.hoa' '--buchi-type=spotba'
LTSmin run took 728 ms.
FORMULA TwoPhaseLocking-PT-nC02000vN-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TwoPhaseLocking-PT-nC02000vN-LTLFireability-08 finished in 2183 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(X(p0)))))'
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 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 05:10:46] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:10:46] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:10:46] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:10:46] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2022-05-22 05:10:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:10:46] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:10:46] [INFO ] Dead Transitions using invariants and state equation in 16 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 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vN-LTLFireability-09 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:(OR (LT s0 1) (LT s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 150 reset in 63 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC02000vN-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC02000vN-LTLFireability-09 finished in 191 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(G(p0)))))'
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
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 8 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 05:10:46] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:10:46] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:10:46] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:10:46] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2022-05-22 05:10:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:10:46] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:10:46] [INFO ] Dead Transitions using invariants and state equation in 17 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 27 ms :[(NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vN-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 57 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 1 ms.
FORMULA TwoPhaseLocking-PT-nC02000vN-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC02000vN-LTLFireability-10 finished in 186 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 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 05:10:46] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:10:46] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:10:46] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:10:46] [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 05:10:46] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:10:46] [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 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vN-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(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-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 68 ms.
Product exploration explored 100000 steps with 0 reset in 182 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1001 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=500 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 190 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:10:47] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:10:47] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:10:47] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:10:47] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:10:47] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:10:47] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1001 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=500 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 73 ms.
Product exploration explored 100000 steps with 0 reset in 159 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
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 3 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2022-05-22 05:10:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:10:48] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:10:48] [INFO ] Dead Transitions using invariants and state equation in 19 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 0 reset in 59 ms.
Product exploration explored 100000 steps with 0 reset in 105 ms.
Built C files in :
/tmp/ltsmin9575604958916285638
[2022-05-22 05:10:49] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9575604958916285638
Running compilation step : cd /tmp/ltsmin9575604958916285638;'/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/ltsmin9575604958916285638;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin9575604958916285638;'/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/stateBased8674035837801535225.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 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 05:11:04] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:11:04] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:11:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:11:04] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:11:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:11:04] [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/ltsmin15948497058104647982
[2022-05-22 05:11:04] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15948497058104647982
Running compilation step : cd /tmp/ltsmin15948497058104647982;'/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/ltsmin15948497058104647982;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin15948497058104647982;'/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/stateBased11080247254574902041.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-22 05:11:19] [INFO ] Flatten gal took : 1 ms
[2022-05-22 05:11:19] [INFO ] Flatten gal took : 1 ms
[2022-05-22 05:11:19] [INFO ] Time to serialize gal into /tmp/LTL5736509262903674764.gal : 1 ms
[2022-05-22 05:11:19] [INFO ] Time to serialize properties into /tmp/LTL3370432626499885129.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/LTL5736509262903674764.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3370432626499885129.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/LTL5736509...266
Read 1 LTL properties
Checking formula 0 : !((X(G("((resA>=1)&&(Clients>=1))"))))
Formula 0 simplified : !XG"((resA>=1)&&(Clients>=1))"
Detected timeout of ITS tools.
[2022-05-22 05:11:34] [INFO ] Flatten gal took : 1 ms
[2022-05-22 05:11:34] [INFO ] Applying decomposition
[2022-05-22 05:11:34] [INFO ] Flatten gal took : 0 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12052806549303927554.txt' '-o' '/tmp/graph12052806549303927554.bin' '-w' '/tmp/graph12052806549303927554.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12052806549303927554.bin' '-l' '-1' '-v' '-w' '/tmp/graph12052806549303927554.weights' '-q' '0' '-e' '0.001'
[2022-05-22 05:11:34] [INFO ] Decomposing Gal with order
[2022-05-22 05:11:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 05:11:34] [INFO ] Flatten gal took : 1 ms
[2022-05-22 05:11:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-22 05:11:34] [INFO ] Time to serialize gal into /tmp/LTL15323048195070324318.gal : 3 ms
[2022-05-22 05:11:34] [INFO ] Time to serialize properties into /tmp/LTL4246674617892681304.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/LTL15323048195070324318.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4246674617892681304.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/LTL1532304...246
Read 1 LTL properties
Checking formula 0 : !((X(G("((u0.resA>=1)&&(u1.Clients>=1))"))))
Formula 0 simplified : !XG"((u0.resA>=1)&&(u1.Clients>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13810115767929615673
[2022-05-22 05:11:49] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13810115767929615673
Running compilation step : cd /tmp/ltsmin13810115767929615673;'/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 71 ms.
Running link step : cd /tmp/ltsmin13810115767929615673;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin13810115767929615673;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TwoPhaseLocking-PT-nC02000vN-LTLFireability-12 finished in 77849 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(X(((F(p1)||p2)&&p0)))||p1)))'
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 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 05:12:04] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:12:04] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:12:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:12:04] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-22 05:12:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:12:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:12:04] [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 74 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vN-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s4 1)), p1:(AND (GEQ s0 1) (GEQ s1 1)), p2:(LT s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 50000 reset in 75 ms.
Product exploration explored 100000 steps with 50000 reset in 87 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) p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 7 factoid took 346 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Finished random walk after 3003 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=1001 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))))), (F (AND p0 (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 332 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 76 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 64 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:12:05] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:12:05] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-22 05:12:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 05:12:05] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-22 05:12:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 05:12:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 05:12:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 05:12:05] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-22 05:12:05] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-22 05:12:05] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 7 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:12:05] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:12:05] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:12:05] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:12:05] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-22 05:12:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:12:05] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:12:06] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
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) p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 7 factoid took 279 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 61 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Finished random walk after 3003 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=750 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))))), (F (AND p0 (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 360 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 64 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 68 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:12:06] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:12:06] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-22 05:12:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 05:12:06] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-22 05:12:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 05:12:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2022-05-22 05:12:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 05:12:06] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-22 05:12:06] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-22 05:12:06] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 68 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 50000 reset in 66 ms.
Product exploration explored 100000 steps with 50000 reset in 63 ms.
Built C files in :
/tmp/ltsmin14367907755453386092
[2022-05-22 05:12:07] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-22 05:12:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:12:07] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-22 05:12:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:12:07] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-22 05:12:07] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:12:07] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14367907755453386092
Running compilation step : cd /tmp/ltsmin14367907755453386092;'/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/ltsmin14367907755453386092;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin14367907755453386092;'/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/stateBased184012484514030446.hoa' '--buchi-type=spotba'
LTSmin run took 60 ms.
FORMULA TwoPhaseLocking-PT-nC02000vN-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TwoPhaseLocking-PT-nC02000vN-LTLFireability-13 finished in 2810 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G((p1 U (X(p2)&&G(p3))))))'
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:12:07] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:12:07] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 05:12:07] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:12:07] [INFO ] Implicit Places using invariants and state equation in 18 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 05:12:07] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:12:07] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 497 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p2) p3)), true, (AND p3 (NOT p2)), (NOT p3), (OR (NOT p3) (NOT p2)), (NOT p2), (NOT p3), (OR (NOT p2) (NOT p3))]
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vN-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p3 p1), acceptance={} source=0 dest: 2}, { cond=(AND p3 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND p3 p1 (NOT p0)), acceptance={} source=2 dest: 8}, { cond=(OR (AND p3 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=2 dest: 10}], [{ cond=(OR (AND (NOT p3) p1 (NOT p0)) (AND p3 (NOT p0) (NOT p2))), acceptance={} source=3 dest: 4}, { cond=(AND p3 p1 (NOT p0) p2), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=5 dest: 4}], [{ cond=(NOT p3), acceptance={} source=6 dest: 4}, { cond=p3, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND p3 (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p3 (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p3) p1), acceptance={0} source=7 dest: 7}, { cond=(AND p3 p1), acceptance={0} source=7 dest: 8}, { cond=(AND p3 p1), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=8 dest: 4}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={0} source=8 dest: 7}, { cond=(AND p3 p1 (NOT p2)), acceptance={0} source=8 dest: 8}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=9 dest: 4}, { cond=(AND p3 (NOT p1)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p3) p1), acceptance={0} source=9 dest: 7}, { cond=(AND p3 p1), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=10 dest: 4}, { cond=(AND p3 (NOT p1)), acceptance={} source=10 dest: 5}, { cond=(AND p3 (NOT p1)), acceptance={} source=10 dest: 6}, { cond=(AND (NOT p3) p1), acceptance={} source=10 dest: 7}, { cond=(AND p3 p1), acceptance={} source=10 dest: 8}, { cond=(OR p3 p1), acceptance={} source=10 dest: 10}]], initial=0, aps=[p3:(AND (GEQ s3 1) (GEQ s4 1)), p1:(GEQ s7 1), p0:(GEQ s2 1), p2:(AND (GEQ s2 1) (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, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC02000vN-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC02000vN-LTLFireability-14 finished in 586 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((X(X(!F(X(p0))))||F(p0))) U p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(G(F(((G(p1)||p2)&&p0)))))||X(X(!p1))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a SL insensitive property : TwoPhaseLocking-PT-nC02000vN-LTLFireability-12
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 7 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 3 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:12:08] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:12:08] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:12:08] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:12:08] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:12:08] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:12:08] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 6/8 places, 4/6 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/8 places, 4/6 transitions.
Running random walk in product with property : TwoPhaseLocking-PT-nC02000vN-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(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-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 58 ms.
Product exploration explored 100000 steps with 0 reset in 111 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1001 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=500 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 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 0 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 05:12:09] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:12:09] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:12:09] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:12:09] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:12:09] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:12:09] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 4/4 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1001 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=200 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 58 ms.
Product exploration explored 100000 steps with 0 reset in 89 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2022-05-22 05:12:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:12:10] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 05:12:10] [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.
Product exploration explored 100000 steps with 0 reset in 60 ms.
Product exploration explored 100000 steps with 0 reset in 71 ms.
Built C files in :
/tmp/ltsmin16621215527532459038
[2022-05-22 05:12:10] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16621215527532459038
Running compilation step : cd /tmp/ltsmin16621215527532459038;'/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/ltsmin16621215527532459038;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin16621215527532459038;'/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/stateBased10708602023680793346.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in 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 05:12:25] [INFO ] Computed 3 place invariants in 12 ms
[2022-05-22 05:12:25] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:12:25] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:12:25] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 05:12:25] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 05:12:25] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 4/4 transitions.
Built C files in :
/tmp/ltsmin13843555991659699721
[2022-05-22 05:12:25] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13843555991659699721
Running compilation step : cd /tmp/ltsmin13843555991659699721;'/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/ltsmin13843555991659699721;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin13843555991659699721;'/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/stateBased4586662305405966567.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-22 05:12:40] [INFO ] Flatten gal took : 2 ms
[2022-05-22 05:12:40] [INFO ] Flatten gal took : 1 ms
[2022-05-22 05:12:40] [INFO ] Time to serialize gal into /tmp/LTL16558891659506431470.gal : 1 ms
[2022-05-22 05:12:40] [INFO ] Time to serialize properties into /tmp/LTL15474101865192048766.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/LTL16558891659506431470.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15474101865192048766.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/LTL1655889...268
Read 1 LTL properties
Checking formula 0 : !((X(G("((resA>=1)&&(Clients>=1))"))))
Formula 0 simplified : !XG"((resA>=1)&&(Clients>=1))"
Detected timeout of ITS tools.
[2022-05-22 05:12:55] [INFO ] Flatten gal took : 1 ms
[2022-05-22 05:12:55] [INFO ] Applying decomposition
[2022-05-22 05:12:55] [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/graph9812636085992456029.txt' '-o' '/tmp/graph9812636085992456029.bin' '-w' '/tmp/graph9812636085992456029.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9812636085992456029.bin' '-l' '-1' '-v' '-w' '/tmp/graph9812636085992456029.weights' '-q' '0' '-e' '0.001'
[2022-05-22 05:12:55] [INFO ] Decomposing Gal with order
[2022-05-22 05:12:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 05:12:55] [INFO ] Flatten gal took : 1 ms
[2022-05-22 05:12:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-22 05:12:55] [INFO ] Time to serialize gal into /tmp/LTL11597196743280432355.gal : 1 ms
[2022-05-22 05:12:55] [INFO ] Time to serialize properties into /tmp/LTL10679718922063600801.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/LTL11597196743280432355.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10679718922063600801.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/LTL1159719...247
Read 1 LTL properties
Checking formula 0 : !((X(G("((i1.u2.resA>=1)&&(i1.u1.Clients>=1))"))))
Formula 0 simplified : !XG"((i1.u2.resA>=1)&&(i1.u1.Clients>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5025943949297361017
[2022-05-22 05:13:10] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5025943949297361017
Running compilation step : cd /tmp/ltsmin5025943949297361017;'/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 60 ms.
Running link step : cd /tmp/ltsmin5025943949297361017;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin5025943949297361017;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property TwoPhaseLocking-PT-nC02000vN-LTLFireability-12 finished in 77579 ms.
[2022-05-22 05:13:25] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
[2022-05-22 05:13:25] [INFO ] Applying decomposition
[2022-05-22 05:13:25] [INFO ] Flatten gal took : 1 ms
Built C files in :
/tmp/ltsmin14909443544323037404
[2022-05-22 05:13:25] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2022-05-22 05:13:25] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:13:25] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2022-05-22 05:13:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph2053361266708505085.txt' '-o' '/tmp/graph2053361266708505085.bin' '-w' '/tmp/graph2053361266708505085.weights'
[2022-05-22 05:13:25] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2022-05-22 05:13:25] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 05:13:25] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14909443544323037404
Running compilation step : cd /tmp/ltsmin14909443544323037404;'/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'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2053361266708505085.bin' '-l' '-1' '-v' '-w' '/tmp/graph2053361266708505085.weights' '-q' '0' '-e' '0.001'
[2022-05-22 05:13:25] [INFO ] Decomposing Gal with order
[2022-05-22 05:13:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 05:13:25] [INFO ] Flatten gal took : 1 ms
[2022-05-22 05:13:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-22 05:13:25] [INFO ] Time to serialize gal into /tmp/LTLFireability12297347139153645050.gal : 1 ms
[2022-05-22 05:13:25] [INFO ] Time to serialize properties into /tmp/LTLFireability4304870440139882037.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/LTLFireability12297347139153645050.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4304870440139882037.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...268
Read 3 LTL properties
Checking formula 0 : !((G((F((X(X(!(F(X("(u1.haveAandB>=1)"))))))||(F("(u1.haveAandB>=1)"))))U("(u1.haveAandB>=1)"))))
Formula 0 simplified : !G(F(XX!FX"(u1.haveAandB>=1)" | F"(u1.haveAandB>=1)") U "(u1.haveAandB>=1)")
Compilation finished in 82 ms.
Running link step : cd /tmp/ltsmin14909443544323037404;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 20 ms.
Running LTSmin : cd /tmp/ltsmin14909443544323037404;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((X(X(!<>(X((LTLAPp0==true)))))||<>((LTLAPp0==true)))) U (LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.000: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: LTL layer: formula: []((<>((X(X(!<>(X((LTLAPp0==true)))))||<>((LTLAPp0==true)))) U (LTLAPp0==true)))
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: "[]((<>((X(X(!<>(X((LTLAPp0==true)))))||<>((LTLAPp0==true)))) U (LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.002: 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( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: 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( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: buchi has 2 states
pins2lts-mc-linux64( 0/ 8), 0.011: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.049: DFS-FIFO for weak LTL, using special progress label 11
pins2lts-mc-linux64( 0/ 8), 0.049: There are 12 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.049: State length is 9, there are 9 groups
pins2lts-mc-linux64( 0/ 8), 0.049: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.049: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.049: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.049: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.066: ~86 levels ~960 states ~1376 transitions
pins2lts-mc-linux64( 0/ 8), 0.092: ~171 levels ~1920 states ~2736 transitions
pins2lts-mc-linux64( 0/ 8), 0.157: ~374 levels ~3840 states ~5984 transitions
pins2lts-mc-linux64( 2/ 8), 0.263: ~805 levels ~7680 states ~12880 transitions
pins2lts-mc-linux64( 4/ 8), 2.400: ~978 levels ~15360 states ~29648 transitions
pins2lts-mc-linux64( 7/ 8), 3.249: ~1000 levels ~30720 states ~63488 transitions
pins2lts-mc-linux64( 2/ 8), 4.700: ~1002 levels ~61440 states ~150120 transitions
pins2lts-mc-linux64( 2/ 8), 7.635: ~1002 levels ~122880 states ~342728 transitions
pins2lts-mc-linux64( 3/ 8), 9.117: ~1005 levels ~245760 states ~746904 transitions
pins2lts-mc-linux64( 3/ 8), 11.662: ~1005 levels ~491520 states ~1549624 transitions
pins2lts-mc-linux64( 3/ 8), 15.283: ~1005 levels ~983040 states ~3307096 transitions
pins2lts-mc-linux64( 3/ 8), 21.148: ~1007 levels ~1966080 states ~6876784 transitions
pins2lts-mc-linux64( 7/ 8), 29.372: ~1016 levels ~3932160 states ~13154744 transitions
pins2lts-mc-linux64( 5/ 8), 35.096: ~1015 levels ~7864320 states ~24506584 transitions
pins2lts-mc-linux64( 0/ 8), 44.409: ~1026 levels ~15728640 states ~48875384 transitions
pins2lts-mc-linux64( 3/ 8), 64.235: ~1033 levels ~31457280 states ~100919400 transitions
pins2lts-mc-linux64( 5/ 8), 105.990: ~1045 levels ~62914560 states ~194051288 transitions
pins2lts-mc-linux64( 5/ 8), 184.930: ~1056 levels ~125829120 states ~391728448 transitions
pins2lts-mc-linux64( 1/ 8), 320.978: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 321.017:
pins2lts-mc-linux64( 0/ 8), 321.017: mean standard work distribution: 3.6% (states) 8.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 321.017:
pins2lts-mc-linux64( 0/ 8), 321.017: Explored 186867158 states 674298528 transitions, fanout: 3.608
pins2lts-mc-linux64( 0/ 8), 321.017: Total exploration time 320.940 sec (320.880 sec minimum, 320.909 sec on average)
pins2lts-mc-linux64( 0/ 8), 321.017: States per second: 582250, Transitions per second: 2101011
pins2lts-mc-linux64( 0/ 8), 321.017:
pins2lts-mc-linux64( 0/ 8), 321.018: Progress states detected: 30705568
pins2lts-mc-linux64( 0/ 8), 321.018: Redundant explorations: 39.2275
pins2lts-mc-linux64( 0/ 8), 321.018:
pins2lts-mc-linux64( 0/ 8), 321.018: Queue width: 8B, total height: 1601844, memory: 12.22MB
pins2lts-mc-linux64( 0/ 8), 321.018: Tree memory: 1102.0MB, 8.6 B/state, compr.: 22.7%
pins2lts-mc-linux64( 0/ 8), 321.018: Tree fill ratio (roots/leafs): 99.0%/30.0%
pins2lts-mc-linux64( 0/ 8), 321.018: Stored 7 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 321.018: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 321.018: Est. total memory use: 1114.2MB (~1036.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14909443544323037404;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((X(X(!<>(X((LTLAPp0==true)))))||<>((LTLAPp0==true)))) U (LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14909443544323037404;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((X(X(!<>(X((LTLAPp0==true)))))||<>((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 05:35:13] [INFO ] Flatten gal took : 1 ms
[2022-05-22 05:35:13] [INFO ] Time to serialize gal into /tmp/LTLFireability13121978127517992383.gal : 1 ms
[2022-05-22 05:35:13] [INFO ] Time to serialize properties into /tmp/LTLFireability297145262376733344.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/LTLFireability13121978127517992383.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability297145262376733344.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...288
Read 3 LTL properties
Checking formula 0 : !((G((F((X(X(!(F(X("(haveAandB>=1)"))))))||(F("(haveAandB>=1)"))))U("(haveAandB>=1)"))))
Formula 0 simplified : !G(F(XX!FX"(haveAandB>=1)" | F"(haveAandB>=1)") U "(haveAandB>=1)")
Detected timeout of ITS tools.
[2022-05-22 05:57:02] [INFO ] Flatten gal took : 3 ms
[2022-05-22 05:57:02] [INFO ] Input system was already deterministic with 6 transitions.
[2022-05-22 05:57:02] [INFO ] Transformed 8 places.
[2022-05-22 05:57:02] [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 05:57:02] [INFO ] Time to serialize gal into /tmp/LTLFireability10475147777568902040.gal : 1 ms
[2022-05-22 05:57:02] [INFO ] Time to serialize properties into /tmp/LTLFireability9196764341013489594.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/LTLFireability10475147777568902040.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9196764341013489594.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...334
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((F((X(X(!(F(X("(haveAandB>=1)"))))))||(F("(haveAandB>=1)"))))U("(haveAandB>=1)"))))
Formula 0 simplified : !G(F(XX!FX"(haveAandB>=1)" | F"(haveAandB>=1)") U "(haveAandB>=1)")

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination 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-nC02000vN"
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-nC02000vN, 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-165303546300852"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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