About the Execution of ITS-Tools for TwoPhaseLocking-PT-nC01000vD
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 296.472 | 14116.00 | 21805.00 | 188.10 | TFFFFFFFFFFFFFFF | normal |
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-165303546200828.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-nC01000vD, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303546200828
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 7.0K Apr 30 10:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 30 10:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 30 10:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 30 10:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 9 09:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 09:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 09:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 09:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 09:18 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-nC01000vD-LTLFireability-00
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-LTLFireability-01
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-LTLFireability-02
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-LTLFireability-03
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-LTLFireability-04
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-LTLFireability-05
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-LTLFireability-06
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-LTLFireability-07
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-LTLFireability-08
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-LTLFireability-09
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-LTLFireability-10
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-LTLFireability-11
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-LTLFireability-12
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-LTLFireability-13
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-LTLFireability-14
FORMULA_NAME TwoPhaseLocking-PT-nC01000vD-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1653190588645
Running Version 202205111006
[2022-05-22 03:36:29] [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 03:36:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-22 03:36:29] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2022-05-22 03:36:29] [INFO ] Transformed 8 places.
[2022-05-22 03:36:29] [INFO ] Transformed 6 transitions.
[2022-05-22 03:36:29] [INFO ] Parsed PT model containing 8 places and 6 transitions in 131 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 2 formulas.
FORMULA TwoPhaseLocking-PT-nC01000vD-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC01000vD-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 6 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 03:36:30] [INFO ] Computed 3 place invariants in 7 ms
[2022-05-22 03:36:30] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 03:36:30] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-22 03:36:30] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 03:36:30] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-22 03:36:30] [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.
Support contains 8 out of 8 places after structural reductions.
[2022-05-22 03:36:30] [INFO ] Flatten gal took : 13 ms
[2022-05-22 03:36:30] [INFO ] Flatten gal took : 2 ms
[2022-05-22 03:36:30] [INFO ] Input system was already deterministic with 6 transitions.
Incomplete random walk after 10022 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=323 ) properties (out of 11) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 03:36:30] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 03:36:30] [INFO ] After 28ms 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.
FORMULA TwoPhaseLocking-PT-nC01000vD-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
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' '!(F(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 03:36:30] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-22 03:36:30] [INFO ] Implicit Places using invariants in 27 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC01000vD-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s5 1) (LT s3 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 176 ms.
Product exploration explored 100000 steps with 50000 reset in 80 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA TwoPhaseLocking-PT-nC01000vD-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TwoPhaseLocking-PT-nC01000vD-LTLFireability-00 finished in 598 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U G(p0)))'
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 7 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 9 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 03:36:31] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 03:36:31] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 03:36:31] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 03:36:31] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2022-05-22 03:36:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 03:36:31] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 03:36:31] [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 39 ms :[(NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC01000vD-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, 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-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 133 ms.
Product exploration explored 100000 steps with 0 reset in 242 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 501 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=501 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 233 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 03:36:32] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 03:36:32] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 03:36:32] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 03:36:32] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2022-05-22 03:36:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-22 03:36:32] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 03:36:32] [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.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 501 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=250 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 78 ms.
Product exploration explored 100000 steps with 0 reset in 128 ms.
Built C files in :
/tmp/ltsmin14282165748586546200
[2022-05-22 03:36:33] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2022-05-22 03:36:33] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 03:36:33] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2022-05-22 03:36:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 03:36:33] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2022-05-22 03:36:33] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-22 03:36:33] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14282165748586546200
Running compilation step : cd /tmp/ltsmin14282165748586546200;'/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 157 ms.
Running link step : cd /tmp/ltsmin14282165748586546200;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin14282165748586546200;'/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/stateBased15793357890505611650.hoa' '--buchi-type=spotba'
LTSmin run took 172 ms.
FORMULA TwoPhaseLocking-PT-nC01000vD-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TwoPhaseLocking-PT-nC01000vD-LTLFireability-01 finished in 2044 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(G((X(X(X(p0)))&&p1)))))&&X(F(p2))))'
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 03:36:33] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 03:36:33] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 03:36:33] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 03:36:33] [INFO ] Implicit Places using invariants and state equation in 26 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 03:36:33] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 03:36:33] [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.
Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC01000vD-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s0 1) (GEQ s1 1)), p1:(OR (LT s3 1) (LT s5 1)), p0:(AND (GEQ s3 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC01000vD-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC01000vD-LTLFireability-02 finished in 400 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(((p1 U X(!p1))||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.
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 03:36:33] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 03:36:33] [INFO ] Implicit Places using invariants in 22 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 2 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND p1 (NOT p0)), (AND (NOT p0) p1), (AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC01000vD-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s2 1), p0:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 33182 reset in 90 ms.
Product exploration explored 100000 steps with 33303 reset in 86 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 150 ms :[(AND p1 (NOT p0)), (AND (NOT p0) p1), (AND p1 (NOT p0)), (NOT p0)]
Incomplete random walk after 10023 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=911 ) properties (out of 3) seen :2
Finished Best-First random walk after 29 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p1), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 219 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 154 ms :[(AND p1 (NOT p0)), (AND (NOT p0) p1), (AND p1 (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[(AND p1 (NOT p0)), (AND (NOT p0) p1), (AND p1 (NOT p0)), (NOT p0)]
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 03:36:35] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 03:36:35] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 03:36:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-22 03:36:35] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2022-05-22 03:36:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 03:36:35] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-22 03:36:35] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 142 ms :[(AND p1 (NOT p0)), (AND (NOT p0) p1), (AND p1 (NOT p0)), (NOT p0)]
Incomplete random walk after 10023 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=1670 ) properties (out of 3) seen :2
Finished Best-First random walk after 29 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p1), (F (NOT p0)), (F (AND (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 231 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 121 ms :[(AND p1 (NOT p0)), (AND (NOT p0) p1), (AND p1 (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[(AND p1 (NOT p0)), (AND (NOT p0) p1), (AND p1 (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(AND p1 (NOT p0)), (AND (NOT p0) p1), (AND p1 (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 33229 reset in 53 ms.
Stack based approach found an accepted trace after 7692 steps with 2511 reset with depth 49 and stack size 49 in 7 ms.
FORMULA TwoPhaseLocking-PT-nC01000vD-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC01000vD-LTLFireability-03 finished in 2360 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 03:36:36] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 03:36:36] [INFO ] Implicit Places using invariants in 21 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC01000vD-LTLFireability-04 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 s4 1) (GEQ s0 1) (GEQ s1 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC01000vD-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC01000vD-LTLFireability-04 finished in 121 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||X(G((!X(p0) U X(G(X(p1)))))))))'
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 03:36:36] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 03:36:36] [INFO ] Implicit Places using invariants in 19 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 20 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC01000vD-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(GEQ s2 1), p1:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6564 reset in 70 ms.
Product exploration explored 100000 steps with 6568 reset in 73 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)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 8 states, 14 edges and 2 AP to 8 states, 14 edges and 2 AP.
Stuttering acceptance computed with spot in 360 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Finished random walk after 6015 steps, including 2 resets, run visited all 4 properties in 12 ms. (steps per millisecond=501 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(F p1), (F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 203 ms. Reduced automaton from 8 states, 14 edges and 2 AP to 8 states, 14 edges and 2 AP.
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 03:36:38] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-22 03:36:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-22 03:36:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 03:36:38] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-22 03:36:38] [INFO ] Solution in real domain found non-integer solution.
Proved EG (AND (NOT p0) (NOT p1))
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(F p1), (F p0), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (G (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 8 states, 14 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA TwoPhaseLocking-PT-nC01000vD-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TwoPhaseLocking-PT-nC01000vD-LTLFireability-05 finished in 1957 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((G(p0)||X(!p0)))||(G(!p0)&&p1))))'
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 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 03:36:38] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 03:36:38] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 03:36:38] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 03:36:38] [INFO ] Implicit Places using invariants and state equation in 25 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 03:36:38] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-22 03:36:38] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 143 ms :[true, p0, (NOT p0), false, false]
Running random walk in product with property : TwoPhaseLocking-PT-nC01000vD-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (LT s3 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 74 ms.
Product exploration explored 100000 steps with 0 reset in 118 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)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 5 states, 9 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 73 ms :[true, p0, p0]
Finished random walk after 501 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=501 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 174 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 95 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 69 ms :[true, p0, p0]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 03:36:39] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 03:36:39] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 03:36:39] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 03:36:39] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 03:36:39] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 03:36:39] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 117 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 88 ms :[true, p0, p0]
Finished random walk after 501 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=501 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 171 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 82 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 59 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 69 ms :[true, p0, p0]
Entered a terminal (fully accepting) state of product in 68383 steps with 0 reset in 57 ms.
FORMULA TwoPhaseLocking-PT-nC01000vD-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC01000vD-LTLFireability-07 finished in 1765 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X((true U p1)))))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 03:36:40] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 03:36:40] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 03:36:40] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 03:36:40] [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 03:36:40] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 03:36:40] [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 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : TwoPhaseLocking-PT-nC01000vD-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s5 1)), p1:(GEQ s2 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3 reset in 152 ms.
Stack based approach found an accepted trace after 58 steps with 3 reset with depth 18 and stack size 18 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC01000vD-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC01000vD-LTLFireability-08 finished in 344 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||X(F(X(X(p1))))))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 03:36:40] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 03:36:40] [INFO ] Implicit Places using invariants in 18 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 18 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TwoPhaseLocking-PT-nC01000vD-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(LT s5 1), p0:(AND (GEQ s3 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3358 reset in 59 ms.
Stack based approach found an accepted trace after 126 steps with 11 reset with depth 64 and stack size 64 in 1 ms.
FORMULA TwoPhaseLocking-PT-nC01000vD-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC01000vD-LTLFireability-09 finished in 278 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((G(F((G(p0)||p0)))&&G(p1))))))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 3 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 03:36:40] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 03:36:40] [INFO ] Implicit Places using invariants in 21 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/8 places, 5/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 6/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC01000vD-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s4 1)), p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7767 reset in 65 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC01000vD-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC01000vD-LTLFireability-10 finished in 179 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 7 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 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 03:36:40] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 03:36:40] [INFO ] Implicit Places using invariants in 22 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/8 places, 4/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 5/8 places, 4/6 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC01000vD-LTLFireability-11 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 s3 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2040 reset in 63 ms.
Stack based approach found an accepted trace after 68 steps with 6 reset with depth 25 and stack size 23 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC01000vD-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC01000vD-LTLFireability-11 finished in 180 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(p0))))'
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 03:36:41] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 03:36:41] [INFO ] Implicit Places using invariants in 27 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC01000vD-LTLFireability-12 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 s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 10290 reset in 51 ms.
Product exploration explored 100000 steps with 10172 reset in 55 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 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)]
Finished random walk after 1504 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=501 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 98 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
// Phase 1: matrix 6 rows 7 cols
[2022-05-22 03:36:41] [INFO ] Computed 2 place invariants in 1 ms
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA TwoPhaseLocking-PT-nC01000vD-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TwoPhaseLocking-PT-nC01000vD-LTLFireability-12 finished in 612 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!X(X((F(p0)&&(F(p1) U p2)))) U !F(p3)))'
Support contains 6 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 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 03:36:41] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 03:36:41] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 03:36:41] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-22 03:36:41] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2022-05-22 03:36:41] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-22 03:36:41] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 857 ms :[p3, (AND p0 p2), (AND p0 p2 p3), (AND p0 p2), true, p0, p2, (AND p2 p1 p0), (AND p2 p1), (AND p0 p2 p3), p1, (AND p0 p1), (OR (AND (NOT p0) p3) (AND (NOT p2) p3)), false, (AND p0 p3 (NOT p2)), (AND p2 p1 p3 (NOT p0)), (AND (NOT p0) p2 p3), false, (OR (AND (NOT p0) p1 p3) (AND p1 (NOT p2) p3))]
Running random walk in product with property : TwoPhaseLocking-PT-nC01000vD-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 0}, { cond=p3, acceptance={0} source=0 dest: 0}, { cond=p3, acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p3, acceptance={} source=2 dest: 3}, { cond=(NOT p3), acceptance={} source=2 dest: 9}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 8}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}], [{ cond=p2, acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=7 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=7 dest: 8}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=7 dest: 10}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=7 dest: 11}], [{ cond=(AND p1 p2), acceptance={} source=8 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) p2), acceptance={} source=8 dest: 10}], [{ cond=(AND p3 p0 p2), acceptance={} source=9 dest: 4}, { cond=(AND p3 (NOT p0) p2), acceptance={} source=9 dest: 5}, { cond=(AND p3 p0 p1 (NOT p2)), acceptance={} source=9 dest: 6}, { cond=(AND p3 (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=9 dest: 7}, { cond=(AND p3 p0 (NOT p1) (NOT p2)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p3) p0 p2), acceptance={} source=9 dest: 12}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=9 dest: 13}, { cond=(AND (NOT p3) (NOT p0) p2), acceptance={} source=9 dest: 14}, { cond=(AND (NOT p3) p0 (NOT p1) (NOT p2)), acceptance={} source=9 dest: 15}, { cond=(AND (NOT p3) p0 p1 (NOT p2)), acceptance={} source=9 dest: 16}], [{ cond=p1, acceptance={} source=10 dest: 4}, { cond=(NOT p1), acceptance={} source=10 dest: 10}], [{ cond=(AND p0 p1), acceptance={} source=11 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=11 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=11 dest: 10}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=11 dest: 11}], [{ cond=(OR (AND p3 (NOT p0)) (AND p3 (NOT p2))), acceptance={} source=12 dest: 4}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p2))), acceptance={} source=12 dest: 12}], [{ cond=(AND p3 p0 (NOT p1) p2), acceptance={} source=13 dest: 10}, { cond=(AND p3 (NOT p0) (NOT p1) p2), acceptance={} source=13 dest: 11}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) p2), acceptance={} source=13 dest: 17}, { cond=(AND (NOT p3) p0 (NOT p1) p2), acceptance={} source=13 dest: 18}], [{ cond=(AND p3 p0 (NOT p2)), acceptance={} source=14 dest: 4}, { cond=(AND p3 (NOT p0) (NOT p2)), acceptance={} source=14 dest: 5}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={} source=14 dest: 12}, { cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=14 dest: 14}], [{ cond=(AND p3 (NOT p0) p1 p2), acceptance={} source=15 dest: 4}, { cond=(AND p3 (NOT p0) p1 (NOT p2)), acceptance={} source=15 dest: 6}, { cond=(AND p3 (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=15 dest: 8}, { cond=(AND p3 (NOT p1) p2), acceptance={} source=15 dest: 10}, { cond=(AND (NOT p3) (NOT p0) p1 p2), acceptance={} source=15 dest: 12}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=15 dest: 15}, { cond=(AND (NOT p3) (NOT p0) p1 (NOT p2)), acceptance={} source=15 dest: 16}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={} source=15 dest: 18}], [{ cond=(AND p3 (NOT p0) p2), acceptance={} source=16 dest: 4}, { cond=(AND p3 (NOT p0) p1 (NOT p2)), acceptance={} source=16 dest: 6}, { cond=(AND p3 (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=16 dest: 8}, { cond=(AND (NOT p3) (NOT p0) p2), acceptance={} source=16 dest: 12}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=16 dest: 15}, { cond=(AND (NOT p3) (NOT p0) p1 (NOT p2)), acceptance={} source=16 dest: 16}], [{ cond=(AND p3 p0 (NOT p1)), acceptance={} source=17 dest: 10}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=17 dest: 11}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=17 dest: 17}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=17 dest: 18}], [{ cond=(OR (AND p3 (NOT p0) p1) (AND p3 p1 (NOT p2))), acceptance={} source=18 dest: 4}, { cond=(AND p3 (NOT p1)), acceptance={} source=18 dest: 10}, { cond=(OR (AND (NOT p3) (NOT p0) p1) (AND (NOT p3) p1 (NOT p2))), acceptance={} source=18 dest: 12}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=18 dest: 18}]], initial=0, aps=[p3:(AND (GEQ s0 1) (GEQ s1 1)), p0:(GEQ s2 1), p1:(AND (GEQ s3 1) (GEQ s4 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, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC01000vD-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC01000vD-LTLFireability-13 finished in 961 ms.
All properties solved by simple procedures.
Total runtime 12871 ms.
BK_STOP 1653190602761
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TwoPhaseLocking-PT-nC01000vD"
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-nC01000vD, 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-165303546200828"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TwoPhaseLocking-PT-nC01000vD.tgz
mv TwoPhaseLocking-PT-nC01000vD 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 '
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 ;