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.r356-tall-171683762100891.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 itstools
Input is ShieldRVt-PT-001B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683762100891
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.2K Apr 23 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 21:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 11 21:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 21:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 11 21:33 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 13K 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-001B-LTLCardinality-00
FORMULA_NAME ShieldRVt-PT-001B-LTLCardinality-01
FORMULA_NAME ShieldRVt-PT-001B-LTLCardinality-02
FORMULA_NAME ShieldRVt-PT-001B-LTLCardinality-03
FORMULA_NAME ShieldRVt-PT-001B-LTLCardinality-04
FORMULA_NAME ShieldRVt-PT-001B-LTLCardinality-05
FORMULA_NAME ShieldRVt-PT-001B-LTLCardinality-06
FORMULA_NAME ShieldRVt-PT-001B-LTLCardinality-07
FORMULA_NAME ShieldRVt-PT-001B-LTLCardinality-08
FORMULA_NAME ShieldRVt-PT-001B-LTLCardinality-09
FORMULA_NAME ShieldRVt-PT-001B-LTLCardinality-10
FORMULA_NAME ShieldRVt-PT-001B-LTLCardinality-11
FORMULA_NAME ShieldRVt-PT-001B-LTLCardinality-12
FORMULA_NAME ShieldRVt-PT-001B-LTLCardinality-13
FORMULA_NAME ShieldRVt-PT-001B-LTLCardinality-14
FORMULA_NAME ShieldRVt-PT-001B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717075227189

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-001B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-30 13:20:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 13:20:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 13:20:28] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2024-05-30 13:20:28] [INFO ] Transformed 53 places.
[2024-05-30 13:20:28] [INFO ] Transformed 53 transitions.
[2024-05-30 13:20:28] [INFO ] Found NUPN structural information;
[2024-05-30 13:20:28] [INFO ] Parsed PT model containing 53 places and 53 transitions and 124 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVt-PT-001B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001B-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 47 transition count 47
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 47 transition count 47
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 46 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 46 transition count 46
Applied a total of 14 rules in 19 ms. Remains 46 /53 variables (removed 7) and now considering 46/53 (removed 7) transitions.
// Phase 1: matrix 46 rows 46 cols
[2024-05-30 13:20:28] [INFO ] Computed 5 invariants in 6 ms
[2024-05-30 13:20:28] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-30 13:20:28] [INFO ] Invariant cache hit.
[2024-05-30 13:20:28] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 45 sub problems to find dead transitions.
[2024-05-30 13:20:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-30 13:20:29] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 6 ms to minimize.
[2024-05-30 13:20:29] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:20:29] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:20:29] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:20:29] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-30 13:20:29] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 1 ms to minimize.
[2024-05-30 13:20:29] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:20:29] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-30 13:20:29] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 46/92 variables, 46/60 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-30 13:20:29] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 0/92 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 61 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1078 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 46/92 variables, 46/61 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 45/106 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-30 13:20:30] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 0/92 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 107 constraints, problems are : Problem set: 0 solved, 45 unsolved in 808 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 11/11 constraints]
After SMT, in 1918ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 1932ms
Starting structural reductions in LTL mode, iteration 1 : 46/53 places, 46/53 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2226 ms. Remains : 46/53 places, 46/53 transitions.
Support contains 25 out of 46 places after structural reductions.
[2024-05-30 13:20:31] [INFO ] Flatten gal took : 19 ms
[2024-05-30 13:20:31] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:20:31] [INFO ] Input system was already deterministic with 46 transitions.
RANDOM walk for 40000 steps (42 resets) in 880 ms. (45 steps per ms) remains 1/17 properties
BEST_FIRST walk for 40001 steps (38 resets) in 269 ms. (148 steps per ms) remains 1/1 properties
[2024-05-30 13:20:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp1 is UNSAT
After SMT solving in domain Real declared 25/92 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 2/5 constraints, State Equation: 0/46 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 23ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA ShieldRVt-PT-001B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 12 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 46/46 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 40 transition count 40
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 40 transition count 40
Applied a total of 12 rules in 2 ms. Remains 40 /46 variables (removed 6) and now considering 40/46 (removed 6) transitions.
// Phase 1: matrix 40 rows 40 cols
[2024-05-30 13:20:31] [INFO ] Computed 5 invariants in 1 ms
[2024-05-30 13:20:31] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-30 13:20:31] [INFO ] Invariant cache hit.
[2024-05-30 13:20:31] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 39 sub problems to find dead transitions.
[2024-05-30 13:20:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 13:20:31] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/80 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 0/80 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 46 constraints, problems are : Problem set: 0 solved, 39 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/80 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 39/85 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 13:20:32] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 13:20:32] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/80 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 87 constraints, problems are : Problem set: 0 solved, 39 unsolved in 663 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 3/3 constraints]
After SMT, in 1093ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1095ms
Starting structural reductions in LTL mode, iteration 1 : 40/46 places, 40/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1164 ms. Remains : 40/46 places, 40/46 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-001B-LTLCardinality-00
Product exploration explored 100000 steps with 2685 reset in 204 ms.
Stack based approach found an accepted trace after 35 steps with 0 reset with depth 36 and stack size 36 in 1 ms.
FORMULA ShieldRVt-PT-001B-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-001B-LTLCardinality-00 finished in 1622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 46/46 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 45 transition count 38
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 38 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 37 transition count 37
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 16 place count 37 transition count 29
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 32 place count 29 transition count 29
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 34 place count 27 transition count 27
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 27 transition count 27
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 36 place count 27 transition count 25
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 25 transition count 25
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
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 60 place count 15 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 15 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 63 place count 14 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 67 place count 12 transition count 14
Applied a total of 67 rules in 27 ms. Remains 12 /46 variables (removed 34) and now considering 14/46 (removed 32) transitions.
// Phase 1: matrix 14 rows 12 cols
[2024-05-30 13:20:33] [INFO ] Computed 5 invariants in 2 ms
[2024-05-30 13:20:33] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-30 13:20:33] [INFO ] Invariant cache hit.
[2024-05-30 13:20:33] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-30 13:20:33] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-30 13:20:33] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
[2024-05-30 13:20:33] [INFO ] Invariant cache hit.
[2024-05-30 13:20:33] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/12 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-30 13:20:33] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 13/25 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/26 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/26 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/26 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 25 constraints, problems are : Problem set: 0 solved, 13 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 12/12 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/12 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 13/25 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 13/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 1/26 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/26 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/26 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 38 constraints, problems are : Problem set: 0 solved, 13 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 12/12 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 1/1 constraints]
After SMT, in 320ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 320ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/46 places, 14/46 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 408 ms. Remains : 12/46 places, 14/46 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-001B-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 106 ms.
Product exploration explored 100000 steps with 50000 reset in 118 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 : [(NOT p0), (X p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-001B-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-001B-LTLCardinality-06 finished in 715 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(p0))||(X(F(p1))&&F(p2)))))'
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 42
Applied a total of 8 rules in 3 ms. Remains 42 /46 variables (removed 4) and now considering 42/46 (removed 4) transitions.
// Phase 1: matrix 42 rows 42 cols
[2024-05-30 13:20:34] [INFO ] Computed 5 invariants in 4 ms
[2024-05-30 13:20:34] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-30 13:20:34] [INFO ] Invariant cache hit.
[2024-05-30 13:20:34] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Running 41 sub problems to find dead transitions.
[2024-05-30 13:20:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-30 13:20:34] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:20:34] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
[2024-05-30 13:20:34] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:20:34] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 1 ms to minimize.
[2024-05-30 13:20:34] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
[2024-05-30 13:20:34] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-30 13:20:34] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 42/84 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 0/84 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 54 constraints, problems are : Problem set: 0 solved, 41 unsolved in 699 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 42/84 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 41/95 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-30 13:20:34] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 0/84 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 96 constraints, problems are : Problem set: 0 solved, 41 unsolved in 540 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 8/8 constraints]
After SMT, in 1247ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 1248ms
Starting structural reductions in LTL mode, iteration 1 : 42/46 places, 42/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1320 ms. Remains : 42/46 places, 42/46 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-001B-LTLCardinality-07
Product exploration explored 100000 steps with 33333 reset in 72 ms.
Product exploration explored 100000 steps with 33333 reset in 56 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT p1)), (X p2), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 28 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-001B-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-001B-LTLCardinality-07 finished in 1720 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(p0)||X(F(p1))))'
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 46/46 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 41 transition count 41
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 41 transition count 41
Applied a total of 10 rules in 4 ms. Remains 41 /46 variables (removed 5) and now considering 41/46 (removed 5) transitions.
// Phase 1: matrix 41 rows 41 cols
[2024-05-30 13:20:35] [INFO ] Computed 5 invariants in 1 ms
[2024-05-30 13:20:35] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-30 13:20:35] [INFO ] Invariant cache hit.
[2024-05-30 13:20:35] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 13:20:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 13:20:35] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 41/82 variables, 41/47 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 13:20:36] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-30 13:20:36] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/82 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 49 constraints, problems are : Problem set: 0 solved, 40 unsolved in 556 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 13:20:36] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 41/82 variables, 41/50 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 40/90 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 13:20:36] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:20:36] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/82 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 92 constraints, problems are : Problem set: 0 solved, 40 unsolved in 667 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 6/6 constraints]
After SMT, in 1231ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1232ms
Starting structural reductions in LTL mode, iteration 1 : 41/46 places, 41/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1320 ms. Remains : 41/46 places, 41/46 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-001B-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 40 ms.
Product exploration explored 100000 steps with 50000 reset in 49 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Detected a total of 10/41 stabilizing places and 10/41 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 18 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-001B-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-001B-LTLCardinality-08 finished in 1584 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 46/46 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 41 transition count 41
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 41 transition count 41
Applied a total of 10 rules in 2 ms. Remains 41 /46 variables (removed 5) and now considering 41/46 (removed 5) transitions.
// Phase 1: matrix 41 rows 41 cols
[2024-05-30 13:20:37] [INFO ] Computed 5 invariants in 0 ms
[2024-05-30 13:20:37] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-30 13:20:37] [INFO ] Invariant cache hit.
[2024-05-30 13:20:37] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2024-05-30 13:20:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 13:20:37] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 13:20:37] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (OVERLAPS) 41/82 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/82 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 48 constraints, problems are : Problem set: 0 solved, 40 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 41/82 variables, 41/48 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 40/88 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 13:20:38] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/82 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 89 constraints, problems are : Problem set: 0 solved, 40 unsolved in 519 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 41/41 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 3/3 constraints]
After SMT, in 1059ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 1060ms
Starting structural reductions in LTL mode, iteration 1 : 41/46 places, 41/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1126 ms. Remains : 41/46 places, 41/46 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-001B-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 80 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-001B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-001B-LTLCardinality-09 finished in 1268 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((F(p1)&&p0))))'
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 42
Applied a total of 8 rules in 6 ms. Remains 42 /46 variables (removed 4) and now considering 42/46 (removed 4) transitions.
// Phase 1: matrix 42 rows 42 cols
[2024-05-30 13:20:38] [INFO ] Computed 5 invariants in 1 ms
[2024-05-30 13:20:38] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-30 13:20:38] [INFO ] Invariant cache hit.
[2024-05-30 13:20:38] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 41 sub problems to find dead transitions.
[2024-05-30 13:20:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-30 13:20:38] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:20:38] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:20:38] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 42/84 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 50 constraints, problems are : Problem set: 0 solved, 41 unsolved in 526 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 42/84 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 41/91 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-30 13:20:39] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/84 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 0/84 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 92 constraints, problems are : Problem set: 0 solved, 41 unsolved in 646 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 4/4 constraints]
After SMT, in 1178ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 1179ms
Starting structural reductions in LTL mode, iteration 1 : 42/46 places, 42/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1256 ms. Remains : 42/46 places, 42/46 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-001B-LTLCardinality-11
Stuttering criterion allowed to conclude after 2950 steps with 35 reset in 5 ms.
FORMULA ShieldRVt-PT-001B-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-001B-LTLCardinality-11 finished in 1409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((!p1&&X(p0))||X(G(p0)))))'
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 46/46 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 42
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 42
Applied a total of 8 rules in 2 ms. Remains 42 /46 variables (removed 4) and now considering 42/46 (removed 4) transitions.
// Phase 1: matrix 42 rows 42 cols
[2024-05-30 13:20:39] [INFO ] Computed 5 invariants in 0 ms
[2024-05-30 13:20:40] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-30 13:20:40] [INFO ] Invariant cache hit.
[2024-05-30 13:20:40] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Running 41 sub problems to find dead transitions.
[2024-05-30 13:20:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-30 13:20:40] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-30 13:20:40] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-30 13:20:40] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 42/84 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 0/84 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 50 constraints, problems are : Problem set: 0 solved, 41 unsolved in 613 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 42/84 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 41/91 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-30 13:20:40] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-30 13:20:41] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:20:41] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:20:41] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:20:41] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-30 13:20:41] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 5/97 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 0/84 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 97 constraints, problems are : Problem set: 0 solved, 41 unsolved in 851 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 9/9 constraints]
After SMT, in 1470ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 1471ms
Starting structural reductions in LTL mode, iteration 1 : 42/46 places, 42/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1538 ms. Remains : 42/46 places, 42/46 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldRVt-PT-001B-LTLCardinality-13
Product exploration explored 100000 steps with 33751 reset in 85 ms.
Product exploration explored 100000 steps with 33804 reset in 104 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p1 p0)), (X p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 105 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), true]
RANDOM walk for 158 steps (0 resets) in 7 ms. (19 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (AND p1 p0)), (X p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 204 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0), true]
Support contains 6 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 42 /42 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-30 13:20:42] [INFO ] Invariant cache hit.
[2024-05-30 13:20:42] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-30 13:20:42] [INFO ] Invariant cache hit.
[2024-05-30 13:20:42] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Running 41 sub problems to find dead transitions.
[2024-05-30 13:20:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-30 13:20:42] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-30 13:20:42] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-30 13:20:42] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 42/84 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 0/84 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/84 variables, and 50 constraints, problems are : Problem set: 0 solved, 41 unsolved in 626 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 42/84 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 41/91 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-30 13:20:43] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-30 13:20:43] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-30 13:20:43] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:20:43] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:20:43] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:20:43] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 5/97 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 0/84 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/84 variables, and 97 constraints, problems are : Problem set: 0 solved, 41 unsolved in 831 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 9/9 constraints]
After SMT, in 1463ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 1464ms
Finished structural reductions in LTL mode , in 1 iterations and 1536 ms. Remains : 42/42 places, 42/42 transitions.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 119 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), true]
RANDOM walk for 148 steps (0 resets) in 6 ms. (21 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 p0))), (F (NOT (OR (NOT p1) p0))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 230 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 33821 reset in 71 ms.
Product exploration explored 100000 steps with 33835 reset in 107 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), true]
Support contains 6 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 42/42 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 42 transition count 42
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 8 place count 42 transition count 46
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 42 transition count 46
Performed 9 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 42 transition count 46
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 42 transition count 45
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 29 place count 35 transition count 38
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 36 place count 35 transition count 38
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 35 transition count 45
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 40 place count 33 transition count 41
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 33 transition count 41
Deduced a syphon composed of 14 places in 0 ms
Applied a total of 42 rules in 7 ms. Remains 33 /42 variables (removed 9) and now considering 41/42 (removed 1) transitions.
[2024-05-30 13:20:45] [INFO ] Redundant transitions in 1 ms returned []
Running 40 sub problems to find dead transitions.
// Phase 1: matrix 41 rows 33 cols
[2024-05-30 13:20:45] [INFO ] Computed 5 invariants in 1 ms
[2024-05-30 13:20:45] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1/33 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 40 unsolved
[2024-05-30 13:20:45] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
[2024-05-30 13:20:45] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
[2024-05-30 13:20:45] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem TDEAD10 is UNSAT
[2024-05-30 13:20:45] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
[2024-05-30 13:20:45] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
[2024-05-30 13:20:45] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 6/11 constraints. Problems are: Problem set: 22 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 22 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 41/74 variables, 33/44 constraints. Problems are: Problem set: 22 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 5/49 constraints. Problems are: Problem set: 22 solved, 18 unsolved
[2024-05-30 13:20:45] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 1/50 constraints. Problems are: Problem set: 22 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/50 constraints. Problems are: Problem set: 22 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/74 variables, 0/50 constraints. Problems are: Problem set: 22 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 74/74 variables, and 50 constraints, problems are : Problem set: 22 solved, 18 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 33/33 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 22 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 22 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 15/33 variables, 5/5 constraints. Problems are: Problem set: 22 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 7/12 constraints. Problems are: Problem set: 22 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 22 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 41/74 variables, 33/45 constraints. Problems are: Problem set: 22 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 5/50 constraints. Problems are: Problem set: 22 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 18/68 constraints. Problems are: Problem set: 22 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/68 constraints. Problems are: Problem set: 22 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/74 variables, 0/68 constraints. Problems are: Problem set: 22 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 74/74 variables, and 68 constraints, problems are : Problem set: 22 solved, 18 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 33/33 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 18/40 constraints, Known Traps: 7/7 constraints]
After SMT, in 658ms problems are : Problem set: 22 solved, 18 unsolved
Search for dead transitions found 22 dead transitions in 660ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 33/42 places, 19/42 transitions.
Graph (complete) has 49 edges and 33 vertex of which 19 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.2 ms
Discarding 14 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 19 /33 variables (removed 14) and now considering 19/19 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/42 places, 19/42 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 684 ms. Remains : 19/42 places, 19/42 transitions.
Built C files in :
/tmp/ltsmin4736918547331085625
[2024-05-30 13:20:45] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4736918547331085625
Running compilation step : cd /tmp/ltsmin4736918547331085625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 219 ms.
Running link step : cd /tmp/ltsmin4736918547331085625;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin4736918547331085625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased297204889236164679.hoa' '--buchi-type=spotba'
LTSmin run took 495 ms.
FORMULA ShieldRVt-PT-001B-LTLCardinality-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-001B-LTLCardinality-13 finished in 6779 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 46/46 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 45 transition count 37
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 37 transition count 37
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 16 place count 37 transition count 31
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 28 place count 31 transition count 31
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 32 place count 27 transition count 27
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 27 transition count 27
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 36 place count 27 transition count 25
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 25 transition count 25
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 58 place count 16 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 16 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 15 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 14 transition count 14
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 64 place count 14 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 13 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 66 place count 12 transition count 13
Applied a total of 66 rules in 12 ms. Remains 12 /46 variables (removed 34) and now considering 13/46 (removed 33) transitions.
// Phase 1: matrix 13 rows 12 cols
[2024-05-30 13:20:46] [INFO ] Computed 4 invariants in 1 ms
[2024-05-30 13:20:46] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-30 13:20:46] [INFO ] Invariant cache hit.
[2024-05-30 13:20:46] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-30 13:20:46] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2024-05-30 13:20:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 13/25 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 0/25 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 16 constraints, problems are : Problem set: 0 solved, 11 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 13/25 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 0/25 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 27 constraints, problems are : Problem set: 0 solved, 11 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 175ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 176ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/46 places, 13/46 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 240 ms. Remains : 12/46 places, 13/46 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-001B-LTLCardinality-14
Stuttering criterion allowed to conclude after 109 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-001B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-001B-LTLCardinality-14 finished in 283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U X(p1)))))'
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 46/46 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 40 transition count 40
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 40 transition count 40
Applied a total of 12 rules in 9 ms. Remains 40 /46 variables (removed 6) and now considering 40/46 (removed 6) transitions.
// Phase 1: matrix 40 rows 40 cols
[2024-05-30 13:20:47] [INFO ] Computed 5 invariants in 1 ms
[2024-05-30 13:20:47] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-30 13:20:47] [INFO ] Invariant cache hit.
[2024-05-30 13:20:47] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 39 sub problems to find dead transitions.
[2024-05-30 13:20:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 13:20:47] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/80 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 0/80 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 46 constraints, problems are : Problem set: 0 solved, 39 unsolved in 409 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/80 variables, 40/46 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 39/85 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 13:20:47] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-30 13:20:47] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/80 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 87 constraints, problems are : Problem set: 0 solved, 39 unsolved in 669 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 40/40 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 3/3 constraints]
After SMT, in 1083ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1083ms
Starting structural reductions in LTL mode, iteration 1 : 40/46 places, 40/46 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1177 ms. Remains : 40/46 places, 40/46 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-001B-LTLCardinality-15
Product exploration explored 100000 steps with 31516 reset in 49 ms.
Product exploration explored 100000 steps with 31685 reset in 117 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Detected a total of 10/40 stabilizing places and 10/40 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 132 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (51 resets) in 211 ms. (188 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40001 steps (15 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
[2024-05-30 13:20:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 37/80 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 4/5 constraints, State Equation: 0/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 68ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (G (OR p1 p0)), (G (OR p1 p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (NOT p1) p0)))]
Knowledge based reduction with 12 factoid took 311 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 40/40 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 39 transition count 32
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 32 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 31 transition count 31
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 16 place count 31 transition count 23
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 32 place count 23 transition count 23
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 44 place count 17 transition count 17
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 17 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 47 place count 16 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 49 place count 15 transition count 15
Applied a total of 49 rules in 10 ms. Remains 15 /40 variables (removed 25) and now considering 15/40 (removed 25) transitions.
// Phase 1: matrix 15 rows 15 cols
[2024-05-30 13:20:49] [INFO ] Computed 5 invariants in 0 ms
[2024-05-30 13:20:49] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-30 13:20:49] [INFO ] Invariant cache hit.
[2024-05-30 13:20:49] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-30 13:20:49] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-30 13:20:49] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
[2024-05-30 13:20:49] [INFO ] Invariant cache hit.
[2024-05-30 13:20:49] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-30 13:20:49] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 15/30 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/30 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 26 constraints, problems are : Problem set: 0 solved, 14 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 15/15 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 15/30 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 14/40 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-30 13:20:49] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/30 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/30 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 41 constraints, problems are : Problem set: 0 solved, 14 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 15/15 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 2/2 constraints]
After SMT, in 304ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 305ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/40 places, 15/40 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 367 ms. Remains : 15/40 places, 15/40 transitions.
Computed a total of 5 stabilizing places and 4 stable transitions
Computed a total of 5 stabilizing places and 4 stable transitions
Detected a total of 5/15 stabilizing places and 4/15 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 154 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (166 resets) in 100 ms. (396 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (43 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
[2024-05-30 13:20:50] [INFO ] Invariant cache hit.
[2024-05-30 13:20:50] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 13/30 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 14 ms.
Refiners :[Positive P Invariants (semi-flows): 4/5 constraints, State Equation: 0/15 constraints, ReadFeed: 0/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 17ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 16 factoid took 457 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 2396 reset in 112 ms.
Product exploration explored 100000 steps with 2164 reset in 126 ms.
Built C files in :
/tmp/ltsmin16316212664475056143
[2024-05-30 13:20:51] [INFO ] Computing symmetric may disable matrix : 15 transitions.
[2024-05-30 13:20:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:20:51] [INFO ] Computing symmetric may enable matrix : 15 transitions.
[2024-05-30 13:20:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:20:51] [INFO ] Computing Do-Not-Accords matrix : 15 transitions.
[2024-05-30 13:20:51] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 13:20:51] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16316212664475056143
Running compilation step : cd /tmp/ltsmin16316212664475056143;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 84 ms.
Running link step : cd /tmp/ltsmin16316212664475056143;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin16316212664475056143;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18059991384465431394.hoa' '--buchi-type=spotba'
LTSmin run took 52 ms.
FORMULA ShieldRVt-PT-001B-LTLCardinality-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-001B-LTLCardinality-15 finished in 4378 ms.
All properties solved by simple procedures.
Total runtime 23051 ms.

BK_STOP 1717075251456

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-001B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ShieldRVt-PT-001B, 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 r356-tall-171683762100891"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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