Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.8K Feb 25 17:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 17:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 17:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 17:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Feb 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 17:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 17:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 4.6K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679225743903

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TwoPhaseLocking-PT-nC10000vD
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 11:35:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 11:35:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 11:35:45] [INFO ] Load time of PNML (sax parser for PT used): 16 ms
[2023-03-19 11:35:45] [INFO ] Transformed 8 places.
[2023-03-19 11:35:45] [INFO ] Transformed 6 transitions.
[2023-03-19 11:35:45] [INFO ] Parsed PT model containing 8 places and 6 transitions and 18 arcs in 72 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA TwoPhaseLocking-PT-nC10000vD-LTLCardinality-06 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 7 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-19 11:35:45] [INFO ] Computed 3 place invariants in 9 ms
[2023-03-19 11:35:45] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-19 11:35:45] [INFO ] Invariant cache hit.
[2023-03-19 11:35:45] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2023-03-19 11:35:45] [INFO ] Invariant cache hit.
[2023-03-19 11:35:45] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 212 ms. Remains : 8/8 places, 6/6 transitions.
Support contains 8 out of 8 places after structural reductions.
[2023-03-19 11:35:46] [INFO ] Flatten gal took : 11 ms
[2023-03-19 11:35:46] [INFO ] Flatten gal took : 3 ms
[2023-03-19 11:35:46] [INFO ] Input system was already deterministic with 6 transitions.
Incomplete random walk after 10003 steps, including 1 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 31) seen :12
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 19) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-19 11:35:46] [INFO ] Invariant cache hit.
[2023-03-19 11:35:46] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 11:35:46] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-19 11:35:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-19 11:35:46] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-19 11:35:46] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 128 ms.
[2023-03-19 11:35:46] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
Fused 9 Parikh solutions to 8 different solutions.
Finished Parikh walk after 9921 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=1240 )
Parikh walk visited 8 properties in 1991 ms.
FORMULA TwoPhaseLocking-PT-nC10000vD-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(F(p0))||(p1&&F(p0)&&X((p1 U (X(p2)||G(p1))))))))))'
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-19 11:35:48] [INFO ] Invariant cache hit.
[2023-03-19 11:35:48] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-19 11:35:48] [INFO ] Invariant cache hit.
[2023-03-19 11:35:48] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-19 11:35:48] [INFO ] Invariant cache hit.
[2023-03-19 11:35:49] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 408 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}, { cond=p1, acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(GT 2 s1), p0:(GT s4 s1), p2:(GT s5 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 837 reset in 185 ms.
Stack based approach found an accepted trace after 25 steps with 3 reset with depth 11 and stack size 11 in 1 ms.
FORMULA TwoPhaseLocking-PT-nC10000vD-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLCardinality-00 finished in 722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))&&(G(p1)||F(p2))))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 6 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-19 11:35:49] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 11:35:49] [INFO ] Implicit Places using invariants in 26 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 SI_LTL mode, iteration 1 : 6/8 places, 5/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 34 ms. Remains : 6/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 3 s1), p2:(LEQ 2 s5), p0:(LEQ 2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 112 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC10000vD-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLCardinality-01 finished in 314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U G((p1&&X(!p2))))))'
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-19 11:35:49] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-19 11:35:49] [INFO ] Implicit Places using invariants in 28 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 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 LTL mode , in 2 iterations and 30 ms. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), (NOT p0), p2, (AND (NOT p0) p1 p2)]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 2}]], initial=0, aps=[p1:(LEQ 1 s0), p0:(LEQ s2 s6), p2:(GT 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 11950 reset in 175 ms.
Stack based approach found an accepted trace after 57 steps with 7 reset with depth 10 and stack size 10 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC10000vD-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLCardinality-02 finished in 426 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(X(G(p0)))))||F(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.
[2023-03-19 11:35:50] [INFO ] Invariant cache hit.
[2023-03-19 11:35:50] [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 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20 ms. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (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-nC10000vD-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(LEQ 2 s2), p0:(GT 3 s6)], 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 2663 reset in 101 ms.
Stack based approach found an accepted trace after 568 steps with 12 reset with depth 58 and stack size 58 in 1 ms.
FORMULA TwoPhaseLocking-PT-nC10000vD-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLCardinality-03 finished in 343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&(p1||X(p2))))))'
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.
[2023-03-19 11:35:50] [INFO ] Invariant cache hit.
[2023-03-19 11:35:50] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-19 11:35:50] [INFO ] Invariant cache hit.
[2023-03-19 11:35:50] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-19 11:35:50] [INFO ] Invariant cache hit.
[2023-03-19 11:35:50] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLCardinality-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=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT 3 s0), p1:(GT s7 s0), p2:(GT 1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC10000vD-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLCardinality-04 finished in 244 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((p0&&F(!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.
[2023-03-19 11:35:50] [INFO ] Invariant cache hit.
[2023-03-19 11:35:50] [INFO ] Implicit Places using invariants in 30 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 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32 ms. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true, p1]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLCardinality-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=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=(AND p0 p1), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p1, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(GT 3 s4), p1:(LEQ 2 s3)], 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][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 87 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC10000vD-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLCardinality-05 finished in 370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(p1 U (p2||G(p1)))))))'
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-19 11:35:51] [INFO ] Invariant cache hit.
[2023-03-19 11:35:51] [INFO ] Implicit Places using invariants in 25 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 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 LTL mode , in 2 iterations and 27 ms. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(OR p0 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(AND (GT 2 s2) (GT s3 s5)), p1:(GT s3 s5), p0:(GT s6 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 266 ms.
Product exploration explored 100000 steps with 0 reset in 253 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 p2 p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (OR p0 p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X p2)), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 317 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :4
Finished Best-First random walk after 64 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=64 )
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (OR p0 p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X p2)), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (OR p0 p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p2)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 11 factoid took 560 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 125 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 5 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-19 11:35:53] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-19 11:35:53] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-19 11:35:53] [INFO ] Invariant cache hit.
[2023-03-19 11:35:53] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-19 11:35:53] [INFO ] Invariant cache hit.
[2023-03-19 11:35:53] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. 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 p1 p2 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (OR p0 p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 330 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 6 ms. (steps per millisecond=1667 ) properties (out of 6) seen :4
Finished Best-First random walk after 63 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=31 )
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (OR p0 p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (OR p0 p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p2)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 11 factoid took 436 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 116 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 132 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 64 ms.
Product exploration explored 100000 steps with 0 reset in 135 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 113 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 5 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.
[2023-03-19 11:35:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 11:35:55] [INFO ] Invariant cache hit.
[2023-03-19 11:35:55] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38 ms. Remains : 7/7 places, 6/6 transitions.
Support contains 5 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-19 11:35:55] [INFO ] Invariant cache hit.
[2023-03-19 11:35:55] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-19 11:35:55] [INFO ] Invariant cache hit.
[2023-03-19 11:35:55] [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.
[2023-03-19 11:35:55] [INFO ] Invariant cache hit.
[2023-03-19 11:35:55] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 7/7 places, 6/6 transitions.
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLCardinality-07 finished in 3924 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X((p1&&(G(p2) U 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
[2023-03-19 11:35:55] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 11:35:55] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-19 11:35:55] [INFO ] Invariant cache hit.
[2023-03-19 11:35:55] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-19 11:35:55] [INFO ] Invariant cache hit.
[2023-03-19 11:35:55] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0, 1} source=2 dest: 0}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))), acceptance={1} source=2 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={0} source=2 dest: 3}, { cond=(AND p1 (NOT p3) p2), acceptance={0, 1} source=2 dest: 4}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={} source=2 dest: 5}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={0} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 5}, { cond=(AND p0 p2), acceptance={0} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={1} source=4 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p3) p2), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=5 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 3}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0, 1} source=6 dest: 0}, { cond=(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p3) (NOT p2))), acceptance={1} source=6 dest: 1}, { cond=(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p3) (NOT p2))), acceptance={0, 1} source=6 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p3) p2)), acceptance={0} source=6 dest: 3}, { cond=(OR (AND p0 (NOT p1) p2) (AND p0 (NOT p3) p2)), acceptance={} source=6 dest: 5}, { cond=(OR (AND p0 (NOT p1) p2) (AND p0 (NOT p3) p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(GT s7 s3), p1:(LEQ s5 s1), p3:(LEQ s0 s4), p2:(GT s0 s3)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 64 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC10000vD-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLCardinality-08 finished in 510 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U 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 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-19 11:35:55] [INFO ] Invariant cache hit.
[2023-03-19 11:35:55] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-19 11:35:55] [INFO ] Invariant cache hit.
[2023-03-19 11:35:55] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-19 11:35:55] [INFO ] Invariant cache hit.
[2023-03-19 11:35:55] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 127 ms :[p1, true, p1, p1]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s4), p1:(GT s5 s3)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA TwoPhaseLocking-PT-nC10000vD-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLCardinality-10 finished in 207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-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.
[2023-03-19 11:35:55] [INFO ] Invariant cache hit.
[2023-03-19 11:35:55] [INFO ] Implicit Places using invariants in 24 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 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 LTL mode , in 2 iterations and 26 ms. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 s3)], 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 39 ms.
Product exploration explored 100000 steps with 50000 reset in 48 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 50 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TwoPhaseLocking-PT-nC10000vD-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLCardinality-11 finished in 240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G((X(p2)&&p1)))))'
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-19 11:35:56] [INFO ] Invariant cache hit.
[2023-03-19 11:35:56] [INFO ] Implicit Places using invariants in 26 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 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 LTL mode , in 2 iterations and 28 ms. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p1:(AND (GT 2 s1) (GT s3 s5)), p0:(OR (LEQ 2 s1) (LEQ s1 s6)), p2:(GT s1 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 1 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC10000vD-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLCardinality-12 finished in 198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0||X(p1))) U (p2&&F(!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.
[2023-03-19 11:35:56] [INFO ] Invariant cache hit.
[2023-03-19 11:35:56] [INFO ] Implicit Places using invariants in 23 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25 ms. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p2) p0), (OR (NOT p2) p0), (AND (NOT p0) (NOT p1)), p0]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p2 p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ s5 s6), p0:(GT 3 s6), p1:(LEQ s3 s6)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1632 reset in 151 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC10000vD-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLCardinality-13 finished in 356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(!p0))&&F(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 4 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-19 11:35:56] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-19 11:35:56] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-19 11:35:56] [INFO ] Invariant cache hit.
[2023-03-19 11:35:56] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-19 11:35:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 11:35:56] [INFO ] Invariant cache hit.
[2023-03-19 11:35:56] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/8 places, 5/6 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 ms. Remains : 7/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 s5), p1:(LEQ s2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 56 ms.
Product exploration explored 100000 steps with 0 reset in 91 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 158 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 3401824 steps, run timeout after 3001 ms. (steps per millisecond=1133 ) properties seen :{1=1}
Probabilistic random walk after 3401824 steps, saw 1392035 distinct states, run finished after 3005 ms. (steps per millisecond=1132 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-19 11:36:00] [INFO ] Invariant cache hit.
[2023-03-19 11:36:00] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-19 11:36:00] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:36:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-19 11:36:00] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:36:00] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-19 11:36:00] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 29997 steps, including 0 resets, run visited all 1 properties in 27 ms. (steps per millisecond=1111 )
Parikh walk visited 1 properties in 26 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 245 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-19 11:36:01] [INFO ] Invariant cache hit.
[2023-03-19 11:36:01] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-19 11:36:01] [INFO ] Invariant cache hit.
[2023-03-19 11:36:01] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-19 11:36:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 11:36:01] [INFO ] Invariant cache hit.
[2023-03-19 11:36:01] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84 ms. Remains : 7/7 places, 5/5 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 181 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 3 ms. (steps per millisecond=3334 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 3770102 steps, run timeout after 3001 ms. (steps per millisecond=1256 ) properties seen :{1=1}
Probabilistic random walk after 3770102 steps, saw 1533516 distinct states, run finished after 3005 ms. (steps per millisecond=1254 ) properties seen :1
Running SMT prover for 1 properties.
[2023-03-19 11:36:04] [INFO ] Invariant cache hit.
[2023-03-19 11:36:04] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 11:36:04] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:36:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-19 11:36:04] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:36:04] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-19 11:36:04] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 29997 steps, including 0 resets, run visited all 1 properties in 25 ms. (steps per millisecond=1199 )
Parikh walk visited 1 properties in 25 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 205 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 59 ms.
Product exploration explored 100000 steps with 0 reset in 64 ms.
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-19 11:36:05] [INFO ] Invariant cache hit.
[2023-03-19 11:36:05] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 11:36:05] [INFO ] Invariant cache hit.
[2023-03-19 11:36:05] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-19 11:36:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 11:36:05] [INFO ] Invariant cache hit.
[2023-03-19 11:36:05] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74 ms. Remains : 7/7 places, 5/5 transitions.
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLCardinality-14 finished in 8570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!p0 U !p1))))'
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
Applied a total of 2 rules in 3 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
[2023-03-19 11:36:05] [INFO ] Invariant cache hit.
[2023-03-19 11:36:05] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-19 11:36:05] [INFO ] Invariant cache hit.
[2023-03-19 11:36:05] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-19 11:36:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 11:36:05] [INFO ] Invariant cache hit.
[2023-03-19 11:36:05] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/8 places, 5/6 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70 ms. Remains : 7/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 84 ms :[p1, p1]
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT 1 s5), p0:(GT 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 60 ms.
Product exploration explored 100000 steps with 0 reset in 127 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 246 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[p1, p1]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 690045 steps, run timeout after 3001 ms. (steps per millisecond=229 ) properties seen :{}
Probabilistic random walk after 690045 steps, saw 330234 distinct states, run finished after 3002 ms. (steps per millisecond=229 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-19 11:36:09] [INFO ] Invariant cache hit.
[2023-03-19 11:36:09] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-19 11:36:09] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-19 11:36:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-19 11:36:09] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-19 11:36:09] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-19 11:36:09] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 15000 steps, including 0 resets, run visited all 2 properties in 53 ms. (steps per millisecond=283 )
Parikh walk visited 2 properties in 53 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (OR (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (AND p0 p1))]
Knowledge based reduction with 8 factoid took 289 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[p1]
Stuttering acceptance computed with spot in 22 ms :[p1]
Support contains 1 out of 7 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-19 11:36:09] [INFO ] Invariant cache hit.
[2023-03-19 11:36:09] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-19 11:36:09] [INFO ] Invariant cache hit.
[2023-03-19 11:36:09] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-19 11:36:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 11:36:09] [INFO ] Invariant cache hit.
[2023-03-19 11:36:09] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 7/7 places, 5/5 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[p1]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 2 ms. (steps per millisecond=5001 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4719757 steps, run timeout after 3028 ms. (steps per millisecond=1558 ) properties seen :{}
Probabilistic random walk after 4719757 steps, saw 1899837 distinct states, run finished after 3028 ms. (steps per millisecond=1558 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 11:36:12] [INFO ] Invariant cache hit.
[2023-03-19 11:36:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 11:36:12] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:36:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 11:36:12] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:36:12] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-19 11:36:12] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 29997 steps, including 0 resets, run visited all 1 properties in 21 ms. (steps per millisecond=1428 )
Parikh walk visited 1 properties in 21 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[p1]
Stuttering acceptance computed with spot in 25 ms :[p1]
Stuttering acceptance computed with spot in 25 ms :[p1]
Product exploration explored 100000 steps with 0 reset in 53 ms.
Product exploration explored 100000 steps with 0 reset in 74 ms.
Support contains 1 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 6 transition count 4
Applied a total of 2 rules in 1 ms. Remains 6 /7 variables (removed 1) and now considering 4/5 (removed 1) transitions.
// Phase 1: matrix 4 rows 6 cols
[2023-03-19 11:36:13] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-19 11:36:13] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-19 11:36:13] [INFO ] Invariant cache hit.
[2023-03-19 11:36:13] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-19 11:36:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 11:36:13] [INFO ] Invariant cache hit.
[2023-03-19 11:36:13] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/7 places, 4/5 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65 ms. Remains : 6/7 places, 4/5 transitions.
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLCardinality-15 finished in 7999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(p1 U (p2||G(p1)))))))'
Found a Lengthening insensitive property : TwoPhaseLocking-PT-nC10000vD-LTLCardinality-07
Stuttering acceptance computed with spot in 140 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions in LI_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
[2023-03-19 11:36:13] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 11:36:13] [INFO ] Implicit Places using invariants in 20 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 LI_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 LI_LTL mode , in 2 iterations and 26 ms. Remains : 7/8 places, 6/6 transitions.
Running random walk in product with property : TwoPhaseLocking-PT-nC10000vD-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(OR p0 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(AND (GT 2 s2) (GT s3 s5)), p1:(GT s3 s5), p0:(GT s6 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 70 ms.
Product exploration explored 100000 steps with 0 reset in 91 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 p2 p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (OR p0 p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X p2)), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 550 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 2 ms. (steps per millisecond=5001 ) properties (out of 6) seen :4
Finished Best-First random walk after 57 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (OR p0 p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X p2)), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (OR p0 p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p2)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 11 factoid took 498 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 143 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 5 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-19 11:36:15] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-19 11:36:15] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-19 11:36:15] [INFO ] Invariant cache hit.
[2023-03-19 11:36:15] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-19 11:36:15] [INFO ] Invariant cache hit.
[2023-03-19 11:36:15] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. 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 p1 p2 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (OR p0 p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 366 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 2 ms. (steps per millisecond=5001 ) properties (out of 6) seen :4
Finished Best-First random walk after 107 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=53 )
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (OR p0 p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X p2)), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (OR p0 p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p2)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 11 factoid took 364 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 87 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 95 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 68 ms.
Product exploration explored 100000 steps with 0 reset in 73 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 98 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 5 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.
[2023-03-19 11:36:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 11:36:16] [INFO ] Invariant cache hit.
[2023-03-19 11:36:16] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28 ms. Remains : 7/7 places, 6/6 transitions.
Support contains 5 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-19 11:36:16] [INFO ] Invariant cache hit.
[2023-03-19 11:36:16] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-19 11:36:16] [INFO ] Invariant cache hit.
[2023-03-19 11:36:16] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2023-03-19 11:36:16] [INFO ] Invariant cache hit.
[2023-03-19 11:36:16] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 7/7 places, 6/6 transitions.
Treatment of property TwoPhaseLocking-PT-nC10000vD-LTLCardinality-07 finished in 3483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(!p0))&&F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!p0 U !p1))))'
[2023-03-19 11:36:16] [INFO ] Flatten gal took : 5 ms
[2023-03-19 11:36:16] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-19 11:36:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 8 places, 6 transitions and 18 arcs took 1 ms.
Total runtime 31700 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT TwoPhaseLocking-PT-nC10000vD
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

FORMULA TwoPhaseLocking-PT-nC10000vD-LTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TwoPhaseLocking-PT-nC10000vD-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679225793091

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:373
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 TwoPhaseLocking-PT-nC10000vD-LTLCardinality-07
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for TwoPhaseLocking-PT-nC10000vD-LTLCardinality-07
lola: result : false
lola: markings : 20003
lola: fired transitions : 20003
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 6 (type EXCL) for 3 TwoPhaseLocking-PT-nC10000vD-LTLCardinality-14
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: CANCELED task # 6 (type EXCL) for TwoPhaseLocking-PT-nC10000vD-LTLCardinality-14 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
TwoPhaseLocking-PT-nC10000vD-LTLCardinality-07: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
TwoPhaseLocking-PT-nC10000vD-LTLCardinality-14: CONJ 0 1 0 0 2 0 1 0
TwoPhaseLocking-PT-nC10000vD-LTLCardinality-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 5 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 8 (type EXCL) for 3 TwoPhaseLocking-PT-nC10000vD-LTLCardinality-14
lola: time limit : 1797 sec
lola: memory limit: 32 pages
lola: FINISHED task # 8 (type EXCL) for TwoPhaseLocking-PT-nC10000vD-LTLCardinality-14
lola: result : false
lola: markings : 20011
lola: fired transitions : 20012
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 11 (type EXCL) for 10 TwoPhaseLocking-PT-nC10000vD-LTLCardinality-15
lola: time limit : 3595 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
TwoPhaseLocking-PT-nC10000vD-LTLCardinality-07: LTL false LTL model checker
TwoPhaseLocking-PT-nC10000vD-LTLCardinality-14: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
TwoPhaseLocking-PT-nC10000vD-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 5/3595 22/32 TwoPhaseLocking-PT-nC10000vD-LTLCardinality-15 3297483 m, 659496 m/sec, 7227561 t fired, .

Time elapsed: 10 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 11 (type EXCL) for TwoPhaseLocking-PT-nC10000vD-LTLCardinality-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
TwoPhaseLocking-PT-nC10000vD-LTLCardinality-07: LTL false LTL model checker
TwoPhaseLocking-PT-nC10000vD-LTLCardinality-14: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
TwoPhaseLocking-PT-nC10000vD-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
TwoPhaseLocking-PT-nC10000vD-LTLCardinality-07: LTL false LTL model checker
TwoPhaseLocking-PT-nC10000vD-LTLCardinality-14: CONJ false LTL model checker
TwoPhaseLocking-PT-nC10000vD-LTLCardinality-15: LTL unknown AGGR


Time elapsed: 15 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TwoPhaseLocking-PT-nC10000vD"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is TwoPhaseLocking-PT-nC10000vD, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r487-tall-167912703700931"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TwoPhaseLocking-PT-nC10000vD.tgz
mv TwoPhaseLocking-PT-nC10000vD execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;