About the Execution of ITS-Tools for ShieldRVs-PT-001A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
421.712 | 21593.00 | 36392.00 | 225.80 | TFFTTTTTFTTTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r356-tall-171683761700707.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 ShieldRVs-PT-001A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761700707
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 17:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 12 17:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 17:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 12 17:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:54 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 6.8K 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 ShieldRVs-PT-001A-LTLCardinality-00
FORMULA_NAME ShieldRVs-PT-001A-LTLCardinality-01
FORMULA_NAME ShieldRVs-PT-001A-LTLCardinality-02
FORMULA_NAME ShieldRVs-PT-001A-LTLCardinality-03
FORMULA_NAME ShieldRVs-PT-001A-LTLCardinality-04
FORMULA_NAME ShieldRVs-PT-001A-LTLCardinality-05
FORMULA_NAME ShieldRVs-PT-001A-LTLCardinality-06
FORMULA_NAME ShieldRVs-PT-001A-LTLCardinality-07
FORMULA_NAME ShieldRVs-PT-001A-LTLCardinality-08
FORMULA_NAME ShieldRVs-PT-001A-LTLCardinality-09
FORMULA_NAME ShieldRVs-PT-001A-LTLCardinality-10
FORMULA_NAME ShieldRVs-PT-001A-LTLCardinality-11
FORMULA_NAME ShieldRVs-PT-001A-LTLCardinality-12
FORMULA_NAME ShieldRVs-PT-001A-LTLCardinality-13
FORMULA_NAME ShieldRVs-PT-001A-LTLCardinality-14
FORMULA_NAME ShieldRVs-PT-001A-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717032246157
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-001A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-30 01:24:07] [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 01:24:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:24:07] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2024-05-30 01:24:07] [INFO ] Transformed 17 places.
[2024-05-30 01:24:07] [INFO ] Transformed 22 transitions.
[2024-05-30 01:24:07] [INFO ] Found NUPN structural information;
[2024-05-30 01:24:07] [INFO ] Parsed PT model containing 17 places and 22 transitions and 92 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA ShieldRVs-PT-001A-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001A-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001A-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001A-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001A-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001A-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001A-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 9 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 17 cols
[2024-05-30 01:24:07] [INFO ] Computed 5 invariants in 4 ms
[2024-05-30 01:24:07] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-30 01:24:07] [INFO ] Invariant cache hit.
[2024-05-30 01:24:07] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 21 sub problems to find dead transitions.
[2024-05-30 01:24:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-30 01:24:07] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 17 ms to minimize.
[2024-05-30 01:24:07] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-30 01:24:08] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:24:08] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/39 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 43 constraints, problems are : Problem set: 0 solved, 21 unsolved in 437 ms.
Refiners :[Domain max(s): 17/17 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/39 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 21/64 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-30 01:24:08] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/39 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 65 constraints, problems are : Problem set: 0 solved, 21 unsolved in 577 ms.
Refiners :[Domain max(s): 17/17 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 5/5 constraints]
After SMT, in 1054ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1066ms
Finished structural reductions in LTL mode , in 1 iterations and 1286 ms. Remains : 17/17 places, 22/22 transitions.
Support contains 14 out of 17 places after structural reductions.
[2024-05-30 01:24:08] [INFO ] Flatten gal took : 17 ms
[2024-05-30 01:24:08] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:24:08] [INFO ] Input system was already deterministic with 22 transitions.
RANDOM walk for 71 steps (0 resets) in 13 ms. (5 steps per ms) remains 0/18 properties
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(F(p1)||G(p2))))'
Support contains 6 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 16 transition count 21
Applied a total of 2 rules in 16 ms. Remains 16 /17 variables (removed 1) and now considering 21/22 (removed 1) transitions.
// Phase 1: matrix 21 rows 16 cols
[2024-05-30 01:24:09] [INFO ] Computed 5 invariants in 0 ms
[2024-05-30 01:24:09] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-30 01:24:09] [INFO ] Invariant cache hit.
[2024-05-30 01:24:09] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-30 01:24:09] [INFO ] Redundant transitions in 26 ms returned [6]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 19 sub problems to find dead transitions.
// Phase 1: matrix 20 rows 16 cols
[2024-05-30 01:24:09] [INFO ] Computed 5 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 1/16 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-30 01:24:09] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-05-30 01:24:09] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:24:09] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:24:09] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:24:09] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 20/36 variables, 16/42 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-30 01:24:09] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/36 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 43 constraints, problems are : Problem set: 0 solved, 19 unsolved in 357 ms.
Refiners :[Domain max(s): 16/16 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 1/16 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 6/27 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-30 01:24:09] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 20/36 variables, 16/44 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/36 variables, 19/63 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-30 01:24:09] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/36 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 0/36 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 64 constraints, problems are : Problem set: 0 solved, 19 unsolved in 270 ms.
Refiners :[Domain max(s): 16/16 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 8/8 constraints]
After SMT, in 640ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 641ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/17 places, 20/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 764 ms. Remains : 16/17 places, 20/22 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-001A-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 252 ms.
Product exploration explored 100000 steps with 50000 reset in 123 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X p1), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 15 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-001A-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-001A-LTLCardinality-00 finished in 1468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 17 cols
[2024-05-30 01:24:10] [INFO ] Computed 5 invariants in 1 ms
[2024-05-30 01:24:10] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-30 01:24:10] [INFO ] Invariant cache hit.
[2024-05-30 01:24:10] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Running 21 sub problems to find dead transitions.
[2024-05-30 01:24:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-30 01:24:10] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-30 01:24:10] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:24:10] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:24:11] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/39 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 43 constraints, problems are : Problem set: 0 solved, 21 unsolved in 252 ms.
Refiners :[Domain max(s): 17/17 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/39 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 21/64 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-30 01:24:11] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/39 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 65 constraints, problems are : Problem set: 0 solved, 21 unsolved in 306 ms.
Refiners :[Domain max(s): 17/17 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 5/5 constraints]
After SMT, in 567ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 568ms
Finished structural reductions in LTL mode , in 1 iterations and 626 ms. Remains : 17/17 places, 22/22 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001A-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 133 ms.
Product exploration explored 100000 steps with 50000 reset in 83 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 11 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-001A-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-001A-LTLCardinality-03 finished in 930 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((X((p0 U p1))||(p0&&G(p2))))))'
Support contains 6 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-30 01:24:11] [INFO ] Invariant cache hit.
[2024-05-30 01:24:11] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-30 01:24:11] [INFO ] Invariant cache hit.
[2024-05-30 01:24:11] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Running 21 sub problems to find dead transitions.
[2024-05-30 01:24:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-30 01:24:11] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:24:11] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:24:11] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2024-05-30 01:24:11] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/39 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 43 constraints, problems are : Problem set: 0 solved, 21 unsolved in 260 ms.
Refiners :[Domain max(s): 17/17 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/39 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 21/64 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-30 01:24:12] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/39 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 65 constraints, problems are : Problem set: 0 solved, 21 unsolved in 338 ms.
Refiners :[Domain max(s): 17/17 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 5/5 constraints]
After SMT, in 605ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 606ms
Finished structural reductions in LTL mode , in 1 iterations and 665 ms. Remains : 17/17 places, 22/22 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-001A-LTLCardinality-04
Product exploration explored 100000 steps with 21016 reset in 114 ms.
Product exploration explored 100000 steps with 21087 reset in 121 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (X p2)), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 111 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 17 states, 46 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 685 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), false, (AND (NOT p0) (NOT p1) p2), false, (AND p0 (NOT p1) (NOT p2)), false, false, false, false, false, false, false, false]
RANDOM walk for 40000 steps (685 resets) in 782 ms. (51 steps per ms) remains 3/14 properties
BEST_FIRST walk for 40003 steps (185 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (356 resets) in 149 ms. (266 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (360 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
[2024-05-30 01:24:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 7/13 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 4/17 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/17 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 22/39 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 39 constraints, problems are : Problem set: 0 solved, 3 unsolved in 53 ms.
Refiners :[Domain max(s): 17/17 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf3 is UNSAT
Problem apf6 is UNSAT
Problem apf13 is UNSAT
After SMT solving in domain Int declared 13/39 variables, and 10 constraints, problems are : Problem set: 3 solved, 0 unsolved in 24 ms.
Refiners :[Domain max(s): 6/17 constraints, Positive P Invariants (semi-flows): 4/5 constraints, State Equation: 0/17 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 82ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (X p2)), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (G (OR p0 p2 p1)), (G (OR (NOT p0) p2 p1)), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p1))), (F (NOT (AND (OR p0 p1) (OR p2 p1)))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (AND p0 p2 p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT p0))]
Knowledge based reduction with 15 factoid took 675 ms. Reduced automaton from 17 states, 46 edges and 3 AP (stutter insensitive) to 11 states, 35 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 451 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 443 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 17 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 4 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-30 01:24:15] [INFO ] Invariant cache hit.
[2024-05-30 01:24:15] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-30 01:24:15] [INFO ] Invariant cache hit.
[2024-05-30 01:24:15] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-30 01:24:15] [INFO ] Redundant transitions in 14 ms returned [9]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 17 cols
[2024-05-30 01:24:15] [INFO ] Computed 5 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-30 01:24:15] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-05-30 01:24:15] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:24:15] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-30 01:24:15] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 21/38 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-30 01:24:16] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/38 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/38 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 44 constraints, problems are : Problem set: 0 solved, 20 unsolved in 344 ms.
Refiners :[Domain max(s): 17/17 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 21/38 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-30 01:24:16] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/38 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 65 constraints, problems are : Problem set: 0 solved, 20 unsolved in 230 ms.
Refiners :[Domain max(s): 17/17 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 6/6 constraints]
After SMT, in 585ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 587ms
Starting structural reductions in SI_LTL mode, iteration 1 : 17/17 places, 21/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 673 ms. Remains : 17/17 places, 21/22 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 119 ms. Reduced automaton from 11 states, 35 edges and 2 AP (stutter insensitive) to 13 states, 43 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 538 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 49 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 13 factoid took 313 ms. Reduced automaton from 13 states, 43 edges and 2 AP (stutter insensitive) to 13 states, 43 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 527 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 509 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 545 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22228 reset in 95 ms.
Product exploration explored 100000 steps with 22231 reset in 94 ms.
Built C files in :
/tmp/ltsmin4550314209351918407
[2024-05-30 01:24:19] [INFO ] Computing symmetric may disable matrix : 21 transitions.
[2024-05-30 01:24:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 01:24:19] [INFO ] Computing symmetric may enable matrix : 21 transitions.
[2024-05-30 01:24:19] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 01:24:19] [INFO ] Computing Do-Not-Accords matrix : 21 transitions.
[2024-05-30 01:24:19] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 01:24:19] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4550314209351918407
Running compilation step : cd /tmp/ltsmin4550314209351918407;'/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 223 ms.
Running link step : cd /tmp/ltsmin4550314209351918407;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin4550314209351918407;'/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/stateBased6140356416385568892.hoa' '--buchi-type=spotba'
LTSmin run took 65 ms.
FORMULA ShieldRVs-PT-001A-LTLCardinality-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVs-PT-001A-LTLCardinality-04 finished in 7854 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X((p1 U (G(p1)||p2)))&&p0)))))'
Support contains 5 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 17 cols
[2024-05-30 01:24:19] [INFO ] Computed 5 invariants in 1 ms
[2024-05-30 01:24:19] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-30 01:24:19] [INFO ] Invariant cache hit.
[2024-05-30 01:24:19] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Running 21 sub problems to find dead transitions.
[2024-05-30 01:24:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-30 01:24:19] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-30 01:24:19] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-30 01:24:19] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-05-30 01:24:19] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/39 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 43 constraints, problems are : Problem set: 0 solved, 21 unsolved in 274 ms.
Refiners :[Domain max(s): 17/17 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/39 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 21/64 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-30 01:24:20] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/39 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 65 constraints, problems are : Problem set: 0 solved, 21 unsolved in 289 ms.
Refiners :[Domain max(s): 17/17 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 5/5 constraints]
After SMT, in 575ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 576ms
Finished structural reductions in LTL mode , in 1 iterations and 633 ms. Remains : 17/17 places, 22/22 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-001A-LTLCardinality-06
Product exploration explored 100000 steps with 15992 reset in 71 ms.
Product exploration explored 100000 steps with 15989 reset in 77 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (747 resets) in 123 ms. (322 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (42 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
[2024-05-30 01:24:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 12/17 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/39 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 39 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26 ms.
Refiners :[Domain max(s): 17/17 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 5/39 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Domain max(s): 5/17 constraints, Positive P Invariants (semi-flows): 0/5 constraints, State Equation: 0/17 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 43ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X (X (NOT p0))), (G (OR p1 (NOT p0) p2))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p0 p2))), (F (NOT p1)), (F (NOT p2)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-30 01:24:21] [INFO ] Invariant cache hit.
[2024-05-30 01:24:21] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-30 01:24:21] [INFO ] Invariant cache hit.
[2024-05-30 01:24:21] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 21 sub problems to find dead transitions.
[2024-05-30 01:24:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-30 01:24:21] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 4 ms to minimize.
[2024-05-30 01:24:21] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-30 01:24:21] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-05-30 01:24:21] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/39 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 43 constraints, problems are : Problem set: 0 solved, 21 unsolved in 291 ms.
Refiners :[Domain max(s): 17/17 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/39 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 21/64 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-30 01:24:21] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/39 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 65 constraints, problems are : Problem set: 0 solved, 21 unsolved in 281 ms.
Refiners :[Domain max(s): 17/17 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 5/5 constraints]
After SMT, in 593ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 594ms
Finished structural reductions in LTL mode , in 1 iterations and 670 ms. Remains : 17/17 places, 22/22 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p1) p2))), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 2 factoid took 181 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 15993 reset in 62 ms.
Product exploration explored 100000 steps with 16013 reset in 79 ms.
Built C files in :
/tmp/ltsmin17948888831525532152
[2024-05-30 01:24:23] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17948888831525532152
Running compilation step : cd /tmp/ltsmin17948888831525532152;'/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 119 ms.
Running link step : cd /tmp/ltsmin17948888831525532152;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17948888831525532152;'/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/stateBased1884114294874176588.hoa' '--buchi-type=spotba'
LTSmin run took 57 ms.
FORMULA ShieldRVs-PT-001A-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVs-PT-001A-LTLCardinality-06 finished in 4054 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) U X(p1)))'
Support contains 4 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-30 01:24:23] [INFO ] Invariant cache hit.
[2024-05-30 01:24:23] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-30 01:24:23] [INFO ] Invariant cache hit.
[2024-05-30 01:24:23] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 21 sub problems to find dead transitions.
[2024-05-30 01:24:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-30 01:24:23] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 2 ms to minimize.
[2024-05-30 01:24:23] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
[2024-05-30 01:24:23] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-30 01:24:23] [INFO ] Deduced a trap composed of 8 places in 15 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/39 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 43 constraints, problems are : Problem set: 0 solved, 21 unsolved in 246 ms.
Refiners :[Domain max(s): 17/17 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/39 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 21/64 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-30 01:24:24] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/39 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 65 constraints, problems are : Problem set: 0 solved, 21 unsolved in 310 ms.
Refiners :[Domain max(s): 17/17 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 5/5 constraints]
After SMT, in 562ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 563ms
Finished structural reductions in LTL mode , in 1 iterations and 641 ms. Remains : 17/17 places, 22/22 transitions.
Stuttering acceptance computed with spot in 308 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001A-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 68 ms.
Product exploration explored 100000 steps with 50000 reset in 64 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 19 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-001A-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-001A-LTLCardinality-10 finished in 1116 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)||p0)))'
Support contains 4 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-30 01:24:24] [INFO ] Invariant cache hit.
[2024-05-30 01:24:24] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-30 01:24:24] [INFO ] Invariant cache hit.
[2024-05-30 01:24:24] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Running 21 sub problems to find dead transitions.
[2024-05-30 01:24:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-30 01:24:24] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-30 01:24:24] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:24:24] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-30 01:24:24] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/39 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 43 constraints, problems are : Problem set: 0 solved, 21 unsolved in 267 ms.
Refiners :[Domain max(s): 17/17 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/39 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 21/64 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-30 01:24:25] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/39 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 65 constraints, problems are : Problem set: 0 solved, 21 unsolved in 276 ms.
Refiners :[Domain max(s): 17/17 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 5/5 constraints]
After SMT, in 553ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 554ms
Finished structural reductions in LTL mode , in 1 iterations and 617 ms. Remains : 17/17 places, 22/22 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-001A-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 50 ms.
Product exploration explored 100000 steps with 50000 reset in 51 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-001A-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-001A-LTLCardinality-11 finished in 860 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-05-30 01:24:25] [INFO ] Invariant cache hit.
[2024-05-30 01:24:25] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-30 01:24:25] [INFO ] Invariant cache hit.
[2024-05-30 01:24:25] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-30 01:24:25] [INFO ] Redundant transitions in 18 ms returned [9]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 17 cols
[2024-05-30 01:24:25] [INFO ] Computed 5 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-30 01:24:25] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:24:25] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-05-30 01:24:25] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-05-30 01:24:25] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 21/38 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-30 01:24:25] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/38 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/38 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 44 constraints, problems are : Problem set: 0 solved, 20 unsolved in 326 ms.
Refiners :[Domain max(s): 17/17 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 21/38 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-30 01:24:26] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/38 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 65 constraints, problems are : Problem set: 0 solved, 20 unsolved in 239 ms.
Refiners :[Domain max(s): 17/17 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 6/6 constraints]
After SMT, in 571ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 571ms
Starting structural reductions in SI_LTL mode, iteration 1 : 17/17 places, 21/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 659 ms. Remains : 17/17 places, 21/22 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001A-LTLCardinality-12
Stuttering criterion allowed to conclude after 29 steps with 3 reset in 0 ms.
FORMULA ShieldRVs-PT-001A-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001A-LTLCardinality-12 finished in 743 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' '!(((p0&&(!p1||G(p0))) U (G((p0&&(!p1||G(p0))))||(p0&&(!p1||G(p0))&&X(p2)))))'
Support contains 4 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 17 cols
[2024-05-30 01:24:26] [INFO ] Computed 5 invariants in 0 ms
[2024-05-30 01:24:26] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-30 01:24:26] [INFO ] Invariant cache hit.
[2024-05-30 01:24:26] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Running 21 sub problems to find dead transitions.
[2024-05-30 01:24:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-30 01:24:26] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 3 ms to minimize.
[2024-05-30 01:24:26] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 0 ms to minimize.
[2024-05-30 01:24:26] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-30 01:24:26] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/39 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 43 constraints, problems are : Problem set: 0 solved, 21 unsolved in 258 ms.
Refiners :[Domain max(s): 17/17 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/39 variables, 17/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 21/64 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-30 01:24:26] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/39 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/39 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 65 constraints, problems are : Problem set: 0 solved, 21 unsolved in 312 ms.
Refiners :[Domain max(s): 17/17 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 5/5 constraints]
After SMT, in 578ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 579ms
Finished structural reductions in LTL mode , in 1 iterations and 633 ms. Remains : 17/17 places, 22/22 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001A-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 15 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-001A-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001A-LTLCardinality-13 finished in 781 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 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 22/22 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 4 ms. Remains 16 /17 variables (removed 1) and now considering 21/22 (removed 1) transitions.
// Phase 1: matrix 21 rows 16 cols
[2024-05-30 01:24:27] [INFO ] Computed 5 invariants in 1 ms
[2024-05-30 01:24:27] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-30 01:24:27] [INFO ] Invariant cache hit.
[2024-05-30 01:24:27] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-30 01:24:27] [INFO ] Redundant transitions in 18 ms returned [8]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 19 sub problems to find dead transitions.
// Phase 1: matrix 20 rows 16 cols
[2024-05-30 01:24:27] [INFO ] Computed 5 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-30 01:24:27] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-30 01:24:27] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-05-30 01:24:27] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
[2024-05-30 01:24:27] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 20/36 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-30 01:24:27] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/36 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 42 constraints, problems are : Problem set: 0 solved, 19 unsolved in 303 ms.
Refiners :[Domain max(s): 16/16 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 20/36 variables, 16/42 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/36 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 61 constraints, problems are : Problem set: 0 solved, 19 unsolved in 130 ms.
Refiners :[Domain max(s): 16/16 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 5/5 constraints]
After SMT, in 441ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 442ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/17 places, 20/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 533 ms. Remains : 16/17 places, 20/22 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001A-LTLCardinality-14
Stuttering criterion allowed to conclude after 86 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-001A-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001A-LTLCardinality-14 finished in 584 ms.
All properties solved by simple procedures.
Total runtime 20479 ms.
BK_STOP 1717032267750
--------------------
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="ShieldRVs-PT-001A"
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 ShieldRVs-PT-001A, 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-171683761700707"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-001A.tgz
mv ShieldRVs-PT-001A 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 '
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 ;