Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 23:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 11 23:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 22:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 11 22:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 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 109K 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-040A-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717084575180

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-040A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-30 15:56:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 15:56:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 15:56:16] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-05-30 15:56:16] [INFO ] Transformed 323 places.
[2024-05-30 15:56:16] [INFO ] Transformed 323 transitions.
[2024-05-30 15:56:16] [INFO ] Found NUPN structural information;
[2024-05-30 15:56:16] [INFO ] Parsed PT model containing 323 places and 323 transitions and 1366 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-040A-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 45 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2024-05-30 15:56:16] [INFO ] Computed 161 invariants in 10 ms
[2024-05-30 15:56:17] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-30 15:56:17] [INFO ] Invariant cache hit.
[2024-05-30 15:56:17] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-05-30 15:56:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 321 unsolved in 14772 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 321/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 1128 constraints, problems are : Problem set: 0 solved, 321 unsolved in 16595 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 31509ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 31531ms
Finished structural reductions in LTL mode , in 1 iterations and 32252 ms. Remains : 323/323 places, 322/322 transitions.
Support contains 40 out of 323 places after structural reductions.
[2024-05-30 15:56:49] [INFO ] Flatten gal took : 65 ms
[2024-05-30 15:56:49] [INFO ] Flatten gal took : 32 ms
[2024-05-30 15:56:49] [INFO ] Input system was already deterministic with 322 transitions.
Reduction of identical properties reduced properties to check from 25 to 21
RANDOM walk for 40000 steps (8 resets) in 2052 ms. (19 steps per ms) remains 12/21 properties
BEST_FIRST walk for 40003 steps (8 resets) in 297 ms. (134 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 176 ms. (226 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 197 ms. (202 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 206 ms. (193 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 189 ms. (210 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 211 ms. (188 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 162 ms. (245 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 205 ms. (194 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 187 ms. (212 steps per ms) remains 12/12 properties
[2024-05-30 15:56:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 26/57 variables, 28/59 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 26/85 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 266/323 variables, 133/218 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 266/484 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 12 unsolved in 478 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 26/57 variables, 28/59 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 26/85 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 266/323 variables, 133/218 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 266/484 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 12/819 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/645 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 0/645 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 819 constraints, problems are : Problem set: 0 solved, 12 unsolved in 874 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 1368ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 7 different solutions.
Parikh walk visited 6 properties in 6837 ms.
Support contains 16 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 322/322 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 322 transition count 321
Partial Free-agglomeration rule applied 37 times.
Drop transitions (Partial Free agglomeration) removed 37 transitions
Iterating global reduction 0 with 37 rules applied. Total rules applied 39 place count 322 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 0 with 37 rules applied. Total rules applied 76 place count 322 transition count 284
Applied a total of 76 rules in 69 ms. Remains 322 /323 variables (removed 1) and now considering 284/322 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 322/323 places, 284/322 transitions.
RANDOM walk for 40000 steps (8 resets) in 751 ms. (53 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 147 ms. (270 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 5107 steps, run visited all 6 properties in 86 ms. (steps per millisecond=59 )
Probabilistic random walk after 5107 steps, saw 4982 distinct states, run finished after 106 ms. (steps per millisecond=48 ) properties seen :6
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U (X(G(p0))||(!p1&&X((p0&&(p1 U p2))))))))'
Support contains 7 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 11 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2024-05-30 15:57:00] [INFO ] Invariant cache hit.
[2024-05-30 15:57:00] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-30 15:57:00] [INFO ] Invariant cache hit.
[2024-05-30 15:57:00] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-05-30 15:57:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 321 unsolved in 14199 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 321/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 1128 constraints, problems are : Problem set: 0 solved, 321 unsolved in 16547 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 30822ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 30830ms
Finished structural reductions in LTL mode , in 1 iterations and 31272 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 391 ms :[true, (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1889 steps with 0 reset in 21 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-00 finished in 31765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 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 322 transition count 321
Applied a total of 2 rules in 38 ms. Remains 322 /323 variables (removed 1) and now considering 321/322 (removed 1) transitions.
// Phase 1: matrix 321 rows 322 cols
[2024-05-30 15:57:31] [INFO ] Computed 161 invariants in 9 ms
[2024-05-30 15:57:32] [INFO ] Implicit Places using invariants in 144 ms returned [315]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 146 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 321/323 places, 321/322 transitions.
Applied a total of 0 rules in 11 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 195 ms. Remains : 321/323 places, 321/322 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 443 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-01 finished in 747 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) U G((X(p1)||G(p2))))))'
Support contains 7 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 6 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2024-05-30 15:57:32] [INFO ] Computed 161 invariants in 2 ms
[2024-05-30 15:57:32] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-30 15:57:32] [INFO ] Invariant cache hit.
[2024-05-30 15:57:33] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-05-30 15:57:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 321 unsolved in 13981 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 321/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 1128 constraints, problems are : Problem set: 0 solved, 321 unsolved in 16086 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 30128ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 30132ms
Finished structural reductions in LTL mode , in 1 iterations and 30515 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 405 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p0), (AND (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-02 finished in 30955 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))&&(G(p1)||G(p2))))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 7 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2024-05-30 15:58:03] [INFO ] Invariant cache hit.
[2024-05-30 15:58:03] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-30 15:58:03] [INFO ] Invariant cache hit.
[2024-05-30 15:58:03] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-05-30 15:58:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 321 unsolved in 14425 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 321/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 1128 constraints, problems are : Problem set: 0 solved, 321 unsolved in 16304 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 30793ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 30796ms
Finished structural reductions in LTL mode , in 1 iterations and 31174 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-03 finished in 31359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2024-05-30 15:58:34] [INFO ] Invariant cache hit.
[2024-05-30 15:58:35] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-30 15:58:35] [INFO ] Invariant cache hit.
[2024-05-30 15:58:35] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-05-30 15:58:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 321 unsolved in 13986 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 321/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 1128 constraints, problems are : Problem set: 0 solved, 321 unsolved in 15842 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 29881ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 29886ms
Finished structural reductions in LTL mode , in 1 iterations and 30259 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 392 ms.
Entered a terminal (fully accepting) state of product in 63535 steps with 0 reset in 337 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-04 finished in 31125 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 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 322 transition count 321
Applied a total of 2 rules in 31 ms. Remains 322 /323 variables (removed 1) and now considering 321/322 (removed 1) transitions.
// Phase 1: matrix 321 rows 322 cols
[2024-05-30 15:59:06] [INFO ] Computed 161 invariants in 2 ms
[2024-05-30 15:59:06] [INFO ] Implicit Places using invariants in 449 ms returned [315]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 452 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 321/323 places, 321/322 transitions.
Applied a total of 0 rules in 14 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 497 ms. Remains : 321/323 places, 321/322 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 456 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-06 finished in 991 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((p0&&(p1||X(p2))))&&(!p3 U (p4||G(!p3)))))))'
Support contains 6 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 7 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2024-05-30 15:59:07] [INFO ] Computed 161 invariants in 2 ms
[2024-05-30 15:59:07] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-30 15:59:07] [INFO ] Invariant cache hit.
[2024-05-30 15:59:07] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-05-30 15:59:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 321 unsolved in 14411 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 321/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 1128 constraints, problems are : Problem set: 0 solved, 321 unsolved in 16120 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 30588ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 30591ms
Finished structural reductions in LTL mode , in 1 iterations and 30972 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 357 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p3 (NOT p4)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND p0 (NOT p2) p3 (NOT p4)), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-07
Product exploration explored 100000 steps with 33077 reset in 801 ms.
Product exploration explored 100000 steps with 33275 reset in 807 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 p4 (NOT p3) p0 p1 p2), (X (NOT p3)), (X (NOT (AND (NOT p4) p3 p0 (NOT p1)))), (X p4), (X (NOT (OR (AND p4 p0 (NOT p1)) (AND (NOT p3) p0 (NOT p1))))), (X (NOT (AND (NOT p4) p3))), (X (NOT (OR (AND p4 (NOT p0)) (AND (NOT p3) (NOT p0))))), (X (NOT (AND (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p4) p3 (NOT p0)))), (X (OR p4 (NOT p3))), (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p1)))), (X (NOT (AND (NOT p4) (NOT p3) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p4) p3 p0 (NOT p1))))), (X (X p4)), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND p4 p0 (NOT p1) (NOT p2)) (AND (NOT p3) p0 (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND p4 (NOT p0)) (AND (NOT p3) (NOT p0)))))), (X (X (NOT (AND (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND p4 (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p4) p3 p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p4 p0 (NOT p1)) (AND (NOT p3) p0 (NOT p1)))))), (X (X (NOT (AND (NOT p4) p3 p0 (NOT p2))))), (X (X (NOT (AND (NOT p4) p3)))), (X (X (NOT (AND (NOT p4) p3 (NOT p0))))), (X (X (NOT (OR (AND p4 (NOT p2)) (AND (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p2))))), (X (X (OR p4 (NOT p3)))), (X (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p4) p3 (NOT p0) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 39 factoid took 186 ms. Reduced automaton from 7 states, 25 edges and 5 AP (stutter sensitive) to 7 states, 25 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p3 (NOT p4)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND p0 (NOT p2) p3 (NOT p4)), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 25 to 23
RANDOM walk for 40000 steps (8 resets) in 461 ms. (86 steps per ms) remains 15/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
[2024-05-30 15:59:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 7/13 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 310/323 variables, 155/174 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 310/484 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 15 unsolved in 515 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
Problem apf6 is UNSAT
Problem apf9 is UNSAT
Problem apf12 is UNSAT
Problem apf14 is UNSAT
Problem apf17 is UNSAT
Problem apf18 is UNSAT
Problem apf23 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 7/13 variables, 6/12 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 7/19 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/19 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 310/323 variables, 155/174 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 310/484 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 8/815 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/645 variables, 0/815 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/645 variables, 0/815 constraints. Problems are: Problem set: 7 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 815 constraints, problems are : Problem set: 7 solved, 8 unsolved in 597 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 8/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 1127ms problems are : Problem set: 7 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 6 properties in 2211 ms.
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 322/322 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 322 transition count 321
Partial Free-agglomeration rule applied 38 times.
Drop transitions (Partial Free agglomeration) removed 38 transitions
Iterating global reduction 0 with 38 rules applied. Total rules applied 40 place count 322 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 0 with 38 rules applied. Total rules applied 78 place count 322 transition count 283
Applied a total of 78 rules in 25 ms. Remains 322 /323 variables (removed 1) and now considering 283/322 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 322/323 places, 283/322 transitions.
Reduction of identical properties reduced properties to check from 2 to 1
RANDOM walk for 40000 steps (8 resets) in 214 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3677 steps, run visited all 1 properties in 32 ms. (steps per millisecond=114 )
Probabilistic random walk after 3677 steps, saw 3572 distinct states, run finished after 33 ms. (steps per millisecond=111 ) properties seen :1
Found 7 invariant AP formulas.
Knowledge obtained : [(AND p4 (NOT p3) p0 p1 p2), (X (NOT p3)), (X (NOT (AND (NOT p4) p3 p0 (NOT p1)))), (X p4), (X (NOT (OR (AND p4 p0 (NOT p1)) (AND (NOT p3) p0 (NOT p1))))), (X (NOT (AND (NOT p4) p3))), (X (NOT (OR (AND p4 (NOT p0)) (AND (NOT p3) (NOT p0))))), (X (NOT (AND (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p4) p3 (NOT p0)))), (X (OR p4 (NOT p3))), (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p1)))), (X (NOT (AND (NOT p4) (NOT p3) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p4) p3 p0 (NOT p1))))), (X (X p4)), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND p4 p0 (NOT p1) (NOT p2)) (AND (NOT p3) p0 (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND p4 (NOT p0)) (AND (NOT p3) (NOT p0)))))), (X (X (NOT (AND (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND p4 (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p4) p3 p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p4 p0 (NOT p1)) (AND (NOT p3) p0 (NOT p1)))))), (X (X (NOT (AND (NOT p4) p3 p0 (NOT p2))))), (X (X (NOT (AND (NOT p4) p3)))), (X (X (NOT (AND (NOT p4) p3 (NOT p0))))), (X (X (NOT (OR (AND p4 (NOT p2)) (AND (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p2))))), (X (X (OR p4 (NOT p3)))), (X (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p4) p3 (NOT p0) (NOT p2))))), (X (X p1)), (G (AND (OR p3 p2) (OR (NOT p4) p2))), (G (OR p3 p4 (NOT p0) p2)), (G (OR p3 p4 (NOT p0) p1 p2)), (G (AND (OR p3 (NOT p0) p1 p2) (OR (NOT p4) (NOT p0) p1 p2))), (G (OR p3 p4 p2)), (G (OR p3 p4 p0 p2)), (G (AND (OR p3 p0 p2) (OR (NOT p4) p0 p2)))]
False Knowledge obtained : [(F (NOT (OR p3 p4 (NOT p0) p1))), (F (NOT (OR (NOT p3) p4))), (F (NOT p1)), (F (NOT (OR (NOT p3) p4 p0))), (F (NOT p2)), (F (NOT p4)), (F p3), (F (NOT p0)), (F (NOT (OR (NOT p3) p4 (NOT p0) p1 p2))), (F (NOT (OR p3 p4 p0))), (F (NOT (OR (NOT p3) p4 (NOT p0) p2))), (F (NOT (OR (NOT p3) p4))), (F (NOT (OR (NOT p3) p4 p2))), (F (NOT (AND (OR p3 p0) (OR (NOT p4) p0)))), (F (NOT (OR p3 p4))), (F (NOT (OR (NOT p3) p4 (NOT p0) p1))), (F (NOT (OR (NOT p3) p4 p0 p2))), (F (NOT (AND (OR p3 (NOT p0) p1) (OR (NOT p4) (NOT p0) p1))))]
Knowledge based reduction with 46 factoid took 1421 ms. Reduced automaton from 7 states, 25 edges and 5 AP (stutter sensitive) to 7 states, 18 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 344 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p3 (NOT p4)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p2) p3 (NOT p4)) (AND p0 (NOT p1) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 378 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p3 (NOT p4)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p2) p3 (NOT p4)) (AND p0 (NOT p1) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 6 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 7 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2024-05-30 15:59:46] [INFO ] Invariant cache hit.
[2024-05-30 15:59:46] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-30 15:59:46] [INFO ] Invariant cache hit.
[2024-05-30 15:59:46] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-05-30 15:59:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 321 unsolved in 14149 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 321/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 1128 constraints, problems are : Problem set: 0 solved, 321 unsolved in 16267 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 30470ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 30474ms
Finished structural reductions in LTL mode , in 1 iterations and 30886 ms. Remains : 323/323 places, 322/322 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 p3) p4 p0 p1 p2), (X (NOT p3)), (X p4), (X (OR (NOT p3) p4)), (X (NOT (AND (NOT p3) (NOT p4) p0 (NOT p1)))), (X (NOT (AND p3 (NOT p4) (NOT p0)))), (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND p4 (NOT p0))))), (X (NOT (AND p3 (NOT p4)))), (X (NOT (AND p3 (NOT p4) p0 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p3) (NOT p4) (NOT p0)))), (X (NOT (OR (AND (NOT p3) p0 (NOT p1)) (AND p4 p0 (NOT p1))))), (X p0), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X p4)), (X (X (OR (NOT p3) p4))), (X (X (NOT (AND (NOT p3) (NOT p4) p0 (NOT p1))))), (X (X (NOT (AND p3 (NOT p4) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND p4 (NOT p0)))))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (NOT (AND p3 (NOT p4) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p4) (NOT p0))))), (X (X (NOT (OR (AND (NOT p3) p0 (NOT p1)) (AND p4 p0 (NOT p1)))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 503 ms. Reduced automaton from 7 states, 18 edges and 5 AP (stutter sensitive) to 7 states, 18 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 343 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p3 (NOT p4)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p2) p3 (NOT p4)) (AND p0 (NOT p1) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 17 to 15
RANDOM walk for 40000 steps (8 resets) in 359 ms. (111 steps per ms) remains 10/15 properties
BEST_FIRST walk for 40003 steps (8 resets) in 189 ms. (210 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 160 ms. (248 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 132 ms. (300 steps per ms) remains 10/10 properties
[2024-05-30 16:00:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 7/13 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 310/323 variables, 155/174 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 310/484 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 10 unsolved in 413 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 7/13 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 310/323 variables, 155/174 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 310/484 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 10/817 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/645 variables, 0/817 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/645 variables, 0/817 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 817 constraints, problems are : Problem set: 0 solved, 10 unsolved in 739 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 1161ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 3 properties in 8039 ms.
Support contains 6 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 322/322 transitions.
Partial Free-agglomeration rule applied 38 times.
Drop transitions (Partial Free agglomeration) removed 38 transitions
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 323 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 323 transition count 284
Applied a total of 76 rules in 23 ms. Remains 323 /323 variables (removed 0) and now considering 284/322 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 323/323 places, 284/322 transitions.
RANDOM walk for 40000 steps (8 resets) in 292 ms. (136 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 169 ms. (235 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 126 ms. (314 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 111 ms. (357 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 3772 steps, run visited all 7 properties in 66 ms. (steps per millisecond=57 )
Probabilistic random walk after 3772 steps, saw 3669 distinct states, run finished after 67 ms. (steps per millisecond=56 ) properties seen :7
Knowledge obtained : [(AND (NOT p3) p4 p0 p1 p2), (X (NOT p3)), (X p4), (X (OR (NOT p3) p4)), (X (NOT (AND (NOT p3) (NOT p4) p0 (NOT p1)))), (X (NOT (AND p3 (NOT p4) (NOT p0)))), (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND p4 (NOT p0))))), (X (NOT (AND p3 (NOT p4)))), (X (NOT (AND p3 (NOT p4) p0 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p3) (NOT p4) (NOT p0)))), (X (NOT (OR (AND (NOT p3) p0 (NOT p1)) (AND p4 p0 (NOT p1))))), (X p0), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X p4)), (X (X (OR (NOT p3) p4))), (X (X (NOT (AND (NOT p3) (NOT p4) p0 (NOT p1))))), (X (X (NOT (AND p3 (NOT p4) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND p4 (NOT p0)))))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (NOT (AND p3 (NOT p4) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p4) (NOT p0))))), (X (X (NOT (OR (AND (NOT p3) p0 (NOT p1)) (AND p4 p0 (NOT p1)))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (OR p3 p0) (OR (NOT p4) p0)))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR (NOT p3) p4))), (F (NOT (OR p3 p4 (NOT p0) p1))), (F (NOT p0)), (F (NOT (AND (OR p3 (NOT p0) p1) (OR (NOT p4) (NOT p0) p1)))), (F (NOT (OR (NOT p3) p4))), (F (NOT (OR p3 p4 p0))), (F (NOT (OR (NOT p3) p4 p0))), (F (NOT (OR p3 p4))), (F (NOT (OR (NOT p0) p2))), (F (NOT p2)), (F (NOT p4)), (F (NOT p1)), (F p3), (F (NOT (OR (NOT p3) p4 (NOT p0) p1))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 31 factoid took 1301 ms. Reduced automaton from 7 states, 18 edges and 5 AP (stutter sensitive) to 7 states, 18 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 405 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p3 (NOT p4)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p2) p3 (NOT p4)) (AND p0 (NOT p1) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 347 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p3 (NOT p4)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p2) p3 (NOT p4)) (AND p0 (NOT p1) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p3 (NOT p4)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p2) p3 (NOT p4)) (AND p0 (NOT p1) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 33282 reset in 741 ms.
Product exploration explored 100000 steps with 33409 reset in 797 ms.
Built C files in :
/tmp/ltsmin12352941558012871916
[2024-05-30 16:00:33] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12352941558012871916
Running compilation step : cd /tmp/ltsmin12352941558012871916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 702 ms.
Running link step : cd /tmp/ltsmin12352941558012871916;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin12352941558012871916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2816469153351287563.hoa' '--buchi-type=spotba'
LTSmin run took 790 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-040A-LTLFireability-07 finished in 87619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p0&&F(!p1))))))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 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 322 transition count 321
Applied a total of 2 rules in 16 ms. Remains 322 /323 variables (removed 1) and now considering 321/322 (removed 1) transitions.
// Phase 1: matrix 321 rows 322 cols
[2024-05-30 16:00:34] [INFO ] Computed 161 invariants in 2 ms
[2024-05-30 16:00:34] [INFO ] Implicit Places using invariants in 201 ms returned [315]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 202 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 321/323 places, 321/322 transitions.
Applied a total of 0 rules in 7 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 225 ms. Remains : 321/323 places, 321/322 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 384 ms.
Product exploration explored 100000 steps with 0 reset in 449 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 p1) p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 90 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 132 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 287 ms. (138 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 168 ms. (236 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 25974 steps, run visited all 4 properties in 163 ms. (steps per millisecond=159 )
Probabilistic random walk after 25974 steps, saw 25091 distinct states, run finished after 163 ms. (steps per millisecond=159 ) properties seen :4
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 232 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 110 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0)]
Support contains 3 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 321/321 transitions.
Applied a total of 0 rules in 11 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
// Phase 1: matrix 321 rows 321 cols
[2024-05-30 16:00:37] [INFO ] Computed 160 invariants in 4 ms
[2024-05-30 16:00:37] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-30 16:00:37] [INFO ] Invariant cache hit.
[2024-05-30 16:00:37] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2024-05-30 16:00:37] [INFO ] Redundant transitions in 14 ms returned []
Running 320 sub problems to find dead transitions.
[2024-05-30 16:00:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 1/321 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (OVERLAPS) 321/642 variables, 321/802 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (OVERLAPS) 0/642 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 802 constraints, problems are : Problem set: 0 solved, 320 unsolved in 14111 ms.
Refiners :[Domain max(s): 321/321 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 1/321 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (OVERLAPS) 321/642 variables, 321/802 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 320/1122 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (OVERLAPS) 0/642 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Int declared 642/642 variables, and 1122 constraints, problems are : Problem set: 0 solved, 320 unsolved in 15907 ms.
Refiners :[Domain max(s): 321/321 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints]
After SMT, in 30074ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 30077ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30485 ms. Remains : 321/321 places, 321/321 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 108 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 108 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 309 ms. (129 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 145 ms. (273 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 25974 steps, run visited all 4 properties in 134 ms. (steps per millisecond=193 )
Probabilistic random walk after 25974 steps, saw 25091 distinct states, run finished after 135 ms. (steps per millisecond=192 ) properties seen :4
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 319 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 98 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 373 ms.
Product exploration explored 100000 steps with 0 reset in 448 ms.
Built C files in :
/tmp/ltsmin3575029907054433170
[2024-05-30 16:01:09] [INFO ] Computing symmetric may disable matrix : 321 transitions.
[2024-05-30 16:01:09] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 16:01:09] [INFO ] Computing symmetric may enable matrix : 321 transitions.
[2024-05-30 16:01:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 16:01:09] [INFO ] Computing Do-Not-Accords matrix : 321 transitions.
[2024-05-30 16:01:09] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-30 16:01:09] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3575029907054433170
Running compilation step : cd /tmp/ltsmin3575029907054433170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 863 ms.
Running link step : cd /tmp/ltsmin3575029907054433170;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3575029907054433170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16911337652423327448.hoa' '--buchi-type=spotba'
LTSmin run took 1340 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-040A-LTLFireability-08 finished in 37279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(!p0)) U (p1 U p2)))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 320 transition count 320
Applied a total of 3 rules in 19 ms. Remains 320 /323 variables (removed 3) and now considering 320/322 (removed 2) transitions.
// Phase 1: matrix 320 rows 320 cols
[2024-05-30 16:01:11] [INFO ] Computed 160 invariants in 1 ms
[2024-05-30 16:01:12] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-30 16:01:12] [INFO ] Invariant cache hit.
[2024-05-30 16:01:12] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2024-05-30 16:01:12] [INFO ] Redundant transitions in 4 ms returned []
Running 319 sub problems to find dead transitions.
[2024-05-30 16:01:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (OVERLAPS) 320/640 variables, 320/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (OVERLAPS) 0/640 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Real declared 640/640 variables, and 800 constraints, problems are : Problem set: 0 solved, 319 unsolved in 11051 ms.
Refiners :[Domain max(s): 320/320 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (OVERLAPS) 320/640 variables, 320/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 319/1119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (OVERLAPS) 0/640 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Int declared 640/640 variables, and 1119 constraints, problems are : Problem set: 0 solved, 319 unsolved in 12968 ms.
Refiners :[Domain max(s): 320/320 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints]
After SMT, in 24061ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 24064ms
Starting structural reductions in SI_LTL mode, iteration 1 : 320/323 places, 320/322 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24505 ms. Remains : 320/323 places, 320/322 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p2), p0]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 374 ms.
Stack based approach found an accepted trace after 6191 steps with 0 reset with depth 6192 and stack size 1876 in 28 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-09 finished in 25018 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 p1)||X(F(p1))))'
Support contains 1 out of 323 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 : 323/323 places, 322/322 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 13 ms. Remains 322 /323 variables (removed 1) and now considering 321/322 (removed 1) transitions.
// Phase 1: matrix 321 rows 322 cols
[2024-05-30 16:01:36] [INFO ] Computed 161 invariants in 3 ms
[2024-05-30 16:01:37] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-30 16:01:37] [INFO ] Invariant cache hit.
[2024-05-30 16:01:37] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-05-30 16:01:37] [INFO ] Redundant transitions in 7 ms returned []
Running 320 sub problems to find dead transitions.
[2024-05-30 16:01:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (OVERLAPS) 321/643 variables, 322/805 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/643 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (OVERLAPS) 0/643 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 643/643 variables, and 805 constraints, problems are : Problem set: 0 solved, 320 unsolved in 11178 ms.
Refiners :[Domain max(s): 322/322 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (OVERLAPS) 321/643 variables, 322/805 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/643 variables, 320/1125 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/643 variables, 0/1125 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (OVERLAPS) 0/643 variables, 0/1125 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Int declared 643/643 variables, and 1125 constraints, problems are : Problem set: 0 solved, 320 unsolved in 13686 ms.
Refiners :[Domain max(s): 322/322 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints]
After SMT, in 24911ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 24917ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 25336 ms. Remains : 322/323 places, 321/322 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 368 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-040A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-13 finished in 25771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Reduce places removed 1 places and 1 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 320 transition count 320
Applied a total of 3 rules in 18 ms. Remains 320 /323 variables (removed 3) and now considering 320/322 (removed 2) transitions.
// Phase 1: matrix 320 rows 320 cols
[2024-05-30 16:02:02] [INFO ] Computed 160 invariants in 1 ms
[2024-05-30 16:02:02] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-30 16:02:02] [INFO ] Invariant cache hit.
[2024-05-30 16:02:03] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2024-05-30 16:02:03] [INFO ] Redundant transitions in 2 ms returned []
Running 319 sub problems to find dead transitions.
[2024-05-30 16:02:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (OVERLAPS) 320/640 variables, 320/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (OVERLAPS) 0/640 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Real declared 640/640 variables, and 800 constraints, problems are : Problem set: 0 solved, 319 unsolved in 10971 ms.
Refiners :[Domain max(s): 320/320 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (OVERLAPS) 320/640 variables, 320/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 319/1119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (OVERLAPS) 0/640 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Int declared 640/640 variables, and 1119 constraints, problems are : Problem set: 0 solved, 319 unsolved in 13164 ms.
Refiners :[Domain max(s): 320/320 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints]
After SMT, in 24179ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 24182ms
Starting structural reductions in SI_LTL mode, iteration 1 : 320/323 places, 320/322 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24600 ms. Remains : 320/323 places, 320/322 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-14
Product exploration explored 100000 steps with 17 reset in 371 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-14 finished in 25056 ms.
All properties solved by simple procedures.
Total runtime 371472 ms.

BK_STOP 1717084947820

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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