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.r528-tall-171683762100907.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 ShieldRVt-PT-002B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762100907
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K 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 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 11 21:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 21:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 11 21:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 24K 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 ShieldRVt-PT-002B-LTLCardinality-00
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-01
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-02
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-03
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-04
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-05
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-06
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-07
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-08
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-09
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-10
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-11
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-12
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-13
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-14
FORMULA_NAME ShieldRVt-PT-002B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717274906147

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-002B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:48:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 20:48:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:48:27] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2024-06-01 20:48:27] [INFO ] Transformed 103 places.
[2024-06-01 20:48:27] [INFO ] Transformed 103 transitions.
[2024-06-01 20:48:27] [INFO ] Found NUPN structural information;
[2024-06-01 20:48:27] [INFO ] Parsed PT model containing 103 places and 103 transitions and 242 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVt-PT-002B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 91 transition count 91
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 91 transition count 91
Applied a total of 24 rules in 23 ms. Remains 91 /103 variables (removed 12) and now considering 91/103 (removed 12) transitions.
// Phase 1: matrix 91 rows 91 cols
[2024-06-01 20:48:27] [INFO ] Computed 9 invariants in 9 ms
[2024-06-01 20:48:27] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-06-01 20:48:27] [INFO ] Invariant cache hit.
[2024-06-01 20:48:28] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-06-01 20:48:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 20:48:28] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 8 ms to minimize.
[2024-06-01 20:48:28] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 2 ms to minimize.
[2024-06-01 20:48:28] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-06-01 20:48:28] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-06-01 20:48:28] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-06-01 20:48:28] [INFO ] Deduced a trap composed of 25 places in 21 ms of which 0 ms to minimize.
[2024-06-01 20:48:28] [INFO ] Deduced a trap composed of 25 places in 22 ms of which 0 ms to minimize.
[2024-06-01 20:48:28] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-06-01 20:48:29] [INFO ] Deduced a trap composed of 23 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 20:48:29] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-06-01 20:48:29] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-06-01 20:48:29] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/182 variables, 91/112 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 112 constraints, problems are : Problem set: 0 solved, 90 unsolved in 2280 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 12/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 20:48:30] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/182 variables, 91/113 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 90/203 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 20:48:31] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-06-01 20:48:31] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-06-01 20:48:31] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-06-01 20:48:31] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-01 20:48:31] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 20:48:31] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 20:48:32] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-01 20:48:33] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 12 (OVERLAPS) 0/182 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 211 constraints, problems are : Problem set: 0 solved, 90 unsolved in 4469 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 21/21 constraints]
After SMT, in 6789ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 6804ms
Starting structural reductions in LTL mode, iteration 1 : 91/103 places, 91/103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7145 ms. Remains : 91/103 places, 91/103 transitions.
Support contains 24 out of 91 places after structural reductions.
[2024-06-01 20:48:35] [INFO ] Flatten gal took : 25 ms
[2024-06-01 20:48:35] [INFO ] Flatten gal took : 10 ms
[2024-06-01 20:48:35] [INFO ] Input system was already deterministic with 91 transitions.
RANDOM walk for 2473 steps (2 resets) in 71 ms. (34 steps per ms) remains 0/12 properties
Computed a total of 28 stabilizing places and 28 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' '!((F(p0)&&X(G((p1&&(F(p1) U p2))))))'
Support contains 6 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 91/91 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 86 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 86 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 85 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 85 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 84 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 84 transition count 84
Applied a total of 14 rules in 11 ms. Remains 84 /91 variables (removed 7) and now considering 84/91 (removed 7) transitions.
// Phase 1: matrix 84 rows 84 cols
[2024-06-01 20:48:35] [INFO ] Computed 9 invariants in 7 ms
[2024-06-01 20:48:35] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 20:48:35] [INFO ] Invariant cache hit.
[2024-06-01 20:48:35] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-06-01 20:48:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-06-01 20:48:35] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 20:48:35] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 20:48:35] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-06-01 20:48:35] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-06-01 20:48:36] [INFO ] Deduced a trap composed of 23 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-06-01 20:48:36] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 84/168 variables, 84/99 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/168 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 99 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1715 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 84/168 variables, 84/99 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 83/182 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-06-01 20:48:37] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 20:48:37] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 10 ms to minimize.
[2024-06-01 20:48:37] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-06-01 20:48:37] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-01 20:48:37] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-01 20:48:38] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-06-01 20:48:38] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-06-01 20:48:38] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 8/190 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-06-01 20:48:38] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 20:48:38] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-06-01 20:48:38] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 3/193 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-06-01 20:48:39] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-06-01 20:48:39] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 2 ms to minimize.
[2024-06-01 20:48:39] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 196 constraints, problems are : Problem set: 0 solved, 83 unsolved in 3384 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 20/20 constraints]
After SMT, in 5117ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 5121ms
Starting structural reductions in LTL mode, iteration 1 : 84/91 places, 84/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5256 ms. Remains : 84/91 places, 84/91 transitions.
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-002B-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 448 steps with 14 reset in 9 ms.
FORMULA ShieldRVt-PT-002B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-LTLCardinality-02 finished in 5668 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(p0))) U (!p1||F(!p2))))'
Support contains 6 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 91/91 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 84 transition count 84
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 84 transition count 84
Applied a total of 14 rules in 9 ms. Remains 84 /91 variables (removed 7) and now considering 84/91 (removed 7) transitions.
// Phase 1: matrix 84 rows 84 cols
[2024-06-01 20:48:40] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 20:48:41] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 20:48:41] [INFO ] Invariant cache hit.
[2024-06-01 20:48:41] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-06-01 20:48:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-06-01 20:48:41] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-06-01 20:48:41] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-01 20:48:41] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-06-01 20:48:41] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 84/168 variables, 84/97 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 0/168 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 97 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1422 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 84/168 variables, 84/97 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 83/180 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-06-01 20:48:43] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 20:48:43] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 20:48:43] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-06-01 20:48:43] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:48:43] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 20:48:43] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-06-01 20:48:44] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:48:44] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 188 constraints, problems are : Problem set: 0 solved, 83 unsolved in 2876 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 12/12 constraints]
After SMT, in 4308ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 4310ms
Starting structural reductions in LTL mode, iteration 1 : 84/91 places, 84/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4402 ms. Remains : 84/91 places, 84/91 transitions.
Stuttering acceptance computed with spot in 231 ms :[(AND p1 p2), (AND p2 (NOT p0)), (AND p2 (NOT p0)), p2]
Running random walk in product with property : ShieldRVt-PT-002B-LTLCardinality-04
Product exploration explored 100000 steps with 4081 reset in 208 ms.
Product exploration explored 100000 steps with 4139 reset in 155 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Computed a total of 25 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (AND p1 p2)), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 p0))), (X (X (AND p1 p2))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 133 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND p1 p2), (AND p2 (NOT p0)), (AND p2 (NOT p0)), p2]
RANDOM walk for 736 steps (0 resets) in 19 ms. (36 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (AND p1 p2)), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 p0))), (X (X (AND p1 p2))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p2))), (F (NOT p1)), (F (NOT p2)), (F (NOT (AND p2 p0))), (F (NOT (OR (NOT p2) p0)))]
Knowledge based reduction with 10 factoid took 300 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND p1 p2), (AND p2 (NOT p0)), (AND p2 (NOT p0)), p2]
Stuttering acceptance computed with spot in 156 ms :[(AND p1 p2), (AND p2 (NOT p0)), (AND p2 (NOT p0)), p2]
[2024-06-01 20:48:46] [INFO ] Invariant cache hit.
[2024-06-01 20:48:46] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 20:48:47] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 20:48:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:48:47] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 20:48:47] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-06-01 20:48:47] [INFO ] Computed and/alt/rep : 83/122/83 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 20:48:47] [INFO ] Added : 83 causal constraints over 17 iterations in 149 ms. Result :sat
Could not prove EG (AND p1 p2)
Support contains 6 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-06-01 20:48:47] [INFO ] Invariant cache hit.
[2024-06-01 20:48:47] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 20:48:47] [INFO ] Invariant cache hit.
[2024-06-01 20:48:47] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-06-01 20:48:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-06-01 20:48:47] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-06-01 20:48:47] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-06-01 20:48:47] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-06-01 20:48:47] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 84/168 variables, 84/97 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 0/168 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 97 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1444 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 84/168 variables, 84/97 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 83/180 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-06-01 20:48:49] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-06-01 20:48:49] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-06-01 20:48:49] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-06-01 20:48:49] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-06-01 20:48:49] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 20:48:49] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-06-01 20:48:50] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-06-01 20:48:50] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 188 constraints, problems are : Problem set: 0 solved, 83 unsolved in 2964 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 12/12 constraints]
After SMT, in 4418ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 4420ms
Finished structural reductions in LTL mode , in 1 iterations and 4513 ms. Remains : 84/84 places, 84/84 transitions.
Computed a total of 25 stabilizing places and 25 stable transitions
Computed a total of 25 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (AND p1 p2)), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 p0))), (X (X (AND p1 p2))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 135 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND p1 p2), (AND p2 (NOT p0)), (AND p2 (NOT p0)), p2]
RANDOM walk for 830 steps (0 resets) in 18 ms. (43 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (AND p1 p2)), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 p0))), (X (X (AND p1 p2))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p2))), (F (NOT p1)), (F (NOT p2)), (F (NOT (AND p2 p0))), (F (NOT (OR (NOT p2) p0)))]
Knowledge based reduction with 10 factoid took 316 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND p1 p2), (AND p2 (NOT p0)), (AND p2 (NOT p0)), p2]
Stuttering acceptance computed with spot in 180 ms :[(AND p1 p2), (AND p2 (NOT p0)), (AND p2 (NOT p0)), p2]
[2024-06-01 20:48:52] [INFO ] Invariant cache hit.
[2024-06-01 20:48:52] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 20:48:52] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 20:48:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:48:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 20:48:52] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-06-01 20:48:52] [INFO ] Computed and/alt/rep : 83/122/83 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 20:48:53] [INFO ] Added : 83 causal constraints over 17 iterations in 116 ms. Result :sat
Could not prove EG (AND p1 p2)
Stuttering acceptance computed with spot in 164 ms :[(AND p1 p2), (AND p2 (NOT p0)), (AND p2 (NOT p0)), p2]
Product exploration explored 100000 steps with 4115 reset in 100 ms.
Product exploration explored 100000 steps with 4110 reset in 205 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 159 ms :[(AND p1 p2), (AND p2 (NOT p0)), (AND p2 (NOT p0)), p2]
Support contains 6 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 84/84 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 84 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 84 transition count 83
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 22 place count 84 transition count 89
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 32 place count 84 transition count 89
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 80 transition count 85
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 80 transition count 85
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 47 places in 1 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 60 place count 80 transition count 85
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 74 place count 66 transition count 71
Deduced a syphon composed of 33 places in 1 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 88 place count 66 transition count 71
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 66 transition count 111
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 60 transition count 99
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 60 transition count 99
Deduced a syphon composed of 33 places in 0 ms
Applied a total of 106 rules in 64 ms. Remains 60 /84 variables (removed 24) and now considering 99/84 (removed -15) transitions.
[2024-06-01 20:48:53] [INFO ] Redundant transitions in 2 ms returned []
Running 98 sub problems to find dead transitions.
// Phase 1: matrix 99 rows 60 cols
[2024-06-01 20:48:53] [INFO ] Computed 9 invariants in 3 ms
[2024-06-01 20:48:53] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 98 unsolved
[2024-06-01 20:48:54] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 20:48:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
[2024-06-01 20:48:54] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 20:48:54] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-06-01 20:48:54] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
[2024-06-01 20:48:54] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
[2024-06-01 20:48:54] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
[2024-06-01 20:48:54] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
[2024-06-01 20:48:54] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-06-01 20:48:54] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
[2024-06-01 20:48:54] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 11/20 constraints. Problems are: Problem set: 64 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/20 constraints. Problems are: Problem set: 64 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 99/159 variables, 60/80 constraints. Problems are: Problem set: 64 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 26/106 constraints. Problems are: Problem set: 64 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/106 constraints. Problems are: Problem set: 64 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 0/159 variables, 0/106 constraints. Problems are: Problem set: 64 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 106 constraints, problems are : Problem set: 64 solved, 34 unsolved in 1013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 64 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 64 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 34/60 variables, 9/9 constraints. Problems are: Problem set: 64 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 11/20 constraints. Problems are: Problem set: 64 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/20 constraints. Problems are: Problem set: 64 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 99/159 variables, 60/80 constraints. Problems are: Problem set: 64 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 26/106 constraints. Problems are: Problem set: 64 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 34/140 constraints. Problems are: Problem set: 64 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/140 constraints. Problems are: Problem set: 64 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 0/159 variables, 0/140 constraints. Problems are: Problem set: 64 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 140 constraints, problems are : Problem set: 64 solved, 34 unsolved in 670 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 34/98 constraints, Known Traps: 11/11 constraints]
After SMT, in 1720ms problems are : Problem set: 64 solved, 34 unsolved
Search for dead transitions found 64 dead transitions in 1722ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 60/84 places, 35/84 transitions.
Graph (complete) has 99 edges and 60 vertex of which 27 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.1 ms
Discarding 33 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 27 /60 variables (removed 33) and now considering 35/35 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/84 places, 35/84 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1795 ms. Remains : 27/84 places, 35/84 transitions.
Support contains 6 out of 84 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 84/84 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 84 /84 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 84 cols
[2024-06-01 20:48:55] [INFO ] Computed 9 invariants in 0 ms
[2024-06-01 20:48:55] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 20:48:55] [INFO ] Invariant cache hit.
[2024-06-01 20:48:55] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2024-06-01 20:48:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-06-01 20:48:56] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-01 20:48:56] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-06-01 20:48:56] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-06-01 20:48:56] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 84/168 variables, 84/97 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 0/168 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 97 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1450 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 84/168 variables, 84/97 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 83/180 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-06-01 20:48:57] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 20:48:57] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-06-01 20:48:57] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-06-01 20:48:58] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 20:48:58] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 20:48:58] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 83 unsolved
[2024-06-01 20:48:58] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 20:48:58] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/168 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 188 constraints, problems are : Problem set: 0 solved, 83 unsolved in 2815 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 84/84 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 12/12 constraints]
After SMT, in 4272ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 4273ms
Finished structural reductions in LTL mode , in 1 iterations and 4360 ms. Remains : 84/84 places, 84/84 transitions.
Treatment of property ShieldRVt-PT-002B-LTLCardinality-04 finished in 19062 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(p1)||p0))))'
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 91/91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 90 transition count 66
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 51 place count 66 transition count 63
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 64 transition count 63
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 53 place count 64 transition count 53
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 73 place count 54 transition count 53
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 80 place count 47 transition count 46
Iterating global reduction 3 with 7 rules applied. Total rules applied 87 place count 47 transition count 46
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 87 place count 47 transition count 41
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 97 place count 42 transition count 41
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 125 place count 28 transition count 27
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 133 place count 24 transition count 30
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 22 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 136 place count 21 transition count 28
Applied a total of 136 rules in 13 ms. Remains 21 /91 variables (removed 70) and now considering 28/91 (removed 63) transitions.
// Phase 1: matrix 28 rows 21 cols
[2024-06-01 20:49:00] [INFO ] Computed 8 invariants in 0 ms
[2024-06-01 20:49:00] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 20:49:00] [INFO ] Invariant cache hit.
[2024-06-01 20:49:00] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 20:49:00] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-06-01 20:49:00] [INFO ] Redundant transitions in 0 ms returned []
Running 25 sub problems to find dead transitions.
[2024-06-01 20:49:00] [INFO ] Invariant cache hit.
[2024-06-01 20:49:00] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 28/49 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 10/39 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/49 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 49/49 variables, and 39 constraints, problems are : Problem set: 0 solved, 25 unsolved in 181 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 28/49 variables, 21/29 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 10/39 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 25/64 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 0/49 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 49/49 variables, and 64 constraints, problems are : Problem set: 0 solved, 25 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 393ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 393ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/91 places, 28/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 468 ms. Remains : 21/91 places, 28/91 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-002B-LTLCardinality-09
Product exploration explored 100000 steps with 275 reset in 159 ms.
Product exploration explored 100000 steps with 287 reset in 131 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0))]
Knowledge based reduction with 7 factoid took 228 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (108 resets) in 145 ms. (273 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (114 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
[2024-06-01 20:49:01] [INFO ] Invariant cache hit.
[2024-06-01 20:49:01] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/42 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 9/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/49 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/49 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/49 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 49/49 variables, and 39 constraints, problems are : Problem set: 0 solved, 1 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 17/49 variables, and 6 constraints, problems are : Problem set: 1 solved, 0 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 6/8 constraints, State Equation: 0/21 constraints, ReadFeed: 0/10 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 65ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (OR p1 p0))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p1) p0))), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 14 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-002B-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-002B-LTLCardinality-09 finished in 1595 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))))'
Support contains 1 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 91/91 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 81 transition count 81
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 80 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 79 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 79 transition count 79
Applied a total of 24 rules in 7 ms. Remains 79 /91 variables (removed 12) and now considering 79/91 (removed 12) transitions.
// Phase 1: matrix 79 rows 79 cols
[2024-06-01 20:49:01] [INFO ] Computed 9 invariants in 0 ms
[2024-06-01 20:49:01] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 20:49:01] [INFO ] Invariant cache hit.
[2024-06-01 20:49:01] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-06-01 20:49:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-06-01 20:49:02] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-01 20:49:02] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-06-01 20:49:02] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 79/158 variables, 79/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/158 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 91 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1309 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 79/158 variables, 79/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 78/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-06-01 20:49:03] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-06-01 20:49:03] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-06-01 20:49:03] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 3/172 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-06-01 20:49:03] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-06-01 20:49:03] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 20:49:04] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-06-01 20:49:04] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/158 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-06-01 20:49:05] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-06-01 20:49:05] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/158 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/158 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 14 (OVERLAPS) 0/158 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 178 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4231 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 12/12 constraints]
After SMT, in 5549ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 5550ms
Starting structural reductions in LTL mode, iteration 1 : 79/91 places, 79/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5642 ms. Remains : 79/91 places, 79/91 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-002B-LTLCardinality-10
Product exploration explored 100000 steps with 33333 reset in 127 ms.
Product exploration explored 100000 steps with 33333 reset in 78 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-002B-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-002B-LTLCardinality-10 finished in 5992 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(p1)||p0)))'
Support contains 7 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 91/91 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 83 transition count 83
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 83 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 82 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 81 transition count 81
Applied a total of 20 rules in 5 ms. Remains 81 /91 variables (removed 10) and now considering 81/91 (removed 10) transitions.
// Phase 1: matrix 81 rows 81 cols
[2024-06-01 20:49:07] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 20:49:07] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-01 20:49:07] [INFO ] Invariant cache hit.
[2024-06-01 20:49:07] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2024-06-01 20:49:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 20:49:08] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-06-01 20:49:08] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-06-01 20:49:08] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-06-01 20:49:08] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-06-01 20:49:08] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 81/162 variables, 81/95 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 0/162 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 95 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1404 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/81 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 81/162 variables, 81/95 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 80/175 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 20:49:09] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-01 20:49:09] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-06-01 20:49:09] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 20:49:09] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-06-01 20:49:09] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 5/180 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 20:49:10] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 20:49:10] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-06-01 20:49:10] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 80 unsolved
[2024-06-01 20:49:10] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/162 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/162 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 184 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2959 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 14/14 constraints]
After SMT, in 4373ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 4374ms
Starting structural reductions in LTL mode, iteration 1 : 81/91 places, 81/91 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4551 ms. Remains : 81/91 places, 81/91 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-002B-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 51 ms.
Product exploration explored 100000 steps with 50000 reset in 56 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-002B-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-002B-LTLCardinality-11 finished in 4827 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(p0)))'
Support contains 1 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 91/91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 90 transition count 66
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 51 place count 66 transition count 63
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 54 place count 64 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 63 transition count 62
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 55 place count 63 transition count 52
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 75 place count 53 transition count 52
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 82 place count 46 transition count 45
Iterating global reduction 4 with 7 rules applied. Total rules applied 89 place count 46 transition count 45
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 89 place count 46 transition count 40
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 99 place count 41 transition count 40
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 129 place count 26 transition count 25
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 139 place count 21 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 141 place count 19 transition count 27
Applied a total of 141 rules in 19 ms. Remains 19 /91 variables (removed 72) and now considering 27/91 (removed 64) transitions.
// Phase 1: matrix 27 rows 19 cols
[2024-06-01 20:49:12] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 20:49:12] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 20:49:12] [INFO ] Invariant cache hit.
[2024-06-01 20:49:12] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 20:49:12] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-06-01 20:49:12] [INFO ] Redundant transitions in 0 ms returned []
Running 22 sub problems to find dead transitions.
[2024-06-01 20:49:12] [INFO ] Invariant cache hit.
[2024-06-01 20:49:12] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 1/19 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 26/45 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 0/45 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 45/46 variables, and 32 constraints, problems are : Problem set: 0 solved, 22 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 19/19 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 1/19 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 26/45 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 22/54 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 0/45 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/46 variables, and 54 constraints, problems are : Problem set: 0 solved, 22 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 19/19 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 336ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 336ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/91 places, 27/91 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 420 ms. Remains : 19/91 places, 27/91 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-002B-LTLCardinality-13
Stuttering criterion allowed to conclude after 60 steps with 1 reset in 2 ms.
FORMULA ShieldRVt-PT-002B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-LTLCardinality-13 finished in 531 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(p0))) U (!p1||F(!p2))))'
Found a Lengthening insensitive property : ShieldRVt-PT-002B-LTLCardinality-04
Stuttering acceptance computed with spot in 153 ms :[(AND p1 p2), (AND p2 (NOT p0)), (AND p2 (NOT p0)), p2]
Support contains 6 out of 91 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 91/91 places, 91/91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 90 transition count 68
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 25 rules applied. Total rules applied 47 place count 68 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 66 transition count 65
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 49 place count 66 transition count 54
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 71 place count 55 transition count 54
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 77 place count 49 transition count 48
Iterating global reduction 3 with 6 rules applied. Total rules applied 83 place count 49 transition count 48
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 83 place count 49 transition count 44
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 91 place count 45 transition count 44
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 115 place count 33 transition count 32
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 125 place count 28 transition count 36
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 28 transition count 36
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 128 place count 26 transition count 34
Applied a total of 128 rules in 15 ms. Remains 26 /91 variables (removed 65) and now considering 34/91 (removed 57) transitions.
// Phase 1: matrix 34 rows 26 cols
[2024-06-01 20:49:13] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 20:49:13] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 20:49:13] [INFO ] Invariant cache hit.
[2024-06-01 20:49:13] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 20:49:13] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Running 31 sub problems to find dead transitions.
[2024-06-01 20:49:13] [INFO ] Invariant cache hit.
[2024-06-01 20:49:13] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 3/26 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-06-01 20:49:13] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-06-01 20:49:13] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 34/60 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 13/50 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-06-01 20:49:13] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 51 constraints, problems are : Problem set: 0 solved, 31 unsolved in 467 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 26/26 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 3/26 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 34/60 variables, 26/38 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 31/82 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 82 constraints, problems are : Problem set: 0 solved, 31 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 26/26 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 3/3 constraints]
After SMT, in 782ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 783ms
Starting structural reductions in LI_LTL mode, iteration 1 : 26/91 places, 34/91 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 863 ms. Remains : 26/91 places, 34/91 transitions.
Running random walk in product with property : ShieldRVt-PT-002B-LTLCardinality-04
Product exploration explored 100000 steps with 20713 reset in 136 ms.
Stack based approach found an accepted trace after 436 steps with 90 reset with depth 5 and stack size 5 in 1 ms.
Treatment of property ShieldRVt-PT-002B-LTLCardinality-04 finished in 1258 ms.
FORMULA ShieldRVt-PT-002B-LTLCardinality-04 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-06-01 20:49:14] [INFO ] Flatten gal took : 5 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 46924 ms.
ITS solved all properties within timeout

BK_STOP 1717274954305

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML

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="ShieldRVt-PT-002B"
export BK_EXAMINATION="LTLCardinality"
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 ShieldRVt-PT-002B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683762100907"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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