fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r540-smll-171690574100324
Last Updated
July 7, 2024

About the Execution of LTSMin+red for TwoPhaseLocking-PT-nC00050vD

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
437.163 27028.00 44334.00 311.90 FFFFFFFFFFFFFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r540-smll-171690574100324.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is TwoPhaseLocking-PT-nC00050vD, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r540-smll-171690574100324
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 08:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 13 07:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 13 07:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 13 07:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 13 07:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 08:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.6K May 18 16:43 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-nC00050vD-LTLFireability-00
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-LTLFireability-01
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-LTLFireability-02
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-LTLFireability-03
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-LTLFireability-04
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-LTLFireability-05
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-LTLFireability-06
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-LTLFireability-07
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-LTLFireability-08
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-LTLFireability-09
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-LTLFireability-10
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-LTLFireability-11
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-LTLFireability-12
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-LTLFireability-13
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-LTLFireability-14
FORMULA_NAME TwoPhaseLocking-PT-nC00050vD-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717272039973

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TwoPhaseLocking-PT-nC00050vD
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:00:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 20:00:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:00:42] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2024-06-01 20:00:42] [INFO ] Transformed 8 places.
[2024-06-01 20:00:42] [INFO ] Transformed 6 transitions.
[2024-06-01 20:00:42] [INFO ] Parsed PT model containing 8 places and 6 transitions and 18 arcs in 345 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA TwoPhaseLocking-PT-nC00050vD-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00050vD-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 18 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-06-01 20:00:42] [INFO ] Computed 3 invariants in 10 ms
[2024-06-01 20:00:43] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-06-01 20:00:43] [INFO ] Invariant cache hit.
[2024-06-01 20:00:43] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2024-06-01 20:00:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 387ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 405ms
Finished structural reductions in LTL mode , in 1 iterations and 831 ms. Remains : 8/8 places, 6/6 transitions.
Support contains 8 out of 8 places after structural reductions.
[2024-06-01 20:00:43] [INFO ] Flatten gal took : 25 ms
[2024-06-01 20:00:43] [INFO ] Flatten gal took : 6 ms
[2024-06-01 20:00:44] [INFO ] Input system was already deterministic with 6 transitions.
Reduction of identical properties reduced properties to check from 15 to 12
RANDOM walk for 1050 steps (6 resets) in 29 ms. (35 steps per ms) remains 0/12 properties
FORMULA TwoPhaseLocking-PT-nC00050vD-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(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.
[2024-06-01 20:00:44] [INFO ] Invariant cache hit.
[2024-06-01 20:00:44] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 20:00:44] [INFO ] Invariant cache hit.
[2024-06-01 20:00:44] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2024-06-01 20:00:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 223ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 223ms
Finished structural reductions in LTL mode , in 1 iterations and 305 ms. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 422 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TwoPhaseLocking-PT-nC00050vD-LTLFireability-00
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 3 ms.
FORMULA TwoPhaseLocking-PT-nC00050vD-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00050vD-LTLFireability-00 finished in 811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(p1) U (p2&&G(p1))))||p0)))'
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-01 20:00:45] [INFO ] Invariant cache hit.
[2024-06-01 20:00:45] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 20:00:45] [INFO ] Invariant cache hit.
[2024-06-01 20:00:45] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2024-06-01 20:00:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 246ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 247ms
Finished structural reductions in LTL mode , in 1 iterations and 330 ms. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : TwoPhaseLocking-PT-nC00050vD-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC00050vD-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00050vD-LTLFireability-01 finished in 618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&F(G(p1)))))))'
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-01 20:00:45] [INFO ] Invariant cache hit.
[2024-06-01 20:00:45] [INFO ] Implicit Places using invariants in 39 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 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 47 ms. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00050vD-LTLFireability-02
Product exploration explored 100000 steps with 43 reset in 551 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 1 ms.
FORMULA TwoPhaseLocking-PT-nC00050vD-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC00050vD-LTLFireability-02 finished in 888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((!p1&&F(G(p2)))))))'
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-01 20:00:46] [INFO ] Invariant cache hit.
[2024-06-01 20:00:46] [INFO ] Implicit Places using invariants in 35 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 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 40 ms. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : TwoPhaseLocking-PT-nC00050vD-LTLFireability-03
Product exploration explored 100000 steps with 10252 reset in 294 ms.
Product exploration explored 100000 steps with 10208 reset in 353 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 155 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 526 steps (2 resets) in 7 ms. (65 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 12 factoid took 359 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 6 rows 7 cols
[2024-06-01 20:00:48] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 20:00:48] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 20:00:48] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 20:00:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:00:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 20:00:48] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 20:00:48] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 20:00:48] [INFO ] Added : 4 causal constraints over 1 iterations in 13 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-01 20:00:48] [INFO ] Invariant cache hit.
[2024-06-01 20:00:48] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 20:00:48] [INFO ] Invariant cache hit.
[2024-06-01 20:00:48] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2024-06-01 20:00:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 5 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 89 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 190ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 191ms
Finished structural reductions in LTL mode , in 1 iterations and 266 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 (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 127 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 631 steps (3 resets) in 8 ms. (70 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p2), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 5 factoid took 272 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2024-06-01 20:00:49] [INFO ] Invariant cache hit.
[2024-06-01 20:00:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 20:00:50] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 20:00:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:00:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 20:00:50] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 20:00:50] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 20:00:50] [INFO ] Added : 4 causal constraints over 1 iterations in 22 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 10210 reset in 181 ms.
Product exploration explored 100000 steps with 10240 reset in 177 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 7 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 7 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 15 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-01 20:00:51] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-06-01 20:00:51] [INFO ] Computed 2 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem TDEAD3 is UNSAT
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 4 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 1 solved, 4 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 161ms problems are : Problem set: 1 solved, 4 unsolved
Search for dead transitions found 1 dead transitions in 161ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 7/7 places, 5/6 transitions.
Graph (complete) has 10 edges and 7 vertex of which 6 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 6 /7 variables (removed 1) and now considering 5/5 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/7 places, 5/6 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 190 ms. Remains : 6/7 places, 5/6 transitions.
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-06-01 20:00:51] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 20:00:51] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 20:00:51] [INFO ] Invariant cache hit.
[2024-06-01 20:00:51] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2024-06-01 20:00:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 5 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 154ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 154ms
Finished structural reductions in LTL mode , in 1 iterations and 214 ms. Remains : 7/7 places, 6/6 transitions.
Treatment of property TwoPhaseLocking-PT-nC00050vD-LTLFireability-03 finished in 4728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((X(F(p1))||G(p0))))))'
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-06-01 20:00:51] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 20:00:51] [INFO ] Implicit Places using invariants in 36 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 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 39 ms. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 253 ms :[true, (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TwoPhaseLocking-PT-nC00050vD-LTLFireability-04
Product exploration explored 100000 steps with 7462 reset in 97 ms.
Stack based approach found an accepted trace after 202 steps with 18 reset with depth 77 and stack size 77 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC00050vD-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC00050vD-LTLFireability-04 finished in 412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(G(!p1))||p0))))'
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-01 20:00:51] [INFO ] Invariant cache hit.
[2024-06-01 20:00:51] [INFO ] Implicit Places using invariants in 32 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 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 35 ms. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00050vD-LTLFireability-05
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC00050vD-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00050vD-LTLFireability-05 finished in 218 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(F(p2)||p1)))))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 12 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-06-01 20:00:52] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 20:00:52] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 20:00:52] [INFO ] Invariant cache hit.
[2024-06-01 20:00:52] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-06-01 20:00:52] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-01 20:00:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/12 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 10 constraints, problems are : Problem set: 0 solved, 4 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/12 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/12 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 14 constraints, problems are : Problem set: 0 solved, 4 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 163ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 164ms
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 240 ms. Remains : 7/8 places, 5/6 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : TwoPhaseLocking-PT-nC00050vD-LTLFireability-06
Product exploration explored 100000 steps with 32 reset in 266 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 1 ms.
FORMULA TwoPhaseLocking-PT-nC00050vD-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC00050vD-LTLFireability-06 finished in 653 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 7 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2024-06-01 20:00:52] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 20:00:52] [INFO ] Implicit Places using invariants in 41 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/8 places, 4/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 52 ms. Remains : 5/8 places, 4/6 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00050vD-LTLFireability-07
Product exploration explored 100000 steps with 15078 reset in 151 ms.
Product exploration explored 100000 steps with 15101 reset in 301 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
RANDOM walk for 478 steps (4 resets) in 6 ms. (68 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
// Phase 1: matrix 4 rows 5 cols
[2024-06-01 20:00:53] [INFO ] Computed 2 invariants in 0 ms
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA TwoPhaseLocking-PT-nC00050vD-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property TwoPhaseLocking-PT-nC00050vD-LTLFireability-07 finished in 1281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(!p0))||(p1&&X(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.
// Phase 1: matrix 6 rows 8 cols
[2024-06-01 20:00:54] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 20:00:54] [INFO ] Implicit Places using invariants in 29 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 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 313 ms :[p0, p0, p0, p0, p0, p0]
Running random walk in product with property : TwoPhaseLocking-PT-nC00050vD-LTLFireability-08
Product exploration explored 100000 steps with 14625 reset in 93 ms.
Stack based approach found an accepted trace after 841 steps with 138 reset with depth 47 and stack size 47 in 1 ms.
FORMULA TwoPhaseLocking-PT-nC00050vD-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC00050vD-LTLFireability-08 finished in 455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(!p0)||X(X(F(p1))))&&(X(!p2) U ((!p2&&X(!p2))||X(G(!p2))))))'
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-01 20:00:54] [INFO ] Invariant cache hit.
[2024-06-01 20:00:54] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 20:00:54] [INFO ] Invariant cache hit.
[2024-06-01 20:00:54] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2024-06-01 20:00:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 225ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 227ms
Finished structural reductions in LTL mode , in 1 iterations and 298 ms. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 290 ms :[(OR p2 (AND p0 (NOT p1))), p2, (AND p0 (NOT p1)), p2, true, (AND p0 (NOT p1))]
Running random walk in product with property : TwoPhaseLocking-PT-nC00050vD-LTLFireability-09
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC00050vD-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00050vD-LTLFireability-09 finished in 620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-01 20:00:55] [INFO ] Invariant cache hit.
[2024-06-01 20:00:55] [INFO ] Implicit Places using invariants in 31 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 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 34 ms. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00050vD-LTLFireability-11
Product exploration explored 100000 steps with 340 reset in 361 ms.
Stack based approach found an accepted trace after 55 steps with 4 reset with depth 44 and stack size 44 in 0 ms.
FORMULA TwoPhaseLocking-PT-nC00050vD-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC00050vD-LTLFireability-11 finished in 513 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(!p0)) U p1)))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 7 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 2 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2024-06-01 20:00:55] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 20:00:55] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 20:00:55] [INFO ] Invariant cache hit.
[2024-06-01 20:00:55] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-06-01 20:00:55] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 20:00:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 4/10 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/10 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 4/10 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/10 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/10 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 159ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 159ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/8 places, 4/6 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 235 ms. Remains : 6/8 places, 4/6 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), p0, (NOT p1)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00050vD-LTLFireability-13
Product exploration explored 100000 steps with 43 reset in 356 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 1 ms.
FORMULA TwoPhaseLocking-PT-nC00050vD-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property TwoPhaseLocking-PT-nC00050vD-LTLFireability-13 finished in 760 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0||X(X(X(F(p1)))))))'
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-06-01 20:00:56] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 20:00:56] [INFO ] Implicit Places using invariants in 34 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 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 39 ms. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 199 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : TwoPhaseLocking-PT-nC00050vD-LTLFireability-14
Product exploration explored 100000 steps with 15023 reset in 200 ms.
Product exploration explored 100000 steps with 15061 reset in 65 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 840 steps (4 resets) in 6 ms. (120 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
// Phase 1: matrix 6 rows 7 cols
[2024-06-01 20:00:57] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 20:00:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 20:00:57] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 20:00:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:00:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 20:00:57] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 20:00:57] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 20:00:57] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Support contains 3 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.
[2024-06-01 20:00:57] [INFO ] Invariant cache hit.
[2024-06-01 20:00:57] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 20:00:57] [INFO ] Invariant cache hit.
[2024-06-01 20:00:57] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2024-06-01 20:00:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 5 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 126ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 128ms
Finished structural reductions in LTL mode , in 1 iterations and 194 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 p0 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 191 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 1155 steps (7 resets) in 9 ms. (115 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 202 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 190 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2024-06-01 20:00:58] [INFO ] Invariant cache hit.
[2024-06-01 20:00:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 20:00:58] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 20:00:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:00:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 20:00:59] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 20:00:59] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 20:00:59] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Stuttering acceptance computed with spot in 174 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 15248 reset in 59 ms.
Product exploration explored 100000 steps with 15070 reset in 64 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 141 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND 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, 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 7 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 7 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-01 20:00:59] [INFO ] Redundant transitions in 1 ms returned []
Running 5 sub problems to find dead transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-06-01 20:00:59] [INFO ] Computed 2 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem TDEAD3 is UNSAT
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 4 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/7 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 4/13 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 1 solved, 4 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 130ms problems are : Problem set: 1 solved, 4 unsolved
Search for dead transitions found 1 dead transitions in 131ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 7/7 places, 5/6 transitions.
Graph (complete) has 10 edges and 7 vertex of which 6 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 6 /7 variables (removed 1) and now considering 5/5 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/7 places, 5/6 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 141 ms. Remains : 6/7 places, 5/6 transitions.
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-06-01 20:00:59] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 20:00:59] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 20:00:59] [INFO ] Invariant cache hit.
[2024-06-01 20:00:59] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2024-06-01 20:00:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 5 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 167ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 167ms
Finished structural reductions in LTL mode , in 1 iterations and 229 ms. Remains : 7/7 places, 6/6 transitions.
Treatment of property TwoPhaseLocking-PT-nC00050vD-LTLFireability-14 finished in 3555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((!p1&&F(G(p2)))))))'
Found a Shortening insensitive property : TwoPhaseLocking-PT-nC00050vD-LTLFireability-03
Stuttering acceptance computed with spot in 112 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in LI_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 1 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-06-01 20:01:00] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 20:01:00] [INFO ] Implicit Places using invariants in 20 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 ms to find 1 implicit places.
Starting structural reductions in LI_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 LI_LTL mode , in 2 iterations and 22 ms. Remains : 6/8 places, 5/6 transitions.
Running random walk in product with property : TwoPhaseLocking-PT-nC00050vD-LTLFireability-03
Product exploration explored 100000 steps with 15076 reset in 82 ms.
Product exploration explored 100000 steps with 15065 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) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge based reduction with 9 factoid took 322 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 1081 steps (11 resets) in 10 ms. (98 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F p0), (F p2), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 586 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 5 rows 6 cols
[2024-06-01 20:01:01] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 20:01:01] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 20:01:01] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 20:01:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:01:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 20:01:01] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 20:01:01] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 20:01:01] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 4 out of 6 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-06-01 20:01:01] [INFO ] Invariant cache hit.
[2024-06-01 20:01:01] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 20:01:01] [INFO ] Invariant cache hit.
[2024-06-01 20:01:01] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Running 4 sub problems to find dead transitions.
[2024-06-01 20:01:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 134ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 135ms
Finished structural reductions in LTL mode , in 1 iterations and 180 ms. Remains : 6/6 places, 5/5 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge based reduction with 2 factoid took 208 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 212 steps (0 resets) in 6 ms. (30 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F p0), (F p2), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 2 factoid took 297 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2024-06-01 20:01:03] [INFO ] Invariant cache hit.
[2024-06-01 20:01:03] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 20:01:03] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 20:01:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:01:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 20:01:03] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 20:01:03] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 20:01:03] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 15112 reset in 79 ms.
Product exploration explored 100000 steps with 15058 reset in 88 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-06-01 20:01:03] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-01 20:01:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 105ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 111 ms. Remains : 6/6 places, 5/5 transitions.
Support contains 4 out of 6 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-06-01 20:01:03] [INFO ] Invariant cache hit.
[2024-06-01 20:01:03] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 20:01:03] [INFO ] Invariant cache hit.
[2024-06-01 20:01:03] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Running 4 sub problems to find dead transitions.
[2024-06-01 20:01:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 105ms
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 6/6 places, 5/5 transitions.
Treatment of property TwoPhaseLocking-PT-nC00050vD-LTLFireability-03 finished in 3889 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0||X(X(X(F(p1)))))))'
Found a Shortening insensitive property : TwoPhaseLocking-PT-nC00050vD-LTLFireability-14
Stuttering acceptance computed with spot in 147 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in LI_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 1 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-06-01 20:01:04] [INFO ] Computed 3 invariants in 4 ms
[2024-06-01 20:01:04] [INFO ] Implicit Places using invariants in 28 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 LI_LTL mode, iteration 1 : 6/8 places, 5/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 30 ms. Remains : 6/8 places, 5/6 transitions.
Running random walk in product with property : TwoPhaseLocking-PT-nC00050vD-LTLFireability-14
Product exploration explored 100000 steps with 20279 reset in 52 ms.
Product exploration explored 100000 steps with 20205 reset in 63 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 553 steps (3 resets) in 5 ms. (92 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 136 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
// Phase 1: matrix 5 rows 6 cols
[2024-06-01 20:01:04] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 20:01:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 20:01:04] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 20:01:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:01:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 20:01:05] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 20:01:05] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 20:01:05] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-06-01 20:01:05] [INFO ] Invariant cache hit.
[2024-06-01 20:01:05] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 20:01:05] [INFO ] Invariant cache hit.
[2024-06-01 20:01:05] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Running 4 sub problems to find dead transitions.
[2024-06-01 20:01:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 112ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 112ms
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 6/6 places, 5/5 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 71 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 474 steps (2 resets) in 8 ms. (52 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 133 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 135 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2024-06-01 20:01:05] [INFO ] Invariant cache hit.
[2024-06-01 20:01:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 20:01:05] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 20:01:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:01:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 20:01:05] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 20:01:05] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 20:01:05] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Stuttering acceptance computed with spot in 137 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 20185 reset in 46 ms.
Product exploration explored 100000 steps with 20321 reset in 59 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 140 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-06-01 20:01:06] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-01 20:01:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 106ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 107ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 6/6 places, 5/5 transitions.
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-06-01 20:01:06] [INFO ] Invariant cache hit.
[2024-06-01 20:01:06] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 20:01:06] [INFO ] Invariant cache hit.
[2024-06-01 20:01:06] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Running 4 sub problems to find dead transitions.
[2024-06-01 20:01:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 110ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 110ms
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. Remains : 6/6 places, 5/5 transitions.
Treatment of property TwoPhaseLocking-PT-nC00050vD-LTLFireability-14 finished in 2769 ms.
[2024-06-01 20:01:06] [INFO ] Flatten gal took : 3 ms
[2024-06-01 20:01:06] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 20:01:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 8 places, 6 transitions and 18 arcs took 4 ms.
Total runtime 24587 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA TwoPhaseLocking-PT-nC00050vD-LTLFireability-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA TwoPhaseLocking-PT-nC00050vD-LTLFireability-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717272067001

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name TwoPhaseLocking-PT-nC00050vD-LTLFireability-03
ltl formula formula --ltl=/tmp/1828/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 8 places, 6 transitions and 18 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1828/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1828/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1828/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1828/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 9 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 9, there are 22 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~102!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 97
pnml2lts-mc( 0/ 4): unique states count: 370
pnml2lts-mc( 0/ 4): unique transitions count: 663
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 376
pnml2lts-mc( 0/ 4): - cum. max stack depth: 279
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 376 states 676 transitions, fanout: 1.798
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.007 sec on average)
pnml2lts-mc( 0/ 4): States per second: 37600, Transitions per second: 67600
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 24.5 B/state, compr.: 64.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 6 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name TwoPhaseLocking-PT-nC00050vD-LTLFireability-14
ltl formula formula --ltl=/tmp/1828/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 8 places, 6 transitions and 18 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1828/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1828/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1828/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1828/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 10 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 9, there are 11 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 676
pnml2lts-mc( 0/ 4): unique states count: 676
pnml2lts-mc( 0/ 4): unique transitions count: 1025
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 920
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 1203
pnml2lts-mc( 0/ 4): - cum. max stack depth: 184
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1203 states 2374 transitions, fanout: 1.973
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 120300, Transitions per second: 237400
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 22.0 B/state, compr.: 57.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 6 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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-nC00050vD"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is TwoPhaseLocking-PT-nC00050vD, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r540-smll-171690574100324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TwoPhaseLocking-PT-nC00050vD.tgz
mv TwoPhaseLocking-PT-nC00050vD execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;