Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 11 21:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 11 21:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 21:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.7K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717274540126

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-001A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:42:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 20:42:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:42:21] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2024-06-01 20:42:21] [INFO ] Transformed 11 places.
[2024-06-01 20:42:21] [INFO ] Transformed 11 transitions.
[2024-06-01 20:42:21] [INFO ] Found NUPN structural information;
[2024-06-01 20:42:21] [INFO ] Parsed PT model containing 11 places and 11 transitions and 40 arcs in 130 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-001A-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001A-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001A-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001A-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 8 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 11 cols
[2024-06-01 20:42:21] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 20:42:21] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-01 20:42:21] [INFO ] Invariant cache hit.
[2024-06-01 20:42:21] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 20:42:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 27 constraints, problems are : Problem set: 0 solved, 9 unsolved in 158 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 36 constraints, problems are : Problem set: 0 solved, 9 unsolved in 123 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 313ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 332ms
Finished structural reductions in LTL mode , in 1 iterations and 558 ms. Remains : 11/11 places, 10/10 transitions.
Support contains 11 out of 11 places after structural reductions.
[2024-06-01 20:42:22] [INFO ] Flatten gal took : 14 ms
[2024-06-01 20:42:22] [INFO ] Flatten gal took : 4 ms
[2024-06-01 20:42:22] [INFO ] Input system was already deterministic with 10 transitions.
Reduction of identical properties reduced properties to check from 22 to 15
RANDOM walk for 40000 steps (8 resets) in 651 ms. (61 steps per ms) remains 1/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 1/1 properties
[2024-06-01 20:42:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Real declared 11/21 variables, and 8 constraints, problems are : Problem set: 1 solved, 0 unsolved in 28 ms.
Refiners :[Domain max(s): 3/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 32ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 1 stabilizing places and 1 stable transitions
FORMULA ShieldRVt-PT-001A-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((X(p0)||(X(p1)&&p1))))))'
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 9
Applied a total of 2 rules in 10 ms. Remains 10 /11 variables (removed 1) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2024-06-01 20:42:23] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 20:42:23] [INFO ] Implicit Places using invariants in 28 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/11 places, 9/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40 ms. Remains : 9/11 places, 9/10 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-001A-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 281 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 15 in 0 ms.
FORMULA ShieldRVt-PT-001A-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-001A-LTLFireability-03 finished in 545 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 11 cols
[2024-06-01 20:42:23] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 20:42:23] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 20:42:23] [INFO ] Invariant cache hit.
[2024-06-01 20:42:23] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 20:42:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 27 constraints, problems are : Problem set: 0 solved, 9 unsolved in 99 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 36 constraints, problems are : Problem set: 0 solved, 9 unsolved in 99 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 204ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 205ms
Finished structural reductions in LTL mode , in 1 iterations and 276 ms. Remains : 11/11 places, 10/10 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-001A-LTLFireability-04
Product exploration explored 100000 steps with 13547 reset in 115 ms.
Product exploration explored 100000 steps with 13431 reset in 118 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/11 stabilizing places and 1/10 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 132 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 9 states, 23 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 383 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false, false, false, false, false, false]
RANDOM walk for 40000 steps (8 resets) in 171 ms. (232 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
[2024-06-01 20:42:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 9/11 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 27 constraints, problems are : Problem set: 0 solved, 1 unsolved in 32 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 11/21 variables, and 7 constraints, problems are : Problem set: 1 solved, 0 unsolved in 21 ms.
Refiners :[Domain max(s): 2/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/11 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 58ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 373 ms. Reduced automaton from 9 states, 23 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 263 ms :[(NOT p1), false, (NOT p1), false, false, false]
Stuttering acceptance computed with spot in 242 ms :[(NOT p1), false, (NOT p1), false, false, false]
[2024-06-01 20:42:25] [INFO ] Invariant cache hit.
[2024-06-01 20:42:25] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 20:42:25] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 20:42:25] [INFO ] Computed and/alt/rep : 9/34/9 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 20:42:25] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 10/10 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 10 transition count 9
Applied a total of 2 rules in 1 ms. Remains 10 /11 variables (removed 1) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2024-06-01 20:42:25] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 20:42:25] [INFO ] Implicit Places using invariants in 22 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/11 places, 9/10 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 28 ms. Remains : 9/11 places, 9/10 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/9 stabilizing places and 1/9 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 155 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), false]
RANDOM walk for 32 steps (0 resets) in 6 ms. (4 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 331 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), false]
// Phase 1: matrix 9 rows 9 cols
[2024-06-01 20:42:26] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 20:42:26] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 20:42:26] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 20:42:26] [INFO ] Computed and/alt/rep : 8/28/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 20:42:26] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), false]
Product exploration explored 100000 steps with 13699 reset in 77 ms.
Product exploration explored 100000 steps with 13726 reset in 71 ms.
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-06-01 20:42:26] [INFO ] Invariant cache hit.
[2024-06-01 20:42:27] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 20:42:27] [INFO ] Invariant cache hit.
[2024-06-01 20:42:27] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-06-01 20:42:27] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-06-01 20:42:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 9/18 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 22 constraints, problems are : Problem set: 0 solved, 8 unsolved in 91 ms.
Refiners :[Domain max(s): 9/9 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 9/18 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/18 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 30 constraints, problems are : Problem set: 0 solved, 8 unsolved in 80 ms.
Refiners :[Domain max(s): 9/9 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 176ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 176ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 233 ms. Remains : 9/9 places, 9/9 transitions.
Treatment of property ShieldRVt-PT-001A-LTLFireability-04 finished in 3712 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&X(X(F(p2)))&&p0)))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 11 cols
[2024-06-01 20:42:27] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 20:42:27] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 20:42:27] [INFO ] Invariant cache hit.
[2024-06-01 20:42:27] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 20:42:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 27 constraints, problems are : Problem set: 0 solved, 9 unsolved in 80 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 36 constraints, problems are : Problem set: 0 solved, 9 unsolved in 91 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 174ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 175ms
Finished structural reductions in LTL mode , in 1 iterations and 225 ms. Remains : 11/11 places, 10/10 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), true]
Running random walk in product with property : ShieldRVt-PT-001A-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-001A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-001A-LTLFireability-05 finished in 455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(X(p1) U (p2&&X(p1))))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-06-01 20:42:27] [INFO ] Invariant cache hit.
[2024-06-01 20:42:27] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 20:42:27] [INFO ] Invariant cache hit.
[2024-06-01 20:42:27] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 20:42:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 27 constraints, problems are : Problem set: 0 solved, 9 unsolved in 81 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 36 constraints, problems are : Problem set: 0 solved, 9 unsolved in 82 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 170ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 173ms
Finished structural reductions in LTL mode , in 1 iterations and 245 ms. Remains : 11/11 places, 10/10 transitions.
Stuttering acceptance computed with spot in 327 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-001A-LTLFireability-06
Entered a terminal (fully accepting) state of product in 13 steps with 2 reset in 0 ms.
FORMULA ShieldRVt-PT-001A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-001A-LTLFireability-06 finished in 594 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(((X(!p1)&&p0)||G(!p1)))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-06-01 20:42:28] [INFO ] Invariant cache hit.
[2024-06-01 20:42:28] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 20:42:28] [INFO ] Invariant cache hit.
[2024-06-01 20:42:28] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 20:42:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 27 constraints, problems are : Problem set: 0 solved, 9 unsolved in 67 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 36 constraints, problems are : Problem set: 0 solved, 9 unsolved in 72 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 143ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 143ms
Finished structural reductions in LTL mode , in 1 iterations and 199 ms. Remains : 11/11 places, 10/10 transitions.
Stuttering acceptance computed with spot in 124 ms :[p1, p1, p1]
Running random walk in product with property : ShieldRVt-PT-001A-LTLFireability-07
Product exploration explored 100000 steps with 7207 reset in 83 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 1 ms.
FORMULA ShieldRVt-PT-001A-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-001A-LTLFireability-07 finished in 425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||G(p1)))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-06-01 20:42:28] [INFO ] Invariant cache hit.
[2024-06-01 20:42:28] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 20:42:28] [INFO ] Invariant cache hit.
[2024-06-01 20:42:28] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 20:42:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 27 constraints, problems are : Problem set: 0 solved, 9 unsolved in 82 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 36 constraints, problems are : Problem set: 0 solved, 9 unsolved in 89 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 179ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 179ms
Finished structural reductions in LTL mode , in 1 iterations and 240 ms. Remains : 11/11 places, 10/10 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-001A-LTLFireability-10
Product exploration explored 100000 steps with 19693 reset in 78 ms.
Product exploration explored 100000 steps with 19683 reset in 73 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 (NOT p0) (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 8 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 172 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 20:42:29] [INFO ] Invariant cache hit.
[2024-06-01 20:42:30] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 20:42:30] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 20:42:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:42:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2024-06-01 20:42:30] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 20:42:30] [INFO ] Computed and/alt/rep : 9/34/9 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 20:42:30] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-06-01 20:42:30] [INFO ] Invariant cache hit.
[2024-06-01 20:42:30] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 20:42:30] [INFO ] Invariant cache hit.
[2024-06-01 20:42:30] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 20:42:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 27 constraints, problems are : Problem set: 0 solved, 9 unsolved in 76 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 36 constraints, problems are : Problem set: 0 solved, 9 unsolved in 71 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 156ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 157ms
Finished structural reductions in LTL mode , in 1 iterations and 215 ms. Remains : 11/11 places, 10/10 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 (NOT p0) (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 132 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 20:42:31] [INFO ] Invariant cache hit.
[2024-06-01 20:42:31] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 20:42:31] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 20:42:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 20:42:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 20:42:31] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 20:42:31] [INFO ] Computed and/alt/rep : 9/34/9 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 20:42:31] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 19672 reset in 65 ms.
Product exploration explored 100000 steps with 19673 reset in 81 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-06-01 20:42:31] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
// Phase 1: matrix 10 rows 11 cols
[2024-06-01 20:42:31] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 20:42:31] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:42:31] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 20 ms to minimize.
Problem TDEAD4 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/17 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 10/21 variables, 11/28 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 2/30 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/21 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 30 constraints, problems are : Problem set: 1 solved, 8 unsolved in 156 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 2/11 variables, 5/14 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 2/16 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/17 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 10/21 variables, 11/28 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 2/30 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 8/38 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/21 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/21 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 38 constraints, problems are : Problem set: 1 solved, 8 unsolved in 83 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 243ms problems are : Problem set: 1 solved, 8 unsolved
Search for dead transitions found 1 dead transitions in 243ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 11/11 places, 9/10 transitions.
Graph (complete) has 32 edges and 11 vertex of which 10 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 10 /11 variables (removed 1) and now considering 9/9 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/11 places, 9/10 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 252 ms. Remains : 10/11 places, 9/10 transitions.
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 11 cols
[2024-06-01 20:42:31] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 20:42:32] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 20:42:32] [INFO ] Invariant cache hit.
[2024-06-01 20:42:32] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 20:42:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 27 constraints, problems are : Problem set: 0 solved, 9 unsolved in 104 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 36 constraints, problems are : Problem set: 0 solved, 9 unsolved in 78 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 186ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 187ms
Finished structural reductions in LTL mode , in 1 iterations and 240 ms. Remains : 11/11 places, 10/10 transitions.
Treatment of property ShieldRVt-PT-001A-LTLFireability-10 finished in 3539 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-06-01 20:42:32] [INFO ] Invariant cache hit.
[2024-06-01 20:42:32] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 20:42:32] [INFO ] Invariant cache hit.
[2024-06-01 20:42:32] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 20:42:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 27 constraints, problems are : Problem set: 0 solved, 9 unsolved in 84 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 36 constraints, problems are : Problem set: 0 solved, 9 unsolved in 82 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 170ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 171ms
Finished structural reductions in LTL mode , in 1 iterations and 217 ms. Remains : 11/11 places, 10/10 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-001A-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-001A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-001A-LTLFireability-11 finished in 305 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((!p0 U (p1||G(!p0))))))'
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-06-01 20:42:32] [INFO ] Invariant cache hit.
[2024-06-01 20:42:32] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 20:42:32] [INFO ] Invariant cache hit.
[2024-06-01 20:42:32] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 20:42:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 27 constraints, problems are : Problem set: 0 solved, 9 unsolved in 105 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 36 constraints, problems are : Problem set: 0 solved, 9 unsolved in 86 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 194ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 194ms
Finished structural reductions in LTL mode , in 1 iterations and 250 ms. Remains : 11/11 places, 10/10 transitions.
Stuttering acceptance computed with spot in 303 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldRVt-PT-001A-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-001A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-001A-LTLFireability-12 finished in 567 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-06-01 20:42:33] [INFO ] Invariant cache hit.
[2024-06-01 20:42:33] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 20:42:33] [INFO ] Invariant cache hit.
[2024-06-01 20:42:33] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 20:42:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 27 constraints, problems are : Problem set: 0 solved, 9 unsolved in 85 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 36 constraints, problems are : Problem set: 0 solved, 9 unsolved in 106 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 194ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 195ms
Finished structural reductions in LTL mode , in 1 iterations and 250 ms. Remains : 11/11 places, 10/10 transitions.
Stuttering acceptance computed with spot in 215 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-001A-LTLFireability-13
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-001A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-001A-LTLFireability-13 finished in 479 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 U X(X((p1||F(p2))))))'
Support contains 6 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-06-01 20:42:33] [INFO ] Invariant cache hit.
[2024-06-01 20:42:33] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 20:42:33] [INFO ] Invariant cache hit.
[2024-06-01 20:42:33] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 20:42:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 27 constraints, problems are : Problem set: 0 solved, 9 unsolved in 78 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 36 constraints, problems are : Problem set: 0 solved, 9 unsolved in 72 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 155ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 155ms
Finished structural reductions in LTL mode , in 1 iterations and 208 ms. Remains : 11/11 places, 10/10 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-001A-LTLFireability-14
Product exploration explored 100000 steps with 9665 reset in 72 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ShieldRVt-PT-001A-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-001A-LTLFireability-14 finished in 552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G(p0))||F((X(p1) U p2)))))'
Support contains 2 out of 11 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 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-06-01 20:42:34] [INFO ] Invariant cache hit.
[2024-06-01 20:42:34] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 20:42:34] [INFO ] Invariant cache hit.
[2024-06-01 20:42:34] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-06-01 20:42:34] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-06-01 20:42:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 27 constraints, problems are : Problem set: 0 solved, 9 unsolved in 66 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/21 variables, 11/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/21 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 36 constraints, problems are : Problem set: 0 solved, 9 unsolved in 68 ms.
Refiners :[Domain max(s): 11/11 constraints, Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 137ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 138ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 210 ms. Remains : 11/11 places, 10/10 transitions.
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-001A-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 70 ms.
Product exploration explored 100000 steps with 33333 reset in 82 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 (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 20 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-001A-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-001A-LTLFireability-15 finished in 441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(p1))))))'
Found a Shortening insensitive property : ShieldRVt-PT-001A-LTLFireability-04
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 11 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 11/11 places, 10/10 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 10 transition count 9
Applied a total of 2 rules in 4 ms. Remains 10 /11 variables (removed 1) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2024-06-01 20:42:34] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 20:42:34] [INFO ] Implicit Places using invariants in 31 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 9/11 places, 9/10 transitions.
Applied a total of 0 rules in 3 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 40 ms. Remains : 9/11 places, 9/10 transitions.
Running random walk in product with property : ShieldRVt-PT-001A-LTLFireability-04
Product exploration explored 100000 steps with 13767 reset in 57 ms.
Product exploration explored 100000 steps with 13784 reset in 76 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/9 stabilizing places and 1/9 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 113 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 9 states, 23 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 337 ms :[(AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), false, false, false, false, false, false]
RANDOM walk for 40000 steps (8 resets) in 301 ms. (132 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
// Phase 1: matrix 9 rows 9 cols
[2024-06-01 20:42:35] [INFO ] Computed 4 invariants in 0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 7/9 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/18 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 22 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26 ms.
Refiners :[Domain max(s): 9/9 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 9/18 variables, and 6 constraints, problems are : Problem set: 1 solved, 0 unsolved in 18 ms.
Refiners :[Domain max(s): 2/9 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/9 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 45ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 249 ms. Reduced automaton from 9 states, 23 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), false, (NOT p1), false, false, false]
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), false, (NOT p1), false, false, false]
[2024-06-01 20:42:36] [INFO ] Invariant cache hit.
[2024-06-01 20:42:36] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 20:42:36] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 20:42:36] [INFO ] Computed and/alt/rep : 8/28/8 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 20:42:36] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-06-01 20:42:36] [INFO ] Invariant cache hit.
[2024-06-01 20:42:36] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 20:42:36] [INFO ] Invariant cache hit.
[2024-06-01 20:42:36] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-06-01 20:42:36] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-06-01 20:42:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 9/18 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 22 constraints, problems are : Problem set: 0 solved, 8 unsolved in 59 ms.
Refiners :[Domain max(s): 9/9 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 9/18 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/18 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 30 constraints, problems are : Problem set: 0 solved, 8 unsolved in 68 ms.
Refiners :[Domain max(s): 9/9 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 131ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 131ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 187 ms. Remains : 9/9 places, 9/9 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/9 stabilizing places and 1/9 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 138 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), false]
RANDOM walk for 22 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 327 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), false]
[2024-06-01 20:42:37] [INFO ] Invariant cache hit.
[2024-06-01 20:42:37] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 20:42:37] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 20:42:37] [INFO ] Computed and/alt/rep : 8/28/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 20:42:37] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), false]
Product exploration explored 100000 steps with 13742 reset in 67 ms.
Product exploration explored 100000 steps with 13737 reset in 64 ms.
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-06-01 20:42:37] [INFO ] Invariant cache hit.
[2024-06-01 20:42:37] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 20:42:37] [INFO ] Invariant cache hit.
[2024-06-01 20:42:37] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-06-01 20:42:37] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-06-01 20:42:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 9/18 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 22 constraints, problems are : Problem set: 0 solved, 8 unsolved in 63 ms.
Refiners :[Domain max(s): 9/9 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 9/18 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/18 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/18 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 30 constraints, problems are : Problem set: 0 solved, 8 unsolved in 59 ms.
Refiners :[Domain max(s): 9/9 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 124ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 124ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 208 ms. Remains : 9/9 places, 9/9 transitions.
Treatment of property ShieldRVt-PT-001A-LTLFireability-04 finished in 3267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)||G(p1)))))'
[2024-06-01 20:42:37] [INFO ] Flatten gal took : 6 ms
[2024-06-01 20:42:37] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-06-01 20:42:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 11 places, 10 transitions and 38 arcs took 2 ms.
Total runtime 16707 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ShieldRVt-PT-001A-LTLFireability-04 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldRVt-PT-001A-LTLFireability-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717274558397

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldRVt-PT-001A-LTLFireability-04
ltl formula formula --ltl=/tmp/1573/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 11 places, 10 transitions and 38 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1573/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1573/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1573/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1573/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 12 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 12, there are 24 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 12
pnml2lts-mc( 0/ 4): unique states count: 27
pnml2lts-mc( 0/ 4): unique transitions count: 48
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 5
pnml2lts-mc( 0/ 4): - claim found count: 26
pnml2lts-mc( 0/ 4): - claim success count: 45
pnml2lts-mc( 0/ 4): - cum. max stack depth: 35
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 50 states 106 transitions, fanout: 2.120
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 15.4 B/state, compr.: 30.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 10 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-001A-LTLFireability-10
ltl formula formula --ltl=/tmp/1573/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 11 places, 10 transitions and 38 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1573/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1573/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1573/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1573/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 13 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 12, there are 28 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 16
pnml2lts-mc( 0/ 4): unique states count: 16
pnml2lts-mc( 0/ 4): unique transitions count: 21
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 19
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 29
pnml2lts-mc( 0/ 4): - cum. max stack depth: 20
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 29 states 65 transitions, fanout: 2.241
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 17.5 B/state, compr.: 35.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 10 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-001A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVt-PT-001A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683762100884"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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